Copy returns a new OrderedMap with the same elements. Using Copy while there are concurrent writes may mangle the result.

Copy returns a new OrderedMap with the same elements. Using Copy while there are concurrent writes may mangle the result.

Delete will remove a key from the map. It will return true if the key was removed (the key did exist).

Delete will remove a key from the map. It will return true if the key was removed (the key did exist).

Front returns the first element of list l or nil if the list is empty.

Front returns the first element of list l or nil if the list is empty.

Get returns the value for a key. If the key does not exist, the second return parameter will be false and the value will be nil.

Get returns the value for a key. If the key does not exist, the second return parameter will be false and the value will be nil.

GetElement returns the element for a key. If the key does not exist, the pointer will be nil.

GetElement returns the element for a key. If the key does not exist, the pointer will be nil.

GetOrDefault returns the value for a key. If the key does not exist, returns the default value instead.

GetOrDefault returns the value for a key. If the key does not exist, returns the default value instead.

GetOrDefault returns the value for a key. If the key does not exist, returns the default value instead.

Has checks if a key exists in the map.

Has checks if a key exists in the map.

Keys returns all of the keys in the order they were inserted. If a key was replaced it will retain the same position. To ensure most recently set keys

Keys returns an iterator that yields all the keys in the map starting at the front (oldest Set element). To create a slice containing all the map keys

NewOrderedMapWithCapacity creates a map with enough pre-allocated space to hold the specified number of elements.

NewOrderedMapWithCapacity creates a map with enough pre-allocated space to hold the specified number of elements.

Next returns the next list element or nil.

Prev returns the previous list element or nil.

PushFront inserts a new element e with value v at the front of list l and returns e.

PushFront inserts a new element e with value v at the front of list l and returns e.

PushFront inserts a new element e with value v at the front of list l and returns e.

Values returns an iterator that yields all the values in the map starting at the front (oldest Set element). To create a slice containing all the map