refactor: tree set

dairongpeng · dairongpeng · commit 145c70569e26 · 2022-01-12T22:40:11.000+08:00
diff --git a/02-链表、栈、队列、递归、哈希表、顺序表.md b/02-链表、栈、队列、递归、哈希表、顺序表.md
@@ -513,6 +513,34 @@ func (set *HashSet) Contains(items ...interface{}) bool {
 ```
 
 ```Go
-// Go中基于红黑树TreeSet的简单实现
-// https://github.com/dairongpeng/gods
+// Go中基于红黑树TreeSet的简单使用
+package main
+
+import (
+	"fmt"
+	"github.com/emirpasic/gods/sets/treeset"
+)
+
+// treeSet => 去重排序
+func main()  {
+	set := treeset.NewWithIntComparator()
+	set.Add()
+	set.Add(1)
+	set.Add(2)
+	set.Add(2, 3)
+	set.Add()
+	set.Add(6)
+	set.Add(4)
+	if actualValue := set.Empty(); actualValue != false {
+		fmt.Printf("Got %v expected %v", actualValue, false)
+	}
+	if actualValue := set.Size(); actualValue != 3 {
+		fmt.Printf("Got %v expected %v", actualValue, 3)
+	}
+	if actualValue, expectedValue := fmt.Sprintf("%d%d%d", set.Values()...), "12346"; actualValue != expectedValue {
+		fmt.Printf("Got %v expected %v", actualValue, expectedValue)
+	}
+
+	fmt.Println(set.Values()...)
+}
 ```
