- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 19 for Brinch (0.16 sec)
-
guava-tests/benchmark/com/google/common/hash/HashStringBenchmark.java
return 0x80; } else if (userFriendly.matches("(?i)(?:French|Latin|Western.*European)")) { // Mostly 1-byte UTF-8 sequences, mixed with occasional 2-byte // sequences - "Western European" text return 0x90; } else if (userFriendly.matches("(?i)(?:Branch.*Prediction.*Hostile)")) { // Defeat branch predictor for: c < 0x80 ; branch taken 50% of the time. return 0x100;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 5.3K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
public static boolean fuzzyEquals(double a, double b, double tolerance) { MathPreconditions.checkNonNegative("tolerance", tolerance); return Math.copySign(a - b, 1.0) <= tolerance // copySign(x, 1.0) is a branch-free version of abs(x), but with different NaN semantics || (a == b) // needed to ensure that infinities equal themselves || (Double.isNaN(a) && Double.isNaN(b)); } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
return x > 0 & (x & (x - 1)) == 0; } /** * Returns 1 if {@code x < y} as unsigned integers, and 0 otherwise. Assumes that x - y fits into * a signed int. The implementation is branch-free, and benchmarks suggest it is measurably (if * narrowly) faster than the straightforward ternary expression. */ @VisibleForTesting static int lessThanBranchFree(int x, int y) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Utf8.java
i++; } // This loop optimizes for chars less than 0x800. for (; i < utf16Length; i++) { char c = sequence.charAt(i); if (c < 0x800) { utf8Length += ((0x7f - c) >>> 31); // branch free! } else { utf8Length += encodedLengthGeneral(sequence, i); break; } } if (utf8Length < utf16Length) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 10 14:11:51 GMT 2023 - 7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
int timeout, TimeUnit unit) throws ExecutionException, TimeoutException { /* * For faster tests (that may hang indefinitely if the class under test has * a bug!), switch the second branch to call untimed future.get() instead of * pseudoTimedGet. */ return (inputs.hasDelayed(iFuture, jFuture)) ? pseudoTimedGetUninterruptibly(future, timeout, unit)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 144.5K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
return x > 0 & (x & (x - 1)) == 0; } /** * Returns 1 if {@code x < y} as unsigned longs, and 0 otherwise. Assumes that x - y fits into a * signed long. The implementation is branch-free, and benchmarks suggest it is measurably faster * than the straightforward ternary expression. */ @VisibleForTesting static int lessThanBranchFree(long x, long y) { // Returns the sign bit of x - y.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
KeyList<K, V> keyList = requireNonNull(keyToKeyList.remove(node.key)); keyList.count = 0; modCount++; } else { // requireNonNull is safe (under the conditions listed in the comment in the branch above). KeyList<K, V> keyList = requireNonNull(keyToKeyList.get(node.key)); keyList.count--; if (node.previousSibling == null) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/hash/HashStringBenchmark.java
return 0x80; } else if (userFriendly.matches("(?i)(?:French|Latin|Western.*European)")) { // Mostly 1-byte UTF-8 sequences, mixed with occasional 2-byte // sequences - "Western European" text return 0x90; } else if (userFriendly.matches("(?i)(?:Branch.*Prediction.*Hostile)")) { // Defeat branch predictor for: c < 0x80 ; branch taken 50% of the time. return 0x100;
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/test/com/google/common/collect/ImmutableMapTest.java
.put(key1, 1) .put(key2, 2) .put(key1, 3) .put(key2, 4) .buildKeepingLast(); assertMapEquals(map, key1, 3, key2, 4); } // The java7 branch has different code depending on whether the entry indexes fit in a byte, // short, or int. The small table in testBuildKeepingLast_allowsOverwrite will test the byte // case. This method tests the short case.
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 27 13:27:08 GMT 2024 - 41.3K bytes - Viewed (0)