- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 186 for Miller (0.15 sec)
-
android/guava-tests/test/com/google/common/io/CharStreamsTest.java
String string = Strings.repeat("0123456789", 100); StringBuilder b = new StringBuilder(); // the main assertion of this test is here... the copy will fail if the buffer size goes down // each time it is not filled completely long copied = CharStreams.copy(newNonBufferFillingReader(new StringReader(string)), b); assertEquals(string, b.toString()); assertEquals(string.length(), copied); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ComparisonChain.java
* * <p><b>Note:</b> {@code ComparisonChain} instances are <b>immutable</b>. For this utility to work * correctly, calls must be chained as illustrated above. * * <p>Performance note: Even though the {@code ComparisonChain} caller always invokes its {@code * compare} methods unconditionally, the {@code ComparisonChain} implementation stops calling its * inputs' {@link Comparable#compareTo compareTo} and {@link Comparator#compare compare} methods as
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 24 17:47:51 GMT 2022 - 9.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/StatsTesting.java
static PairedStats createPairedStatsOf(List<Double> xValues, List<Double> yValues) { return createFilledPairedStatsAccumulator(xValues, yValues).snapshot(); } /** * Creates a {@link PairedStatsAccumulator} filled with the given lists of {@code x} and {@code y} * values, which must be of the same size. */ static PairedStatsAccumulator createFilledPairedStatsAccumulator( List<Double> xValues, List<Double> yValues) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Nov 09 22:49:56 GMT 2023 - 23.8K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
return result; } boolean removeIf(BiPredicate<? super K, ? super V> filter) { checkNotNull(filter); boolean changed = false; for (K key : keySet()) { while (true) { V value = get(key); if (value == null || !filter.test(key, value)) { break; } else if (LocalCache.this.remove(key, value)) { changed = true;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TopKSelector.java
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/math/MathTesting.java
FINITE_DOUBLE_CANDIDATES = Iterables.concat(FRACTIONAL_DOUBLE_CANDIDATES, INTEGRAL_DOUBLE_CANDIDATES); POSITIVE_FINITE_DOUBLE_CANDIDATES = Iterables.filter( FINITE_DOUBLE_CANDIDATES, new Predicate<Double>() { @Override public boolean apply(Double input) { return input.doubleValue() > 0.0;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
} } return false; } /** * If more than this many consecutive positions are filled in a table of the specified size, * report probable hash flooding. ({@link #hashFloodingDetected} may also report hash flooding * if fewer consecutive positions are filled; see that method for details.) */ static int maxRunBeforeFallback(int tableSize) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
} } private void recurse(int level) { // We're going to reuse the stimuli array 3^steps times by overwriting it // in a recursive loop. Sneaky. if (level == stimuli.length) { // We've filled the array. compareResultsForThisListOfStimuli(); } else { // Keep recursing to fill the array. for (Stimulus<E, ? super I> stimulus : getStimulusValues()) { stimuli[level] = stimulus;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 20.7K bytes - Viewed (0) -
guava/src/com/google/common/base/Verify.java
* which approach to use, <b>don't worry</b> too much about it; just pick something that seems * reasonable and it will be fine. * * <ul> * <li>If checking whether the <i>caller</i> has violated your method or constructor's contract * (such as by passing an invalid argument), use the utilities of the {@link Preconditions} * class instead.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon May 17 14:07:47 GMT 2021 - 18.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/SmoothRateLimiter.java
* rate is applied to networking (limiting bandwidth), where past underutilization typically * translates to "almost empty buffers", which can be filled immediately. * * On the other hand, past underutilization could mean that "the server responsible for handling * the request has become less ready for future requests", i.e. its caches become stale, and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 19.3K bytes - Viewed (0)