- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 665 for inode (0.15 sec)
-
android/guava/src/com/google/common/graph/ImmutableValueGraph.java
ImmutableMap.Builder<N, GraphConnections<N, V>> nodeConnections = ImmutableMap.builder(); for (N node : graph.nodes()) { nodeConnections.put(node, connectionsOf(graph, node)); } return nodeConnections.buildOrThrow(); } private static <N, V> GraphConnections<N, V> connectionsOf(ValueGraph<N, V> graph, N node) { Function<N, V> successorNodeToValueFn = (N successorNode) ->
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.7K bytes - Viewed (0) -
common-protos/k8s.io/api/networking/v1alpha1/generated.proto
// ClusterCIDR represents a single configuration for per-Node Pod CIDR // allocations when the MultiCIDRRangeAllocator is enabled (see the config for // kube-controller-manager). A cluster may have any number of ClusterCIDR // resources, all of which will be considered when allocating a CIDR for a // Node. A ClusterCIDR is eligible to be used for a given Node when the node // selector matches the node in question and has free CIDRs to allocate. In
Plain Text - Registered: Wed May 08 22:53:08 GMT 2024 - Last Modified: Mon Mar 11 18:43:24 GMT 2024 - 6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractUndirectedNetworkConnections.java
return requireNonNull(previousNode); } @Override public void addInEdge(E edge, N node, boolean isSelfLoop) { if (!isSelfLoop) { addOutEdge(edge, node); } } @Override public void addOutEdge(E edge, N node) { N previousNode = incidentEdgeMap.put(edge, node); checkState(previousNode == null); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.7K bytes - Viewed (0) -
src/main/java/jcifs/smb1/dcerpc/UUID.java
clock_seq_hi_and_reserved = uuid.clock_seq_hi_and_reserved; clock_seq_low = uuid.clock_seq_low; node = new byte[6]; node[0] = uuid.node[0]; node[1] = uuid.node[1]; node[2] = uuid.node[2]; node[3] = uuid.node[3]; node[4] = uuid.node[4]; node[5] = uuid.node[5]; } public UUID(String str) { char[] arr = str.toCharArray();
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 4.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingNetwork.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 Set<E> incidentEdges(N node) { return delegate().incidentEdges(node); }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.5K 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) -
CHANGELOG/CHANGELOG-1.9.md
[kubernetes-node-linux-arm64.tar.gz](https://dl.k8s.io/v1.9.10/kubernetes-node-linux-arm64.tar.gz) | `8b6d61316e99c17d51ffd966c26d2034960947968a5a6840e547a1966a087ad7` [kubernetes-node-linux-ppc64le.tar.gz](https://dl.k8s.io/v1.9.10/kubernetes-node-linux-ppc64le.tar.gz) | `471d3a21f9bd8e8a7f03f8d225c4a72d7305f888102556e0ba29e5ec86dc763e`
Plain Text - Registered: Fri May 03 09:05:14 GMT 2024 - Last Modified: Tue Nov 16 10:46:27 GMT 2021 - 313.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConnections.java
* * @param thisNode The node that this all of the connections in this class are connected to. */ Iterator<EndpointPair<N>> incidentEdgeIterator(N thisNode); /** * Returns the value associated with the edge connecting the origin node to {@code node}, or null * if there is no such edge. */ @CheckForNull V value(N node); /** Remove {@code node} from the set of predecessors. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedListMultimap.java
*/ private void removeNode(Node<K, V> node) { if (node.previous != null) { node.previous.next = node.next; } else { // node was head head = node.next; } if (node.next != null) { node.next.previous = node.previous; } else { // node was tail tail = node.previous; } if (node.previousSibling == null && node.nextSibling == null) { /*
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 27.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardMutableValueGraph.java
@Override @CanIgnoreReturnValue public boolean addNode(N node) { checkNotNull(node, "node"); if (containsNode(node)) { return false; } addNodeInternal(node); return true; } /** * Adds {@code node} to the graph and returns the associated {@link GraphConnections}. * * @throws IllegalStateException if {@code node} is already present */ @CanIgnoreReturnValue
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Sat Oct 21 01:50:30 GMT 2023 - 6.4K bytes - Viewed (0)