linked

May 4, 2026

Changes in this version

+ func InsertAfter[T any](l *List[T], v T, location *ListElement[T])

+ func InsertBefore[T any](l *List[T], v T, location *ListElement[T])

+ func PushBack[T any](l *List[T], v T)

+ func PushFront[T any](l *List[T], v T)

+ type Hashmap struct

+ func NewHashmapWithSize[K comparable, V any](initialSize int) *Hashmap[K, V]

+ func NewHashmap[K comparable, V any]() *Hashmap[K, V]

+ func (lh *Hashmap[K, V]) Clear()

+ func (lh *Hashmap[K, V]) Delete(key K) bool

+ func (lh *Hashmap[K, V]) Get(key K) (V, bool)

+ func (lh *Hashmap[K, V]) Len() int

+ func (lh *Hashmap[K, V]) NewIterator() *Iterator[K, V]

+ func (lh *Hashmap[K, V]) Newest() (K, V, bool)

+ func (lh *Hashmap[K, V]) Oldest() (K, V, bool)

+ func (lh *Hashmap[K, V]) Put(key K, value V)

+ type Iterator struct

+ func (it *Iterator[K, V]) Key() K

+ func (it *Iterator[K, V]) Next() bool

+ func (it *Iterator[K, V]) Value() V

+ type List struct

+ func NewList[T any]() *List[T]

+ func (l *List[T]) Back() *ListElement[T]

+ func (l *List[T]) Front() *ListElement[T]

+ func (l *List[T]) InsertAfter(e *ListElement[T], location *ListElement[T])

+ func (l *List[T]) InsertBefore(e *ListElement[T], location *ListElement[T])

+ func (l *List[T]) MoveAfter(e, location *ListElement[T])

+ func (l *List[T]) MoveBefore(e, location *ListElement[T])

+ func (l *List[T]) MoveToBack(e *ListElement[T])

+ func (l *List[T]) MoveToFront(e *ListElement[T])

+ func (l *List[T]) PushBack(e *ListElement[T])

+ func (l *List[T]) PushFront(e *ListElement[T])

+ func (l *List[T]) Remove(e *ListElement[T])

+ func (l *List[_]) Len() int

+ type ListElement struct

+ Value T

+ func (e *ListElement[T]) Next() *ListElement[T]

+ func (e *ListElement[T]) Prev() *ListElement[T]