Documentation
¶
Index ¶
- func CompareOrdered[T cmp.Ordered](x, y T) bool
- type Comparer
- type Node
- type SymbolTable
- func (st *SymbolTable[K, V]) Add(key K, value V)
- func (st *SymbolTable[K, V]) Contains(key K) bool
- func (st *SymbolTable[K, V]) Count() int
- func (st *SymbolTable[K, V]) Empty() bool
- func (st *SymbolTable[K, V]) Keys() []K
- func (st *SymbolTable[K, V]) Remove(key K) bool
- func (st *SymbolTable[K, V]) TryGet(key K) (V, bool)
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func CompareOrdered ¶
Types ¶
type SymbolTable ¶
func NewSymbolTable ¶
func NewSymbolTable[K cmp.Ordered, V any](comparer Comparer[K]) *SymbolTable[K, V]
func (*SymbolTable[K, V]) Add ¶
func (st *SymbolTable[K, V]) Add(key K, value V)
func (*SymbolTable[K, V]) Contains ¶
func (st *SymbolTable[K, V]) Contains(key K) bool
func (*SymbolTable[K, V]) Count ¶
func (st *SymbolTable[K, V]) Count() int
func (*SymbolTable[K, V]) Empty ¶
func (st *SymbolTable[K, V]) Empty() bool
func (*SymbolTable[K, V]) Keys ¶
func (st *SymbolTable[K, V]) Keys() []K
func (*SymbolTable[K, V]) Remove ¶
func (st *SymbolTable[K, V]) Remove(key K) bool
func (*SymbolTable[K, V]) TryGet ¶
func (st *SymbolTable[K, V]) TryGet(key K) (V, bool)
Click to show internal directories.
Click to hide internal directories.