Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 20 for predecessors (0.3 seconds)

  1. android/guava/src/com/google/common/graph/PredecessorsFunction.java

     * which has a method {@code getParents()} that retrieves its predecessors in a graph:
     *
     * {@snippet :
     * someGraphAlgorithm(startNode, MyNode::getParents);
     * }
     *
     * <p>If you have some other mechanism for returning the predecessors of a node, or one that doesn't
     * return a {@code Iterable<? extends N>}, then you can use a lambda to perform a more general
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 4K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/graph/StandardValueGraph.java

      @Override
      public Set<N> adjacentNodes(N node) {
        return nodeInvalidatableSet(checkedConnections(node).adjacentNodes(), node);
      }
    
      @Override
      public Set<N> predecessors(N node) {
        return nodeInvalidatableSet(checkedConnections(node).predecessors(), node);
      }
    
      @Override
      public Set<N> successors(N node) {
        return nodeInvalidatableSet(checkedConnections(node).successors(), node);
      }
    
      @Override
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 6K bytes
    - Click Count (0)
  3. android/guava/src/com/google/common/graph/ValueGraph.java

      @Override
      ElementOrder<N> nodeOrder();
    
      /**
       * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of
       * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link
       * #successors(Object)} and {@link #incidentEdges(Object)}.
       *
       * @since 29.0
       */
      @Override
      ElementOrder<N> incidentEdgeOrder();
    
      //
      // Element-level accessors
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 15K bytes
    - Click Count (0)
  4. android/guava/src/com/google/common/graph/Graphs.java

        }
    
        @Override
        Graph<N> delegate() {
          return graph;
        }
    
        @Override
        public Set<N> predecessors(N node) {
          return delegate().successors(node); // transpose
        }
    
        @Override
        public Set<N> successors(N node) {
          return delegate().predecessors(node); // transpose
        }
    
        @Override
        public Set<EndpointPair<N>> incidentEdges(N node) {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 24.4K bytes
    - Click Count (0)
  5. android/guava/src/com/google/common/graph/Graph.java

      @Override
      ElementOrder<N> nodeOrder();
    
      /**
       * Returns an {@link ElementOrder} that specifies the order of iteration for the elements of
       * {@link #edges()}, {@link #adjacentNodes(Object)}, {@link #predecessors(Object)}, {@link
       * #successors(Object)} and {@link #incidentEdges(Object)}.
       *
       * @since 29.0
       */
      @Override
      ElementOrder<N> incidentEdgeOrder();
    
      //
      // Element-level accessors
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 13.6K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/graph/StandardNetwork.java

      }
    
      @Override
      public Set<E> outEdges(N node) {
        return nodeInvalidatableSet(checkedConnections(node).outEdges(), node);
      }
    
      @Override
      public Set<N> predecessors(N node) {
        return nodeInvalidatableSet(checkedConnections(node).predecessors(), node);
      }
    
      @Override
      public Set<N> successors(N node) {
        return nodeInvalidatableSet(checkedConnections(node).successors(), node);
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 6.9K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/graph/ElementOrder.java

       *         <li>{@code predecessors(node)}: Connecting edge insertion order
       *         <li>{@code successors(node)}: Connecting edge insertion order
       *         <li>{@code incidentEdges(node)}: Edge insertion order
       *       </ul>
       *   <li>For {@link Network}:
       *       <ul>
       *         <li>{@code adjacentNodes(node)}: Stable order
       *         <li>{@code predecessors(node)}: Connecting edge insertion order
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 6.5K bytes
    - Click Count (0)
  8. android/guava/src/com/google/common/graph/AbstractValueGraph.java

          }
    
          @Override
          public Set<N> adjacentNodes(N node) {
            return AbstractValueGraph.this.adjacentNodes(node);
          }
    
          @Override
          public Set<N> predecessors(N node) {
            return AbstractValueGraph.this.predecessors(node);
          }
    
          @Override
          public Set<N> successors(N node) {
            return AbstractValueGraph.this.successors(node);
          }
    
          @Override
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Mar 11 01:10:31 GMT 2026
    - 4K bytes
    - Click Count (0)
  9. docs/en/docs/history-design-future.md

    As part of that, I needed to investigate, test and use many alternatives.
    
    The history of **FastAPI** is in great part the history of its predecessors.
    
    As said in the section [Alternatives](alternatives.md):
    
    <blockquote markdown="1">
    
    **FastAPI** wouldn't exist if not for the previous work of others.
    
    Created: Sun Apr 05 07:19:11 GMT 2026
    - Last Modified: Thu Mar 05 18:13:19 GMT 2026
    - 4K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/graph/GraphBuilder.java

        return newBuilder;
      }
    
      /**
       * Specifies the order of iteration for the elements of {@link Graph#edges()}, {@link
       * Graph#adjacentNodes(Object)}, {@link Graph#predecessors(Object)}, {@link
       * Graph#successors(Object)} and {@link Graph#incidentEdges(Object)}.
       *
       * <p>The default value is {@link ElementOrder#unordered() unordered} for mutable graphs. For
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Apr 02 14:49:41 GMT 2026
    - 7.2K bytes
    - Click Count (0)
Back to Top