- Sort Score
- Result 10 results
- Languages All
Results 211 - 220 of 3,128 for pode (0.02 sec)
-
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.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.4K bytes - Viewed (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},
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Jul 17 15:26:41 UTC 2025 - 3K bytes - Viewed (0) -
android/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.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
if (isDirected()) { return IntMath.saturatedAdd(predecessors(node).size(), successors(node).size()); } else { Set<N> neighbors = adjacentNodes(node); int selfLoopCount = (allowsSelfLoops() && neighbors.contains(node)) ? 1 : 0; return IntMath.saturatedAdd(neighbors.size(), selfLoopCount); } } @Override public int inDegree(N node) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 7.2K bytes - Viewed (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
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Wed Aug 06 14:59:07 UTC 2025 - 9.4K bytes - Viewed (0) -
guava/src/com/google/common/graph/MutableValueGraph.java
/** * Removes {@code node} if it is present; all edges incident to {@code node} will also be removed. * * @return {@code true} if the graph was modified as a result of this call */ @CanIgnoreReturnValue boolean removeNode(N node); /** * Removes the edge connecting {@code nodeU} to {@code nodeV}, if it is present. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 4.3K bytes - Viewed (0) -
android/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) { /*
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sat Aug 09 01:14:59 UTC 2025 - 26.6K bytes - Viewed (0) -
guava/src/com/google/common/io/Files.java
* <p>These heuristics do not always match the behavior of the filesystem. In particular, consider * the path {@code a/../b}, which {@code simplifyPath} will change to {@code b}. If {@code a} is a * symlink to {@code x}, {@code a/../b} may refer to a sibling of {@code x}, rather than the * sibling of {@code a} referred to by {@code b}. * * @since 11.0 */ public static String simplifyPath(String pathname) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 32.9K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/Session.java
* @return flattened list of node with the given build path scope * @throws org.apache.maven.api.services.DependencyResolverException if the dependency flattening failed * * @see org.apache.maven.api.services.DependencyResolver#flatten(Session, Node, PathScope) */ @Nonnull List<Node> flattenDependencies(@Nonnull Node node, @Nonnull PathScope scope); /**
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Thu Jul 03 14:18:26 UTC 2025 - 36.5K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
/** * Checks the acquisition-ordering between {@code this}, which is about to be acquired, and the * specified {@code acquiredLock}. * * <p>When this method returns, the {@code acquiredLock} should be in either the {@code * preAcquireLocks} map, for the case in which it is safe to acquire {@code this} after the * {@code acquiredLock}, or in the {@code disallowedPriorLocks} map, in which case it is not * safe.
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Fri Jul 18 15:05:43 UTC 2025 - 35.9K bytes - Viewed (0)