Function TestConcurrentInsertDelete

hashmap_test.go:405–454

(t *testing.T)

}

func TestConcurrentInsertDelete(t *testing.T) {
	t.Parallel()

	for i := 0; i < 200; i++ {
		el1 := &ListElement[int, int]{
			key:     111,
			keyHash: 111,
		}
		el2 := &ListElement[int, int]{
			key:     222,
			keyHash: 222,
		}
		el3 := &ListElement[int, int]{
			key:     333,
			keyHash: 333,
		}
		newIl := &ListElement[int, int]{
			key:     223,
			keyHash: 223,
		}
		l := NewList[int, int]()
		l.Add(nil, el1.keyHash, el1.key, 111)
		l.Add(nil, el2.keyHash, el2.key, 222)
		l.Add(nil, el3.keyHash, el3.key, 333)
		wg := sync.WaitGroup{}
		wg.Add(2)

		go func() {
			rand.Seed(int64(time.Now().Nanosecond()))
			time.Sleep(time.Duration(rand.Intn(10)))
			l.Delete(el2)
			wg.Done()
		}()
		go func() {
			defer wg.Done()
			rand.Seed(int64(time.Now().Nanosecond()))
			time.Sleep(time.Duration(rand.Intn(10)))
			for {
				if _, _, inserted := l.Add(nil, newIl.keyHash, newIl.key, 223); inserted {
					return
				}
			}
		}()
		wg.Wait()

		assert.Equal(t, 3, l.Len())
		_, found, _ := l.search(nil, newIl.keyHash, newIl.key)
		assert.True(t, found != nil)
	}
}