edge - Code Search

src/main/webapp/WEB-INF/view/help.jsp

<html>
<head profile="http://a9.com/-/spec/opensearch/1.1/">
<meta charset="utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<title><la:message key="labels.search_title" /></title>
<link href="${fe:url('/css/bootstrap.min.css')}" rel="stylesheet"
	type="text/css" />
<link href="${fe:url('/css/style.css')}" rel="stylesheet" type="text/css" />

Registered: Thu Oct 31 13:40:30 UTC 2024

- Last Modified: Sat Oct 26 01:07:52 UTC 2024

- 1.4K bytes

- Viewed (0)

github.com/google/guava

android/guava-tests/test/com/google/common/graph/TraverserTest.java

    ImmutableMultimap.Builder<Character, Character> graphMapBuilder = ImmutableMultimap.builder();
    for (String edge : edges) {
      checkArgument(
          edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge);
      char node1 = edge.charAt(0);
      char node2 = edge.charAt(1);
      graphMapBuilder.put(node1, node2);

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Wed Sep 06 17:04:31 UTC 2023

- 47.5K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/graph/TraverserTest.java

    ImmutableMultimap.Builder<Character, Character> graphMapBuilder = ImmutableMultimap.builder();
    for (String edge : edges) {
      checkArgument(
          edge.length() == 2, "Expecting each edge to consist of 2 characters but got %s", edge);
      char node1 = edge.charAt(0);
      char node2 = edge.charAt(1);
      graphMapBuilder.put(node1, node2);

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Wed Sep 06 17:04:31 UTC 2023

- 47.5K bytes

- Viewed (0)

github.com/apache/maven

compat/maven-compat/src/test/java/org/apache/maven/repository/metadata/DefaultGraphConflictResolutionPolicyTest.java

        MetadataGraphEdge res;

        res = policy.apply(e1, e2);
        assertEquals("1.1", res.getVersion(), "Wrong depth edge selected");

        res = policy.apply(e1, e3);
        assertEquals("1.2", res.getVersion(), "Wrong version edge selected");
    }
    // ------------------------------------------------------------------------------------------

Registered: Sun Nov 03 03:35:11 UTC 2024

- Last Modified: Fri Oct 25 12:31:46 UTC 2024

- 2.2K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/graph/NetworkBuilder.java

    NetworkBuilder<N1, E1> castBuilder = cast();
    return new ImmutableNetwork.Builder<>(castBuilder);
  }

  /**
   * Specifies whether the network will allow parallel edges. Attempting to add a parallel edge to a
   * network that does not allow them will throw an {@link UnsupportedOperationException}.
   *
   * <p>The default value is {@code false}.
   */
  @CanIgnoreReturnValue

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Fri Jun 03 01:21:31 UTC 2022

- 7.4K bytes

- Viewed (0)

github.com/apache/maven

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

        from.children.add(to);
        to.parents.add(from);
        List<String> cycle = findCycle(to);
        if (cycle != null) {
            // remove edge which introduced cycle
            removeEdge(from, to);
            throw new CycleDetectedException(
                    "Edge between '" + from.label + "' and '" + to.label + "' introduces to cycle in the graph", cycle);
        }
    }

    void removeEdge(Vertex from, Vertex to) {

Registered: Sun Nov 03 03:35:11 UTC 2024

- Last Modified: Fri Oct 25 12:31:46 UTC 2024

- 4.6K bytes

- Viewed (0)

github.com/google/guava

guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

 *       locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either
 *       verified or created.
 *   <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed
 *       to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new
 *       "safe" edge is created.
 *   <li>If a cycle is detected, an "unsafe" (cyclic) edge is created to represent a potential

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Fri Dec 15 19:31:54 UTC 2023

- 35.9K bytes

- Viewed (0)

github.com/tiangolo/fastapi

.github/actions/people/app/main.py

    )


def get_individual_sponsors(settings: Settings):
    nodes: List[SponsorshipAsMaintainerNode] = []
    edges = get_graphql_sponsor_edges(settings=settings)

    while edges:
        for edge in edges:
            nodes.append(edge.node)
        last_edge = edges[-1]
        edges = get_graphql_sponsor_edges(settings=settings, after=last_edge.cursor)

Registered: Sun Nov 03 07:19:11 UTC 2024

- Last Modified: Sat Aug 17 04:13:50 UTC 2024

- 19.2K bytes

- Viewed (1)

github.com/google/guava

guava/src/com/google/common/graph/AbstractGraphBuilder.java

  Optional<Integer> expectedNodeCount = Optional.absent();

  /**
   * Creates a new instance with the specified edge directionality.
   *
   * @param directed if true, creates an instance for graphs whose edges are each directed; if
   *     false, creates an instance for graphs whose edges are each undirected.
   */
  AbstractGraphBuilder(boolean directed) {
    this.directed = directed;
  }

Registered: Fri Nov 01 12:43:10 UTC 2024

- Last Modified: Mon Apr 26 17:43:39 UTC 2021

- 1.4K bytes

- Viewed (0)

github.com/apache/maven

compat/maven-artifact/src/test/java/org/apache/maven/artifact/versioning/ComparableVersionTest.java

        ComparableVersion version2 = new ComparableVersion("0.2");
        assertEquals("0.2", version2.getCanonical());
    }

    /**
     * Test <a href="https://issues.apache.org/jira/browse/MNG-5568">MNG-5568</a> edge case
     * which was showing transitive inconsistency: since A &gt; B and B &gt; C then we should have A &gt; C
     * otherwise sorting a list of ComparableVersions() will in some cases throw runtime exception;

Registered: Sun Nov 03 03:35:11 UTC 2024

- Last Modified: Fri Oct 25 12:31:46 UTC 2024

- 14K bytes

- Viewed (0)

Search Options