slowtable

package module

v1.2.1 Latest Latest Go to latest Published: Nov 24, 2021 License: MIT Imports: 6 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Slow and non-optimized hash table

This section is empty.

This section is empty.

This section is empty.

type Table struct {
	// contains filtered or unexported fields
}

func NewTable(hash func([]byte) uint64, keysize uint64) *Table

NewTable : Create a new table hash : xxHash64 (default) if hash == nil keysize : The number of keys in the table (recommended: 65536)

func (t *Table) Clear()

Clear : Clear the table Note: This function drops all the items in the table (GC overhead) No Pooling

func (t *Table) CompareAndSwap(key []byte, old, new unsafe.Pointer) bool

func (t *Table) Delete(key []byte)

Delete : Delete the item from the table Thread safe

func (t *Table) DeleteS(key string)

DeleteS : Delete the item from the table Thread safe

func (t *Table) Exists(key []byte) bool

func (t *Table) Get(key []byte) (unsafe.Pointer, bool)

Get : Get the value for the given key Thread safe

func (t *Table) GetS(key string) (unsafe.Pointer, bool)

GetS : Get the value for the given key(String) Thread safe

func (t *Table) PoolPreload()

func (t *Table) Set(key []byte, val unsafe.Pointer)

Set : Set the value for the given key Thread safe

func (t *Table) SetS(key string, val unsafe.Pointer)

SetS : Set the value for the given key(String) Thread safe