/** Returns the number of elements added so far, unless it is too big to fit in an integer (in which case this method will throw an * exception). * * @return the number of elements added so far. * @deprecated Use {@link #size64()} instead. */ @Override @Deprecated public int size() { final long size64 = size64(); if (size64 > Integer.MAX_VALUE) throw new IllegalStateException("The number of elements of this bit list (" + size64 + ") exceeds Integer.MAX_INT"); return (int)size64; }
final int[][] lcpLength = IntBigArrays.newBigArray(lcps.size64()); long p = 0; for(final LongArrayBitVector bv : lcps) IntBigArrays.set(lcpLength, p++, (int)bv.length());
emptyTrie = intermediateTrie.internalNodeRepresentations.size64() == 0; noDelimiters = intermediateTrie.delimiters == null || intermediateTrie.delimiters.size64() == 0; numDelimiters = intermediateTrie.delimiters.size64(); pl.expectedUpdates = intermediateTrie.internalNodeRepresentations.size64(); pl.start("Computing leaf ranker keys...");