Searched refs:iterationOrder (Results 1 – 3 of 3) sorted by relevance
112 static String iterationOrder(Iterable<Tree> iterable) { in iterationOrder() method in TreeTraverserTest129 ASSERT.that(iterationOrder(ADAPTER.preOrderTraversal(h))).is("hdabcegf"); in testPreOrder()134 ASSERT.that(iterationOrder(ADAPTER.postOrderTraversal(h))).is("abcdefgh"); in testPostOrder()139 ASSERT.that(iterationOrder(ADAPTER.breadthFirstTraversal(h))).is("hdegabcf"); in testBreadthOrder()
114 static String iterationOrder(Iterable<Tree> iterable) { in iterationOrder() method in TreeTraverserTest131 ASSERT.that(iterationOrder(ADAPTER.preOrderTraversal(h))).is("hdabcegf"); in testPreOrder()136 ASSERT.that(iterationOrder(ADAPTER.postOrderTraversal(h))).is("abcdefgh"); in testPostOrder()141 ASSERT.that(iterationOrder(ADAPTER.breadthFirstTraversal(h))).is("hdegabcf"); in testBreadthOrder()
1857 static void generateTwoPassRandomIterationOrder (std::vector<int>& iterationOrder, int numSamples) in generateTwoPassRandomIterationOrder() argument1862 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()