- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 558 for successor (0.2 sec)
-
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
checkArgument(incidentEdge.nodeU().equals(thisNode)); N successor = incidentEdge.nodeV(); V value = successorNodeToValueFn.apply(successor); Object existingValue = adjacentNodeValues.put(successor, value); if (existingValue != null) { checkArgument(existingValue == PRED); adjacentNodeValues.put(successor, new PredAndSucc(value)); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
*/ @CheckForNull private transient int[] predecessor; /** * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last * node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ @CheckForNull private transient int[] successor; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
/** * Remove {@code node} from the set of successors. Returns the value previously associated with * the edge connecting the two nodes. */ @CanIgnoreReturnValue @CheckForNull V removeSuccessor(N node); /** * Add {@code node} as a predecessor to the origin node. In the case of an undirected graph, it * also becomes a successor. Associates {@code value} with the edge connecting the two nodes. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
*/ @CheckForNull private transient int[] predecessor; /** * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last * node in insertion order; all values at indices ≥ {@link #size()} are UNSET. */ @CheckForNull private transient int[] successor; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} for (N successor : sanityCheckSet(graph.successors(node))) { allEndpointPairs.add(EndpointPair.of(graph, node, successor)); assertThat(graph.predecessors(successor)).contains(node); assertThat(graph.hasEdgeConnecting(node, successor)).isTrue(); assertThat(graph.incidentEdges(node)).contains(EndpointPair.of(graph, node, successor)); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
@CanIgnoreReturnValue N removeOutEdge(E edge); /** * Add {@code edge} to the set of incoming edges. Implicitly adds {@code node} as a predecessor. */ void addInEdge(E edge, N node, boolean isSelfLoop); /** Add {@code edge} to the set of outgoing edges. Implicitly adds {@code node} as a successor. */ void addOutEdge(E edge, N node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
} } for (N successor : ImmutableList.copyOf(connections.successors())) { // requireNonNull is safe because the node is a successor. requireNonNull(nodeConnections.getWithoutCaching(successor)).removePredecessor(node); requireNonNull(connections.removeSuccessor(successor)); --edgeCount; } if (isDirected()) { // In undirected graphs, the successor and predecessor sets are equal.
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/AbstractGraphTest.java
} for (N successor : sanityCheckSet(graph.successors(node))) { allEndpointPairs.add(EndpointPair.of(graph, node, successor)); assertThat(graph.predecessors(successor)).contains(node); assertThat(graph.hasEdgeConnecting(node, successor)).isTrue(); assertThat(graph.incidentEdges(node)).contains(EndpointPair.of(graph, node, successor)); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
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/graph/AbstractBaseGraph.java
Iterators.transform( // filter out 'node' from successors (already covered by predecessors, // above) Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(), (N successor) -> EndpointPair.ordered(node, successor)))); } else { return Iterators.unmodifiableIterator(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0)