README
¶
bimap-go
Bidirectional map written in Go.
Documentation: https://pkg.go.dev/github.com/antoniszymanski/bimap-go
Installation:
go get github.com/antoniszymanski/bimap-go
Documentation
¶
Index ¶
- type BiMap
- func (bm BiMap[K, V]) All() iter.Seq2[K, V]
- func (bm BiMap[K, V]) Clear()
- func (bm BiMap[K, V]) Clone() BiMap[K, V]
- func (bm BiMap[K, V]) Copy(dst BiMap[K, V])
- func (bm BiMap[K, V]) Delete(key K)
- func (bm BiMap[K, V]) DeleteFunc(del func(K, V) bool)
- func (bm BiMap[K, V]) DeleteInverse(val V)
- func (bm BiMap[K, V]) Equal(other BiMap[K, V]) bool
- func (bm BiMap[K, V]) EqualFunc(other BiMap[K, V], eq func(V, V) bool) bool
- func (bm BiMap[K, V]) Get(key K) V
- func (bm BiMap[K, V]) GetInverse(val V) K
- func (bm BiMap[K, V]) Has(key K) bool
- func (bm BiMap[K, V]) HasInverse(val V) bool
- func (bm BiMap[K, V]) Insert(seq iter.Seq2[K, V])
- func (bm BiMap[K, V]) Keys() iter.Seq[K]
- func (bm BiMap[K, V]) Lookup(key K) (V, bool)
- func (bm BiMap[K, V]) LookupInverse(val V) (K, bool)
- func (bm BiMap[K, V]) Reverse() BiMap[V, K]
- func (bm BiMap[K, V]) Set(key K, val V)
- func (bm BiMap[K, V]) Size() int
- func (bm BiMap[K, V]) Values() iter.Seq[V]
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type BiMap ¶
type BiMap[K, V comparable] struct { // contains filtered or unexported fields }
func From ¶
func From[K, V comparable](items map[K]V) BiMap[K, V]
func New ¶
func New[K, V comparable](size int) BiMap[K, V]
func (BiMap[K, V]) DeleteFunc ¶
func (BiMap[K, V]) DeleteInverse ¶
func (bm BiMap[K, V]) DeleteInverse(val V)
func (BiMap[K, V]) GetInverse ¶
func (bm BiMap[K, V]) GetInverse(val V) K
func (BiMap[K, V]) HasInverse ¶
func (BiMap[K, V]) LookupInverse ¶
Source Files
Click to show internal directories.
Click to hide internal directories.