[testng] 56/355: Use LinkedHashMap so that the topological sort will process the nodes in the same order of collecting

[Eugene Zhukov]

This is an automated email from the git hooks/post-receive script.

eugene-guest pushed a commit to annotated tag OpenBSD
in repository testng.

commit 57462cac0ab34e112f7243a7c84dedeb8ad4dc93
Author: Le Trong Dao <Dao007forever at gmail.com>
Date:   Sat Mar 22 10:30:24 2014 +0800

    Use LinkedHashMap so that the topological sort will process the nodes in the same order of collecting
---
 src/main/java/org/testng/internal/Graph.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/main/java/org/testng/internal/Graph.java b/src/main/java/org/testng/internal/Graph.java
index 9a0ce75..f7ba442 100644
--- a/src/main/java/org/testng/internal/Graph.java
+++ b/src/main/java/org/testng/internal/Graph.java
@@ -19,7 +19,7 @@ import java.util.Set;
  */
 public class Graph<T> {
   private static boolean m_verbose = false;
-  private Map<T, Node<T>> m_nodes = Maps.newHashMap();
+  private Map<T, Node<T>> m_nodes = Maps.newLinkedHashMap();
   private List<T> m_strictlySortedNodes = null;
 
   //  A map of nodes that are not the predecessors of any node

-- 
Alioth's /usr/local/bin/git-commit-notice on /srv/git.debian.org/git/pkg-java/testng.git