- Sort Score
- Result 10 results
- Languages All
Results 111 - 120 of 1,706 for _nodes (0.18 sec)
-
src/go/types/initorder.go
// In a valid Go program, those nodes always have zero dependencies (after // removing all incoming dependencies), otherwise there are initialization // cycles. emitted := make(map[*declInfo]bool) for len(pq) > 0 { // get the next node n := heap.Pop(&pq).(*graphNode) if debug { fmt.Printf("\t%s (src pos %d) depends on %d nodes now\n", n.obj.Name(), n.obj.order(), n.ndeps) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.9K bytes - Viewed (0) -
build-logic/documentation/src/test/groovy/gradlebuild/docs/XmlSpecification.groovy
return cl.call() } } def format(Node... nodes) { format(nodes as List) } def formatTree(Node... nodes) { formatTree(nodes as List) } def formatTree(Iterable<? extends Node> nodes) { format(nodes, true) } def format(Iterable<? extends Node> nodes, boolean prettyPrint = false) { StringBuilder builder = new StringBuilder()
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Dec 09 08:14:05 UTC 2020 - 4.1K bytes - Viewed (0) -
src/vendor/golang.org/x/sys/cpu/cpu_netbsd_arm64.go
parts = append(parts, name[last:]) mib := []int32{} // Discover the nodes and construct the MIB OID. for partno, part := range parts { nodes, err := sysctlNodes(mib) if err != nil { return nil, err } for _, node := range nodes { n := make([]byte, 0) for i := range node.Name { if node.Name[i] != 0 { n = append(n, byte(node.Name[i])) } } if string(n) == part {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Nov 02 15:41:00 UTC 2020 - 4.3K bytes - Viewed (0) -
tensorflow/compiler/jit/extract_outside_compilation_pass.h
// // 1. Add a XLA computation key placeholder node (it will be used as input for // XlaRecvAtHost and XlaSendFromHost); // 2. Replace all _Arg nodes with one single XlaRecvAtHost node; // 3. Replace all _Retval nodes with one single XlaSendFromHost node; // 4. Mark all nodes except key placeholder with attr `xla_cluster_attr_name` // and `outside_compilation_attr_name`; // 5. For nodes marked with attr kXlaConnectedToXlaComputationAttrName, add a
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Sep 06 19:12:29 UTC 2023 - 5.3K bytes - Viewed (0) -
.github/actions/people/app/main.py
for node in nodes: tiers[node.tier.monthlyPriceInDollars][ node.sponsorEntity.login ] = node.sponsorEntity return tiers def get_top_users( *, counter: Counter, authors: Dict[str, Author], skip_users: Container[str], min_count: int = 2, ): users = []
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Tue Mar 26 17:38:21 UTC 2024 - 19.2K bytes - Viewed (0) -
platforms/core-configuration/core-serialization-codecs/src/main/kotlin/org/gradle/internal/serialize/codecs/core/WorkNodeCodec.kt
// A large build may have many nodes but not so many entry nodes. // To save some disk space, we're only saving entry node ids rather than writing "entry/non-entry" boolean for every node. writeCollection(scheduledEntryNodeIds) { writeSmallInt(it) } nodes.forEach { node -> writeSuccessorReferencesOf(node, scheduledNodeIds) writeNodeGroup(node.group, scheduledNodeIds) } }
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Jun 08 11:29:30 UTC 2024 - 10.4K bytes - Viewed (0) -
platforms/core-configuration/model-core/src/main/java/org/gradle/model/internal/core/MutableModelNode.java
/** * Adds a reference node to the graph. A reference node is a node that refers to some other node elsewhere in the graph, similar to a symbolic link. */ <T> void addReference(String name, ModelType<T> type, ModelNode target, ModelRuleDescriptor ruleDescriptor); /** * Adds a node to the graph, linked from this node. The given registration is used to initialize the node when required. *
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Sep 28 09:51:04 UTC 2023 - 5.8K bytes - Viewed (0) -
android/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(); } assertThat(graph.nodes()).hasSize(NUM_NODES);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Aug 18 16:17:46 UTC 2017 - 4.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
assertThat(graph.predecessors(node)).hasSize(graph.inDegree(node)); assertThat(graph.successors(node)).hasSize(graph.outDegree(node)); } else { int selfLoopCount = graph.adjacentNodes(node).contains(node) ? 1 : 0; assertThat(graph.degree(node)).isEqualTo(graph.adjacentNodes(node).size() + selfLoopCount);
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Jan 22 17:29:38 UTC 2024 - 16.6K bytes - Viewed (0) -
pkg/volume/metrics_du.go
metrics.Used = resource.NewQuantity(usage.Bytes, resource.BinarySI) metrics.InodesUsed = resource.NewQuantity(usage.Inodes, resource.BinarySI) return nil } // getFsInfo writes metrics.Capacity and metrics.Available from the filesystem // info func (md *metricsDu) getFsInfo(metrics *Metrics) error { available, capacity, _, inodes, inodesFree, _, err := fs.Info(md.path) if err != nil { return NewFsInfoFailedError(err) }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Apr 06 12:19:35 UTC 2021 - 2.5K bytes - Viewed (0)