anchor.diff:      // in a predictable order determined by the proposed name.  This is in order
       // to make the renamer stable: small changes in the input should nornally
       // result in relatively small changes in the output.
  -    for (var n = 2; n <= 3; n++) {
  +    for (var n = 1; n <= 3; n++) {
         int h = hash;
         while (h > 10) {
           var codes = <int>[_letterNumber(h)];
  
positive.code:         h ~/= 7;
        }
      }
  
      // If we can't find a hash based name in the three-letter space, then base
      // the name on a letter and a counter.
      var startLetter = new String.fromCharCodes([_letterNumber(hash)]);
      var i = 0;
      while (usedNames.contains("$startLetter$i")) {
        i++;
      }
      // We don't need to check for banned prefix because the name is in the form
      // xnnn, where nnn is a number.  There can be no getter or setter called
      // gnnn since that would imply a numeric field name.
      return "$startLetter$i";
    }
  
    /// Instance members starting with g and s are reserved for getters and
  
negative.code:         final candidate = new String.fromCharCodes(codes);
          if (!usedNames.contains(candidate) &&
              !jsReserved.contains(candidate) &&
              !_hasBannedPrefix(candidate) &&
              (n != 1 || !suggestions.contains(candidate))) {
            return candidate;
          }
          // Try again with a slightly different hash.  After around 10 turns
  