MCPcopy Create free account
hub / github.com/elliotchance/orderedmap / NewOrderedMap

Function NewOrderedMap

orderedmap.go:8–12  ·  view source on GitHub ↗
()

Source from the content-addressed store, hash-verified

6}
7
8func NewOrderedMap() *OrderedMap {
9 return &OrderedMap{
10 kv: make(map[interface{}]*Element),
11 }
12}
13
14// NewOrderedMapWithCapacity creates a map with enough pre-allocated space to
15// hold the specified number of elements.

Callers 15

TestNewOrderedMapFunction · 0.92
TestGetFunction · 0.92
TestSetFunction · 0.92
TestLenFunction · 0.92
TestKeysFunction · 0.92
TestDeleteFunction · 0.92
TestOrderedMap_FrontFunction · 0.92
TestOrderedMap_BackFunction · 0.92
TestOrderedMap_CopyFunction · 0.92
TestGetElementFunction · 0.92
TestOrderedMap_HasFunction · 0.92
benchmarkOrderedMap_SetFunction · 0.92

Calls

no outgoing calls

Tested by 15

TestNewOrderedMapFunction · 0.74
TestGetFunction · 0.74
TestSetFunction · 0.74
TestLenFunction · 0.74
TestKeysFunction · 0.74
TestDeleteFunction · 0.74
TestOrderedMap_FrontFunction · 0.74
TestOrderedMap_BackFunction · 0.74
TestOrderedMap_CopyFunction · 0.74
TestGetElementFunction · 0.74
TestOrderedMap_HasFunction · 0.74
benchmarkOrderedMap_SetFunction · 0.74

Used in the wild real call sites across dependent graphs

searching dependent graphs…