@Test public void testDfs() { nodes.sort(dfs()); Assert.assertArrayEquals(new ArgNode[]{s20, s21, s10, s11, s12, s0}, nodes.toArray()); }
public static ArgNodeComparator dfs() { return combine(invert(new DepthOrder()), new CreationOrder()); }
ArgNodeComparators { public static ArgNodeComparator dfs() { return combine(invert(new DepthOrder()), new CreationOrder()); } }
ArgNodeComparators { public static ArgNodeComparator dfs() { return combine(invert(new DepthOrder()), new CreationOrder()); } private  ArgNodeComparators(); }
ArgNodeComparators { public static ArgNodeComparator dfs() { return combine(invert(new DepthOrder()), new CreationOrder()); } private  ArgNodeComparators(); static ArgNodeComparator creationAsc(); static ArgNodeComparator creationDesc(); static ArgNodeComparator invert(final ArgNodeComparator comparator); static ArgNodeComparator combine(final ArgNodeComparator first, final ArgNodeComparator then); static ArgNodeComparator bfs(); static ArgNodeComparator dfs(); static ArgNodeComparator targetFirst(); }
ArgNodeComparators { public static ArgNodeComparator dfs() { return combine(invert(new DepthOrder()), new CreationOrder()); } private  ArgNodeComparators(); static ArgNodeComparator creationAsc(); static ArgNodeComparator creationDesc(); static ArgNodeComparator invert(final ArgNodeComparator comparator); static ArgNodeComparator combine(final ArgNodeComparator first, final ArgNodeComparator then); static ArgNodeComparator bfs(); static ArgNodeComparator dfs(); static ArgNodeComparator targetFirst();  }