- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 82 for accessors (6.45 sec)
-
android/guava/src/com/google/common/graph/Traverser.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
} @Override @Test public void successors_checkReturnedSetMutability() { assume().that(graphIsMutable()).isTrue(); addNode(N1); Set<Integer> successors = network.successors(N1); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> successors.add(N2)); addEdge(N1, N2, E12); assertThat(successors).containsExactlyElementsIn(network.successors(N1)); }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/SuccessorsFunction.java
* which has a method {@code getChildren()} that retrieves its successors in a graph: * * <pre>{@code * someGraphAlgorithm(startNode, MyNode::getChildren); * }</pre> * * <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
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
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);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.9K bytes - Viewed (0) -
guava/src/com/google/common/cache/LocalCache.java
* higher than performing just the operation without enforcing the capacity constraint. * * This implementation uses a per-segment queue to record a memento of the additions, removals, * and accesses that were performed on the map. The queue is drained on writes and when it exceeds * its capacity threshold. * * The Least Recently Used page replacement algorithm was chosen due to its simplicity, high hit
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 150.3K bytes - Viewed (0) -
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: * * <pre>{@code * // Building a mutable graph
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
&& successorCount <= adjacentNodeValues.size()); } static <N, V> DirectedGraphConnections<N, V> of(ElementOrder<N> incidentEdgeOrder) { // We store predecessors and successors in the same map, so double the initial capacity. int initialCapacity = INNER_CAPACITY * 2; List<NodeConnection<N>> orderedNodeConnections; switch (incidentEdgeOrder.type()) { case UNORDERED:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <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 * <li>{@code successors(node)}: Connecting edge insertion order
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 6.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/NetworkConnections.java
* @param <N> Node parameter type * @param <E> Edge parameter type */ @ElementTypesAreNonnullByDefault interface NetworkConnections<N, E> { Set<N> adjacentNodes(); Set<N> predecessors(); Set<N> successors(); Set<E> incidentEdges(); Set<E> inEdges(); Set<E> outEdges(); /** * Returns the set of edges connecting the origin node to {@code node}. For networks without
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/GraphsTest.java
assertThat(directedGraph.outDegree(node)).isSameInstanceAs(transpose.inDegree(node)); } assertThat(transpose.successors(N1)).doesNotContain(N2); directedGraph.putEdge(N2, N1); // View should be updated. assertThat(transpose.successors(N1)).contains(N2); AbstractGraphTest.validateGraph(transpose); } @Test public void transpose_undirectedValueGraph() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.8K bytes - Viewed (0)