Use relative availabilities to determine piece request order

[btrtrc.git] / peerconn_test.go

diff --git a/peerconn_test.go b/peerconn_test.go
index 93e512a0ccdce66db359625ffd30d581697a3aad..7ecb6933357460ea77c244d7c1622d3c3ada1cb5 100644 (file)
--- a/peerconn_test.go
+++ b/peerconn_test.go
@@ -222,8 +222,10 @@ func TestHaveAllThenBitfield(t *testing.T) {
        pc.peerImpl = &pc
        tt.conns[&pc] = struct{}{}
        c.Assert(pc.onPeerSentHaveAll(), qt.IsNil)
+       c.Check(pc.t.connsWithAllPieces, qt.DeepEquals, map[*Peer]struct{}{&pc.Peer: {}})
        pc.peerSentBitfield([]bool{false, false, true, false, true, true, false, false})
        c.Check(pc.peerMinPieces, qt.Equals, 6)
+       c.Check(pc.t.connsWithAllPieces, qt.HasLen, 0)
        c.Assert(pc.t.setInfo(&metainfo.Info{
                PieceLength: 0,
                Pieces:      make([]byte, pieceHash.Size()*7),