- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 268 for inodes (0.03 sec)
-
cmd/metrics-v3-system-drive.go
driveUsedInodesMD = NewGaugeMD(driveUsedInodes, "Total used inodes on a drive", allDriveLabels...) driveFreeInodesMD = NewGaugeMD(driveFreeInodes, "Total free inodes on a drive", allDriveLabels...) driveTotalInodesMD = NewGaugeMD(driveTotalInodes, "Total inodes available on a drive", allDriveLabels...) driveTimeoutErrorsMD = NewCounterMD(driveTimeoutErrorsTotal,
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sun Mar 30 00:56:02 UTC 2025 - 7.8K bytes - Viewed (0) -
compat/maven-compat/src/main/java/org/apache/maven/repository/MetadataGraphNode.java
import java.util.List; /** * MetadataGraph node - as it's a directed graph - holds adjacency lists for incident and exident nodes * * */ @Deprecated public class MetadataGraphNode { /** node payload */ MavenArtifactMetadata metadata; /** nodes, incident to this (depend on me) */ List<MetadataGraphNode> inNodes; /** nodes, exident to this (I depend on) */
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Fri Oct 25 12:31:46 UTC 2024 - 2.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ElementOrderTest.java
ComparableSubClass node8 = new ComparableSubClass(8); graph.addNode(node4); graph.addNode(node2); graph.addNode(node6); graph.addNode(node8); assertThat(graph.nodeOrder().comparator()).isEqualTo(Ordering.natural()); assertThat(graph.nodes()).containsExactly(node2, node4, node6, node8).inOrder(); } private static void addNodes(MutableGraph<Integer> graph) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 8.1K bytes - Viewed (0) -
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(); /**
Registered: Sun Sep 07 03:35:12 UTC 2025 - Last Modified: Mon Mar 24 14:10:11 UTC 2025 - 4.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/ImmutableValueGraphTest.java
@Test public void immutableValueGraphBuilder_addNode() { ImmutableValueGraph<String, Integer> graph = ValueGraphBuilder.directed().<String, Integer>immutable().addNode("A").build(); assertThat(graph.nodes()).containsExactly("A"); assertThat(graph.edges()).isEmpty(); } @Test public void immutableValueGraphBuilder_putEdgeFromNodes() { ImmutableValueGraph<String, Integer> graph =
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 6.5K bytes - Viewed (0) -
docs/distributed/README.md
Example 1: Start distributed MinIO instance on n nodes with m drives each mounted at `/export1` to `/exportm` (pictured below), by running this command on all the n nodes:  ### GNU/Linux and macOS
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Aug 12 18:20:36 UTC 2025 - 8.9K bytes - Viewed (0) -
docs/bucket/replication/sio-error.sh
NODES=4 args1=() args2=() for i in $(seq 1 $NODES); do args1+=("http://localhost:$((9000 + i))/tmp/xl/1/$i ") args2+=("http://localhost:$((9100 + i))/tmp/xl/2/$i ") done for i in $(seq 1 $NODES); do ./minio server --address "127.0.0.1:$((9000 + i))" ${args1[@]} & # | tee /tmp/minio/node.$i &
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Sat May 18 18:19:01 UTC 2024 - 1.7K bytes - Viewed (0) -
guava/src/com/google/common/graph/EndpointPairIterator.java
* EndpointPair [N2, N1] - skip * EndpointPair [N2, N3] - return * Visited Nodes = {N1, N2} * EndpointPair [N3, N1] - skip * EndpointPair [N3, N2] - skip * Visited Nodes = {N1, N2, N3} * EndpointPair [N4, N4] - return * Visited Nodes = {N1, N2, N3, N4} * </pre> */ private static final class Undirected<N> extends EndpointPairIterator<N> {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Sun Dec 22 03:38:46 UTC 2024 - 4.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/NetworkMutationTest.java
assertThat(network.nodes()).isEmpty(); assertThat(network.edges()).isEmpty(); AbstractNetworkTest.validateNetwork(network); while (network.nodes().size() < NUM_NODES) { network.addNode(gen.nextInt(NODE_POOL_SIZE)); } ArrayList<Integer> nodeList = new ArrayList<>(network.nodes()); for (int i = 0; i < NUM_EDGES; ++i) {
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/GraphMutationTest.java
AbstractGraphTest.validateGraph(graph); Collections.shuffle(nodeList, gen); for (Integer node : nodeList) { assertThat(graph.addNode(node)).isTrue(); } Collections.shuffle(edgeList, gen); for (EndpointPair<Integer> edge : edgeList) { assertThat(graph.putEdge(edge.nodeU(), edge.nodeV())).isTrue(); }
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 4.2K bytes - Viewed (0)