Documentation
¶
Index ¶
- type HashMap
- func (m *HashMap[K, V]) ContainsKey(key K) bool
- func (m *HashMap[K, V]) Delete(key K)
- func (m *HashMap[K, V]) ForEach(f func(key K, value V) bool)
- func (m *HashMap[K, V]) Get(key K) (V, bool)
- func (m *HashMap[K, V]) IsEmpty() bool
- func (m *HashMap[K, V]) Keys() []K
- func (m *HashMap[K, V]) Len() int
- func (m *HashMap[K, V]) MustGet(key K) V
- func (m *HashMap[K, V]) Set(key K, value V)
- func (m *HashMap[K, V]) Values() []V
- type LinkedHashMap
- func (l *LinkedHashMap[K, V]) Clear()
- func (l *LinkedHashMap[K, V]) ContainsKey(key K) bool
- func (l *LinkedHashMap[K, V]) ForEach(f func(key K, value V) bool)
- func (l *LinkedHashMap[K, V]) Get(key K) (V, bool)
- func (l *LinkedHashMap[K, V]) IsEmpty() bool
- func (l *LinkedHashMap[K, V]) Keys() []K
- func (l *LinkedHashMap[K, V]) Len() int
- func (l *LinkedHashMap[K, V]) MustGet(key K) V
- func (l *LinkedHashMap[K, V]) Put(key K, value V)
- func (l *LinkedHashMap[K, V]) Remove(key K)
- func (l *LinkedHashMap[K, V]) Values() []V
- type TreeMap
- func (t *TreeMap[K, V]) Clear()
- func (t *TreeMap[K, V]) ContainsKey(key K) bool
- func (t *TreeMap[K, V]) ForEach(f func(key K, value V) bool)
- func (t *TreeMap[K, V]) Get(key K) (V, bool)
- func (t *TreeMap[K, V]) IsEmpty() bool
- func (t *TreeMap[K, V]) Keys() []K
- func (t *TreeMap[K, V]) Len() int
- func (t *TreeMap[K, V]) MustGet(key K) V
- func (t *TreeMap[K, V]) Put(key K, value V)
- func (t *TreeMap[K, V]) Remove(key K)
- func (t *TreeMap[K, V]) Values() []V
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type HashMap ¶
type HashMap[K comparable, V any] struct { // contains filtered or unexported fields }
func NewHashMap ¶
func NewHashMap[K comparable, V any]() *HashMap[K, V]
func (*HashMap[K, V]) ContainsKey ¶
type LinkedHashMap ¶
type LinkedHashMap[K comparable, V any] struct { K []K M map[K]V }
func NewLinkedHashMap ¶
func NewLinkedHashMap[K comparable, V any]() *LinkedHashMap[K, V]
func (*LinkedHashMap[K, V]) Clear ¶
func (l *LinkedHashMap[K, V]) Clear()
func (*LinkedHashMap[K, V]) ContainsKey ¶
func (l *LinkedHashMap[K, V]) ContainsKey(key K) bool
func (*LinkedHashMap[K, V]) ForEach ¶
func (l *LinkedHashMap[K, V]) ForEach(f func(key K, value V) bool)
func (*LinkedHashMap[K, V]) Get ¶
func (l *LinkedHashMap[K, V]) Get(key K) (V, bool)
func (*LinkedHashMap[K, V]) IsEmpty ¶
func (l *LinkedHashMap[K, V]) IsEmpty() bool
func (*LinkedHashMap[K, V]) Keys ¶
func (l *LinkedHashMap[K, V]) Keys() []K
func (*LinkedHashMap[K, V]) Len ¶
func (l *LinkedHashMap[K, V]) Len() int
func (*LinkedHashMap[K, V]) MustGet ¶
func (l *LinkedHashMap[K, V]) MustGet(key K) V
func (*LinkedHashMap[K, V]) Put ¶
func (l *LinkedHashMap[K, V]) Put(key K, value V)
func (*LinkedHashMap[K, V]) Remove ¶
func (l *LinkedHashMap[K, V]) Remove(key K)
func (*LinkedHashMap[K, V]) Values ¶
func (l *LinkedHashMap[K, V]) Values() []V
type TreeMap ¶
type TreeMap[K constraints.Ordered, V any] struct { K []K M map[K]V }
func NewTreeMap ¶
func NewTreeMap[K constraints.Ordered, V any]() *TreeMap[K, V]
func (*TreeMap[K, V]) ContainsKey ¶
Source Files
Click to show internal directories.
Click to hide internal directories.