Version: v0.0.0-...-5b112dc Latest Latest

This package is not in the latest version of its module.

Go to latest
Published: May 26, 2021 License: BSD-3-Clause Imports: 11 Imported by: 0




View Source
const (
	RED   = 0
	BLACK = 1
View Source
const (
	LESS    = -1
	EQUAL   = 0


View Source
var DEBUG = true


func AssertAny

func AssertAny(t *testing.T, got interface{}, expected interface{}) bool

func AssertBool

func AssertBool(t *testing.T, got bool, expected bool) bool

func AssertInt

func AssertInt(t *testing.T, got int, expected int) bool

func AssertSize

func AssertSize(t *testing.T, got int, expected int) bool

func AssertString

func AssertString(t *testing.T, got string, expected string) bool

func AssertValue

func AssertValue(t *testing.T, got []byte, expected string) bool

func NewHashTree

func NewHashTree(shardCount int) *hashTree

NewHashTree returns a new sharded hash tree

func NewRBTree

func NewRBTree() *rbTree


type Entry

type Entry struct {
	Key   string
	Value []byte

Entry represents a key value pair for the ordered map. If the user decides to change any of this, take care to ensure you implement the Item interface properly in order to keep everything in working order.

func NewEntry1

func NewEntry1(key string, value string) Entry

func NewEntry2

func NewEntry2(key string, value string) Entry

func NewKey

func NewKey(key string) Entry

func (*Entry) Compare

func (e *Entry) Compare(that Entry) int

func (Entry) String

func (e Entry) String() string

type Iterator

type Iterator func(entry Entry) bool

type RBTree

type RBTree = rbTree

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
t or T : Toggle theme light dark auto
y or Y : Canonical URL