Edge - Code Search

guava/src/com/google/common/reflect/AbstractInvocationHandler.java

  }

  private static boolean isProxyOfSameInterfaces(Object arg, Class<?> proxyClass) {
    return proxyClass.isInstance(arg)
        // Equal proxy instances should mostly be instance of proxyClass
        // Under some edge cases (such as the proxy of JDK types serialized and then deserialized)
        // the proxy type may not be the same.
        // We first check isProxyClass() so that the common case of comparing with non-proxy objects

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

- Last Modified: Wed Jan 05 17:43:40 UTC 2022

- 5.2K bytes

- Viewed (0)

github.com/google/guava

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

public interface SuccessorsFunction<N> {

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s outgoing edges in the direction (if any) of the edge.
   *
   * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
   * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}.
   *

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

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

- 4.3K bytes

- Viewed (0)

github.com/google/guava

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

  static final String ERROR_ELEMENT_REMOVED = "used to generate this set";
  private static final String NODE_STRING = "Node";
  private static final String EDGE_STRING = "Edge";

  enum EdgeType {
    UNDIRECTED,
    DIRECTED;
  }

  private TestUtil() {}

  static void assertNodeNotInGraphErrorMessage(Throwable throwable) {

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

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

- 3.9K bytes

- Viewed (0)

github.com/codelibs/fess

src/main/webapp/WEB-INF/view/index.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>
<c:if test="${osddLink}">
	<link rel="search" type="application/opensearchdescription+xml"
		href="${fe:url('/osdd')}"

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

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

- 6.9K bytes

- Viewed (0)

github.com/codelibs/fess

src/main/webapp/WEB-INF/view/profile/index.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.profile.title" /></title>
<link href="${fe:url('/css/admin/bootstrap.min.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

- 3.6K bytes

- Viewed (0)

github.com/google/guava

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

public interface PredecessorsFunction<N> {

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s incoming edges <i>against</i> the direction (if any) of the edge.
   *
   * <p>Some algorithms that operate on a {@code PredecessorsFunction} may produce undesired results
   * if the returned {@link Iterable} contains duplicate elements. Implementations of such

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

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

- 4.1K bytes

- Viewed (0)

github.com/google/guava

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

 *     #from(ValueGraph)}.
 * @since 20.0
 */
@Beta
@ElementTypesAreNonnullByDefault
public final class ValueGraphBuilder<N, V> extends AbstractGraphBuilder<N> {

  /** Creates a new instance with the specified edge directionality. */
  private ValueGraphBuilder(boolean directed) {
    super(directed);
  }

  /** Returns a {@link ValueGraphBuilder} for building directed graphs. */

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

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

- 8K bytes

- Viewed (0)

github.com/tensorflow/tensorflow

tensorflow/c/c_api_function_test.cc

        const auto& v = a_edges.insert({iter->second, arg.name()});
        ASSERT_TRUE(v.second) << "Duplicate edge " << iter->second << " -> "
                              << arg.name() << ". fdef: " << fdef.DebugString();
      } else {
        const auto& v = a_edges.insert({arg.name(), arg.name()});
        ASSERT_TRUE(v.second) << "Duplicate edge " << arg.name() << " -> "
                              << arg.name() << ". fdef: " << fdef.DebugString();

Registered: Tue Nov 05 12:39:12 UTC 2024

- Last Modified: Thu Jul 20 22:08:54 UTC 2023

- 63.6K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/reflect/AbstractInvocationHandler.java

  }

  private static boolean isProxyOfSameInterfaces(Object arg, Class<?> proxyClass) {
    return proxyClass.isInstance(arg)
        // Equal proxy instances should mostly be instance of proxyClass
        // Under some edge cases (such as the proxy of JDK types serialized and then deserialized)
        // the proxy type may not be the same.
        // We first check isProxyClass() so that the common case of comparing with non-proxy objects

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

- Last Modified: Wed Jan 05 17:43:40 UTC 2022

- 5.2K bytes

- Viewed (0)

github.com/google/guava

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

public interface SuccessorsFunction<N> {

  /**
   * Returns all nodes in this graph adjacent to {@code node} which can be reached by traversing
   * {@code node}'s outgoing edges in the direction (if any) of the edge.
   *
   * <p>This is <i>not</i> the same as "all nodes reachable from {@code node} by following outgoing
   * edges". For that functionality, see {@link Graphs#reachableNodes(Graph, Object)}.
   *

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

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

- 4.3K bytes

- Viewed (0)

Search Options