- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 62 for paging (0.15 sec)
-
android/guava/src/com/google/common/io/ByteStreams.java
* and virtual memory, this is not a problem - because it is mapped read-only, the kernel * can always page it to disk "for free". However, on systems where killing processes * happens all the time in normal conditions (i.e., android) the OS must make a tradeoff * between paging memory and killing other processes - so allocating a gigantic buffer and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jan 17 18:59:58 GMT 2024 - 29.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/testers/SetHashCodeTester.java
elements.add(null); collection = getSubjectGenerator().create(elements.toArray()); assertEquals( "A Set's hashCode() should be the sum of those of its elements (with " + "a null element counting as having a hash of zero).", expectedHashCode, getSet().hashCode()); } /** * Returns the {@link Method} instances for the test methods in this class which call {@code
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/net/InternetDomainNameTest.java
private static final ImmutableSet<String> NO_PS = ImmutableSet.of("www", "foo.ihopethiswillneverbeapublicsuffix", "x.y.z"); /** * Having a public suffix is equivalent to having a registry suffix, because all registry suffixes * are public suffixes, and all public suffixes have registry suffixes. */ private static final ImmutableSet<String> NO_RS = NO_PS;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Mar 05 13:16:00 GMT 2024 - 17.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/TraverserTest.java
*/ private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH = createDirectedGraph("ab", "ac", "bc", "cd", "da"); /** * A tree-shaped graph that looks as follows (all edges are directed facing downwards): * * <pre>{@code * h * /|\ * / | \ * / | \ * d e g * /|\ | * / | \ | * a b c f * }</pre>
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
* of the <i>next</i> request. I.e., if an expensive task arrives at an idle RateLimiter, it will be * granted immediately, but it is the <i>next</i> request that will experience extra throttling, * thus paying for the cost of the expensive task. * * @author Dimitris Andreou * @since 13.0 */ // TODO(user): switch to nano precision. A natural unit of cost is "bytes", and a micro precision
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ComparisonChain.java
* @since 12.0 (present as {@code compare} since 2.0) */ public abstract ComparisonChain compareFalseFirst(boolean left, boolean right); /** * Ends this comparison chain and returns its result: a value having the same sign as the first * nonzero comparison result in the chain, or zero if every result was zero. */ public abstract int result();
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Sep 21 17:28:11 GMT 2022 - 11.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* objects per entry. Instead we use an open-addressed hash table. This design is basically * equivalent to RegularImmutableSet, save that instead of having a hash table containing the * elements directly and null for empty positions, we store indices of the keys in the hash table, * and ABSENT for empty positions. We then look up the keys in alternatingKeysAndValues. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
// condition efficiently without _introducing_ deadlock is probably // tricky. For now, just accept the race condition---missing a warning // now and then is still better than having no deadlock detection. allowedPriorLocks.put(acquiredLock, new ExampleStackTrace(acquiredLock, this)); } else { // Unsafe acquisition order detected. Create and cache a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Preconditions.java
* * <pre>{@code * void exampleBadCaller() { * double d = sqrt(-1.0); * } * }</pre> * * <p>would be flagged as having called {@code sqrt()} with an illegal argument. * * <h3>Performance</h3> * * <p>Avoid passing message arguments that are expensive to compute; your code will always compute * them, even though they usually won't be needed. If you have such arguments, use the conventional
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Apr 11 11:52:14 GMT 2024 - 52.9K bytes - Viewed (0)