anchor.diff:        // Try to find an existing compatible VTable.
         if (deduplicateTables) {
           // Search backward - more likely to have recently used one
  -        for (int i = _vTables.length - 1; i >= 0; i--) {
  -          final int vt2Offset = _vTables[i];
  -          final int vt2Start = _buf.lengthInBytes - vt2Offset;
  -          final int vt2Size = _buf.getUint16(vt2Start, Endian.little);
  +        for (var i = _vTables.length - 1; i >= 0; i--) {
  +          final vt2Offset = _vTables[i];
  +          final vt2Start = _buf.lengthInBytes - vt2Offset;
  +          final vt2Size = _buf.getUint16(vt2Start, Endian.little);
   
             if (currentVTable._vTableSize == vt2Size &&
                 currentVTable._offsetsMatch(vt2Start, _buf)) {
  
positive.code:   int writeListUint16(List<int> values) {
      assert(!_inVTable);
      _prepare(_sizeofUint32, 1, additionalBytes: 2 * values.length);
      final int result = _tail;
      int tail = _tail;
      _setUint32AtTail(tail, values.length);
      tail -= _sizeofUint32;
      for (int value in values) {
        _setUint16AtTail(tail, value);
        tail -= _sizeofUint16;
      }
  
negative.code:   int writeListUint64(List<int> values) {
      assert(!_inVTable);
      _prepare(_sizeofUint64, values.length, additionalBytes: _sizeofUint32);
      final result = _tail;
      var tail = _tail;
      _setUint32AtTail(tail, values.length);
      tail -= _sizeofUint32;
      for (var value in values) {
        _setUint64AtTail(tail, value);
        tail -= _sizeofUint64;
      }
  