Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 6 of 6 for isSuccessor (0.04 sec)

  1. 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)
  2. 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)
  3. android/guava/src/com/google/common/graph/GraphConnections.java

      /**
       * 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.
       */
      void addPredecessor(N node, V value);
    
      /**
       * Add {@code node} as a successor to the origin node. In the case of an undirected graph, it also
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.4K bytes
    - Viewed (0)
  4. android/guava/src/com/google/common/graph/AbstractBaseGraph.java

                              // above)
                              Sets.difference(graph.successors(node), ImmutableSet.of(node)).iterator(),
                              (N successor) -> EndpointPair.ordered(node, successor))));
                } else {
                  return Iterators.unmodifiableIterator(
                      Iterators.transform(
                          graph.adjacentNodes(node).iterator(),
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 7.2K bytes
    - Viewed (0)
  5. 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)
  6. 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)
Back to top