Class IndexSet
- java.lang.Object
-
- de.tilman_neumann.jml.factor.base.matrixSolver.IndexSet
-
public class IndexSet extends Object
BitArray implementation of an IndexSet, realized in long[], used by the Gaussian solver. The xor() operation has complexity O(n), where n is the sum of the size of the two argument arrays. Since here 64 xor's are done at once, this implementation is very fast compared to other algorithms with the same complexity.- Author:
- Tilman Neumann
-
-
Constructor Summary
Constructors Constructor Description IndexSet(int numberOfBits)
Standard constructor, creates an empty bit array capable to hold the given numberOfBits.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
add(int x)
Add a single element x to this index set.void
addXor(IndexSet other)
boolean
contains(Object o)
boolean
equals(Object o)
int
hashCode()
boolean
isEmpty()
Integer
last()
ArrayList<Integer>
toList()
String
toString()
-