etcdserver: introduce the cluster and member

This introduces two new concepts: the cluster and the member.

Members are logical etcd instances that have a name, raft ID, and a list
of peer and client addresses.

A cluster is made up of a list of members.

etcdserver/cluster_test.go

@@ -0,0 +1,143 @@
+package etcdserver
+
+import (
+	"testing"
+)
+
+func TestClusterFind(t *testing.T) {
+	tests := []struct {
+		id    int64
+		name  string
+		mems  []Member
+		match bool
+	}{
+		{
+			1,
+			"node1",
+			[]Member{{Name: "node1", ID: 1}},
+			true,
+		},
+		{
+			2,
+			"foobar",
+			[]Member{},
+			false,
+		},
+		{
+			2,
+			"node2",
+			[]Member{{Name: "node1", ID: 1}, {Name: "node2", ID: 2}},
+			true,
+		},
+		{
+			3,
+			"node3",
+			[]Member{{Name: "node1", ID: 1}, {Name: "node2", ID: 2}},
+			false,
+		},
+	}
+	for i, tt := range tests {
+		c := Cluster{}
+		c.AddSlice(tt.mems)
+
+		m := c.FindName(tt.name)
+		if m == nil && !tt.match {
+			continue
+		}
+		if m == nil && tt.match {
+			t.Errorf("#%d: expected match got empty", i)
+		}
+		if m.Name != tt.name && tt.match {
+			t.Errorf("#%d: got = %v, want %v", i, m.Name, tt.name)
+		}
+	}
+
+	for i, tt := range tests {
+		c := Cluster{}
+		c.AddSlice(tt.mems)
+
+		m := c.FindID(tt.id)
+		if m == nil && !tt.match {
+			continue
+		}
+		if m == nil && tt.match {
+			t.Errorf("#%d: expected match got empty", i)
+		}
+		if m.ID != tt.id && tt.match {
+			t.Errorf("#%d: got = %v, want %v", i, m.Name, tt.id)
+		}
+	}
+}
+
+func TestClusterSet(t *testing.T) {
+	tests := []struct {
+		f     string
+		mems  []Member
+		parse bool
+	}{
+		{
+			"mem1=10.0.0.1:2379,mem1=128.193.4.20:2379,mem2=10.0.0.2:2379,default=127.0.0.1:2379",
+			[]Member{
+				{ID: 3736794188555456841, Name: "mem1", PeerURLs: []string{"10.0.0.1:2379", "128.193.4.20:2379"}},
+				{ID: 5674507346857578431, Name: "mem2", PeerURLs: []string{"10.0.0.2:2379"}},
+				{ID: 2676999861503984872, Name: "default", PeerURLs: []string{"127.0.0.1:2379"}},
+			},
+			true,
+		},
+	}
+	for i, tt := range tests {
+		c := Cluster{}
+		err := c.AddSlice(tt.mems)
+		if err != nil {
+			t.Error(err)
+		}
+
+		g := Cluster{}
+		g.Set(tt.f)
+
+		if g.String() != c.String() {
+			t.Errorf("#%d: set = %v, want %v", i, g, c)
+		}
+	}
+}
+
+func TestClusterSetBad(t *testing.T) {
+	tests := []string{
+		"mem1=,mem2=128.193.4.20:2379,mem3=10.0.0.2:2379",
+		"mem1,mem2=128.193.4.20:2379,mem3=10.0.0.2:2379",
+		// TODO(philips): anyone know of a 64 bit sha1 hash collision
+		// "06b2f82fd81b2c20=128.193.4.20:2379,02c60cb75083ceef=128.193.4.20:2379",
+	}
+	for i, tt := range tests {
+		g := Cluster{}
+		err := g.Set(tt)
+		if err == nil {
+			t.Errorf("#%d: set = %v, want err", i, tt)
+		}
+	}
+}
+
+func TestClusterAddBad(t *testing.T) {
+	tests := []struct {
+		mems []Member
+	}{
+		{
+			[]Member{
+				{ID: 1, Name: "mem1"},
+				{ID: 1, Name: "mem2"},
+			},
+		},
+	}
+
+	c := &Cluster{}
+	c.Add(Member{ID: 1, Name: "mem1"})
+
+	for i, tt := range tests {
+		for _, m := range tt.mems {
+			err := c.Add(m)
+			if err == nil {
+				t.Errorf("#%d: set = %v, want err", i, m)
+			}
+		}
+	}
+}