Home
last modified time | relevance | path

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

/external/guava/android/guava-tests/test/com/google/common/collect/
DTreeTraverserTest.java84 static String iterationOrder(Iterable<? extends Node> iterable) { in iterationOrder() method in TreeTraverserTest
93 assertThat(iterationOrder(ADAPTER.preOrderTraversal(h))).isEqualTo("hdabcegf"); in testPreOrder()
97 assertThat(iterationOrder(ADAPTER.postOrderTraversal(h))).isEqualTo("abcdefgh"); in testPostOrder()
101 assertThat(iterationOrder(ADAPTER.breadthFirstTraversal(h))).isEqualTo("hdegabcf"); in testBreadthOrder()
105 assertThat(iterationOrder(ADAPTER_USING_USING.preOrderTraversal(h))).isEqualTo("hdabcegf"); in testUsing()
/external/guava/guava-tests/test/com/google/common/collect/
DTreeTraverserTest.java84 static String iterationOrder(Iterable<? extends Node> iterable) { in iterationOrder() method in TreeTraverserTest
98 assertThat(iterationOrder(ADAPTER.preOrderTraversal(h))).isEqualTo("hdabcegf"); in testPreOrder()
102 assertThat(iterationOrder(ADAPTER.postOrderTraversal(h))).isEqualTo("abcdefgh"); in testPostOrder()
106 assertThat(iterationOrder(ADAPTER.breadthFirstTraversal(h))).isEqualTo("hdegabcf"); in testBreadthOrder()
110 assertThat(iterationOrder(ADAPTER_USING_USING.preOrderTraversal(h))).isEqualTo("hdabcegf"); in testUsing()
/external/dagger2/javatests/dagger/internal/
DMapProviderFactoryTest.java51 public void iterationOrder() { in iterationOrder() method in MapProviderFactoryTest
/external/deqp/modules/gles3/performance/
Des3pBufferDataUploadTests.cpp1857 static void generateTwoPassRandomIterationOrder (std::vector<int>& iterationOrder, int numSamples) in generateTwoPassRandomIterationOrder() argument
1862 DE_ASSERT((int)iterationOrder.size() == numSamples); in generateTwoPassRandomIterationOrder()
1869 iterationOrder[sampleNdx] = sampleNdx * 2; in generateTwoPassRandomIterationOrder()
1871 iterationOrder[sampleNdx] = (sampleNdx - midPoint) * 2 + 1; in generateTwoPassRandomIterationOrder()
1874 std::swap(iterationOrder[ndx], iterationOrder[rnd.getInt(0, midPoint - 1)]); in generateTwoPassRandomIterationOrder()
1875 for (int ndx = midPoint; ndx < (int)iterationOrder.size(); ++ndx) in generateTwoPassRandomIterationOrder()
1876 …std::swap(iterationOrder[ndx], iterationOrder[rnd.getInt(midPoint, (int)iterationOrder.size()-1)]); in generateTwoPassRandomIterationOrder()