This module contains minimal type-safe Ordered Map, Queue and Stack implementations using Go 1.18 generics.
See the available types by underlying storage
| Type | Slice | List | List+sync.Pool | List+int. pool | Recommended |
|---|---|---|---|---|---|
| OrderedMap | Y | Slice with size hint | |||
| Queue | Y | Y | Y | Y | Slice with size hint |
| Stack | Y | Y | Y | Y | Slice with size hint |
CAVEAT: All of these implementations are unsafe for concurrent execution, so they need protection in concurrency situations.
Generally speaking, in terms of performance:
- Slice > list+internal pool > plain List > list+sync.Pool
- Preallocated > not preallocated
See BENCHARKS.md for details.
See complete listings in:
om := orderedmap.NewSlice[Key,Value](sizeHint)
om.Store(k, v)
om.Range(func(k K, v V) bool { fmt.Println(k, v); return true })
v, loaded := om.Load(k)
if !loaded { fmt.Printf("No entry for key %v\n", k)}
om.Delete(k) // Idempotent: does not fail on nonexistent keys.q := queue.NewSliceQueue[Element](sizeHint)
q.Enqueue(e)
if lq, ok := q.(container.Countable); ok {
fmt.Printf("elements in queue: %d\n", lq.Len())
}
for i := 0; i < 2; i++ {
e, ok := q.Dequeue()
fmt.Printf("Element: %v, ok: %t\n", e, ok)
}s := stack.NewSliceStack[Element](sizeHint)
s.Push(e)
if ls, ok := s.(container.Countable); ok {
fmt.Printf("elements in stack: %d\n", ls.Len())
}
for i := 0; i < 2; i++ {
e, ok := s.Pop()
fmt.Printf("Element: %v, ok: %t\n", e, ok)
}The complete test coverage requires running not only the unit tests, but also the benchmarks, like:
go test -race -run=. -bench=. -coverprofile=cover.out -covermode=atomic ./...