n1 - Code Search

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

    addEdge(N1, N1, E11);
    assertThat(network.successors(N1)).containsExactly(N1);
    addEdge(N2, N1, E12);
    assertThat(network.successors(N1)).containsExactly(N1, N2);
  }

  @Test
  public void degree_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.degree(N1)).isEqualTo(2);
    addEdge(N1, N2, E12);
    assertThat(network.degree(N1)).isEqualTo(3);

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Tue Sep 30 17:09:51 GMT 2025

- 18.6K bytes

- Click Count (0)

github.com/google/guava

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

    putEdge(N1, N1);
    putEdge(N1, N2);
    assertThat(graph.adjacentNodes(N1)).containsExactly(N1, N2);
  }

  @Test
  public void predecessors_selfLoop() {
    assume().that(graph.allowsSelfLoops()).isTrue();

    putEdge(N1, N1);
    assertThat(graph.predecessors(N1)).containsExactly(N1);
    putEdge(N1, N2);
    assertThat(graph.predecessors(N1)).containsExactly(N1, N2);
  }

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Mon Oct 06 20:14:55 GMT 2025

- 13.2K bytes

- Click Count (0)

github.com/google/guava

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

    addEdge(N1, N1, E11);
    assertThat(network.degree(N1)).isEqualTo(2);
    addEdge(N1, N2, E12);
    assertThat(network.degree(N1)).isEqualTo(3);
  }

  @Test
  public void inDegree_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.inDegree(N1)).isEqualTo(1);
    addEdge(N4, N1, E41);
    assertThat(network.inDegree(N1)).isEqualTo(2);
  }

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Tue Sep 30 17:09:51 GMT 2025

- 21.3K bytes

- Click Count (0)

github.com/google/guava

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

    putEdge(N1, N1);
    putEdge(N1, N2);
    assertThat(graph.adjacentNodes(N1)).containsExactly(N1, N2);
  }

  @Test
  public void predecessors_selfLoop() {
    assume().that(graph.allowsSelfLoops()).isTrue();

    putEdge(N1, N1);
    assertThat(graph.predecessors(N1)).containsExactly(N1);
    putEdge(N1, N2);
    assertThat(graph.predecessors(N1)).containsExactly(N1, N2);
  }

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Mon Oct 06 20:14:55 GMT 2025

- 13.2K bytes

- Click Count (0)

github.com/google/guava

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

    putEdge(N1, N1);
    putEdge(N1, N2);
    assertThat(graph.adjacentNodes(N1)).containsExactly(N1, N2);
  }

  @Test
  public void predecessors_selfLoop() {
    assume().that(graph.allowsSelfLoops()).isTrue();

    putEdge(N1, N1);
    assertThat(graph.predecessors(N1)).containsExactly(N1);
    putEdge(N4, N1);
    assertThat(graph.predecessors(N1)).containsExactly(N1, N4);
  }

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Mon Oct 06 20:14:55 GMT 2025

- 14.4K bytes

- Click Count (0)

github.com/google/guava

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

    addEdge(N1, N1, E11);
    assertThat(network.successors(N1)).containsExactly(N1);
    addEdge(N2, N1, E12);
    assertThat(network.successors(N1)).containsExactly(N1, N2);
  }

  @Test
  public void degree_selfLoop() {
    assume().that(network.allowsSelfLoops()).isTrue();

    addEdge(N1, N1, E11);
    assertThat(network.degree(N1)).isEqualTo(2);
    addEdge(N1, N2, E12);
    assertThat(network.degree(N1)).isEqualTo(3);

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Tue Sep 30 17:09:51 GMT 2025

- 19K bytes

- Click Count (0)

github.com/google/guava

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

    directedGraph.putEdgeValue(N1, N1, E11);
    directedGraph.putEdgeValue(N3, N4, E34);

    MutableValueGraph<Integer, String> expectedTranspose =
        ValueGraphBuilder.directed().allowsSelfLoops(true).build();
    expectedTranspose.putEdgeValue(N3, N1, E13);
    expectedTranspose.putEdgeValue(N1, N3, E31);
    expectedTranspose.putEdgeValue(N2, N1, E12);
    expectedTranspose.putEdgeValue(N1, N1, E11);

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Fri Jan 09 23:46:06 GMT 2026

- 30.1K bytes

- Click Count (0)

github.com/google/guava

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

    assertThat(graphAsMutableGraph.removeEdge(N1, N3)).isTrue();
    assertThat(graph.adjacentNodes(N1)).containsExactly(N2, N4);
  }

  @Test
  public void removeEdge_nodeNotPresent() {
    assume().that(graphIsMutable()).isTrue();

    putEdge(N1, N2);
    assertThat(graphAsMutableGraph.removeEdge(N1, NODE_NOT_IN_GRAPH)).isFalse();
    assertThat(graph.successors(N1)).contains(N2);
  }

  @Test

Created: Fri Apr 03 12:43:13 GMT 2026

- Last Modified: Tue Oct 07 15:57:03 GMT 2025

- 17.3K bytes

- Click Count (0)

github.com/minio/minio

internal/ioutil/ioutil.go

	n = len(p)
	var n1 int
	if w.skipBytes > 0 {
		if w.skipBytes >= int64(len(p)) {
			w.skipBytes -= int64(len(p))
			return n, nil
		}
		p = p[w.skipBytes:]
		w.skipBytes = 0
	}
	if w.wLimit == 0 {
		return n, nil
	}
	if w.wLimit < int64(len(p)) {
		n1, err = w.Writer.Write(p[:w.wLimit])
		w.wLimit -= int64(n1)
		return n, err
	}
	n1, err = w.Writer.Write(p)

Created: Sun Apr 05 19:28:12 GMT 2026

- Last Modified: Tue Feb 18 16:25:55 GMT 2025

- 11.1K bytes

- Click Count (0)

github.com/minio/minio

cmd/bucket-replication-metrics.go

		Peak:    peak,
		Curr:    curr,
		measure: rx.measure,
		N:       rx.N + o.N,
	}
}

func calcAvg(x, y float64, n1, n2 int64) float64 {
	if n1+n2 == 0 {
		return 0
	}
	avg := (x*float64(n1) + y*float64(n2)) / float64(n1+n2)
	return avg
}

// Add a new transfer
func (rx *XferStats) addSize(sz int64, t time.Duration) {
	if rx.measure == nil {

Created: Sun Apr 05 19:28:12 GMT 2026

- Last Modified: Thu Aug 15 12:04:40 GMT 2024

- 14.2K bytes

- Click Count (0)

Search Options