Function TestInsertOrderedMap_Quick

pkg/container/insert_ordered_map_test.go:42–118

(t *testing.T)

}

func TestInsertOrderedMap_Quick(t *testing.T) {
	err := quick.Check(func(keys []int) bool {
		if len(keys) < 1 {
			// We need some keys to test with.
			return true
		}

		m := NewInsertOrderedMap[int, int]()
		for _, k := range keys {
			m.Insert(k, k)
		}

		// Update the keys in random order. This does not affect the
		// iteration order.
		randomized := slices.Clone(keys)
		rand.Shuffle(len(randomized), func(i, j int) {
			randomized[i], randomized[j] = randomized[j], randomized[i]
		})
		for _, k := range randomized {
			m.Insert(k, k*2)
		}
		keysCopy := slices.Clone(keys)
		numUnique := 0
		for k, v := range m.All() {
			numUnique++
			expected := keys[0]
			keys = keys[1:]
			if k != expected || v != expected*2 {
				t.Logf("Unexpected order or value: key=%v (expected %v), value=%v (expected %v)",
					k, expected, v, expected*2)
				return false
			}

			v, found := m.Get(k)
			if !found {
				t.Logf("%v not found", k)
				return false
			}
			if v != k*2 {
				t.Logf("value %v not the expected %v", v, k*2)
			}
		}
		if m.Len() != numUnique {
			t.Logf("Len() returned %d, expected %d", m.Len(), numUnique)
			return false
		}
		keys = keysCopy

		// Delete a random key. Ordering should not be affected and all keys are found.
		if !m.Delete(randomized[0]) {
			t.Logf("Delete did not return true")
		}
		for i, k := range keys {
			if k == randomized[0] {
				keys = slices.Delete(keys, i, i+1)
				break
			}
		}