- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,237 for Code (0.13 sec)
-
ci/official/containers/linux_arm64/devel.usertools/code_check_full.bats
EOF cat $BATS_TEST_TMPDIR/out [[ ! -s $BATS_TEST_TMPDIR/out ]] } @test "All tensorflow.org/code links point to real files" { for i in $(grep -onI 'https://www.tensorflow.org/code/[a-zA-Z0-9/._-]\+' -r tensorflow); do target=$(echo $i | sed 's!.*https://www.tensorflow.org/code/!!g') if [[ ! -f $target ]] && [[ ! -d $target ]]; then echo "$i" >> errors.txt fi
Plain Text - Registered: Tue May 07 12:40:20 GMT 2024 - Last Modified: Mon Sep 18 14:52:45 GMT 2023 - 12.7K bytes - Viewed (0) -
ci/official/utilities/code_check_full.bats
EOF cat $BATS_TEST_TMPDIR/out [[ ! -s $BATS_TEST_TMPDIR/out ]] } @test "All tensorflow.org/code links point to real files" { for i in $(grep -onI 'https://www.tensorflow.org/code/[a-zA-Z0-9/._-]\+' -r tensorflow); do target=$(echo $i | sed 's!.*https://www.tensorflow.org/code/!!g') if [[ ! -f $target ]] && [[ ! -d $target ]]; then echo "$i" >> errors.txt fi
Plain Text - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Wed Mar 06 21:54:13 GMT 2024 - 13.2K bytes - Viewed (0) -
maven-api-impl/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 May 05 03:35:11 GMT 2024 - Last Modified: Thu May 02 16:33:18 GMT 2024 - 27.2K 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/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/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/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) -
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) -
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)