+ leftPiece := t.piece(int(leftPieceIndex))
+ rightPiece := t.piece(int(rightPieceIndex))
+ // Putting this first means we can steal requests from lesser-performing peers for our first few
+ // new requests.
+ ml = ml.Int(
+ // Technically we would be happy with the cached priority here, except we don't actually
+ // cache it anymore, and Torrent.piecePriority just does another lookup of *Piece to resolve
+ // the priority through Piece.purePriority, which is probably slower.
+ -int(leftPiece.purePriority()),
+ -int(rightPiece.purePriority()),
+ )