anchor.diff:  
     V _get(K key, int hash, int depth) {
       int f=0;
  -//    for (int i=0; i<_kv.length; i+=21){
  -//      if (_kv[i+2] < hash){
  -//        f=i;
  -//      }
  -//    }
  -//
  -//    for (int i=f+recsize; i<_kv.length; i+=recsize) {
  -//      var h = _kv[i+2];
  -//      if (h == hash && _kv[i] == key) {
  -//        return _kv[i+1];
  -//      }
  -//      if (h > hash) {
  -//        return _none;
  -//      }
  -//    }
  -//    return _none;
       int from = 0;
       int to = _kv.length ~/ recsize;
       while(to - from > binSearchThr){
  
positive.code: }
  
  /// usually, we need to copy some arrays when associng. However, when working
  /// with transients (and owners match), it is safe just to modify the array
  _makeCopyIfNeeded(_Owner a, _Owner b, List c) {
    if(_ownerEquals(a, b))
      return c;
  
negative.code:             // scan the same-hash regions
              for (var j=i; j<=bm; j+=recsize) {
                bool res = false;
                for (var k=i; k<=bo; k+=recsize) {
                  res = res || ((mekv[j+1] == okv[k+1]) && (mekv[j+2] == okv[k+2]));
                }
                if (!res) return false;
  