- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 152 for fore (0.12 sec)
-
android/guava/src/com/google/common/hash/Hashing.java
* Comparisons between the two should take this into account. * * <p>Fingerprint2011() is a form of Murmur2 on strings up to 32 bytes and a form of CityHash for * longer strings. It could have been one or the other throughout. The main advantage of the * combination is that CityHash has a bunch of special cases for short strings that don't need to * be replicated here. The result will never be 0 or 1. *
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) -
guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
} } private static <K, V> int countLiveEntries(MapMakerInternalMap<K, V, ?, ?> map) { int result = 0; for (Segment<K, V, ?, ?> segment : map.segments) { AtomicReferenceArray<? extends InternalEntry<K, V, ?>> table = segment.table; for (int i = 0; i < table.length(); i++) { for (InternalEntry<K, V, ?> e = table.get(i); e != null; e = e.getNext()) { if (map.isLiveForTesting(e)) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/MapMakerInternalMapTest.java
} } private static <K, V> int countLiveEntries(MapMakerInternalMap<K, V, ?, ?> map) { int result = 0; for (Segment<K, V, ?, ?> segment : map.segments) { AtomicReferenceArray<? extends InternalEntry<K, V, ?>> table = segment.table; for (int i = 0; i < table.length(); i++) { for (InternalEntry<K, V, ?> e = table.get(i); e != null; e = e.getNext()) { if (map.isLiveForTesting(e)) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 35.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
int copyIntoArray(@Nullable Object[] dst, int offset) { // this loop is faster for RandomAccess instances, which ImmutableLists are int size = size(); for (int i = 0; i < size; i++) { dst[offset + i] = get(i); } return offset + size; } /** * Returns a view of this immutable list in reverse order. For example, {@code ImmutableList.of(1,
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1) -
android/guava/src/com/google/common/collect/TreeMultiset.java
} @Override public void clear() { if (!range.hasLowerBound() && !range.hasUpperBound()) { // We can do this in O(n) rather than removing one by one, which could force rebalancing. for (AvlNode<E> current = header.succ(); current != header; ) { AvlNode<E> next = current.succ(); current.elemCount = 0;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 34.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableMap.java
} /** * Returns a newly-created immutable map, using the last value for any key that was added more * than once. The iteration order of the returned map is the order in which entries were * inserted into the builder, unless {@link #orderEntriesByValue} was called, in which case * entries are sorted by value. If a key was added more than once, it appears in iteration order
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
* free slot. * * The table size is capped because, when there are more threads * than CPUs, supposing that each thread were bound to a CPU, * there would exist a perfect hash function mapping threads to * slots that eliminates collisions. When we reach capacity, we * search for this mapping by randomly varying the hash codes of * colliding threads. Because search is random, and collisions
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) -
guava-tests/test/com/google/common/collect/TreeMultimapNaturalTest.java
@GwtIncompatible // suite public static Test suite() { TestSuite suite = new TestSuite(); // TODO(lowasser): should we force TreeMultimap to be more thorough about checking nulls? suite.addTest( SortedSetMultimapTestSuiteBuilder.using( new TestStringSetMultimapGenerator() { @Override protected SetMultimap<String, String> create(Entry<String, String>[] entries) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 22.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// similar purposes. // * We want to behave reasonably for timeouts of 0 // * We are more responsive to completion than timeouts. This is because parkNanos depends on // system scheduling and as such we could either miss our deadline, or unpark() could be delayed // so that it looks like we timed out even though we didn't. For comparison FutureTask respects
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/OneSizeTestContainerGenerator.java
/** * The subject-generator interface accepted by Collection testers, for testing a Collection at one * particular {@link CollectionSize}. * * <p>This interface should not be implemented outside this package; {@link * PerCollectionSizeTestSuiteBuilder} constructs instances of it from a more general {@link * TestCollectionGenerator}. * * @author George van den Driessche */ @GwtCompatible
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 1.5K bytes - Viewed (0)