Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 3 of 3 for SuccessorsFunction (0.7 sec)

  1. guava/src/com/google/common/collect/TreeTraverser.java

     * @since 15.0
     * @deprecated Use {@link com.google.common.graph.Traverser} instead. All instance methods have
     *     their equivalent on the result of {@code Traverser.forTree(tree)} where {@code tree}
     *     implements {@code SuccessorsFunction}, which has a similar API as {@link #children} or can be
     *     the same lambda function as passed into {@link #using(Function)}.
     *     <p>This class is scheduled to be removed in October 2019.
     */
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Wed Oct 30 16:15:19 UTC 2024
    - 8.9K bytes
    - Viewed (0)
  2. guava/src/com/google/common/graph/Network.java

     * @param <E> Edge parameter type
     * @since 20.0
     */
    @Beta
    @DoNotMock("Use NetworkBuilder to create a real instance")
    @ElementTypesAreNonnullByDefault
    public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFunction<N> {
      //
      // Network-level accessors
      //
    
      /** Returns all nodes in this network, in the order specified by {@link #nodeOrder()}. */
      Set<N> nodes();
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 22.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/Network.java

     * @param <E> Edge parameter type
     * @since 20.0
     */
    @Beta
    @DoNotMock("Use NetworkBuilder to create a real instance")
    @ElementTypesAreNonnullByDefault
    public interface Network<N, E> extends SuccessorsFunction<N>, PredecessorsFunction<N> {
      //
      // Network-level accessors
      //
    
      /** Returns all nodes in this network, in the order specified by {@link #nodeOrder()}. */
      Set<N> nodes();
    
    Registered: Fri Nov 01 12:43:10 UTC 2024
    - Last Modified: Thu Oct 10 15:41:27 UTC 2024
    - 21.1K bytes
    - Viewed (0)
Back to top