Home
last modified time | relevance | path

Searched refs:numNodesToRemove (Results 1 – 4 of 4) sorted by relevance

/external/guava/android/guava-tests/test/com/google/common/graph/
DGraphMutationTest.java84 int numNodesToRemove = gen.nextInt(NUM_NODES); in testGraphMutation() local
85 for (int i = 0; i < numNodesToRemove; ++i) { in testGraphMutation()
89 assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); in testGraphMutation()
93 for (int i = numNodesToRemove; i < NUM_NODES; ++i) { in testGraphMutation()
DNetworkMutationTest.java89 int numNodesToRemove = gen.nextInt(NUM_NODES); in testNetworkMutation() local
90 for (int i = 0; i < numNodesToRemove; ++i) { in testNetworkMutation()
94 assertThat(network.nodes()).hasSize(NUM_NODES - numNodesToRemove); in testNetworkMutation()
98 for (int i = numNodesToRemove; i < NUM_NODES; ++i) { in testNetworkMutation()
/external/guava/guava-tests/test/com/google/common/graph/
DGraphMutationTest.java84 int numNodesToRemove = gen.nextInt(NUM_NODES); in testGraphMutation() local
85 for (int i = 0; i < numNodesToRemove; ++i) { in testGraphMutation()
89 assertThat(graph.nodes()).hasSize(NUM_NODES - numNodesToRemove); in testGraphMutation()
93 for (int i = numNodesToRemove; i < NUM_NODES; ++i) { in testGraphMutation()
DNetworkMutationTest.java89 int numNodesToRemove = gen.nextInt(NUM_NODES); in testNetworkMutation() local
90 for (int i = 0; i < numNodesToRemove; ++i) { in testNetworkMutation()
94 assertThat(network.nodes()).hasSize(NUM_NODES - numNodesToRemove); in testNetworkMutation()
98 for (int i = numNodesToRemove; i < NUM_NODES; ++i) { in testNetworkMutation()