- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 4,129 for Code (0.19 sec)
-
android/guava/src/com/google/common/graph/Network.java
*/ Set<E> outEdges(N node); /** * Returns the count of {@code node}'s {@link #incidentEdges(Object) incident edges}, counting * self-loops twice (equivalently, the number of times an edge touches {@code node}). * * <p>For directed networks, this is equal to {@code inDegree(node) + outDegree(node)}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0) -
android/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) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 33.1K 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
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graph.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 - 13.6K 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) -
src/main/java/jcifs/smb/SmbFile.java
* smb://foo/bar/ * </code></td> * </tr> * * <tr> * <td width="20%"><code> * smb://host/share/foo/ * </code></td> * <td width="20%"><code> * ../.././.././../foo/ * </code></td> * <td><code> * smb://host/foo/ * </code></td> * </tr> * * <tr> * <td width="20%"><code> * smb://host/share/zig/zag * </code></td> * <td width="20%"><code> * /
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Mon Mar 13 12:00:57 GMT 2023 - 81.6K 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/ImmutableNetwork.java
* * <p>If the network is directed, {@code edge} will be directed in this network; otherwise, it * will be undirected. * * <p><b>{@code edge} must be unique to this network</b>, just as a {@code Map} key must be. It * must also be non-null. * * <p>If {@code nodeU} and {@code nodeV} are not already present in this network, this method
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 9.6K bytes - Viewed (0) -
api/maven-api-core/src/main/java/org/apache/maven/api/Session.java
/** * Shortcut for {@code getService(ArtifactFactory.class).create(...)}. * * @param groupId the group identifier, or {@code null} is unspecified * @param artifactId the artifact identifier, or {@code null} is unspecified * @param version the artifact version, or {@code null} is unspecified * @param extension the artifact extension, or {@code null} is unspecified
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu May 02 15:10:38 GMT 2024 - 30.2K bytes - Viewed (0) -
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)