Set will set (or replace) a value for a key. If the key was new, then true will be returned. The returned value will be false if the value was replace

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.

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

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

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

Has checks if a key exists in the map.

Len returns the number of elements in the map.

Front will return the element that is the first (oldest Set element). If there are no elements this will return nil.

Next returns the next list element or nil.

Back will return the element that is the last (most recent Set element). If there are no elements this will return nil.

Set will set (or replace) a value for a key. If the key was new, then true will be returned. The returned value will be false if the value was replace

Next returns the next list element or nil.

Front will return the element that is the first (oldest Set element). If there are no elements this will return nil.

Len returns the number of elements in the map.

ReplaceKey replaces an existing key with a new key while preserving order of the value. This function will return true if the operation was successful

ReplaceKey replaces an existing key with a new key while preserving order of the value. This function will return true if the operation was successful

Set will set (or replace) a value for a key. If the key was new, then true will be returned. The returned value will be false if the value was replace

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

Front will return the element that is the first (oldest Set element). If there are no elements this will return nil.

Len returns the number of elements in the map.

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

AllFromBack returns an iterator that yields all elements in the map starting at the back (most recent Set element).

AllFromFront returns an iterator that yields all elements in the map starting at the front (oldest Set element).

Back returns the last element of list l or nil if the list is empty.

Back will return the element that is the last (most recent Set element). If there are no elements this will return nil.

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

Prev returns the previous list element or nil.

Prev returns the previous list element or nil.

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

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

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

Remove removes e from its list

Remove removes e from its list

Remove removes e from its list