- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 22 for inodes (0.04 sec)
-
cmd/xl-storage.go
data := make([]byte, 8) binary.LittleEndian.PutUint64(data, writeCount) return xattr.LSet(s.formatFile, attr, data) } // DiskInfo provides current information about disk space usage, // total free inodes and underlying filesystem. func (s *xlStorage) DiskInfo(ctx context.Context, _ DiskInfoOptions) (info DiskInfo, err error) { info, err = s.diskInfoCache.GetWithCtx(ctx) info.NRRequests = s.nrRequests
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Fri Jun 13 11:33:47 UTC 2025 - 91.7K bytes - Viewed (0) -
cmd/bucket-stats_gen.go
switch msgp.UnsafeString(field) { case "Nodes": var zb0002 uint32 zb0002, err = dc.ReadArrayHeader() if err != nil { err = msgp.WrapError(err, "Nodes") return } if cap(z.Nodes) >= int(zb0002) { z.Nodes = (z.Nodes)[:zb0002] } else { z.Nodes = make([]ReplQNodeStats, zb0002) } for za0001 := range z.Nodes { err = z.Nodes[za0001].DecodeMsg(dc) if err != nil {
Registered: Sun Sep 07 19:28:11 UTC 2025 - Last Modified: Tue Feb 06 06:00:45 UTC 2024 - 57.5K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.3.md
* This ensures that attachment and detachment of volumes is independent of any single nodes’ availability. Meaning, if a node or kubelet becomes unavailable for any reason, the volumes attached to that node will be detached so they are free to be attached to other nodes.
Registered: Fri Sep 05 09:05:11 UTC 2025 - Last Modified: Thu Dec 24 02:28:26 UTC 2020 - 84K bytes - Viewed (0) -
tensorflow/c/c_api_function_test.cc
ASSERT_EQ(nodes.size(), fdef.node_def_size()) << "Got unexpected number of nodes. Expected: [" << absl::StrJoin(nodes, ", ") << "] Actual nodes in fdef: " << fdef.DebugString(); for (const NodeDef& node_def : fdef.node_def()) { ASSERT_TRUE(nodes.find(node_def.name()) != nodes.end()) << "Got unexpected node: " << node_def.name()
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Thu Jul 20 22:08:54 UTC 2023 - 63.6K bytes - Viewed (1) -
tensorflow/c/c_api.h
// use them in new code. // - Every node in the function's body must have all of its inputs (including // control inputs). In other words, for every node in the body, each input // must be either listed in `inputs` or must come from another node in // the body. In particular, it is an error to have a control edge going from // a node outside of the body into a node in the body. This applies to control
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Thu Oct 26 21:08:15 UTC 2023 - 82.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
return; } /* * Reclassify nodes in each list to new Map. Because we are using power-of-two expansion, the * elements from each bin must either stay at same index, or move with a power of two offset. * We eliminate unnecessary node creation by catching cases where old nodes can be reused
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Mon Aug 11 19:31:30 UTC 2025 - 90K bytes - Viewed (0) -
docs/en/docs/img/index/index-02-redoc-simple.png
index-02-redoc-simple.png...
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Thu Mar 26 19:09:53 UTC 2020 - 66.9K bytes - Viewed (0) -
docs/en/docs/img/index/index-05-swagger-04.png
index-05-swagger-04.png...
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Thu Mar 26 19:09:53 UTC 2020 - 69.8K bytes - Viewed (0) -
docs/en/docs/img/index/index-04-swagger-03.png
index-04-swagger-03.png...
Registered: Sun Sep 07 07:19:17 UTC 2025 - Last Modified: Thu Mar 26 19:09:53 UTC 2020 - 66K bytes - Viewed (0) -
tensorflow/c/c_api_test.cc
TF_DeleteBuffer(graph_def); // Can add nodes to the imported graph without trouble. Add(feed, scalar, graph, s); ASSERT_EQ(TF_OK, TF_GetCode(s)) << TF_Message(s); TF_DeleteGraph(graph); TF_DeleteStatus(s); } TEST(CAPI, ImportGraphDef_WithReturnOutputs) { TF_Status* s = TF_NewStatus(); TF_Graph* graph = TF_NewGraph(); // Create a graph with two nodes: x and 3 Placeholder(graph, s);
Registered: Tue Sep 09 12:39:10 UTC 2025 - Last Modified: Fri Dec 27 12:18:10 UTC 2024 - 97K bytes - Viewed (0)