- Sort Score
- Num 10 results
- Language All
Results 291 - 300 of 3,260 for pode (0.02 seconds)
-
guava/src/com/google/common/graph/PredecessorsFunction.java
* } * * <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 * transformation: * * {@snippet : * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.mother(), node.father())); * } * * <p>Graph algorithms that need additional capabilities (accessing both predecessors and
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 4K bytes - Click Count (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount); assertThat(graph.predecessors(node)).isEqualTo(graph.adjacentNodes(node)); assertThat(graph.successors(node)).isEqualTo(graph.adjacentNodes(node)); assertThat(graph.inDegree(node)).isEqualTo(graph.degree(node)); assertThat(graph.outDegree(node)).isEqualTo(graph.degree(node));
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Oct 07 15:57:03 GMT 2025 - 17.3K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. * * <p>{@code contains(x)}, {@code add(x)} and {@code remove(x)}, are all (expected and amortized) * constant time operations. Expected in the hashtable sense (depends on the hash function doing a
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.6K bytes - Click Count (0) -
helm-releases/minio-5.1.0.tgz
this to work. If you'd rather use `emptyDir`, disable PersistentVolumeClai by: ```bash helm install --set persistence.enabled=false minio/minio ``` > *"An emptyDir volume is first created when a Pod is assigned to a Node, and exists as long as that Pod is running on that node. When a Pod is removed from a node for any reason, the data in the emptyDir is deleted forever."* ### Existing PersistentVolumeClai If a Persistent Volume Claim already exists, specify it during installation. 1. Create the PersistentVolume...
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Mar 03 18:49:37 GMT 2024 - 21.3K bytes - Click Count (0) -
helm-releases/minio-5.2.0.tgz
this to work. If you'd rather use `emptyDir`, disable PersistentVolumeClai by: ```bash helm install --set persistence.enabled=false minio/minio ``` > *"An emptyDir volume is first created when a Pod is assigned to a Node, and exists as long as that Pod is running on that node. When a Pod is removed from a node for any reason, the data in the emptyDir is deleted forever."* ### Existing PersistentVolumeClai If a Persistent Volume Claim already exists, specify it during installation. 1. Create the PersistentVolume...
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Apr 28 10:14:37 GMT 2024 - 21.7K bytes - Click Count (0) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code adjacentNodes(node)}: Stable order * <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Stable order * <li>{@code inEdges(node)}: Edge insertion order * <li>{@code outEdges(node)}: Edge insertion order * <li>{@code adjacentEdges(edge)}: Stable order
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 6.6K bytes - Click Count (0) -
guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code adjacentNodes(node)}: Stable order * <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Stable order * <li>{@code inEdges(node)}: Edge insertion order * <li>{@code outEdges(node)}: Edge insertion order * <li>{@code adjacentEdges(edge)}: Stable order
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 6.6K bytes - Click Count (0) -
guava/src/com/google/common/graph/ImmutableValueGraph.java
} /** * Adds {@code node} if it is not already present. * * <p><b>Nodes must be unique</b>, just as {@code Map} keys must be. They must also be non-null. * * @return this {@code Builder} object */ @CanIgnoreReturnValue public ImmutableValueGraph.Builder<N, V> addNode(N node) { mutableValueGraph.addNode(node); return this; } /**Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Mar 17 20:26:29 GMT 2025 - 7.9K bytes - Click Count (0) -
helm-releases/minio-5.3.0.tgz
this to work. If you'd rather use `emptyDir`, disable PersistentVolumeClai by: ```bash helm install --set persistence.enabled=false minio/minio ``` > *"An emptyDir volume is first created when a Pod is assigned to a Node, and exists as long as that Pod is running on that node. When a Pod is removed from a node for any reason, the data in the emptyDir is deleted forever."* ### Existing PersistentVolumeClai If a Persistent Volume Claim already exists, specify it during installation. 1. Create the PersistentVolume...
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Oct 11 12:21:05 GMT 2024 - 21.7K bytes - Click Count (0)