- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 23 for Bart (0.15 sec)
-
guava/src/com/google/common/collect/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/net/InternetDomainNameTest.java
InternetDomainName.from("xn--jrpeland-54a.no"); /** The Greek letter delta, used in unicode testing. */ private static final String DELTA = "\u0394"; /** A domain part which is valid under lenient validation, but invalid under strict validation. */ static final String LOTS_OF_DELTAS = Strings.repeat(DELTA, 62); private static final String ALMOST_TOO_MANY_LEVELS = Strings.repeat("a.", 127);
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-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* AbstractIteratorTester<E>, that's implicitly a cast to * AbstractIteratorTester<E>.MultiExceptionListIterator. The runtime * won't be able to verify the AbstractIteratorTester<E> part, so it's * an unchecked cast. We know, however, that the only possible value for * the type parameter is <E>, since otherwise the * MultiExceptionListIterator wouldn't be an Iterator<E>. The cast is
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* placed adjacent to each other, and so will most often share * cache lines (with a huge negative performance impact) without * this precaution. * * In part because Cells are relatively large, we avoid creating * them until they are needed. When there is no contention, all * updates are made to the base field. Upon first contention (a
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
* AbstractIteratorTester<E>, that's implicitly a cast to * AbstractIteratorTester<E>.MultiExceptionListIterator. The runtime * won't be able to verify the AbstractIteratorTester<E> part, so it's * an unchecked cast. We know, however, that the only possible value for * the type parameter is <E>, since otherwise the * MultiExceptionListIterator wouldn't be an Iterator<E>. The cast is
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-tests/test/com/google/common/util/concurrent/FuturesTest.java
*/ clearInterrupt(); aggregateFutureLogger.removeHandler(aggregateFutureLogHandler); super.tearDown(); } /* * TODO(cpovirk): Use FutureSubject once it's part of core Truth. But be wary of using it when I'm * really testing a Future implementation (e.g., in the case of immediate*Future()). But it's OK * to use in the case of the majority of Futures that are AbstractFutures. */
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 144.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
* map are also in this queue, and that all elements not in the queue are not in the map. * * <p>The benefits of creating our own queue are that (1) we can replace elements in the middle of * the queue as part of copyWriteEntry, and (2) the contains method is highly optimized for the * current model. */ static final class WriteQueue<K, V> extends AbstractQueue<ReferenceEntry<K, V>> { final ReferenceEntry<K, V> head =
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/Collections2.java
* * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the * first permutation will be in ascending order, and the last will be in descending order.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 22.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeMap.java
* * <p>It is guaranteed that no empty ranges will be in the returned {@code Map}. * * @since 19.0 */ Map<Range<K>, V> asDescendingMapOfRanges(); /** * Returns a view of the part of this range map that intersects with {@code range}. * * <p>For example, if {@code rangeMap} had the entries {@code [1, 5] => "foo", (6, 8) => "bar",
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 6.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/FeatureSpecificTestSuiteBuilder.java
public String getName() { return name; } // Test suppression private final Set<Method> suppressedTests = new HashSet<>(); /** * Prevents the given methods from being run as part of the test suite. * * <p>Note: in principle this should never need to be used, but it might be useful if the * semantics of an implementation disagree in unforeseen ways with the semantics expected by a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 10.2K bytes - Viewed (0)