- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 3,796 for node (0.27 sec)
-
docs/distributed/SIZING.md
# Erasure code sizing guide ## Toy Setups Capacity constrained environments, MinIO will work but not recommended for production. | servers | drives (per node) | stripe_size | parity chosen (default) | tolerance for reads (servers) | tolerance for writes (servers) | |--------:|------------------:|------------:|------------------------:|------------------------------:|-------------------------------:|
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Tue Aug 15 23:04:20 UTC 2023 - 3.9K bytes - Viewed (0) -
impl/maven-core/src/main/java/org/apache/maven/internal/transformation/impl/DefaultConsumerPomBuilder.java
model.getGroupId(), model.getArtifactId(), model.getVersion(), null); Node node = iSession.collectDependencies( iSession.createDependencyCoordinates(artifact), PathScope.MAIN_RUNTIME); Map<String, Node> nodes = node.stream() .collect(Collectors.toMap(n -> getDependencyKey(n.getDependency()), Function.identity()));
Registered: Sun Dec 28 03:35:09 UTC 2025 - Last Modified: Thu Nov 27 07:40:26 UTC 2025 - 21.2K bytes - Viewed (0) -
cmd/callhome.go
return } go func() { r := rand.New(rand.NewSource(time.Now().UnixNano())) // Leader node (that successfully acquires the lock inside runCallhome) // will keep performing the callhome. If the leader goes down for some reason, // the lock will be released and another node will acquire it and take over // because of this loop. for { if !globalCallhomeConfig.Enabled() { return }
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Fri Aug 29 02:39:48 UTC 2025 - 5.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
int numKeys = keys.length; ArrayList<LockGraphNode> nodes = Lists.newArrayListWithCapacity(numKeys); // Create a LockGraphNode for each enum value. for (E key : keys) { LockGraphNode node = new LockGraphNode(getLockName(key)); nodes.add(node); map.put(key, node); } // Pre-populate all allowedPriorLocks with nodes of smaller ordinal. for (int i = 1; i < numKeys; i++) {Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Sep 11 17:06:34 UTC 2025 - 35.9K bytes - Viewed (0) -
docs/metrics/prometheus/alerts.md
"instance": "localhost:9000", "job": "minio-job-node", "pool": "0", "server": "127.0.0.1:9000", "set": "0", "severity": "critical" }, "annotations": { "description": "MinIO instance 127.0.0.1:9000 of job minio-job has tolerance <=0 for more than 5 minutes.", "summary": "Instance 127.0.0.1:9000 unable to tolerate node failures" },
Registered: Sun Dec 28 19:28:13 UTC 2025 - Last Modified: Wed Apr 23 15:13:23 UTC 2025 - 4.4K bytes - Viewed (0) -
api/go1.25.txt
pkg go/ast, func FilterPackage //deprecated #73088 pkg go/ast, func MergePackageFiles //deprecated #73088 pkg go/ast, func PackageExports //deprecated #73088 pkg go/ast, func PreorderStack(Node, []Node, func(Node, []Node) bool) #73319 pkg go/ast, type MergeMode //deprecated #73088 pkg go/parser, func ParseDir //deprecated #71122 pkg go/token, method (*FileSet) AddExistingFiles(...*File) #73205 pkg go/types, const FieldVar = 6 #70250
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Mon Jun 02 16:09:57 UTC 2025 - 6.8K 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 Dec 28 19:28:13 UTC 2025 - Last Modified: Sat May 18 18:19:01 UTC 2024 - 1.7K bytes - Viewed (0) -
tensorflow/c/c_api_experimental.cc
using tensorflow::FunctionDef; using tensorflow::Node; using tensorflow::NodeBuilder; using tensorflow::Status; using tensorflow::errors::InvalidArgument; namespace { typedef std::unique_ptr<TF_Function, decltype(&TF_DeleteFunction)> UniqueFuncPtr; } // struct TF_Operation { tensorflow::Node node; }; static TF_Operation* ToTF_Operation(Node* node) { return static_cast<TF_Operation*>(static_cast<void*>(node));Registered: Tue Dec 30 12:39:10 UTC 2025 - Last Modified: Sat Oct 04 05:55:32 UTC 2025 - 29.4K bytes - Viewed (0) -
fess-crawler/src/main/java/org/codelibs/fess/crawler/extractor/impl/HtmlExtractor.java
for (int i = 0; i < nodeList.size(); i++) { final Node node = nodeList.get(i); strList.add(node.getTextContent()); } return strList.toArray(n -> new String[n]); case NODE: final Node node = (Node) xObj.value(); return new String[] { node.getTextContent() }; default:
Registered: Sat Dec 20 11:21:39 UTC 2025 - Last Modified: Sat Oct 04 08:47:19 UTC 2025 - 9.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void validateUndirectedEdges() { for (Integer node : network.nodes()) { new EqualsTester() .addEqualityGroup( network.inEdges(node), network.outEdges(node), network.incidentEdges(node)) .testEquals(); new EqualsTester() .addEqualityGroup( network.predecessors(node), network.successors(node), network.adjacentNodes(node)) .testEquals();
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 30 17:09:51 UTC 2025 - 19K bytes - Viewed (0)