- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 222 for Mask (0.14 sec)
-
guava-tests/benchmark/com/google/common/math/BigIntegerMathRoundingBenchmark.java
int log2(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += BigIntegerMath.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 += BigIntegerMath.log10(positive[j], mode); } return tmp; } @Benchmark
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Jun 30 13:06:20 GMT 2020 - 2.8K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/DoubleMathBenchmark.java
long tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += Double.doubleToRawLongBits(DoubleMath.log2(positiveDoubles[j])); } return tmp; } @Benchmark long factorial(int reps) { long tmp = 0; for (int i = 0; i < reps; i++) { int j = i & ARRAY_MASK; tmp += Double.doubleToRawLongBits(DoubleMath.factorial(factorials[j])); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.5K bytes - Viewed (0) -
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 2.6K bytes - Viewed (0) -
src/main/java/jcifs/internal/dtyp/ACE.java
* and access mask of each ACE. If the SID matches, the allow/deny flags * and access mask are considered. If the ACE is a "deny" * ACE and <i>any</i> of the desired access bits match bits in the access * mask of the ACE, the whole access check fails. If the ACE is an "allow" * ACE and <i>all</i> of the bits in the desired access bits match bits in * the access mask of the ACE, the access check is successful. Otherwise,
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 5.4K bytes - Viewed (0) -
android/guava/src/com/google/common/base/SmallCharMatcher.java
index = (index + 1) & mask; } } return new SmallCharMatcher(table, filter, containsZero, description); } @Override public boolean matches(char c) { if (c == 0) { return containsZero; } if (!checkFilter(c)) { return false; } int mask = table.length - 1; int startingIndex = smear(c) & mask; int index = startingIndex;
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) -
android/guava-tests/benchmark/com/google/common/math/LessThanBenchmark.java
xLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK; yLongs[i] = random.nextLong() & NONNEGATIVE_LONG_MASK; constant[i] = random.nextInt(); } } @Benchmark int branchFreeLtIntInlined(int reps) { int tmp = 0; for (int i = 0; i < reps; i++) { int j = i & SAMPLE_MASK; int x = xInts[j]; int y = yInts[j]; int z = constant[j];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/UnsignedBytes.java
* that least significant nonzero byte. */ int n = Long.numberOfTrailingZeros(lw ^ rw) & ~0x7; return ((int) ((lw >>> n) & UNSIGNED_MASK)) - ((int) ((rw >>> n) & UNSIGNED_MASK)); } } // The epilogue to cover the last (minLength % stride) elements. for (; i < minLength; i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 18.3K 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) -
android/guava/src/com/google/common/collect/ObjectCountHashMap.java
static final float DEFAULT_LOAD_FACTOR = 1.0f; /** Bitmask that selects the low 32 bits. */ private static final long NEXT_MASK = (1L << 32) - 1; /** Bitmask that selects the high 32 bits. */ private static final long HASH_MASK = ~NEXT_MASK; static final int DEFAULT_SIZE = 3; // used to indicate blank table entries static final int UNSET = -1; /*
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Jun 01 22:07:10 GMT 2021 - 15K 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)