- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 4,885 for Code (0.21 sec)
-
android/guava/src/com/google/common/math/BigIntegerMath.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},
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/MutableNetwork.java
@CanIgnoreReturnValue boolean addNode(N node); /** * Adds {@code edge} connecting {@code nodeU} to {@code nodeV}. * * <p>If the graph is directed, {@code edge} will be directed in this graph; otherwise, it will be * undirected. * * <p><b>{@code edge} must be unique to this graph</b>, just as a {@code Map} key must be. It must * also be non-null. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.4K bytes - Viewed (0) -
android/guava/src/com/google/common/math/DoubleMath.java
* <li>If {@code tolerance} is zero, and neither {@code a} nor {@code b} is NaN, then {@code a} * and {@code b} are fuzzily equal if and only if {@code a == b}. * <li>With {@link Double#POSITIVE_INFINITY} tolerance, all non-NaN values are fuzzily equal. * <li>With finite tolerance, {@code Double.POSITIVE_INFINITY} and {@code
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
@Override Set<EndpointPair<N>> incidentEdges(N node); /** * Returns the count of {@code node}'s incident edges, counting self-loops twice (equivalently, * the number of times an edge touches {@code node}). * * <p>For directed graphs, this is equal to {@code inDegree(node) + outDegree(node)}. * * <p>For undirected graphs, this is equal to {@code incidentEdges(node).size()} + (number of
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/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; } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.7K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/AbstractSession.java
} @Override public Node getNode(org.eclipse.aether.graph.DependencyNode node) { return getNode(node, false); } @Override public Node getNode(org.eclipse.aether.graph.DependencyNode node, boolean verbose) { return allNodes.computeIfAbsent(node, n -> new DefaultNode(this, n, verbose)); } @Nonnull @Override
Java - Registered: Sun Mar 24 03:35:10 GMT 2024 - Last Modified: Fri Mar 01 17:18:13 GMT 2024 - 21.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* * <p>This method can be used to traverse over a binary tree. Given methods {@code * leftChild(node)} and {@code rightChild(node)}, this method can be called as * * <pre>{@code * Traverser.forTree(node -> ImmutableList.of(leftChild(node), rightChild(node))); * }</pre> * * @param tree {@link SuccessorsFunction} representing a directed acyclic graph that has at most * one path between any two nodes */
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) -
guava/src/com/google/common/collect/CompactLinkedHashMap.java
* all "null" (UNSET). * * <p>A node with "prev" pointer equal to {@code ENDPOINT} is the first node in the linked list, * and a node with "next" pointer equal to {@code ENDPOINT} is the last node. */ @CheckForNull @VisibleForTesting transient long[] links; /** Pointer to the first node in the linked list, or {@code ENDPOINT} if there are no entries. */ private transient int firstEntry;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 10.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/IntMath.java
/** * Returns the result of dividing {@code p} by {@code q}, rounding using the specified {@code * RoundingMode}. * * @throws ArithmeticException if {@code q == 0}, or if {@code mode == UNNECESSARY} and {@code a} * is not an integer multiple of {@code b} */ @SuppressWarnings("fallthrough") public static int divide(int p, int q, RoundingMode mode) { checkNotNull(mode); if (q == 0) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 23.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
* not be updated after modifications to {@code graph}. * * @throws IllegalArgumentException if {@code node} is not present in {@code graph} * @since 33.1.0 (present with return type {@code Set} since 20.0) */ public static <N> ImmutableSet<N> reachableNodes(Graph<N> graph, N node) { checkArgument(graph.nodes().contains(node), NODE_NOT_IN_GRAPH, node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0)