- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 47 for begreep (0.34 sec)
-
src/main/java/jcifs/netbios/NbtAddress.java
* group name. This degree of state can be obtained with a Name Query * Request or Node Status Request. * * 3) All - The NbtAddress will be populated with all state such as mac * address, isPermanent, isBeingDeleted, ...etc. This information can only * be retrieved with the Node Status request. * * The degree of state that an NbtAddress has is dependant on how it was
Java - Registered: Sun Apr 21 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 15.2K bytes - Viewed (0) -
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 Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 16.6K bytes - Viewed (0) -
src/main/java/jcifs/smb1/netbios/NbtAddress.java
* group name. This degree of state can be obtained with a Name Query * Request or Node Status Request. * * 3) All - The NbtAddress will be populated with all state such as mac * address, isPermanent, isBeingDeleted, ...etc. This information can only * be retrieved with the Node Status request. * * The degree of state that an NbtAddress has is dependant on how it was
Java - Registered: Sun Apr 21 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 30.1K 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 19 12:43:09 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 2.2K bytes - Viewed (0) -
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 19 12:43:09 GMT 2024 - Last Modified: Fri Oct 01 17:18:04 GMT 2021 - 1.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 19 12:43:09 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 7.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 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.9K 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/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 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 2.5K 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 19 12:43:09 GMT 2024 - Last Modified: Mon Apr 26 17:43:39 GMT 2021 - 3.5K bytes - Viewed (0)