| // Copyright 2020 The Go Authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style |
| // license that can be found in the LICENSE file. |
| |
| package sets |
| |
| import ( |
| "sort" |
| "testing" |
| |
| "slices" |
| ) |
| |
| func TestSet(t *testing.T) { |
| s1 := Make[int]() |
| if got := s1.Len(); got != 0 { |
| t.Errorf("Len of empty set = %d, want 0", got) |
| } |
| s1.Add(1) |
| s1.Add(1) |
| s1.Add(1) |
| if got := s1.Len(); got != 1 { |
| t.Errorf("(%v).Len() == %d, want 1", s1, got) |
| } |
| s1.Add(2) |
| s1.Add(3) |
| s1.Add(4) |
| if got := s1.Len(); got != 4 { |
| t.Errorf("(%v).Len() == %d, want 4", s1, got) |
| } |
| if !s1.Contains(1) { |
| t.Errorf("(%v).Contains(1) == false, want true", s1) |
| } |
| if s1.Contains(5) { |
| t.Errorf("(%v).Contains(5) == true, want false", s1) |
| } |
| vals := s1.Values() |
| sort.Ints(vals) |
| w1 := []int{1, 2, 3, 4} |
| if !slices.Equal(vals, w1) { |
| t.Errorf("(%v).Values() == %v, want %v", s1, vals, w1) |
| } |
| } |
| |
| func TestEqual(t *testing.T) { |
| s1 := Make[string]() |
| s2 := Make[string]() |
| if !Equal(s1, s2) { |
| t.Errorf("Equal(%v, %v) = false, want true", s1, s2) |
| } |
| s1.Add("hello") |
| s1.Add("world") |
| if got := s1.Len(); got != 2 { |
| t.Errorf("(%v).Len() == %d, want 2", s1, got) |
| } |
| if Equal(s1, s2) { |
| t.Errorf("Equal(%v, %v) = true, want false", s1, s2) |
| } |
| } |
| |
| func TestCopy(t *testing.T) { |
| s1 := Make[float64]() |
| s1.Add(0) |
| s2 := s1.Copy() |
| if !Equal(s1, s2) { |
| t.Errorf("Equal(%v, %v) = false, want true", s1, s2) |
| } |
| s1.Add(1) |
| if Equal(s1, s2) { |
| t.Errorf("Equal(%v, %v) = true, want false", s1, s2) |
| } |
| } |
| |
| func TestAddSet(t *testing.T) { |
| s1 := Make[int]() |
| s1.Add(1) |
| s1.Add(2) |
| s2 := Make[int]() |
| s2.Add(2) |
| s2.Add(3) |
| s1.AddSet(s2) |
| if got := s1.Len(); got != 3 { |
| t.Errorf("(%v).Len() == %d, want 3", s1, got) |
| } |
| s2.Add(1) |
| if !Equal(s1, s2) { |
| t.Errorf("Equal(%v, %v) = false, want true", s1, s2) |
| } |
| } |
| |
| func TestSubSet(t *testing.T) { |
| s1 := Make[int]() |
| s1.Add(1) |
| s1.Add(2) |
| s2 := Make[int]() |
| s2.Add(2) |
| s2.Add(3) |
| s1.SubSet(s2) |
| if got := s1.Len(); got != 1 { |
| t.Errorf("(%v).Len() == %d, want 1", s1, got) |
| } |
| if vals, want := s1.Values(), []int{1}; !slices.Equal(vals, want) { |
| t.Errorf("after SubSet got %v, want %v", vals, want) |
| } |
| } |
| |
| func TestIntersect(t *testing.T) { |
| s1 := Make[int]() |
| s1.Add(1) |
| s1.Add(2) |
| s2 := Make[int]() |
| s2.Add(2) |
| s2.Add(3) |
| s1.Intersect(s2) |
| if got := s1.Len(); got != 1 { |
| t.Errorf("(%v).Len() == %d, want 1", s1, got) |
| } |
| if vals, want := s1.Values(), []int{2}; !slices.Equal(vals, want) { |
| t.Errorf("after Intersect got %v, want %v", vals, want) |
| } |
| } |
| |
| func TestIterate(t *testing.T) { |
| s1 := Make[int]() |
| s1.Add(1) |
| s1.Add(2) |
| s1.Add(3) |
| s1.Add(4) |
| tot := 0 |
| s1.Iterate(func(i int) { tot += i }) |
| if tot != 10 { |
| t.Errorf("total of %v == %d, want 10", s1, tot) |
| } |
| } |
| |
| func TestFilter(t *testing.T) { |
| s1 := Make[int]() |
| s1.Add(1) |
| s1.Add(2) |
| s1.Add(3) |
| s1.Filter(func(v int) bool { return v%2 == 0 }) |
| if vals, want := s1.Values(), []int{2}; !slices.Equal(vals, want) { |
| t.Errorf("after Filter got %v, want %v", vals, want) |
| } |
| |
| } |
