orderedmap

package

v1.0.6 Latest Latest Go to latest Published: Jan 6, 2025 License: MIT Imports: 0 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

type Entry[K comparable, V any] struct {
	Key   K
	Value V
}

type Map[K comparable, V any] struct {
	// contains filtered or unexported fields
}

Map is a generic data structure that maintains the order of keys.

func New[K comparable, V any]() *Map[K, V]

New creates a new Map.

func (om *Map[K, V]) Delete(key K)

Delete removes a key-value pair from the Map.

func (om *Map[K, V]) Each(cb func(key K, value V))

func (om *Map[K, V]) Entries() []Entry[K, V]

Entries returns the key-value pairs in the order they were added.

func (om *Map[K, V]) Get(key K) (V, bool)

Get retrieves a value by key.

func (om *Map[K, V]) Keys() []K

Keys returns the keys in the order they were added.

func (om *Map[K, V]) Set(key K, value V)

Set adds or updates a key-value pair in the Map.

func (om *Map[K, V]) Values() []V

Values returns the values in the order of their keys.