Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 10 of 61 for accessors (0.04 sec)

  1. src/test/java/jcifs/internal/smb1/com/SmbComNTCreateAndXTest.java

    import jcifs.SmbConstants;
    import jcifs.internal.smb1.ServerMessageBlock;
    
    /**
     * Unit tests for {@link SmbComNTCreateAndX}.  The tests exercise the
     * constructor’s flag handling, response creation and simple accessors.
     *
     * <p>All tests run in the same package as the class under test so that
     * package‑private members are visible if required.
     */
    @ExtendWith(MockitoExtension.class)
    class SmbComNTCreateAndXTest {
        @Mock
    Registered: Sun Sep 07 00:10:21 UTC 2025
    - Last Modified: Thu Aug 14 05:31:44 UTC 2025
    - 5.6K bytes
    - Viewed (0)
  2. android/guava/src/com/google/common/graph/ValueGraphBuilder.java

     *       order)
     * </ul>
     *
     * <p>{@code ValueGraph}s built by this class also guarantee that each collection-returning accessor
     * returns a <b>(live) unmodifiable view</b>; see <a
     * href="https://github.com/google/guava/wiki/GraphsExplained#accessor-behavior">the external
     * documentation</a> for details.
     *
     * <p>Examples of use:
     *
     * {@snippet :
     * // Building a mutable value graph
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/graph/GraphBuilder.java

     *       order)
     * </ul>
     *
     * <p>{@code Graph}s built by this class also guarantee that each collection-returning accessor
     * returns a <b>(live) unmodifiable view</b>; see <a
     * href="https://github.com/google/guava/wiki/GraphsExplained#accessor-behavior">the external
     * documentation</a> for details.
     *
     * <p>Examples of use:
     *
     * {@snippet :
     * // Building a mutable graph
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 7.3K bytes
    - Viewed (0)
  4. guava/src/com/google/common/graph/ValueGraphBuilder.java

     *       order)
     * </ul>
     *
     * <p>{@code ValueGraph}s built by this class also guarantee that each collection-returning accessor
     * returns a <b>(live) unmodifiable view</b>; see <a
     * href="https://github.com/google/guava/wiki/GraphsExplained#accessor-behavior">the external
     * documentation</a> for details.
     *
     * <p>Examples of use:
     *
     * {@snippet :
     * // Building a mutable value graph
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 7.9K bytes
    - Viewed (0)
  5. guava/src/com/google/common/graph/SuccessorsFunction.java

     * which has a method {@code getChildren()} that retrieves its successors in a graph:
     *
     * {@snippet :
     * someGraphAlgorithm(startNode, MyNode::getChildren);
     * }
     *
     * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't
     * return an {@code Iterable<? extends N>}, then you can use a lambda to perform a more general
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
  6. 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 {
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 7.2K bytes
    - Viewed (0)
  7. android/guava/src/com/google/common/graph/DirectedMultiNetworkConnections.java

      @Override
      public Set<N> successors() {
        return Collections.unmodifiableSet(successorsMultiset().elementSet());
      }
    
      private Multiset<N> successorsMultiset() {
        Multiset<N> successors = getReference(successorsReference);
        if (successors == null) {
          successors = HashMultiset.create(outEdgeMap.values());
          successorsReference = new SoftReference<>(successors);
        }
        return successors;
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  8. guava/src/com/google/common/graph/DirectedMultiNetworkConnections.java

      @Override
      public Set<N> successors() {
        return Collections.unmodifiableSet(successorsMultiset().elementSet());
      }
    
      private Multiset<N> successorsMultiset() {
        Multiset<N> successors = getReference(successorsReference);
        if (successors == null) {
          successors = HashMultiset.create(outEdgeMap.values());
          successorsReference = new SoftReference<>(successors);
        }
        return successors;
      }
    
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 4.6K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/graph/ForwardingValueGraph.java

        return delegate().adjacentNodes(node);
      }
    
      @Override
      public Set<N> predecessors(N node) {
        return delegate().predecessors(node);
      }
    
      @Override
      public Set<N> successors(N node) {
        return delegate().successors(node);
      }
    
      @Override
      public int degree(N node) {
        return delegate().degree(node);
      }
    
      @Override
      public int inDegree(N node) {
        return delegate().inDegree(node);
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Sun Dec 22 03:38:46 UTC 2024
    - 2.8K bytes
    - Viewed (0)
  10. android/guava/src/com/google/common/graph/SuccessorsFunction.java

     * which has a method {@code getChildren()} that retrieves its successors in a graph:
     *
     * {@snippet :
     * someGraphAlgorithm(startNode, MyNode::getChildren);
     * }
     *
     * <p>If you have some other mechanism for returning the successors of a node, or one that doesn't
     * return an {@code Iterable<? extends N>}, then you can use a lambda to perform a more general
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 4.2K bytes
    - Viewed (0)
Back to top