- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for nextSetBit (0.27 sec)
-
android/guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
return result; } private static String allMatchingChars(BitSet bitSet) { final char[] result = new char[bitSet.cardinality()]; for (int j = 0, c = bitSet.nextSetBit(0); j < result.length; ++j) { result[j] = (char) c; c = bitSet.nextSetBit(c + 1); } return new String(result); } private static String newTestString(Random random, BitSet bitSet, int percentMatching) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 16 22:49:59 GMT 2018 - 3.9K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
boolean containsZero = chars.get(0); // Compute the hash table. char[] table = new char[chooseTableSize(size)]; int mask = table.length - 1; for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) { // Compute the filter at the same time. filter |= 1L << c; int index = smear(c) & mask; while (true) { // Check for empty. if (table[index] == 0) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/WhitespaceMatcherBenchmark.java
return result; } private static String allMatchingChars(BitSet bitSet) { final char[] result = new char[bitSet.cardinality()]; for (int j = 0, c = bitSet.nextSetBit(0); j < result.length; ++j) { result[j] = (char) c; c = bitSet.nextSetBit(c + 1); } return new String(result); } private static String newTestString(Random random, BitSet bitSet, int percentMatching) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed May 16 22:49:59 GMT 2018 - 3.9K bytes - Viewed (0) -
guava/src/com/google/common/base/SmallCharMatcher.java
boolean containsZero = chars.get(0); // Compute the hash table. char[] table = new char[chooseTableSize(size)]; int mask = table.length - 1; for (int c = chars.nextSetBit(0); c != -1; c = chars.nextSetBit(c + 1)) { // Compute the filter at the same time. filter |= 1L << c; int index = smear(c) & mask; while (true) { // Check for empty. if (table[index] == 0) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 4.5K bytes - Viewed (0)