1 files changed, 172 insertions, 0 deletions
diff --git a/vendor/github.com/hashicorp/memberlist/queue_test.go b/vendor/github.com/hashicorp/memberlist/queue_test.go
new file mode 100644
index 000000000..765a3b53d
--- /dev/null
+++ b/vendor/github.com/hashicorp/memberlist/queue_test.go
@@ -0,0 +1,172 @@
+package memberlist
+
+import (
+	"testing"
+)
+
+func TestTransmitLimited_Queue(t *testing.T) {
+	q := &TransmitLimitedQueue{RetransmitMult: 1, NumNodes: func() int { return 1 }}
+	q.QueueBroadcast(&memberlistBroadcast{"test", nil, nil})
+	q.QueueBroadcast(&memberlistBroadcast{"foo", nil, nil})
+	q.QueueBroadcast(&memberlistBroadcast{"bar", nil, nil})
+
+	if len(q.bcQueue) != 3 {
+		t.Fatalf("bad len")
+	}
+	if q.bcQueue[0].b.(*memberlistBroadcast).node != "test" {
+		t.Fatalf("missing test")
+	}
+	if q.bcQueue[1].b.(*memberlistBroadcast).node != "foo" {
+		t.Fatalf("missing foo")
+	}
+	if q.bcQueue[2].b.(*memberlistBroadcast).node != "bar" {
+		t.Fatalf("missing bar")
+	}
+
+	// Should invalidate previous message
+	q.QueueBroadcast(&memberlistBroadcast{"test", nil, nil})
+
+	if len(q.bcQueue) != 3 {
+		t.Fatalf("bad len")
+	}
+	if q.bcQueue[0].b.(*memberlistBroadcast).node != "foo" {
+		t.Fatalf("missing foo")
+	}
+	if q.bcQueue[1].b.(*memberlistBroadcast).node != "bar" {
+		t.Fatalf("missing bar")
+	}
+	if q.bcQueue[2].b.(*memberlistBroadcast).node != "test" {
+		t.Fatalf("missing test")
+	}
+}
+
+func TestTransmitLimited_GetBroadcasts(t *testing.T) {
+	q := &TransmitLimitedQueue{RetransmitMult: 3, NumNodes: func() int { return 10 }}
+
+	// 18 bytes per message
+	q.QueueBroadcast(&memberlistBroadcast{"test", []byte("1. this is a test."), nil})
+	q.QueueBroadcast(&memberlistBroadcast{"foo", []byte("2. this is a test."), nil})
+	q.QueueBroadcast(&memberlistBroadcast{"bar", []byte("3. this is a test."), nil})
+	q.QueueBroadcast(&memberlistBroadcast{"baz", []byte("4. this is a test."), nil})
+
+	// 2 byte overhead per message, should get all 4 messages
+	all := q.GetBroadcasts(2, 80)
+	if len(all) != 4 {
+		t.Fatalf("missing messages: %v", all)
+	}
+
+	// 3 byte overhead, should only get 3 messages back
+	partial := q.GetBroadcasts(3, 80)
+	if len(partial) != 3 {
+		t.Fatalf("missing messages: %v", partial)
+	}
+}
+
+func TestTransmitLimited_GetBroadcasts_Limit(t *testing.T) {
+	q := &TransmitLimitedQueue{RetransmitMult: 1, NumNodes: func() int { return 10 }}
+
+	// 18 bytes per message
+	q.QueueBroadcast(&memberlistBroadcast{"test", []byte("1. this is a test."), nil})
+	q.QueueBroadcast(&memberlistBroadcast{"foo", []byte("2. this is a test."), nil})
+	q.QueueBroadcast(&memberlistBroadcast{"bar", []byte("3. this is a test."), nil})
+	q.QueueBroadcast(&memberlistBroadcast{"baz", []byte("4. this is a test."), nil})
+
+	// 3 byte overhead, should only get 3 messages back
+	partial1 := q.GetBroadcasts(3, 80)
+	if len(partial1) != 3 {
+		t.Fatalf("missing messages: %v", partial1)
+	}
+
+	partial2 := q.GetBroadcasts(3, 80)
+	if len(partial2) != 3 {
+		t.Fatalf("missing messages: %v", partial2)
+	}
+
+	// Only two not expired
+	partial3 := q.GetBroadcasts(3, 80)
+	if len(partial3) != 2 {
+		t.Fatalf("missing messages: %v", partial3)
+	}
+
+	// Should get nothing
+	partial5 := q.GetBroadcasts(3, 80)
+	if len(partial5) != 0 {
+		t.Fatalf("missing messages: %v", partial5)
+	}
+}
+
+func TestTransmitLimited_Prune(t *testing.T) {
+	q := &TransmitLimitedQueue{RetransmitMult: 1, NumNodes: func() int { return 10 }}
+
+	ch1 := make(chan struct{}, 1)
+	ch2 := make(chan struct{}, 1)
+
+	// 18 bytes per message
+	q.QueueBroadcast(&memberlistBroadcast{"test", []byte("1. this is a test."), ch1})
+	q.QueueBroadcast(&memberlistBroadcast{"foo", []byte("2. this is a test."), ch2})
+	q.QueueBroadcast(&memberlistBroadcast{"bar", []byte("3. this is a test."), nil})
+	q.QueueBroadcast(&memberlistBroadcast{"baz", []byte("4. this is a test."), nil})
+
+	// Keep only 2
+	q.Prune(2)
+
+	if q.NumQueued() != 2 {
+		t.Fatalf("bad len")
+	}
+
+	// Should notify the first two
+	select {
+	case <-ch1:
+	default:
+		t.Fatalf("expected invalidation")
+	}
+	select {
+	case <-ch2:
+	default:
+		t.Fatalf("expected invalidation")
+	}
+
+	if q.bcQueue[0].b.(*memberlistBroadcast).node != "bar" {
+		t.Fatalf("missing bar")
+	}
+	if q.bcQueue[1].b.(*memberlistBroadcast).node != "baz" {
+		t.Fatalf("missing baz")
+	}
+}
+
+func TestLimitedBroadcastSort(t *testing.T) {
+	bc := limitedBroadcasts([]*limitedBroadcast{
+		&limitedBroadcast{
+			transmits: 0,
+		},
+		&limitedBroadcast{
+			transmits: 10,
+		},
+		&limitedBroadcast{
+			transmits: 3,
+		},
+		&limitedBroadcast{
+			transmits: 4,
+		},
+		&limitedBroadcast{
+			transmits: 7,
+		},
+	})
+	bc.Sort()
+
+	if bc[0].transmits != 10 {
+		t.Fatalf("bad val %v", bc[0])
+	}
+	if bc[1].transmits != 7 {
+		t.Fatalf("bad val %v", bc[7])
+	}
+	if bc[2].transmits != 4 {
+		t.Fatalf("bad val %v", bc[2])
+	}
+	if bc[3].transmits != 3 {
+		t.Fatalf("bad val %v", bc[3])
+	}
+	if bc[4].transmits != 0 {
+		t.Fatalf("bad val %v", bc[4])
+	}
+}