- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 168 for Mask (0.15 sec)
-
guava/src/com/google/common/collect/CompactLinkedHashSet.java
void insertEntry(int entryIndex, @ParametricNullness E object, int hash, int mask) { super.insertEntry(entryIndex, object, hash, mask); setSucceeds(lastEntry, entryIndex); setSucceeds(entryIndex, ENDPOINT); } @Override void moveLastEntry(int dstIndex, int mask) { int srcIndex = size() - 1; super.moveLastEntry(dstIndex, mask); setSucceeds(getPredecessor(dstIndex), getSuccessor(dstIndex));
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/ApacheBenchmark.java
long tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += Double.doubleToRawLongBits(impl.factorialDouble(factorials[j])); } return tmp; } @Benchmark int intGCD(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += impl.gcdInt(nonnegInt[j][0], nonnegInt[j][1]); } return tmp; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 6.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/DoubleMathRoundingBenchmark.java
int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += DoubleMath.roundToInt(doubleInIntRange[j], mode); } return tmp; } @Benchmark long roundToLong(int reps) { long tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += DoubleMath.roundToLong(doubleInLongRange[j], mode); } return tmp; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/IntMathRoundingBenchmark.java
@Benchmark int log2(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += IntMath.log2(positive[j], mode); } return tmp; } @Benchmark int log10(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += IntMath.log10(positive[j], mode); } return tmp; } @Benchmark
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/io/BaseEncodingBenchmark.java
tmp += System.identityHashCode(encoding.encoding.encode(encodingInputs[i & INPUTS_MASK])); } return tmp; } @Benchmark public int decode(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { tmp += System.identityHashCode(encoding.encoding.decode(decodingInputs[i & INPUTS_MASK])); } return tmp; } @Benchmark
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/HashStringBenchmark.java
int charCount; @Param({"MURMUR3_32", "MURMUR3_128", "SHA1"}) HashFunctionEnum hashFunctionEnum; private String[] strings; static final int SAMPLES = 0x100; static final int SAMPLE_MASK = 0xFF; /** * Compute arrays of valid unicode text, and store it in 3 forms: byte arrays, Strings, and * StringBuilders (in a CharSequence[] to make it a little harder for the JVM). */ @BeforeExperiment
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.3K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/ImmutableSetHashFloodingDetectionBenchmark.java
public void setUp() { int tableSize = ImmutableSet.chooseTableSize(size); int mask = tableSize - 1; for (int i = 0; i < TEST_CASES; i++) { tables[i] = new Object[tableSize]; for (int j = 0; j < size; j++) { Object o = new Object(); for (int k = o.hashCode(); ; k++) { int index = k & mask; if (tables[i][index] == null) { tables[i][index] = o; break;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jun 03 20:16:35 GMT 2021 - 6.8K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += oldSlowFactorial(slowFactorials[j]).intValue(); } return tmp; } @Benchmark int factorial(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += BigIntegerMath.factorial(factorials[j]).intValue(); } return tmp; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Ascii.java
* The maximum value of an ASCII character. * * @since 9.0 (was type {@code int} before 12.0) */ public static final char MAX = 127; /** A bit mask which selects the bit encoding ASCII character case. */ private static final char CASE_MASK = 0x20; /** * Returns a copy of the input string in which all {@linkplain #isUpperCase(char) uppercase ASCII
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
this.hashTable = hashTable; int mask = hashTable.length - 1; for (ValueSetLink<K, V> entry = firstEntry; entry != this; entry = entry.getSuccessorInValueSet()) { ValueEntry<K, V> valueEntry = (ValueEntry<K, V>) entry; int bucket = valueEntry.smearedValueHash & mask; valueEntry.nextInValueBucket = hashTable[bucket];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0)