bimap

package

v1.0.4 Latest Latest Go to latest Published: Jan 27, 2025 License: Apache-2.0 Imports: 0 Imported by: 0

Details

This section is empty.

This section is empty.

This section is empty.

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

func NewBiMap[K comparable, V comparable]() *BiMap[K, V]

NewBiMap returns a an empty, mutable, biMap

func (b *BiMap[K, V]) Delete(k K)

Delete removes a key-value pair from the BiMap for a given key. Returns if the key doesn't exist

func (b *BiMap[K, V]) DeleteInverse(v V)

DeleteInverse removes a key-value pair from the BiMap for a given value. Returns if the value doesn't exist

func (b *BiMap[K, V]) Exists(k K) bool

Exists checks whether or not a key exists in the BiMap

func (b *BiMap[K, V]) ExistsInverse(k V) bool

ExistsInverse checks whether or not a value exists in the BiMap

func (b *BiMap[K, V]) Get(k K) (V, bool)

Get returns the value for a given key in the BiMap and whether or not the element was present.

func (b *BiMap[K, V]) GetInverse(v V) (K, bool)

GetInverse returns the key for a given value in the BiMap and whether or not the element was present.

func (b *BiMap[K, V]) Insert(k K, v V)

Insert puts a key and value into the BiMap, and creates the reverse mapping from value to key.

func (b *BiMap[K, V]) Size() int

Size returns the number of elements in the bimap