(els ...*Element[K, V])
| 20 | } |
| 21 | |
| 22 | func NewOrderedMapWithElements[K comparable, V any](els ...*Element[K, V]) *OrderedMap[K, V] { |
| 23 | om := NewOrderedMapWithCapacity[K, V](len(els)) |
| 24 | for _, el := range els { |
| 25 | om.Set(el.Key, el.Value) |
| 26 | } |
| 27 | return om |
| 28 | } |
| 29 | |
| 30 | // Get returns the value for a key. If the key does not exist, the second return |
| 31 | // parameter will be false and the value will be nil. |
nothing calls this directly
no test coverage detected
searching dependent graphs…