anchor.diff:      return _chunkSizeInWords * _BYTES_PER_WORD;
     }
   
  -  // Create a fresh instance of this Hash.
  -  newInstance();
  -
     // One round of the hash computation.
  -  _updateHash(List<int> m);
  +  _updateHash(Uint32List m);
   
     // Helper methods.
     int _add32(int x, int y) => (x + y) & _MASK_32;
  
positive.code:     _h[1] = 0xefcdab89;
      _h[2] = 0x98badcfe;
      _h[3] = 0x10325476;
    }
  
    // Returns a new instance of this Hash.
    _MD5 newInstance() {
      return _MD5();
    }
  
    static const _k = [
  
negative.code:   final bool _bigEndianWords;
    int _lengthInBytes = 0;
    List<int> _pendingData;
    final Uint32List _currentChunk;
    final Uint32List _h;
    bool _digestCalled = false;
  
    _HashBase(this._chunkSizeInWords, int digestSizeInWords, this._bigEndianWords)
        : _pendingData = [],
          _currentChunk = Uint32List(_chunkSizeInWords),
          _h = Uint32List(digestSizeInWords);
  
    // Update the hasher with more data.
    void add(List<int> data) {
      if (_digestCalled) {
        throw StateError('Hash update method called after digest was retrieved');
      }
  