dsgo

package module

v0.0.0-...-8cfa9df Latest Latest Go to latest Published: May 30, 2024 License: MIT Imports: 0 Imported by: 0

Details

Data structures for Go, with generics apis.

This section is empty.

View Source

var EmptyHolder = Empty{}

This section is empty.

type BidMap[K, V comparable] interface {
	Map[K, V]
	GetKey(value V) (key K, found bool)
	RemoveValue(value V)
}

type Cache[K comparable, V any] interface {
	Container[V]
	Put(key K, value V)
	Get(key K) (value V, found bool)
	Keys() []K
}

type Comparator[T any] func(a, b T) int

func Reverse[T any](cmp Comparator[T]) Comparator[T]

type Container[T any] interface {
	Len() int
	Empty() bool
	Values() []T
	Clear()
}

type Empty struct{}

type Map[K comparable, V any] interface {
	Cache[K, V]
	Remove(key K)
}

type Pair[K comparable, V any] struct {
	Key   K
	Value V
}

Pair holds a key-value item

type Set[T comparable] interface {
	Container[T]
	Add(elements ...T)
	Remove(elements ...T)
	Contains(elements ...T) bool
}

type Stack[T any] interface {
	Container[T]
	Push(value T)
	Pop() (value T, ok bool)
	Peek() (value T, ok bool)
}

Path	Synopsis
arraystack
bidmap
bitset BitSet is a fixed-size sequence of n bits.	BitSet is a fixed-size sequence of n bits.
hashset A hash set can store unique values, without any particular order.	A hash set can store unique values, without any particular order.
heap
heapx Package heapx is an advanced heap, which can remove or update any item in O(nlogn) time.	Package heapx is an advanced heap, which can remove or update any item in O(nlogn) time.
internal
heap Package heap is a generics version of "container/heap" in the standard library	Package heap is a generics version of "container/heap" in the standard library
lfucache
linkedstack
list Package list implements a doubly linked list.	Package list implements a doubly linked list.
listmap Package listmap is a map that preserves insertion-order.	Package listmap is a map that preserves insertion-order.
lrucache
queue A queue gives you a FIFO or first-in firs-out order.	A queue gives you a FIFO or first-in firs-out order.
redblacktree
ring Package ring implements operations on circular lists.	Package ring implements operations on circular lists.
ringbuffer
treemap Package treemap implements a map backed by red-black tree.	Package treemap implements a map backed by red-black tree.
treeset Package treeset implements a tree backed by a red-black tree.	Package treeset implements a tree backed by a red-black tree.
unionfind