Equality of databraid currently must be perfect equality between the generators and the crossing times. In other words, compact(b) ~= b if compact cancels generators.
But there is a problem with that: we've starting allowing simultaneous times. So we should have databraid([1 3],[1 1]) == databraid([3 1],[1 1]). The way to do this might be to sort the generators corresponding to duplicate crossing times, then compare.
The solution method is the same as is used to check for bad crossings in check_tcross. Should split off the relevant code into a new private functions which can be used by both.
Equality of databraid currently must be perfect equality between the generators and the crossing times. In other words,
compact(b) ~= b
ifcompact
cancels generators.But there is a problem with that: we've starting allowing simultaneous times. So we should have
databraid([1 3],[1 1]) == databraid([3 1],[1 1])
. The way to do this might be to sort the generators corresponding to duplicate crossing times, then compare.Add unit test when this is resolved.