Lines Matching refs:word
65 * BitSets are packed into arrays of "words." Currently a word is
67 * The choice of word size is determined purely by performance concerns.
73 /* Used to shift left or right for a partial word mask */
107 * Given a bit index, return word index containing it.
128 // Traverse the bitset until a used word is found
169 * The last word (if there is one) must be non-zero.
408 // Case 1: One word
412 // Handle first word
419 // Handle last word
486 // Case 1: One word
490 // Handle first word
497 // Handle last word (restores invariants)
574 // Case 1: One word
578 // Handle first word
585 // Handle last word
656 // Process all words but the last word
662 // Process the last word
709 long word = words[u] & (WORD_MASK << fromIndex);
712 if (word != 0)
713 return (u * BITS_PER_WORD) + Long.numberOfTrailingZeros(word);
716 word = words[u];
741 long word = ~words[u] & (WORD_MASK << fromIndex);
744 if (word != 0)
745 return (u * BITS_PER_WORD) + Long.numberOfTrailingZeros(word);
748 word = ~words[u];
787 long word = words[u] & (WORD_MASK >>> -(fromIndex+1));
790 if (word != 0)
791 return (u+1) * BITS_PER_WORD - 1 - Long.numberOfLeadingZeros(word);
794 word = words[u];
825 long word = ~words[u] & (WORD_MASK >>> -(fromIndex+1));
828 if (word != 0)
829 return (u+1) * BITS_PER_WORD -1 - Long.numberOfLeadingZeros(word);
832 word = ~words[u];