anchor.diff:      return new DartCode.fromDartCodeChild(new DartCodeChild.fromMap(map));
     }
     
  +  /*
  +   *  Because the operation can be a little CPU intensive we save this. There
  +   *  are no risks involved because the hashsum of each dependency of the 
  +   *  DartCode can't be changed after creation of the DartCode object.
  +   */
     String _treeHashCache = null;
  +  
     /***
      * Returns a calculated SHA1 checksum for the DartCode object and all the 
      * dependencies in the tree.  The purpose of this checksum is to make sure 
  
positive.code:     return _treeHashCache;
    }
    
    void _shortenPaths() {
      _log("Running _shortenPaths()");
      List<DartCodeChild> dependencies = _getTree(this).toList(growable:false);
  
negative.code:       }
      });
      
      // Find the number of equal segments in a list of segments
      for (int i = 0; i < minSegmentLength; i++) {
        String compareValue = paths[0][i];
        
  