- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 478 for successor (0.04 sec)
-
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
*/ private transient int @Nullable [] 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. */ private transient int @Nullable [] successor; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 14:59:07 UTC 2025 - 9.4K bytes - Viewed (0) -
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)); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Jan 18 02:54:30 UTC 2025 - 17.8K 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);
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/TreeMultiset.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 33.8K 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 @Nullable 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. */
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.4K 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(
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 7.2K bytes - Viewed (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/connection/FastFallbackExchangeFinder.kt
} else { firstException.addSuppressed(throwable) } } val nextPlan = connectResult.nextPlan if (nextPlan != null) { // Try this plan's successor before deferred plans because it won the race! routePlanner.deferredPlans.addFirst(nextPlan) } } } finally { cancelInFlightConnects() } throw firstException!!
Registered: Fri Sep 05 11:42:10 UTC 2025 - Last Modified: Fri Dec 27 13:39:56 UTC 2024 - 5.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractNetworkTest.java
} for (N successor : sanityCheckSet(network.successors(node))) { assertThat(network.predecessors(successor)).contains(node); assertThat(network.edgesConnecting(node, successor)).isNotEmpty(); } for (E incidentEdge : sanityCheckSet(network.incidentEdges(node))) { assertTrue( network.inEdges(node).contains(incidentEdge)
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 18:46:00 UTC 2025 - 32.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/HashBiMap.java
values[size] = value; insertIntoTableKToV(size, keyHash); insertIntoTableVToK(size, valueHash); int successor = (predecessor == ENDPOINT) ? firstInInsertionOrder : nextInInsertionOrder[predecessor]; setSucceeds(predecessor, size); setSucceeds(size, successor); size++; modCount++; return null; } /**
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 36.2K bytes - Viewed (0) -
docs/distributed/DECOMMISSION.md
> Without a 'Complete' status any 'Active' or 'Draining' pool(s) are not allowed to be removed once configured. ## NOTE - Empty delete markers (such as for objects with no other successor versions) do not transition to the new pool to avoid creating empty metadata on the other pool(s). If you believe transitioning empty delete markers is required, open a GitHub issue. ## TODO
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Mon Jul 11 14:59:49 UTC 2022 - 8.3K bytes - Viewed (0)