| /* |
| Open Source Initiative OSI - The MIT License (MIT):Licensing |
| |
| The MIT License (MIT) |
| Copyright (c) 2013 - 2022 Ralph Caraveo (deckarep@gmail.com) |
| |
| Permission is hereby granted, free of charge, to any person obtaining a copy of |
| this software and associated documentation files (the "Software"), to deal in |
| the Software without restriction, including without limitation the rights to |
| use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies |
| of the Software, and to permit persons to whom the Software is furnished to do |
| so, subject to the following conditions: |
| |
| The above copyright notice and this permission notice shall be included in all |
| copies or substantial portions of the Software. |
| |
| THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR |
| IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, |
| FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE |
| AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER |
| LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, |
| OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
| SOFTWARE. |
| */ |
| |
| package mapset |
| |
| import ( |
| "encoding/json" |
| "math/rand" |
| "runtime" |
| "sync" |
| "sync/atomic" |
| "testing" |
| ) |
| |
| const N = 1000 |
| |
| func Test_AddConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| |
| var wg sync.WaitGroup |
| wg.Add(len(ints)) |
| for i := 0; i < len(ints); i++ { |
| go func(i int) { |
| s.Add(i) |
| wg.Done() |
| }(i) |
| } |
| |
| wg.Wait() |
| for _, i := range ints { |
| if !s.Contains(i) { |
| t.Errorf("Set is missing element: %v", i) |
| } |
| } |
| } |
| |
| func Test_AppendConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| |
| n := len(ints) >> 1 |
| var wg sync.WaitGroup |
| wg.Add(n) |
| for i := 0; i < n; i++ { |
| go func(i int) { |
| s.Append(i, N-i-1) |
| wg.Done() |
| }(i) |
| } |
| |
| wg.Wait() |
| for _, i := range ints { |
| if !s.Contains(i) { |
| t.Errorf("Set is missing element: %v", i) |
| } |
| } |
| } |
| |
| func Test_CardinalityConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| |
| var wg sync.WaitGroup |
| wg.Add(1) |
| go func() { |
| elems := s.Cardinality() |
| for i := 0; i < N; i++ { |
| newElems := s.Cardinality() |
| if newElems < elems { |
| t.Errorf("Cardinality shrunk from %v to %v", elems, newElems) |
| } |
| } |
| wg.Done() |
| }() |
| |
| for i := 0; i < N; i++ { |
| s.Add(rand.Int()) |
| } |
| wg.Wait() |
| } |
| |
| func Test_ClearConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| |
| var wg sync.WaitGroup |
| wg.Add(len(ints)) |
| for i := 0; i < len(ints); i++ { |
| go func() { |
| s.Clear() |
| wg.Done() |
| }() |
| go func(i int) { |
| s.Add(i) |
| }(i) |
| } |
| |
| wg.Wait() |
| } |
| |
| func Test_CloneConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| |
| for _, v := range ints { |
| s.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| wg.Add(len(ints)) |
| for i := range ints { |
| go func(i int) { |
| s.Remove(i) |
| wg.Done() |
| }(i) |
| } |
| s.Clone() |
| wg.Wait() |
| } |
| |
| func Test_ContainsConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| integers := make([]int, 0) |
| for _, v := range ints { |
| s.Add(v) |
| integers = append(integers, v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.Contains(integers...) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_DifferenceConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s, ss := NewSet[int](), NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| ss.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.Difference(ss) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_EqualConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s, ss := NewSet[int](), NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| ss.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.Equal(ss) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_IntersectConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s, ss := NewSet[int](), NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| ss.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.Intersect(ss) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_IsSubsetConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s, ss := NewSet[int](), NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| ss.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.IsSubset(ss) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_IsProperSubsetConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s, ss := NewSet[int](), NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| ss.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.IsProperSubset(ss) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_IsSupersetConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s, ss := NewSet[int](), NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| ss.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.IsSuperset(ss) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_IsProperSupersetConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s, ss := NewSet[int](), NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| ss.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.IsProperSuperset(ss) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_EachConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| concurrent := 10 |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| } |
| |
| var count int64 |
| wg := new(sync.WaitGroup) |
| wg.Add(concurrent) |
| for n := 0; n < concurrent; n++ { |
| go func() { |
| defer wg.Done() |
| s.Each(func(elem int) bool { |
| atomic.AddInt64(&count, 1) |
| return false |
| }) |
| }() |
| } |
| wg.Wait() |
| |
| if count != int64(N*concurrent) { |
| t.Errorf("%v != %v", count, int64(N*concurrent)) |
| } |
| } |
| |
| func Test_IterConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| } |
| |
| cs := make([]<-chan int, 0) |
| for range ints { |
| cs = append(cs, s.Iter()) |
| } |
| |
| c := make(chan interface{}) |
| go func() { |
| for n := 0; n < len(ints)*N; { |
| for _, d := range cs { |
| select { |
| case <-d: |
| n++ |
| c <- nil |
| default: |
| } |
| } |
| } |
| close(c) |
| }() |
| |
| for range c { |
| } |
| } |
| |
| func Test_RemoveConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| wg.Add(len(ints)) |
| for _, v := range ints { |
| go func(i int) { |
| s.Remove(i) |
| wg.Done() |
| }(v) |
| } |
| wg.Wait() |
| |
| if s.Cardinality() != 0 { |
| t.Errorf("Expected cardinality 0; got %v", s.Cardinality()) |
| } |
| } |
| |
| func Test_StringConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| wg.Add(len(ints)) |
| for range ints { |
| go func() { |
| _ = s.String() |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_SymmetricDifferenceConcurrent(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s, ss := NewSet[int](), NewSet[int]() |
| ints := rand.Perm(N) |
| for _, v := range ints { |
| s.Add(v) |
| ss.Add(v) |
| } |
| |
| var wg sync.WaitGroup |
| for range ints { |
| wg.Add(1) |
| go func() { |
| s.SymmetricDifference(ss) |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_ToSlice(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| s := NewSet[int]() |
| ints := rand.Perm(N) |
| |
| var wg sync.WaitGroup |
| wg.Add(len(ints)) |
| for i := 0; i < len(ints); i++ { |
| go func(i int) { |
| s.Add(i) |
| wg.Done() |
| }(i) |
| } |
| |
| wg.Wait() |
| setAsSlice := s.ToSlice() |
| if len(setAsSlice) != s.Cardinality() { |
| t.Errorf("Set length is incorrect: %v", len(setAsSlice)) |
| } |
| |
| for _, i := range setAsSlice { |
| if !s.Contains(i) { |
| t.Errorf("Set is missing element: %v", i) |
| } |
| } |
| } |
| |
| // Test_ToSliceDeadlock - fixes issue: https://github.com/deckarep/golang-set/issues/36 |
| // This code reveals the deadlock however it doesn't happen consistently. |
| func Test_ToSliceDeadlock(t *testing.T) { |
| runtime.GOMAXPROCS(2) |
| |
| var wg sync.WaitGroup |
| set := NewSet[int]() |
| workers := 10 |
| wg.Add(workers) |
| for i := 1; i <= workers; i++ { |
| go func() { |
| for j := 0; j < 1000; j++ { |
| set.Add(1) |
| set.ToSlice() |
| } |
| wg.Done() |
| }() |
| } |
| wg.Wait() |
| } |
| |
| func Test_UnmarshalJSON(t *testing.T) { |
| s := []byte(`["test", "1", "2", "3"]`) //,["4,5,6"]]`) |
| expected := NewSet( |
| []string{ |
| string(json.Number("1")), |
| string(json.Number("2")), |
| string(json.Number("3")), |
| "test", |
| }..., |
| ) |
| |
| actual := NewSet[string]() |
| err := json.Unmarshal(s, actual) |
| if err != nil { |
| t.Errorf("Error should be nil: %v", err) |
| } |
| |
| if !expected.Equal(actual) { |
| t.Errorf("Expected no difference, got: %v", expected.Difference(actual)) |
| } |
| } |
| |
| func Test_MarshalJSON(t *testing.T) { |
| expected := NewSet( |
| []string{ |
| string(json.Number("1")), |
| "test", |
| }..., |
| ) |
| |
| b, err := json.Marshal( |
| NewSet( |
| []string{ |
| "1", |
| "test", |
| }..., |
| ), |
| ) |
| if err != nil { |
| t.Errorf("Error should be nil: %v", err) |
| } |
| |
| actual := NewSet[string]() |
| err = json.Unmarshal(b, actual) |
| if err != nil { |
| t.Errorf("Error should be nil: %v", err) |
| } |
| |
| if !expected.Equal(actual) { |
| t.Errorf("Expected no difference, got: %v", expected.Difference(actual)) |
| } |
| } |