- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 146 for Franke (0.14 sec)
-
guava-tests/test/com/google/common/escape/UnicodeEscaperTest.java
UnicodeEscaper e = SIMPLE_ESCAPER; // Build up a range of surrogate pair characters to test final int min = Character.MIN_SUPPLEMENTARY_CODE_POINT; final int max = Character.MAX_CODE_POINT; final int range = max - min; final int s1 = min + (1 * range) / 4; final int s2 = min + (2 * range) / 4; final int s3 = min + (3 * range) / 4; final char[] dst = new char[12];
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 6.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
private final int k; private final Comparator<? super T> comparator; /* * We are currently considering the elements in buffer in the range [0, bufferSize) as candidates * for the top k elements. Whenever the buffer is filled, we quickselect the top k elements to the * range [0, k) and ignore the remaining elements. */ private final @Nullable T[] buffer; private int bufferSize; /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 11.2K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/escape/ArrayBasedCharEscaperTest.java
protected char[] escapeUnsafe(char c) { return noChars; } }; EscaperAsserts.assertBasic(deletingEscaper); assertEquals( "Everything outside the printable ASCII range is deleted.", deletingEscaper.escape( "\tEverything\0 outside the\uD800\uDC00 " + "printable ASCII \uFFFFrange is \u007Fdeleted.\n")); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 07 23:02:38 GMT 2024 - 3.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ExplicitOrdering.java
this.rankMap = rankMap; } @Override public int compare(T left, T right) { return rank(left) - rank(right); // safe because both are nonnegative } private int rank(T value) { Integer rank = rankMap.get(value); if (rank == null) { throw new IncomparableValueException(value); } return rank; } @Override public boolean equals(@CheckForNull Object object) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Sun Jun 20 14:22:42 GMT 2021 - 2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/MinMaxPriorityQueueTest.java
MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue.create(); int range = 10_000; // range should be small enough that equal elements occur semi-frequently for (int iter = 0; iter < reduceIterationsIfGwt(1000); iter++) { for (int i = 0; i < 100; i++) { Integer element = random.nextInt(range); elements.add(element); queue.add(element); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 36.1K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/cache/LoadingCacheSingleThreadBenchmark.java
int max; static AtomicLong requests = new AtomicLong(0); static AtomicLong misses = new AtomicLong(0); @BeforeExperiment void setUp() { // random integers will be generated in this range, then raised to the // power of (1/concentration) and floor()ed max = Ints.checkedCast((long) Math.pow(distinctKeys, concentration)); cache = CacheBuilder.newBuilder()
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/math/BigIntegerMathBenchmark.java
} return BigInteger.valueOf(result); } /* * We want each multiplication to have both sides with approximately the same number of digits. * Currently, we just divide the range in half. */ int mid = (n1 + n2) >>> 1; return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2)); } @Benchmark int slowFactorial(int reps) { int tmp = 0;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/MathBenchmarking.java
} /** * Generates a number in [0, 2^numBits) with an exponential distribution. The floor of the log2 of * the result is chosen uniformly at random in [0, numBits), and then the result is chosen in that * range uniformly at random. Zero is treated as having log2 == 0. */ static BigInteger randomNonNegativeBigInteger(int numBits) { int digits = RANDOM_SOURCE.nextInt(numBits); if (digits == 0) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/StandardRowSortedTable.java
implements RowSortedTable<R, C, V> { /* * TODO(jlevy): Consider adding headTable, tailTable, and subTable methods, * which return a Table view with rows keys in a given range. Create a * RowSortedTable subinterface with the revised methods? */ StandardRowSortedTable( SortedMap<R, Map<C, V>> backingMap, Supplier<? extends Map<C, V>> factory) { super(backingMap, factory);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jul 15 15:41:16 GMT 2021 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Strings.java
s--; } return a.subSequence(a.length() - s, a.length()).toString(); } /** * True when a valid surrogate pair starts at the given {@code index} in the given {@code string}. * Out-of-range indexes return false. */ @VisibleForTesting static boolean validSurrogatePairAt(CharSequence string, int index) { return index >= 0 && index <= (string.length() - 2)
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Apr 09 00:49:18 GMT 2021 - 12.3K bytes - Viewed (0)