anchor.diff:    }
   
     /**
  -   * Assert that the result of the incremental scan matches the given list of lexemes and that the
  -   * left and right tokens correspond to the tokens at the given indices.
  -   *
  -   * @param leftIndex the expected index of the left token
  -   * @param rightIndex the expected index of the right token
  -   * @param lexemes the expected lexemes of the resulting tokens
  +   * Assert that the result of the incremental scan matches the given list of
  +   * [lexemes] and that the left and right tokens correspond to the tokens at
  +   * the [leftIndex] and [rightIndex].
      */
     void _assertTokens(int leftIndex, int rightIndex, List<String> lexemes) {
       int count = lexemes.length;
  -    expect(leftIndex >= -1 && leftIndex < count, isTrue, reason: "Invalid left index");
  -    expect(rightIndex >= 0 && rightIndex <= count, isTrue, reason: "Invalid right index");
  +    expect(
  +        leftIndex >= -1 && leftIndex < count,
  +        isTrue,
  +        reason: "Invalid left index");
  +    expect(
  +        rightIndex >= 0 && rightIndex <= count,
  +        isTrue,
  +        reason: "Invalid right index");
       Token leftToken = null;
       Token rightToken = null;
       Token token = _incrementalTokens;
  
positive.code:     expect(_incrementalScanner.hasNonWhitespaceChange, isTrue);
    }
  
    void test_insert_afterIdentifier1() {
      // "a + b;"
      // "abs + b;"
      _scan("a", "", "bs", " + b;");
  
negative.code:     expect(_incrementalScanner.hasNonWhitespaceChange, isTrue);
    }
  
    void test_insert_convertOneFunctionToTwo_overlap() {
      // "f() {}"
      // "f() {} g() {}"
      _scan("f() {", "", "} g() {", "}");
      _assertTokens(4, 10, ["f", "(", ")", "{", "}", "g", "(", ")", "{", "}"]);
      expect(_incrementalScanner.hasNonWhitespaceChange, isTrue);
    }
  
    void test_insert_end() {
      // "class A {}"
      // "class A {} class B {}"
  