Edge - Code Search

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

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

    putEdge(N1, N2);

    assertThat(graphAsMutableGraph.putEdge(N2, N1)).isFalse();
  }

  /**
   * Tests that the method {@code putEdge} will silently add the missing nodes to the graph, then
   * add the edge connecting them. We are not using the proxy methods here as we want to test {@code
   * putEdge} when the end-points are not elements of the graph.
   */
  @Test
  public void putEdge_nodesNotInGraph() {

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

- Last Modified: Tue Jul 02 18:21:29 UTC 2024

- 12.7K bytes

- Viewed (0)

github.com/codelibs/fess

src/main/webapp/WEB-INF/orig/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/tensorflow/tensorflow

tensorflow/c/c_api.h

                                                    TF_Status* status);

// This method is used to add a new input edge to 'dst', which must be a While
// op. The While op's "T" attribute must have already been updated to include
// the new edge. This is used to construct tf.while_loop gradients.
TF_CAPI_EXPORT extern void TF_AddWhileInputHack(TF_Graph* graph,

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

- Last Modified: Thu Oct 26 21:08:15 UTC 2023

- 82.3K bytes

- Viewed (0)

github.com/google/guava

android/guava/src/com/google/common/util/concurrent/TimeoutFuture.java

    @RetainedLocalRef Future<?> localTimer = timer;
    // Try to cancel the timer as an optimization.
    // timer may be null if this call to run was by the timer task since there is no happens-before
    // edge between the assignment to timer and an execution of the timer task.
    if (localTimer != null) {
      localTimer.cancel(false);
    }

    delegateRef = null;
    timer = null;
  }

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

- Last Modified: Fri Oct 25 13:13:32 UTC 2024

- 8.1K bytes

- Viewed (0)

github.com/google/guava

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

import org.junit.runner.RunWith;
import org.junit.runners.JUnit4;

/**
 * Tests for {@link Graphs}. Tests assume that the implementation of the method {@code addEdge} adds
 * the missing nodes to the graph, then adds the edge between them.
 */
@RunWith(JUnit4.class)
public class GraphsTest {
  private static final Integer N1 = 1;
  private static final Integer N2 = 2;
  private static final Integer N3 = 3;

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

- Last Modified: Tue Jul 02 18:21:29 UTC 2024

- 24.7K bytes

- Viewed (0)

github.com/google/guava

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

    putEdge(N1, N2);

    assertThat(graphAsMutableGraph.putEdge(N2, N1)).isFalse();
  }

  /**
   * Tests that the method {@code putEdge} will silently add the missing nodes to the graph, then
   * add the edge connecting them. We are not using the proxy methods here as we want to test {@code
   * putEdge} when the end-points are not elements of the graph.
   */
  @Test
  public void putEdge_nodesNotInGraph() {

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

- Last Modified: Tue Jul 02 18:21:29 UTC 2024

- 12.7K bytes

- Viewed (0)

github.com/tiangolo/fastapi

docs/en/docs/advanced/custom-response.md

/// info

This requires installing `ujson` for example with `pip install ujson`.

///

/// warning

`ujson` is less careful than Python's built-in implementation in how it handles some edge-cases.

///

```Python hl_lines="2  7"
{!../../docs_src/custom_response/tutorial001.py!}
```

/// tip

It's possible that `ORJSONResponse` might be a faster alternative.

///

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

- Last Modified: Sun Oct 06 20:36:54 UTC 2024

- 12K bytes

- Viewed (0)

github.com/codelibs/fess

src/main/webapp/WEB-INF/view/advance.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')}"
		title="<la:message key="labels.index_osdd_title" />"

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

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

- 14.9K bytes

- Viewed (0)

github.com/google/guava

guava-tests/test/com/google/common/util/concurrent/FuturesGetCheckedTest.java

                    ExceptionWithGoodAndBadConstructor.class,
                    1,
                    SECONDS));
    assertThat(expected).hasCauseThat().isSameInstanceAs(CHECKED_EXCEPTION);
  }

  // Edge case tests of the exception-construction code through untimed get():

  @SuppressWarnings("FuturesGetCheckedIllegalExceptionType")
  public void testGetCheckedUntimed_exceptionClassIsRuntimeException() {
    assertThrows(

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

- Last Modified: Fri Oct 18 22:10:29 UTC 2024

- 16.3K bytes

- Viewed (0)

Search Options