- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 156 for consistent (0.17 sec)
-
android/guava/src/com/google/common/hash/Hashing.java
* traffic to {@code charlie}, rather than letting {@code bravo} keep its traffic. * </ul> * * <p>See the <a href="http://en.wikipedia.org/wiki/Consistent_hashing">Wikipedia article on * consistent hashing</a> for more information. */ public static int consistentHash(HashCode hashCode, int buckets) { return consistentHash(hashCode.padToLong(), buckets); } /**
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/src/com/google/common/base/Predicate.java
* required, to have the following properties: * * <ul> * <li>Its execution does not cause any observable side effects. * <li>The computation is <i>consistent with equals</i>; that is, {@link Objects#equal * Objects.equal}{@code (a, b)} implies that {@code predicate.apply(a) == * predicate.apply(b))}. * </ul> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 3.5K bytes - Viewed (0) -
guava/src/com/google/common/base/Functions.java
} /** * Creates a function that returns the same boolean output as the given predicate for all inputs. * * <p>The returned function is <i>consistent with equals</i> (as documented at {@link * Function#apply}) if and only if {@code predicate} is itself consistent with equals. * * <p><b>Java 8+ users:</b> use the method reference {@code predicate::test} instead. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 14.1K bytes - Viewed (0) -
guava/src/com/google/common/collect/ForwardingMapEntry.java
* equality for both keys and values. This may not be the desired behavior for map implementations * that use non-standard notions of key equality, such as the entry of a {@code SortedMap} whose * comparator is not consistent with {@code equals}. * * <p>The {@code standard} methods are not guaranteed to be thread-safe, even when all of the * methods that they depend on are thread-safe. * * @author Mike Bostock * @author Louis Wasserman
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Tue Mar 19 19:28:11 GMT 2024 - 4.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/ForwardingSortedSet.java
* * <p>Each of the {@code standard} methods, where appropriate, uses the set's comparator (or the * natural ordering of the elements, if there is no comparator) to test element equality. As a * result, if the comparator is not consistent with equals, some of the standard implementations may * violate the {@code Set} contract. * * <p>The {@code standard} methods and the collection views they return are not guaranteed to be
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Fri May 12 15:26:39 GMT 2023 - 5.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/SortedMultiset.java
* all cases, this implementation uses {@link Comparable#compareTo} or {@link Comparator#compare} * instead of {@link Object#equals} to determine equivalence of instances. * * <p><b>Warning:</b> The comparison must be <i>consistent with equals</i> as explained by the * {@link Comparable} class specification. Otherwise, the resulting multiset will violate the {@link * Collection} contract, which is specified in terms of {@link Object#equals}. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 5.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractBiMap.java
@Override public Set<V> values() { /* * We can almost reuse the inverse's keySet, except we have to fix the * iteration order so that it is consistent with the forward map. */ Set<V> result = valueSet; return (result == null) ? valueSet = new ValueSet() : result; } @WeakOuter private class ValueSet extends ForwardingSet<V> {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Aug 24 01:40:03 GMT 2023 - 13.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/AbstractBiMap.java
K conflict = inverse.delegate.putIfAbsent(v, k); if (conflict != null) { broken = entry; // We're definitely going to throw, but we'll try to keep the BiMap in an internally // consistent state by removing the bad entry. itr.remove(); } } if (broken != null) { throw new IllegalArgumentException("value already present: " + broken.getValue()); } }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Aug 24 01:40:03 GMT 2023 - 14.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/CollectPreconditions.java
if (value <= 0) { throw new IllegalArgumentException(name + " must be positive but was: " + value); } } /** * Precondition tester for {@code Iterator.remove()} that throws an exception with a consistent * error message. */ static void checkRemove(boolean canRemove) { checkState(canRemove, "no calls to next() since the last call to remove()"); }
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Jun 30 10:33:07 GMT 2021 - 2.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CollectPreconditions.java
if (value <= 0) { throw new IllegalArgumentException(name + " must be positive but was: " + value); } } /** * Precondition tester for {@code Iterator.remove()} that throws an exception with a consistent * error message. */ static void checkRemove(boolean canRemove) { checkState(canRemove, "no calls to next() since the last call to remove()"); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Jun 30 10:33:07 GMT 2021 - 2.1K bytes - Viewed (0)