@Override public BitVector copy(final long from, final long to) { BitVectors.ensureFromTo(length(), from, to); return bitVector.copy(this.from + from, this.from + to); }
public BitVector copy( final long from, final long to ) { BitVectors.ensureFromTo( length(), from, to ); return bitVector.copy( this.from + from, this.from + to ); }
public BitVector copy( final long from, final long to ) { BitVectors.ensureFromTo( length(), from, to ); return bitVector.copy( this.from + from, this.from + to ); }
/** Populates the codeword vector by scanning recursively * the decoding tree. * * @param node a subtree of the decoding tree. * @param prefix the path leading to <code>n</code>. */ private void buildCodes( final BitVector[] codeWord, final TreeDecoder.Node node, final BitVector prefix ) { if ( node instanceof TreeDecoder.LeafNode ) { codeWord[ ((TreeDecoder.LeafNode)node).symbol ] = prefix; return; } BitVector bitVector = prefix.copy(); bitVector.length( bitVector.length() + 1 ); buildCodes( codeWord, node.left, bitVector ); bitVector = prefix.copy(); bitVector.length( bitVector.length() + 1 ); bitVector.set( bitVector.size() - 1 ); buildCodes( codeWord, node.right, bitVector ); }
/** Populates the codeword vector by scanning recursively * the decoding tree. * * @param node a subtree of the decoding tree. * @param prefix the path leading to <code>n</code>. */ private void buildCodes( final BitVector[] codeWord, final TreeDecoder.Node node, final BitVector prefix ) { if ( node instanceof TreeDecoder.LeafNode ) { codeWord[ ((TreeDecoder.LeafNode)node).symbol ] = prefix; return; } BitVector bitVector = prefix.copy(); bitVector.length( bitVector.length() + 1 ); buildCodes( codeWord, node.left, bitVector ); bitVector = prefix.copy(); bitVector.length( bitVector.length() + 1 ); bitVector.set( bitVector.size() - 1 ); buildCodes( codeWord, node.right, bitVector ); }
/** Populates the codeword vector by scanning recursively * the decoding tree. * * @param node a subtree of the decoding tree. * @param prefix the path leading to <code>n</code>. */ private void buildCodes(final BitVector[] codeWord, final TreeDecoder.Node node, final BitVector prefix) { if (node instanceof TreeDecoder.LeafNode) { codeWord[((TreeDecoder.LeafNode)node).symbol] = prefix; return; } BitVector bitVector = prefix.copy(); bitVector.length(bitVector.length() + 1); buildCodes(codeWord, node.left, bitVector); bitVector = prefix.copy(); bitVector.length(bitVector.length() + 1); bitVector.set(bitVector.length() - 1); buildCodes(codeWord, node.right, bitVector); }
final long h = Hashes.spooky4(curr, seed); if (mistakeSignatures.contains((int)h)) { positives.add(curr.copy()); results.add(intermediateTrie.externalParentRepresentations.getInt(c));
if (DDDEBUG) System.err.println("getNodeStringLength(v)=" + length); if (length >= v.length()) return -1; final BitVector key = v.subVector(0, length).copy(); final boolean bit = v.getBoolean(length);