containers

Documentation

Index

• type IDTable
  • func (id IDTable[T]) Assign(val T) uint64
  • func (id IDTable[T]) Delete(index uint64)
  • func (id IDTable[T]) Get(index uint64) (T, bool)
  • func (id IDTable[T]) Replace(index uint64, val T)
• type OrderedIDTable
  • func (id *OrderedIDTable[T]) Assign(val T) uint64
  • func (id *OrderedIDTable[T]) Delete(index uint64)
  • func (id *OrderedIDTable[T]) Get(index uint64) (T, bool)
  • func (id *OrderedIDTable[T]) Replace(index uint64, val T)
• type Table

Types

type IDTable

type IDTable[T any] map[uint64]T

IDTable is a map with random indexes for jobs and other cases where a random but unique index is required

func (IDTable[T]) Assign

func (id IDTable[T]) Assign(val T) uint64

Assign adds an object to the map and returns its assigned index

func (IDTable[T]) Delete

func (id IDTable[T]) Delete(index uint64)

func (IDTable[T]) Get

func (id IDTable[T]) Get(index uint64) (T, bool)

func (IDTable[T]) Replace

func (id IDTable[T]) Replace(index uint64, val T)

type OrderedIDTable

type OrderedIDTable[T any] struct {
	// contains filtered or unexported fields
}

OrderedIDTable is a map with incremental indexes, it's faster than IDTable by orders of magnitude, but will eventually run out of IDs (after 2^64 assignments)

func (*OrderedIDTable[T]) Assign

func (id *OrderedIDTable[T]) Assign(val T) uint64

func (*OrderedIDTable[T]) Delete

func (id *OrderedIDTable[T]) Delete(index uint64)

func (*OrderedIDTable[T]) Get

func (id *OrderedIDTable[T]) Get(index uint64) (T, bool)

func (*OrderedIDTable[T]) Replace

func (id *OrderedIDTable[T]) Replace(index uint64, val T)

type Table

type Table[T any] interface {
	Assign(T)
	Get(uint64) (T, bool)
}