- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 25 for begreep (0.22 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 May 05 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 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) -
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 May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 20:39:42 GMT 2019 - 30.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
.containsExactly(EndpointPair.ordered(N1, N1), EndpointPair.ordered(N1, N2)); } @Test public void degree_selfLoop() { assume().that(graph.allowsSelfLoops()).isTrue(); putEdge(N1, N1); assertThat(graph.degree(N1)).isEqualTo(2); putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.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/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-tests/test/com/google/common/graph/AbstractStandardDirectedNetworkTest.java
assertThat(network.incidentNodes(E11).target()).isEqualTo(N1); } @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); } @Test public void inDegree_selfLoop() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
.containsExactly(EndpointPair.unordered(N1, N1), EndpointPair.unordered(N1, N2)); } @Test public void degree_selfLoop() { assume().that(graph.allowsSelfLoops()).isTrue(); putEdge(N1, N1); assertThat(graph.degree(N1)).isEqualTo(2); putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 12.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardDirectedGraphTest.java
.containsExactly(EndpointPair.ordered(N1, N1), EndpointPair.ordered(N1, N2)); } @Test public void degree_selfLoop() { assume().that(graph.allowsSelfLoops()).isTrue(); putEdge(N1, N1); assertThat(graph.degree(N1)).isEqualTo(2); putEdge(N1, N2); assertThat(graph.degree(N1)).isEqualTo(3); } @Test public void inDegree_selfLoop() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 14.1K bytes - Viewed (0)