MCPcopy
hub / github.com/cornelk/hashmap / TestInsert

Function TestInsert

hashmap_test.go:127–153  ·  view source on GitHub ↗
(t *testing.T)

Source from the content-addressed store, hash-verified

125}
126
127func TestInsert(t *testing.T) {
128 t.Parallel()
129 m := New[int, string]()
130 elephant := "elephant"
131 monkey := "monkey"
132
133 inserted := m.Insert(1, elephant)
134 assert.True(t, inserted)
135 value, ok := m.Get(1)
136 assert.True(t, ok)
137 assert.Equal(t, elephant, value)
138
139 inserted = m.Insert(1, monkey)
140 assert.False(t, inserted)
141 value, ok = m.Get(1)
142 assert.True(t, ok)
143 assert.Equal(t, elephant, value)
144
145 assert.Equal(t, 1, m.Len())
146
147 inserted = m.Insert(2, monkey)
148 assert.True(t, inserted)
149 assert.Equal(t, 2, m.Len())
150 value, ok = m.Get(2)
151 assert.True(t, ok)
152 assert.Equal(t, monkey, value)
153}
154
155func TestGetNonExistingItem(t *testing.T) {
156 t.Parallel()

Callers

nothing calls this directly

Calls 7

TrueFunction · 0.92
EqualFunction · 0.92
FalseFunction · 0.92
NewFunction · 0.85
InsertMethod · 0.80
GetMethod · 0.80
LenMethod · 0.45

Tested by

no test coverage detected

Used in the wild real call sites across dependent graphs

searching dependent graphs…