- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 320 for nide (0.16 sec)
-
api/maven-api-core/src/main/java/org/apache/maven/api/Node.java
*/ @Nullable Dependency getDependency(); /** * Gets the child nodes of this node. * * @return the child nodes of this node, never {@code null} */ @Nonnull List<Node> getChildren(); /** * @return repositories of this node */ @Nonnull List<RemoteRepository> getRemoteRepositories(); /**
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Dec 08 08:42:44 GMT 2023 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/TimeoutFuture.java
* need to clear our reference to the TimeoutFuture is the reason we use a *static* nested * class with a manual reference back to the "containing" class.) * * This has the nice-ish side effect of limiting reentrancy: run() calls * timeoutFuture.setException() calls run(). That reentrancy would already be harmless, since
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 7.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedGraphConnections.java
/** * A value class representing single connection between the origin node and another node. * * <p>There can be two types of connections (predecessor and successor), which is represented by * the two implementations. */ private abstract static class NodeConnection<N> { final N node; NodeConnection(N node) { this.node = checkNotNull(node); } static final class Pred<N> extends NodeConnection<N> {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 18K bytes - Viewed (0) -
android/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));
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* 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 * self-loops incident to {@code node}). * * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}. *
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/NetworkConnections.java
Set<E> inEdges(); Set<E> outEdges(); /** * Returns the set of edges connecting the origin node to {@code node}. For networks without * parallel edges, this set cannot be of size greater than one. */ 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. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.3K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingValueGraph.java
@Override public Set<N> adjacentNodes(N node) { return delegate().adjacentNodes(node); } @Override public Set<N> predecessors(N node) { return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public int degree(N node) { return delegate().degree(node); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
} }; } /** * Creates a new traverser for a directed acyclic graph that has at most one path from the start * node(s) to any node reachable from the start node(s), and has no paths from any start node to * any other start node, such as a tree or forest. * * <p>{@code forTree()} is especially useful (versus {@code forGraph()}) in cases where the data
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/graph/SuccessorsFunction.java
* transformation: * * <pre>{@code * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.leftChild(), node.rightChild())); * }</pre> * * <p>Graph algorithms that need additional capabilities (accessing both predecessors and * successors, iterating over the edges, etc.) should declare their input to be of a type that * provides those capabilities, such as {@link Graph}, {@link ValueGraph}, or {@link Network}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 4.3K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/util/PrunedTag.java
import org.w3c.dom.Node; public class PrunedTag { private final String tag; private String id; private String css; private String attrName; private String attrValue; public PrunedTag(final String tag) { this.tag = tag; } public boolean matches(final Node node) { if (tag.equalsIgnoreCase(node.getNodeName())) { if (attrName != null) {
Java - Registered: Mon Apr 29 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 4.8K bytes - Viewed (0)