The highest tagged major version is
Documentation
¶
Index ¶
- type Entry
- type SetMap
- func (m *SetMap[K, V]) DeleteKey(key K) (set.Set[V], bool)
- func (m *SetMap[K, V]) DeleteOverlapping(set set.Set[V]) []Entry[K, V]
- func (m *SetMap[K, V]) DeleteValue(val V) (K, set.Set[V], bool)
- func (m *SetMap[K, V]) GetKey(val V) (K, bool)
- func (m *SetMap[K, V]) GetSet(key K) (set.Set[V], bool)
- func (m *SetMap[K, _]) HasKey(key K) bool
- func (m *SetMap[_, V]) HasOverlap(set set.Set[V]) bool
- func (m *SetMap[_, V]) HasValue(val V) bool
- func (m *SetMap[K, V]) Len() int
- func (m *SetMap[K, V]) LenValues() int
- func (m *SetMap[K, V]) Put(key K, set set.Set[V]) []Entry[K, V]
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type SetMap ¶
type SetMap[K, V comparable] struct { // contains filtered or unexported fields }
SetMap is a map to a set where all sets are non-overlapping.
func (*SetMap[K, V]) DeleteKey ¶
DeleteKey removes [key] from the map and returns the set it mapped to.
func (*SetMap[K, V]) DeleteOverlapping ¶
DeleteOverlapping removes and returns all the entries where the set overlaps with set.
func (*SetMap[K, V]) DeleteValue ¶
DeleteValue removes and returns the entry that contained [val].
func (*SetMap[_, V]) HasOverlap ¶
HasOverlap returns true if set overlaps with any of the sets in the map.
Source Files
Click to show internal directories.
Click to hide internal directories.