- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 17 for begreep (0.21 sec)
-
android/guava/src/com/google/common/graph/UndirectedNetworkConnections.java
* See the License for the specific language governing permissions and * limitations under the License. */ package com.google.common.graph; import static com.google.common.graph.GraphConstants.EXPECTED_DEGREE; import com.google.common.collect.BiMap; import com.google.common.collect.HashBiMap; import com.google.common.collect.ImmutableBiMap; import java.util.Collections; import java.util.Map; import java.util.Set;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 1.9K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/DirectedNetworkConnections.java
super(inEdgeMap, outEdgeMap, selfLoopCount); } static <N, E> DirectedNetworkConnections<N, E> of() { return new DirectedNetworkConnections<>( HashBiMap.<E, N>create(EXPECTED_DEGREE), HashBiMap.<E, N>create(EXPECTED_DEGREE), 0); } static <N, E> DirectedNetworkConnections<N, E> ofImmutable( Map<E, N> inEdges, Map<E, N> outEdges, int selfLoopCount) { return new DirectedNetworkConnections<>(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 2.2K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/ForwardingValueGraph.java
return delegate().predecessors(node); } @Override public Set<N> successors(N node) { return delegate().successors(node); } @Override public int degree(N node) { return delegate().degree(node); } @Override public int inDegree(N node) { return delegate().inDegree(node); } @Override public int outDegree(N node) { return delegate().outDegree(node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.9K 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/ForwardingGraph.java
return delegate().successors(node); } @Override public Set<EndpointPair<N>> incidentEdges(N node) { return delegate().incidentEdges(node); } @Override public int degree(N node) { return delegate().degree(node); } @Override public int inDegree(N node) { return delegate().inDegree(node); } @Override public int outDegree(N node) { return delegate().outDegree(node);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K 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/ForwardingNetwork.java
return delegate().incidentNodes(edge); } @Override public Set<E> adjacentEdges(E edge) { return delegate().adjacentEdges(edge); } @Override public int degree(N node) { return delegate().degree(node); } @Override public int inDegree(N node) { return delegate().inDegree(node); } @Override public int outDegree(N node) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/AbstractValueGraph.java
} @Override public Set<N> successors(N node) { return AbstractValueGraph.this.successors(node); } @Override public int degree(N node) { return AbstractValueGraph.this.degree(node); } @Override public int inDegree(N node) { return AbstractValueGraph.this.inDegree(node); } @Override
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 17 13:59:28 GMT 2023 - 4K 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) -
.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)