Use a stable sort to further ensure largest common subset of nodes ar…

…e emitted

lib/inspector.js

@@ -5,6 +5,7 @@ var parse        = require('./parser').parse;
 var Match        = require('./match');
 var nodeUtils    = require('./nodeUtils');
 var crypto       = require('crypto');
+var stable       = require('stable');
 
 class Inspector extends EventEmitter {
   /**
@@ -167,9 +168,14 @@ class Inspector extends EventEmitter {
   _analyze() {
     var key, match, i, groups, nodeArrays;
 
-    var sortedKeys = Object.keys(this._map)
-      .filter(key => this._map[key].length >= this._minInstances)
-      .sort((a, b) => this._map[b].length - this._map[a].length);
+    var keys = Object.keys(this._map)
+      .filter(key => this._map[key].length >= this._minInstances);
+
+    // Need to use a stable sort to ensure parent nodes are traversed
+    // before children when lengths are equal
+    var sortedKeys = stable(keys, (a, b) => {
+      return this._map[b].length - this._map[a].length;
+    });
 
     for (key of sortedKeys) {
       if (!this._map[key] || this._map[key].length < this._minInstances) {

package.json

@@ -23,6 +23,7 @@
     "chalk": "*",
     "commander": "*",
     "node-filepaths": "0.1.0",
+    "stable": "0.1.6",
     "strip-indent": "^1.0.0",
     "strip-json-comments": "1.0.2"
   },