/** Creates a new bit vector with given bits. * * @param bit a list of bits that will be set in the newly created bit vector. */ public static LongArrayBitVector of(final int... bit) { final LongArrayBitVector bitVector = new LongArrayBitVector(bit.length); for(final int b : bit) { if (b != 0 && b != 1) throw new IllegalArgumentException("Illegal bit value: " + b); bitVector.add(b); } return bitVector; }
/** Creates a new bit vector with given bits. * * @param bit a list of bits that will be set in the newly created bit vector. */ public static LongArrayBitVector of( final int... bit ) { final LongArrayBitVector bitVector = new LongArrayBitVector( bit.length ); for( int b : bit ) bitVector.add( b ); return bitVector; }
/** Creates a new bit vector with given bits. * * @param bit a list of bits that will be set in the newly created bit vector. */ public static LongArrayBitVector of( final int... bit ) { final LongArrayBitVector bitVector = new LongArrayBitVector( bit.length ); for( int b : bit ) bitVector.add( b ); return bitVector; }
public LongArrayBitVector succinctRepresentation() { final LongArrayBitVector bitVector = LongArrayBitVector.getInstance(); bitVector.add(true); // Fake open parenthesis if (root != null) visit(root, bitVector); bitVector.add(false); // Fake closed parenthesis bitVector.trim(); return bitVector; } }
newNode.repr.add(true); newNode.repr.append(n.repr); newNode.repr.add(false); newNode.skips.add(n.skip); newNode.skips.addAll(n.skips); bitVector.add(true); // Fake open parenthesis bitVector.add(true); bitVector.append(m.repr); bitVector.add(false); } while ((m = m.right) != null); bitVector.add(false);