- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for Schile (0.17 sec)
-
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
[later editions continued as follows The Panther took pie-crust, and gravy, and meat, While the Owl had the dish as its share of the treat. When the pie was all finished, the Owl, as a boon, Was kindly permitted to pocket the spoon: While the Panther received knife and fork with a growl, And concluded the banquet--]
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
} if (map.usesValueReferences()) { clearValueReferenceQueue(); } } void clearKeyReferenceQueue() { while (keyReferenceQueue.poll() != null) {} } void clearValueReferenceQueue() { while (valueReferenceQueue.poll() != null) {} } // recency queue, shared by expiration and eviction /**
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) -
guava-tests/test/com/google/common/cache/LocalCacheTest.java
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 14 23:06:48 GMT 2024 - 112.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/cache/LocalCacheTest.java
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Mar 14 23:06:48 GMT 2024 - 110.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/CharMatcherBenchmark.java
int needle = random.nextInt(sum); int l = 0; int r = prob.length - 1; int c = prob.length / 2; int lv = prob[l]; int rv = prob[r]; int cv = prob[c]; while (true) { if (needle == cv) { return chars[c - 1]; } else if ((lv <= needle) && (needle < cv)) { return chars[l]; } else if (needle == rv) { return chars[r];
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 194.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
[later editions continued as follows The Panther took pie-crust, and gravy, and meat, While the Owl had the dish as its share of the treat. When the pie was all finished, the Owl, as a boon, Was kindly permitted to pocket the spoon: While the Panther received knife and fork with a growl, And concluded the banquet--]
Plain Text - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 145.2K bytes - Viewed (0) -
android/guava/src/com/google/common/cache/LocalCache.java
} if (map.usesValueReferences()) { clearValueReferenceQueue(); } } void clearKeyReferenceQueue() { while (keyReferenceQueue.poll() != null) {} } void clearValueReferenceQueue() { while (valueReferenceQueue.poll() != null) {} } // recency queue, shared by expiration and eviction /**
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 144.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
V value1 = entry1.getValue(); checkEntryNotNull(key1, value1); // Do something that works for j2cl, where we can't call getDeclaredClass(): EnumMap<K, V> enumMap = new EnumMap<>(singletonMap(key1, value1)); while (entryItr.hasNext()) { Entry<K, ? extends V> entry = entryItr.next(); K key = entry.getKey(); V value = entry.getValue(); checkEntryNotNull(key, value); enumMap.put(key, value); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 159.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ClosingFuture.java
} catch (RejectedExecutionException e) { if (logger.get().isLoggable(WARNING)) { logger .get() .log( WARNING, String.format("while submitting close to %s; will close inline", executor), e); } closeQuietly(closeable, directExecutor()); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 98.5K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/CharMatcherBenchmark.java
int needle = random.nextInt(sum); int l = 0; int r = prob.length - 1; int c = prob.length / 2; int lv = prob[l]; int rv = prob[r]; int cv = prob[c]; while (true) { if (needle == cv) { return chars[c - 1]; } else if ((lv <= needle) && (needle < cv)) { return chars[l]; } else if (needle == rv) { return chars[r];
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 194.8K bytes - Viewed (0)