anchor.diff:      }
       peerInfos.add(peerInfo);
       peerInfos.sort((KPeerInfo a, KPeerInfo b) {
  -      if (a.id == b.id) {
  -        return 0;
  -      } else if (a.id > b.id) {
  -        return 1;
  -      } else {
  -        return -1;
  -      }
  +      return (a.id == b.id ? 0 : (a.id > b.id ? 1 : -1));
       });
       if (peerInfos.length > k) {
         peerInfos.removeAt(0);
  
positive.code:   }
  
    int get length => peerInfos.length;
    KPeerInfo operator[](int idx) => peerInfos[idx];
    Iterator<KPeerInfo> get iterator => peerInfos.iterator;
  }
  
negative.code: class KBucket {
    int _k = 8;
    int get k => _k;
    List<KPeerInfo> peerInfos = null;
  
    KBucket(int kBucketSize) {
      this._k = kBucketSize;
      this.peerInfos = [];
  