- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 100 for Hodges (0.16 sec)
-
android/guava/src/com/google/common/graph/NetworkBuilder.java
* user-defined properties. * * <p>A {@code Network} built by this class has the following default properties: * * <ul> * <li>does not allow parallel edges * <li>does not allow self-loops * <li>orders {@link Network#nodes()} and {@link Network#edges()} in the order in which the * elements were added (insertion order) * </ul> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
} /** * Returns a hash code, having the same bit length as each of the input hash codes, that combines * the information of these hash codes in an ordered fashion. That is, whenever two equal hash * codes are produced by two calls to this method, it is <i>as likely as possible</i> that each * was computed from the <i>same</i> input hash codes in the <i>same</i> order. *
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/graph/TraverserTest.java
} private static SuccessorsFunction<Character> createDirectedGraph(String... edges) { return createGraph(/* directed= */ true, edges); } private static SuccessorsFunction<Character> createUndirectedGraph(String... edges) { return createGraph(/* directed= */ false, edges); } /**
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/CycleDetectingLockFactory.java
LockGraphNode node = new LockGraphNode(getLockName(key)); nodes.add(node); map.put(key, node); } // Pre-populate all allowedPriorLocks with nodes of smaller ordinal. for (int i = 1; i < numKeys; i++) { nodes.get(i).checkAcquiredLocks(Policies.THROW, nodes.subList(0, i)); } // Pre-populate all disallowedPriorLocks with nodes of larger ordinal. for (int i = 0; i < numKeys - 1; i++) {
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) -
guava-testlib/src/com/google/common/collect/testing/TestCollidingSetGenerator.java
import com.google.common.annotations.GwtCompatible; import com.google.common.collect.testing.SampleElements.Colliders; import java.util.List; /** * A generator using sample elements whose hash codes all collide badly. * * @author Kevin Bourrillion */ @GwtCompatible @ElementTypesAreNonnullByDefault public abstract class TestCollidingSetGenerator implements TestSetGenerator<Object> { @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 1.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
if (connections == null) { return false; } if (allowsSelfLoops()) { // Remove self-loop (if any) first, so we don't get CME while removing incident edges. if (connections.removeSuccessor(node) != null) { connections.removePredecessor(node); --edgeCount; } } for (N successor : ImmutableList.copyOf(connections.successors())) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ValueGraphTest.java
assertStronglyEquivalent(graph, ImmutableValueGraph.copyOf(graph)); Graph<Integer> asGraph = graph.asGraph(); AbstractGraphTest.validateGraph(asGraph); assertThat(graph.nodes()).isEqualTo(asGraph.nodes()); assertThat(graph.edges()).isEqualTo(asGraph.edges()); assertThat(graph.nodeOrder()).isEqualTo(asGraph.nodeOrder()); assertThat(graph.incidentEdgeOrder()).isEqualTo(asGraph.incidentEdgeOrder());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 06 18:35:19 GMT 2024 - 20K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hasher.java
* were inserted, not how those bytes were chunked into discrete put() operations. For example, the * following three expressions all generate colliding hash codes: * * <pre>{@code * newHasher().putByte(b1).putByte(b2).putByte(b3).hash() * newHasher().putByte(b1).putBytes(new byte[] { b2, b3 }).hash() * newHasher().putBytes(new byte[] { b1, b2, b3 }).hash() * }</pre> *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 5.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/base/PredicatesTest.java
// Make sure that hash codes are not computed per-instance. assertEqualHashCode(Predicates.not(p1), Predicates.not(p1)); assertEqualHashCode(Predicates.and(p1, p2), Predicates.and(p1, p2)); assertEqualHashCode(Predicates.or(p1, p2), Predicates.or(p1, p2)); // While not a contractual requirement, we'd like the hash codes for ands // & ors of the same predicates to not collide.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 32.4K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ImmutableMap.java
return Maps.equalsImpl(this, object); } @Override public int hashCode() { // not caching hash code since it could change if map values are mutable // in a way that modifies their hash codes return entrySet().hashCode(); } @Override public String toString() { return Maps.toStringImpl(this); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 17.1K bytes - Viewed (0)