- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 23 for begreep (0.3 sec)
-
android/guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} @Test public void degree_oneEdge() { putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(1); assertThat(graph.degree(N2)).isEqualTo(1); } @Test public void degree_isolatedNode() { addNode(N1); assertThat(graph.degree(N1)).isEqualTo(0); } @Test public void degree_nodeNotInGraph() { assertNodeNotInGraphErrorMessage(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractGraphTest.java
} @Test public void degree_oneEdge() { putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(1); assertThat(graph.degree(N2)).isEqualTo(1); } @Test public void degree_isolatedNode() { addNode(N1); assertThat(graph.degree(N1)).isEqualTo(0); } @Test public void degree_nodeNotInGraph() { assertNodeNotInGraphErrorMessage(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractBaseGraph.java
*/ protected long edgeCount() { long degreeSum = 0L; for (N node : nodes()) { degreeSum += degree(node); } // According to the degree sum formula, this is equal to twice the number of edges. checkState((degreeSum & 1) == 0); return degreeSum >>> 1; } /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/GraphConstants.java
private GraphConstants() {} static final int EXPECTED_DEGREE = 2; static final int DEFAULT_NODE_COUNT = 10; static final int DEFAULT_EDGE_COUNT = DEFAULT_NODE_COUNT * EXPECTED_DEGREE; // Load factor and capacity for "inner" (i.e. per node/edge element) hash sets or maps static final float INNER_LOAD_FACTOR = 1.0f; static final int INNER_CAPACITY = 2; // ceiling(EXPECTED_DEGREE / INNER_LOAD_FACTOR) // Error messages
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 3.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractNetwork.java
@Override public Set<N> successors(N node) { return AbstractNetwork.this.successors(node); } // DO NOT override the AbstractGraph *degree() implementations. }; } @Override public int degree(N node) { if (isDirected()) { return IntMath.saturatedAdd(inEdges(node).size(), outEdges(node).size()); } else {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 13 18:17:09 GMT 2024 - 10.1K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ValueGraph.java
* * @throws IllegalArgumentException if {@code node} is not an element of this graph */ @Override int degree(N node); /** * Returns the count of {@code node}'s incoming edges (equal to {@code predecessors(node).size()}) * in a directed graph. In an undirected graph, returns the {@link #degree(Object)}. * * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 15K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/BaseGraph.java
* * @throws IllegalArgumentException if {@code node} is not an element of this graph */ int degree(N node); /** * Returns the count of {@code node}'s incoming edges (equal to {@code predecessors(node).size()}) * in a directed graph. In an undirected graph, returns the {@link #degree(Object)}. * * <p>If the count is greater than {@code Integer.MAX_VALUE}, returns {@code Integer.MAX_VALUE}. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 8.8K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/execution/MavenExecutionRequest.java
String getMakeBehavior(); /** * Set's the parallel degree of concurrency used by the build. * * @param degreeOfConcurrency */ void setDegreeOfConcurrency(int degreeOfConcurrency); /** * @return the degree of concurrency for the build. */ int getDegreeOfConcurrency();
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Wed Dec 20 13:03:57 GMT 2023 - 17.7K bytes - Viewed (0) -
.github/workflows/update-rbe.yml
# returned by the API, but a sha256sum of the entire chunk of image # metadata. gcr.io helpfully includes it in the header of the response # as docker-content-digest: sha256:[digest]. Note we use egrep to # match exactly sha256:<hash> because curl may include a ^M symbol at # the end of the line.
Others - Registered: Tue Apr 30 12:39:09 GMT 2024 - Last Modified: Wed Apr 10 15:40:34 GMT 2024 - 7.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Network.java
* * <p>If this network {@link #allowsParallelEdges() allows parallel edges}, parallel edges will be * treated as if collapsed into a single edge. For example, the {@link #degree(Object)} of a node * in the {@link Graph} view may be less than the degree of the same node in this {@link Network}. */ Graph<N> asGraph(); // // Network properties // /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 21.1K bytes - Viewed (0)