Search Options

Results per page
Sort
Preferred Languages
Advance

Results 11 - 20 of 1,814 for grape (0.05 sec)

  2. github.com/apache/maven

    maven-model-builder/src/main/java/org/apache/maven/model/building/Graph.java 

     */
package org.apache.maven.model.building;

import java.util.*;

class Graph {

    final Map<String, Set<String>> graph = new LinkedHashMap<>();

    synchronized void addEdge(String from, String to) throws CycleDetectedException {
        if (graph.computeIfAbsent(from, l -> new HashSet<>()).add(to)) {
            List<String> cycle = visitCycle(graph, Collections.singleton(to), new HashMap<>(), new LinkedList<>());
    Registered: Wed Jun 12 09:55:16 UTC 2024
    - Last Modified: Mon Jan 22 17:27:48 UTC 2024
    - 3.1K bytes
    - Viewed (0)
  3. github.com/golang/go

    src/cmd/go/internal/modcmd/graph.go 

    Graph prints the module requirement graph (with replacements applied)
in text form. Each line in the output has two space-separated fields: a module
and one of its requirements. Each module is identified as a string of the form
path@version, except for the main module, which has no @version suffix.

The -go flag causes graph to report the module graph as loaded by the
given Go version, instead of the version indicated by the 'go' directive
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Sat Jun 03 21:13:11 UTC 2023
    - 2.2K bytes
    - Viewed (0)
  4. github.com/golang/go

    src/cmd/vendor/github.com/google/pprof/internal/graph/graph.go 

    }

// New summarizes performance data from a profile into a graph.
func New(prof *profile.Profile, o *Options) *Graph {
	if o.CallTree {
		return newTree(prof, o)
	}
	g, _ := newGraph(prof, o)
	return g
}

// newGraph computes a graph from a profile. It returns the graph, and
// a map from the profile location indices to the corresponding graph
// nodes.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 31K bytes
    - Viewed (0)
  5. github.com/golang/go

    src/cmd/go/internal/mvs/graph.go 

    }

// NewGraph returns an incremental MVS graph containing only a set of root
// dependencies and using the given max function for version strings.
//
// The caller must ensure that the root slice is not modified while the Graph
// may be in use.
func NewGraph(cmp func(p, v1, v2 string) int, roots []module.Version) *Graph {
	g := &Graph{
		cmp:      cmp,
		roots:    slices.Clip(roots),
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Jun 01 02:52:19 UTC 2023
    - 6.3K bytes
    - Viewed (0)
  6. github.com/golang/go

    src/internal/profile/graph.go 

    // limitations under the License.

// Package profile represents a pprof profile as a directed graph.
//
// This package is a simplified fork of github.com/google/pprof/internal/graph.
package profile

import (
	"fmt"
	"sort"
	"strings"
)

// Options encodes the options for constructing a graph
type Options struct {
	SampleValue       func(s []int64) int64 // Function to compute the value of a sample
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Mon Feb 05 20:59:15 UTC 2024
    - 13.1K bytes
    - Viewed (0)
  7. github.com/apache/maven

    maven-core/src/main/java/org/apache/maven/internal/impl/Graph.java 

     * specific language governing permissions and limitations
 * under the License.
 */
package org.apache.maven.internal.impl;

import java.util.*;

import org.apache.maven.project.CycleDetectedException;

class Graph {
    private enum DfsState {
        VISITING,
        VISITED
    }

    final Map<String, Vertex> vertices = new LinkedHashMap<>();

    public Vertex getVertex(String id) {
        return vertices.get(id);
    Registered: Wed Jun 12 09:55:16 UTC 2024
    - Last Modified: Fri Apr 12 10:50:18 UTC 2024
    - 4.5K bytes
    - Viewed (0)
  8. github.com/golang/go

    test/typeparam/graph.go 

    			}
		}
	}
	return true
}

// A Graph is a collection of nodes. A node may have an arbitrary number
// of edges. An edge connects two nodes. Both nodes and edges must be
// comparable. This is an undirected simple graph.
type _Graph[_Node _NodeC[_Edge], _Edge _EdgeC[_Node]] struct {
	nodes []_Node
}

// _NodeC is the constraints on a node in a graph, given the _Edge type.
type _NodeC[_Edge any] interface {
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Mar 26 19:58:28 UTC 2024
    - 5.7K bytes
    - Viewed (0)
  9. github.com/golang/go

    src/cmd/vendor/github.com/google/pprof/internal/driver/html/graph.css 

    #graph {
    cursor: grab;
}

#graph:active {
    cursor: grabbing;
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 70 bytes
    - Viewed (0)
  10. github.com/apache/maven

    maven-core/src/main/java/org/apache/maven/project/Graph.java 

     * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */
package org.apache.maven.project;

import java.util.*;

class Graph {
    private enum DfsState {
        VISITING,
        VISITED
    }

    final Map<String, Vertex> vertices = new LinkedHashMap<>();

    public Vertex getVertex(String id) {
        return vertices.get(id);
    Registered: Wed Jun 12 09:55:16 UTC 2024
    - Last Modified: Fri Sep 22 06:02:04 UTC 2023
    - 3.9K bytes
    - Viewed (0)
  11. github.com/golang/go

    src/cmd/vendor/github.com/google/pprof/internal/driver/html/graph.html 

    <!DOCTYPE html>
<html>
<head>
  <meta charset="utf-8">
  <title>{{.Title}}</title>
  {{template "css" .}}
  {{template "graph_css" .}}
</head>
<body>
  {{template "header" .}}
  <div id="graph">
    {{.HTMLBody}}
  </div>
  {{template "script" .}}
  <script>viewer(new URL(window.location.href), {{.Nodes}});</script>
</body>
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 31 19:48:28 UTC 2024
    - 334 bytes
    - Viewed (0)
Back to top