- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 13 for vertx (0.24 sec)
-
testing/internal-performance-testing/src/main/groovy/org/gradle/performance/generator/JavaTestProjectGenerator.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Apr 18 13:08:21 UTC 2024 - 8K bytes - Viewed (0) -
plugin/pkg/auth/authorizer/node/graph.go
typedVertices[namespace] = namespacedVertices } vertex := newNamedVertex(vertexType, namespace, name, g.graph.NewNodeID()) namespacedVertices[name] = vertex g.graph.AddNode(vertex) return vertex } // must be called under write lock func (g *Graph) deleteVertex_locked(vertexType vertexType, namespace, name string) { vertex, exists := g.getVertex_rlocked(vertexType, namespace, name) if !exists {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 21:22:55 UTC 2024 - 17.5K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java
} final Map<String, Vertex> vertices = new LinkedHashMap<>(); public Vertex getVertex(String id) { return vertices.get(id); } public Collection<Vertex> getVertices() { return vertices.values(); } Vertex addVertex(String label) { return vertices.computeIfAbsent(label, Vertex::new); } void addEdge(Vertex from, Vertex to) throws CycleDetectedException {
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 4.5K bytes - Viewed (0) -
src/go/types/mono.go
// nameIdx maps a defined type or (canonical) type parameter to its // vertex index. nameIdx map[*TypeName]int } type monoVertex struct { weight int // weight of heaviest known path to this vertex pre int // previous edge (if any) in the above path len int // length of the above path // obj is the defined type or type parameter represented by this // vertex. obj *TypeName } type monoEdge struct { dst, src int
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 9.2K bytes - Viewed (0) -
src/cmd/compile/internal/types2/mono.go
// nameIdx maps a defined type or (canonical) type parameter to its // vertex index. nameIdx map[*TypeName]int } type monoVertex struct { weight int // weight of heaviest known path to this vertex pre int // previous edge (if any) in the above path len int // length of the above path // obj is the defined type or type parameter represented by this // vertex. obj *TypeName } type monoEdge struct { dst, src int
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0) -
maven-api-impl/src/test/remote-repo/org/codehaus/plexus/plexus-utils/1.1/plexus-utils-1.1.jar
java.util.List vertexList; public void DAG(); public java.util.List getVerticies(); public java.util.Set getLabels(); public Vertex addVertex(String); public void addEdge(String, String) throws CycleDetectedExcepti; public void addEdge(Vertex, Vertex) throws CycleDetectedExcepti; public void removeEdge(String, String); public void removeEdge(Vertex, Vertex); public Vertex getVertex(String); public boolean hasEdge(String, String); public java.util.List getChildLabels(String); public java.util.List...
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Thu May 02 15:10:38 UTC 2024 - 164.6K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/model/Graph.java
} cycle.removeLast(); stateMap.put(v, DfsState.VISITED); } else if (state == DfsState.VISITING) { // we are already visiting this vertex, this mean we have a cycle int pos = cycle.lastIndexOf(v); List<String> ret = cycle.subList(pos, cycle.size()); ret.add(v); return ret;
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Apr 12 10:50:18 UTC 2024 - 3.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/unitchecker/unitchecker.go
return nil } makeFactImporter = func(cfg *Config) factImporter { return func(pkgPath string) ([]byte, error) { if vetx, ok := cfg.PackageVetx[pkgPath]; ok { return os.ReadFile(vetx) } return nil, nil // no .vetx file, no facts } } exportFacts = func(cfg *Config, data []byte) error { return os.WriteFile(cfg.VetxOutput, data, 0666) } )
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 13K bytes - Viewed (0) -
src/cmd/go/internal/mvs/mvs.go
// or "none" if no such version is known. Previous(m module.Version) (module.Version, error) } // BuildList returns the build list for the target module. // // target is the root vertex of a module requirement graph. For cmd/go, this is // typically the main module, but note that this algorithm is not intended to // be Go-specific: module paths and versions are treated as opaque values. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 21:58:12 UTC 2024 - 14.5K bytes - Viewed (0) -
src/cmd/compile/internal/types2/infer.go
assert(targ == nil || inferred[i] == targ) } } // The data structure of each (provided or inferred) type represents a graph, where // each node corresponds to a type and each (directed) vertex points to a component // type. The substitution process described above repeatedly replaces type parameter // nodes in these graphs with the graphs of the types the type parameters stand for,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 13:54:20 UTC 2024 - 26.4K bytes - Viewed (0)