Cross Reference: /openjdk7/jdk/src/share/classes/java/util/BitSet.java

Lines Matching refs:wordsInUse
95     private transient int wordsInUse = 0;
117         assert(wordsInUse == 0 || words[wordsInUse - 1] != 0);
118         assert(wordsInUse >= 0 && wordsInUse <= words.length);
119         assert(wordsInUse == words.length || words[wordsInUse] == 0);
123      * Sets the field wordsInUse to the logical size in words of the bit set.
125      * less than or equal to the current value of wordsInUse!
130         for (i = wordsInUse-1; i >= 0; i--)
134         wordsInUse = i+1; // The new logical size
173         this.wordsInUse = words.length;
289         int n = wordsInUse;
318         return Arrays.copyOf(words, wordsInUse);
343         if (wordsInUse < wordsRequired) {
345             wordsInUse = wordsRequired;
535         if (wordIndex >= wordsInUse)
562         if (startWordIndex >= wordsInUse)
566         if (endWordIndex >= wordsInUse) {
568             endWordIndex = wordsInUse - 1;
599         while (wordsInUse > 0)
600             words[--wordsInUse] = 0;
620         return (wordIndex < wordsInUse)
672         // Set wordsInUse correctly
673         result.wordsInUse = targetWords;
706         if (u >= wordsInUse)
714             if (++u == wordsInUse)
738         if (u >= wordsInUse)
746             if (++u == wordsInUse)
747                 return wordsInUse * BITS_PER_WORD;
784         if (u >= wordsInUse)
822         if (u >= wordsInUse)
845         if (wordsInUse == 0)
848         return BITS_PER_WORD * (wordsInUse - 1) +
849             (BITS_PER_WORD - Long.numberOfLeadingZeros(words[wordsInUse - 1]));
860         return wordsInUse == 0;
873         for (int i = Math.min(wordsInUse, set.wordsInUse) - 1; i >= 0; i--)
887         for (int i = 0; i < wordsInUse; i++)
905         while (wordsInUse > set.wordsInUse)
906             words[--wordsInUse] = 0;
909         for (int i = 0; i < wordsInUse; i++)
929         int wordsInCommon = Math.min(wordsInUse, set.wordsInUse);
931         if (wordsInUse < set.wordsInUse) {
932             ensureCapacity(set.wordsInUse);
933             wordsInUse = set.wordsInUse;
941         if (wordsInCommon < set.wordsInUse)
944                              wordsInUse - wordsInCommon);
965         int wordsInCommon = Math.min(wordsInUse, set.wordsInUse);
967         if (wordsInUse < set.wordsInUse) {
968             ensureCapacity(set.wordsInUse);
969             wordsInUse = set.wordsInUse;
977         if (wordsInCommon < set.wordsInUse)
980                              set.wordsInUse - wordsInCommon);
996         for (int i = Math.min(wordsInUse, set.wordsInUse) - 1; i >= 0; i--)
1023         for (int i = wordsInUse; --i >= 0; )
1065         if (wordsInUse != set.wordsInUse)
1069         for (int i = 0; i < wordsInUse; i++)
1105         if (wordsInUse != words.length) {
1106             words = Arrays.copyOf(words, wordsInUse);
1141         wordsInUse = words.length;
1173         int numBits = (wordsInUse > 128) ?
1174             cardinality() : wordsInUse * BITS_PER_WORD;