Edge - Code Search

src/main/webapp/WEB-INF/view/error/badRequest.jsp

<% try{ %>
<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.system_error_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/apache/maven

compat/maven-compat/src/main/java/org/apache/maven/repository/metadata/MetadataGraphEdge.java

 * under the License.
 */
package org.apache.maven.repository.metadata;

import org.apache.maven.artifact.ArtifactScopeEnum;

/**
 * metadata graph edge - combination of version, scope and depth define
 * an edge in the graph
 *
 *
 */
@Deprecated
public class MetadataGraphEdge {
    String version;
    ArtifactScopeEnum scope;
    int depth = -1;
    int pomOrder = -1;

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

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

- 4.8K bytes

- Viewed (0)

github.com/google/guava

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

  private static <N, V> Map<EndpointPair<N>, V> edgeValueMap(final ValueGraph<N, V> graph) {
    return Maps.asMap(
        graph.edges(),
        edge ->
            // requireNonNull is safe because the endpoint pair comes from the graph.
            requireNonNull(graph.edgeValueOrDefault(edge.nodeU(), edge.nodeV(), null)));
  }

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

- Last Modified: Mon Apr 17 13:59:28 UTC 2023

- 4.3K bytes

- Viewed (0)

github.com/codelibs/fess

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/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/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/graph/EndpointPairIterator.java

    successorIterator = graph.successors(node).iterator();
    return true;
  }

  /**
   * If the graph is directed, each ordered [source, target] pair will be visited once if there is
   * an edge connecting them.
   */
  private static final class Directed<N> extends EndpointPairIterator<N> {
    private Directed(BaseGraph<N> graph) {
      super(graph);
    }

    @Override
    @CheckForNull

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

- Last Modified: Fri Jul 09 17:31:04 UTC 2021

- 5K bytes

- Viewed (0)

github.com/google/guava

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

   *
   * @since 29.0
   */
  @Override
  ElementOrder<N> incidentEdgeOrder();

  //
  // Element-level accessors
  //

  /**
   * Returns a live view of the nodes which have an incident edge in common with {@code node} in
   * this graph.
   *
   * <p>This is equal to the union of {@link #predecessors(Object)} and {@link #successors(Object)}.
   *

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

- Last Modified: Thu Oct 10 15:41:27 UTC 2024

- 13.7K bytes

- Viewed (0)

github.com/google/guava

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

   *
   * @since 29.0
   */
  @Override
  ElementOrder<N> incidentEdgeOrder();

  //
  // Element-level accessors
  //

  /**
   * Returns a live view of the nodes which have an incident edge in common with {@code node} in
   * this graph.
   *
   * <p>This is equal to the union of {@link #predecessors(Object)} and {@link #successors(Object)}.
   *

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

- Last Modified: Thu Oct 10 15:41:27 UTC 2024

- 13.7K bytes

- Viewed (0)

github.com/google/guava

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

 *   <li>Test cases related to the specific implementation of the {@link Graph} interface.
 * </ul>
 *
 * TODO(user): Make this class generic (using <N, E>) for all node and edge types.
 * TODO(user): Differentiate between directed and undirected edge strings.
 */
public abstract class AbstractGraphTest {

  Graph<Integer> graph;

  /**

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

- Last Modified: Mon Jan 22 17:29:38 UTC 2024

- 16.6K bytes

- Viewed (0)

Search Options