()
| 6 | } |
| 7 | |
| 8 | func 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. |
no outgoing calls
searching dependent graphs…