refactor project structure

datastruct/set/set.go

@@ -0,0 +1,116 @@
+package set
+
+import "github.com/hdt3213/godis/datastruct/dict"
+
+type Set struct {
+	dict dict.Dict
+}
+
+func Make() *Set {
+	return &Set{
+		dict: dict.MakeSimple(),
+	}
+}
+
+func MakeFromVals(members ...string) *Set {
+	set := &Set{
+		dict: dict.MakeConcurrent(len(members)),
+	}
+	for _, member := range members {
+		set.Add(member)
+	}
+	return set
+}
+
+func (set *Set) Add(val string) int {
+	return set.dict.Put(val, nil)
+}
+
+func (set *Set) Remove(val string) int {
+	return set.dict.Remove(val)
+}
+
+func (set *Set) Has(val string) bool {
+	_, exists := set.dict.Get(val)
+	return exists
+}
+
+func (set *Set) Len() int {
+	return set.dict.Len()
+}
+
+func (set *Set) ToSlice() []string {
+	slice := make([]string, set.Len())
+	i := 0
+	set.dict.ForEach(func(key string, val interface{}) bool {
+		if i < len(slice) {
+			slice[i] = key
+		} else {
+			// set extended during traversal
+			slice = append(slice, key)
+		}
+		i++
+		return true
+	})
+	return slice
+}
+
+func (set *Set) ForEach(consumer func(member string) bool) {
+	set.dict.ForEach(func(key string, val interface{}) bool {
+		return consumer(key)
+	})
+}
+
+func (set *Set) Intersect(another *Set) *Set {
+	if set == nil {
+		panic("set is nil")
+	}
+
+	result := Make()
+	another.ForEach(func(member string) bool {
+		if set.Has(member) {
+			result.Add(member)
+		}
+		return true
+	})
+	return result
+}
+
+func (set *Set) Union(another *Set) *Set {
+	if set == nil {
+		panic("set is nil")
+	}
+	result := Make()
+	another.ForEach(func(member string) bool {
+		result.Add(member)
+		return true
+	})
+	set.ForEach(func(member string) bool {
+		result.Add(member)
+		return true
+	})
+	return result
+}
+
+func (set *Set) Diff(another *Set) *Set {
+	if set == nil {
+		panic("set is nil")
+	}
+
+	result := Make()
+	set.ForEach(func(member string) bool {
+		if !another.Has(member) {
+			result.Add(member)
+		}
+		return true
+	})
+	return result
+}
+
+func (set *Set) RandomMembers(limit int) []string {
+	return set.dict.RandomKeys(limit)
+}
+
+func (set *Set) RandomDistinctMembers(limit int) []string {
+	return set.dict.RandomDistinctKeys(limit)
+}

datastruct/set/set_test.go

@@ -0,0 +1,32 @@
+package set
+
+import (
+	"strconv"
+	"testing"
+)
+
+func TestSet(t *testing.T) {
+	size := 10
+	set := Make()
+	for i := 0; i < size; i++ {
+		set.Add(strconv.Itoa(i))
+	}
+	for i := 0; i < size; i++ {
+		ok := set.Has(strconv.Itoa(i))
+		if !ok {
+			t.Error("expected true actual false, key: " + strconv.Itoa(i))
+		}
+	}
+	for i := 0; i < size; i++ {
+		ok := set.Remove(strconv.Itoa(i))
+		if ok != 1 {
+			t.Error("expected true actual false, key: " + strconv.Itoa(i))
+		}
+	}
+	for i := 0; i < size; i++ {
+		ok := set.Has(strconv.Itoa(i))
+		if ok {
+			t.Error("expected false actual true, key: " + strconv.Itoa(i))
+		}
+	}
+}