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; } }
this.borders = new EliasFanoMonotoneLongBigList(c + 1, maxBorder + 1, offline ? BinIO.asLongIterator(tempFile) : borders.iterator()); if (offline) tempFile.delete(); this.bits.trim();
n = new Node(node.left, node.right, node.path.copy(prefix + 1, pathLength)); node.path.length(prefix); node.path.trim(); node.left = n; node.right = new Node(null, null, prev.copy(pos + prefix + 1, prev.length()));
n = new Node(node.left, node.right, node.path.copy(prefix + 1, pathLength)); node.path.length(prefix); node.path.trim(); node.left = n; node.right = new Node(null, null, shortest.copy(pos + prefix + 1, shortest.length()));
n = new Node(node.left, node.right, node.path.copy(prefix + 1, pathLength)); node.path.length(prefix); node.path.trim(); node.left = n; node.right = new Node(null, null, prev.copy(pos + prefix + 1, prev.length()));