- Sort Score
- Num 10 results
- Language All
Results 251 - 260 of 3,205 for pode (0.02 seconds)
-
android/guava/src/com/google/common/graph/GraphConnections.java
/** * Returns the value associated with the edge connecting the origin node to {@code node}, or null * if there is no such edge. */ @Nullable V value(N node); /** Remove {@code node} from the set of predecessors. */ void removePredecessor(N node); /** * Remove {@code node} from the set of successors. Returns the value previously associated with * the edge connecting the two nodes.Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 2.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/LinkedListMultimap.java
*/ private void removeNode(Node<K, V> node) { if (node.previous != null) { node.previous.next = node.next; } else { // node was head head = node.next; } if (node.next != null) { node.next.previous = node.previous; } else { // node was tail tail = node.previous; } if (node.previousSibling == null && node.nextSibling == null) { /*
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 27K bytes - Click Count (0) -
guava/src/com/google/common/math/BigDecimalMath.java
/** * Returns {@code x}, rounded to a {@code double} with the specified rounding mode. If {@code x} * is precisely representable as a {@code double}, its {@code double} value will be returned; * otherwise, the rounding will choose between the two nearest representable values with {@code * mode}. * * <p>For the case of {@link RoundingMode#HALF_DOWN}, {@code HALF_UP}, and {@code HALF_EVEN},Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Thu Jul 17 15:26:41 GMT 2025 - 3K bytes - Click Count (0) -
guava/src/com/google/common/graph/NetworkConnections.java
*/ Set<E> edgesConnecting(N node); /** * Returns the node that is adjacent to the origin node along {@code edge}. * * <p>In the directed case, {@code edge} is assumed to be an outgoing edge. */ N adjacentNode(E edge); /** * Remove {@code edge} from the set of incoming edges. Returns the former predecessor node. * * <p>In the undirected case, returns {@code null} if {@code isSelfLoop} is true.
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 2.3K bytes - Click Count (0) -
helm-releases/minio-3.6.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 13 22:44:21 GMT 2022 - 17.9K 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) -
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) -
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)