From 7fba10e5be51a3fe565a6f69a946ece9f0e59a67 Mon Sep 17 00:00:00 2001 From: Luke Shumaker Date: Mon, 5 Sep 2022 12:43:46 -0600 Subject: Try to uniformly use containers.Set --- lib/containers/rbtree_test.go | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'lib/containers/rbtree_test.go') diff --git a/lib/containers/rbtree_test.go b/lib/containers/rbtree_test.go index 65cc78d..9841d26 100644 --- a/lib/containers/rbtree_test.go +++ b/lib/containers/rbtree_test.go @@ -49,7 +49,7 @@ func (node *RBNode[V]) asciiArt(w io.Writer, u, m, l string) { node.Left.asciiArt(w, l+" | ", l+" `--", l+" ") } -func checkRBTree[K constraints.Ordered, V any](t *testing.T, expectedSet map[K]struct{}, tree *RBTree[NativeOrdered[K], V]) { +func checkRBTree[K constraints.Ordered, V any](t *testing.T, expectedSet Set[K], tree *RBTree[NativeOrdered[K], V]) { // 1. Every node is either red or black // 2. The root is black. @@ -142,7 +142,7 @@ func FuzzRBTree(f *testing.F) { return NativeOrdered[uint8]{Val: x} }, } - set := make(map[uint8]struct{}) + set := make(Set[uint8]) checkRBTree(t, set, tree) t.Logf("\n%s\n", tree.ASCIIArt()) for _, b := range dat { @@ -151,7 +151,7 @@ func FuzzRBTree(f *testing.F) { if ins { t.Logf("Insert(%v)", val) tree.Insert(val) - set[val] = struct{}{} + set.Insert(val) t.Logf("\n%s\n", tree.ASCIIArt()) node := tree.Lookup(NativeOrdered[uint8]{Val: val}) require.NotNil(t, node) -- cgit v1.2.3-2-g168b