- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 320 for nide (0.13 sec)
-
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) -
android/guava/src/com/google/common/graph/PredecessorsFunction.java
* transformation: * * <pre>{@code * someGraphAlgorithm(startNode, node -> ImmutableList.of(node.mother(), node.father())); * }</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.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableNetwork.java
} private static <N, E> NetworkConnections<N, E> connectionsOf(Network<N, E> network, N node) { if (network.isDirected()) { Map<E, N> inEdgeMap = Maps.asMap(network.inEdges(node), sourceNodeFn(network)); Map<E, N> outEdgeMap = Maps.asMap(network.outEdges(node), targetNodeFn(network)); int selfLoopCount = network.edgesConnecting(node, node).size(); return network.allowsParallelEdges()
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) -
guava-tests/test/com/google/common/graph/NetworkEquivalenceTest.java
assertThat(network).isNotEqualTo(g2); } // Node sets are the same, but edge sets differ. @Test public void equivalent_edgeSetsDiffer() { network.addEdge(N1, N2, E12); MutableNetwork<Integer, String> g2 = createNetwork(edgeType); g2.addEdge(N1, N2, E13); assertThat(network).isNotEqualTo(g2); } // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 5.9K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/TrieParser.java
// ':' represents an interior node that represents a private entry in the map // ',' represents a leaf node, which represents a private entry in the map. String domain = DIRECT_JOINER.join(stack); if (domain.length() > 0) { builder.put(domain, PublicSuffixType.fromCode(c)); } } idx++; if (c != '?' && c != ',') {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Oct 13 19:20:43 GMT 2022 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ImmutableGraph.java
for (N node : graph.nodes()) { nodeConnections.put(node, connectionsOf(graph, node)); } return nodeConnections.buildOrThrow(); } @SuppressWarnings("unchecked") private static <N> GraphConnections<N, Presence> connectionsOf(Graph<N> graph, N node) { Function<N, Presence> edgeValueFn =
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K 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) -
android/guava/src/com/google/common/graph/ElementOrder.java
* <li>{@code predecessors(node)}: Connecting edge insertion order * <li>{@code successors(node)}: Connecting edge insertion order * <li>{@code incidentEdges(node)}: Stable order * <li>{@code inEdges(node)}: Edge insertion order * <li>{@code outEdges(node)}: Edge insertion order * <li>{@code adjacentEdges(edge)}: Stable order
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 6.7K 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) -
guava-tests/test/com/google/common/graph/GraphEquivalenceTest.java
assertThat(graph).isNotEqualTo(g2); } // Node/edge sets are the same, but node/edge connections differ due to edge type. @Test public void equivalent_directedVsUndirected() { graph.putEdge(N1, N2); MutableGraph<Integer> g2 = createGraph(oppositeType(edgeType)); g2.putEdge(N1, N2); assertThat(graph).isNotEqualTo(g2); } // Node/edge sets and node/edge connections are the same, but directedness differs.
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Jun 22 19:09:27 GMT 2017 - 4.7K bytes - Viewed (0)