- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 1,113 for Node (0.15 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 May 05 03:35:11 GMT 2024 - Last Modified: Fri Dec 08 08:42:44 GMT 2023 - 3.2K 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 May 03 12:43:13 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
@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/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/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/GraphsTest.java
AbstractGraphTest.validateGraph(transpose); for (Integer node : directedGraph.nodes()) { assertThat(directedGraph.inDegree(node)).isSameInstanceAs(transpose.outDegree(node)); assertThat(directedGraph.outDegree(node)).isSameInstanceAs(transpose.inDegree(node)); } assertThat(transpose.successors(N1)).doesNotContain(N2); directedGraph.putEdge(N2, N1);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 24.8K 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 May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 4.8K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/WrapperNode.java
import org.apache.maven.api.Dependency; import org.apache.maven.api.Node; import org.apache.maven.api.RemoteRepository; import org.apache.maven.api.annotations.Nonnull; import org.eclipse.aether.graph.DependencyNode; class WrapperNode extends AbstractNode { protected final Node delegate; protected final List<Node> children; WrapperNode(Node delegate, List<Node> children) { this.delegate = delegate;
Java - Registered: Sun Mar 24 03:35:10 GMT 2024 - Last Modified: Fri Dec 08 08:42:44 GMT 2023 - 2.2K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/MetadataGraphNode.java
this(); this.metadata = metadata; } public MetadataGraphNode addIncident(MetadataGraphNode node) { inNodes.add(node); return this; } public MetadataGraphNode addExident(MetadataGraphNode node) { exNodes.add(node); return this; } @Override public boolean equals(Object obj) { if (obj == null) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Sep 06 11:28:54 GMT 2023 - 2.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
assertThat(endpointPair.source()).isEqualTo(node); assertThat(endpointPair.target()).isEqualTo(endpointPair.adjacentNode(node)); } for (Integer adjacentNode : network.adjacentNodes(node)) { Set<String> edges = network.edgesConnecting(node, adjacentNode); Set<String> antiParallelEdges = network.edgesConnecting(adjacentNode, node);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0)