Versions in this module Expand all Collapse all v1 v1.0.1 Apr 10, 2022 v1.0.0 Mar 17, 2022 Changes in this version + type Hash interface + FindFirst func(hashValue HashedKeyValue) *T + FindNext func(prevResult *T) *T + GetKey func(obj *T) HashedKeyValue + Insert func(hashValue HashedKeyValue, obj *T) *T + IsContained func(obj *T) bool + Move func(obj *T, newHashValue HashedKeyValue) + Remove func(obj *T) *T + WalkFirst func() *T + WalkNext func(prevResult *T) *T + func NewHashDynamic[T any](linkField uintptr) Hash[T] + func NewHashStatic[T any](linkField uintptr, tableSize int) Hash[T] + type HashLink struct + type HashList interface + func NewHashListDynamic[T any](linkField uintptr) HashList[T] + func NewHashListStatic[T any](linkField uintptr, tableSize int) HashList[T] + type HashListLink struct + type HashListMap interface + RemoveAllByKey func(key TKey) + RemoveAllByUniqueKey func(key TKey) + func NewHashListMapDynamic[TKey HashMapKeyType, T any](linkField uintptr) HashListMap[TKey, T] + func NewHashListMapStatic[TKey HashMapKeyType, T any](linkField uintptr, tableSize int) HashListMap[TKey, T] + type HashListMapLink struct + type HashMap interface + FindFirst func(key TKey) *T + FindNext func(prevResult *T) *T + GetKey func(obj *T) TKey + Insert func(key TKey, obj *T) *T + IsContained func(obj *T) bool + Move func(obj *T, newKey TKey) + Remove func(obj *T) *T + RemoveAllByKey func(key TKey) + RemoveAllByUniqueKey func(key TKey) + WalkFirst func() *T + WalkNext func(prevResult *T) *T + func NewHashMapDynamic[TKey HashMapKeyType, T any](linkField uintptr) HashMap[TKey, T] + func NewHashMapStatic[TKey HashMapKeyType, T any](linkField uintptr, tableSize int) HashMap[TKey, T] + type HashMapKeyType interface + type HashMapLink struct + type HashedKeyValue uint64 + func HashKey[TKey HashMapKeyType](key TKey) HashedKeyValue + type List interface + Count func() int + First func() *T + InsertAfter func(prev, cur *T) *T + InsertBefore func(after, cur *T) *T + InsertFirst func(cur *T) *T + InsertLast func(cur *T) *T + IsContained func(cur *T) bool + IsEmpty func() bool + Last func() *T + MoveAfter func(dest, cur *T) + MoveBefore func(dest, cur *T) + MoveFirst func(cur *T) + MoveLast func(cur *T) + Next func(cur *T) *T + Position func(index int) *T + Prev func(cur *T) *T + Remove func(obj *T) *T + RemoveAll func() + RemoveFirst func() *T + RemoveLast func() *T + func NewList[T any](linkField uintptr) List[T] + type ListInterface interface + FindFirst func(key TKey) *T + FindNext func(prevResult *T) *T + First func() *T + GetKey func(obj *T) TKey + InsertAfter func(key TKey, prev, obj *T) *T + InsertBefore func(key TKey, after, obj *T) *T + InsertFirst func(key TKey, obj *T) *T + InsertLast func(key TKey, obj *T) *T + IsContained func(obj *T) bool + Last func() *T + Move func(obj *T, newKey TKey) + MoveAfter func(dest, obj *T) + MoveBefore func(dest, obj *T) + MoveFirst func(obj *T) + MoveLast func(obj *T) + Next func(cur *T) *T + Position func(index int) *T + Prev func(cur *T) *T + Remove func(obj *T) *T + RemoveAll func() + RemoveFirst func() *T + RemoveLast func() *T + type ListLink struct + type Map interface + Count func() int + Find func(key TKey) *T + FindFirst func(key TKey) *T + FindLowerExclusive func(key TKey) *T + FindLowerInclusive func(key TKey) *T + FindNext func(cur *T) *T + FindUpperExclusive func(key TKey) *T + FindUpperInclusive func(key TKey) *T + First func() *T + GetKey func(obj *T) TKey + GetPosition func(obj *T) int + Insert func(key TKey, obj *T) *T + IsContained func(obj *T) bool + IsEmpty func() bool + Last func() *T + Move func(obj *T, newKey TKey) + Next func(cur *T) *T + Position func(index int) *T + Prev func(cur *T) *T + Remove func(obj *T) *T + RemoveAll func() + RemoveFirst func() *T + RemoveLast func() *T + func NewMap[TKey MapKeyType, T any](linkField uintptr) Map[TKey, T] + type MapKeyType interface + type MapLink struct + type PriorityQueue interface + Count func() int + GetPriority func(entry *T) *P + Insert func(priority P, entry *T) *T + IsContained func(entry *T) bool + IsEmpty func() bool + Remove func(entry *T) *T + RemoveAll func() + RemoveTop func() *T + RemoveTopWithPriority func(priority P) *T + Top func() *T + TopWithPriority func(priority P) *T + func NewPriorityQueue[P PriorityType, T any](linkField uintptr) PriorityQueue[P, T] + type PriorityQueueLink struct + type PriorityType interface + type TableInterface interface + Count func() int + GetTableSize func() int + GetTableUsed func() int + IsEmpty func() bool + RemoveAll func() + Reserve func(count int)