btree

Sep 6, 2023

Changes in this version

type BTree

+ func (tr *BTree) AscendHint(pivot any, iter func(item any) bool, hint *PathHint)

+ func (tr *BTree) AscendHintMut(pivot any, iter func(item any) bool, hint *PathHint)

+ func (tr *BTree) DescendHint(pivot any, iter func(item any) bool, hint *PathHint)

+ func (tr *BTree) DescendHintMut(pivot any, iter func(item any) bool, hint *PathHint)

type BTreeG

+ func (tr *BTreeG[T]) AscendHint(pivot T, iter func(item T) bool, hint *PathHint)

+ func (tr *BTreeG[T]) AscendHintMut(pivot T, iter func(item T) bool, hint *PathHint)

+ func (tr *BTreeG[T]) DescendHint(pivot T, iter func(item T) bool, hint *PathHint)

+ func (tr *BTreeG[T]) DescendHintMut(pivot T, iter func(item T) bool, hint *PathHint)

type Iter

+ func (iter *Iter) SeekHint(key any, hint *PathHint) bool

type IterG

+ func (iter *IterG[T]) SeekHint(key T, hint *PathHint) bool

Dec 8, 2022

Changes in this version

type BTree

+ func (tr *BTree) AscendMut(pivot any, iter func(item any) bool)

+ func (tr *BTree) DescendMut(pivot any, iter func(item any) bool)

+ func (tr *BTree) GetAtMut(index int) any

+ func (tr *BTree) GetHintMut(key any, hint *PathHint) any

+ func (tr *BTree) GetMut(key any) any

+ func (tr *BTree) IsoCopy() *BTree

+ func (tr *BTree) IterMut() Iter

+ func (tr *BTree) MaxMut() any

+ func (tr *BTree) MinMut() any

+ func (tr *BTree) WalkMut(iter func(items []any))

type BTreeG

+ func (tr *BTreeG[T]) AscendMut(pivot T, iter func(item T) bool)

+ func (tr *BTreeG[T]) DescendMut(pivot T, iter func(item T) bool)

+ func (tr *BTreeG[T]) GetAtMut(index int) (T, bool)

+ func (tr *BTreeG[T]) GetHintMut(key T, hint *PathHint) (value T, ok bool)

+ func (tr *BTreeG[T]) GetMut(key T) (T, bool)

+ func (tr *BTreeG[T]) IsoCopy() *BTreeG[T]

+ func (tr *BTreeG[T]) ItemsMut() []T

+ func (tr *BTreeG[T]) IterMut() IterG[T]

+ func (tr *BTreeG[T]) MaxMut() (T, bool)

+ func (tr *BTreeG[T]) MinMut() (T, bool)

+ func (tr *BTreeG[T]) ReverseMut(iter func(item T) bool)

+ func (tr *BTreeG[T]) ScanMut(iter func(item T) bool)

+ func (tr *BTreeG[T]) WalkMut(iter func(item []T) bool)

+ type IterG struct

+ func (iter *IterG[T]) First() bool

+ func (iter *IterG[T]) Item() T

+ func (iter *IterG[T]) Last() bool

+ func (iter *IterG[T]) Next() bool

+ func (iter *IterG[T]) Prev() bool

+ func (iter *IterG[T]) Release()

+ func (iter *IterG[T]) Seek(key T) bool

type Map

+ func (tr *Map[K, V]) AscendMut(pivot K, iter func(key K, value V) bool)

+ func (tr *Map[K, V]) DescendMut(pivot K, iter func(key K, value V) bool)

+ func (tr *Map[K, V]) GetAtMut(index int) (K, V, bool)

+ func (tr *Map[K, V]) GetMut(key K) (V, bool)

+ func (tr *Map[K, V]) IsoCopy() *Map[K, V]

+ func (tr *Map[K, V]) IterMut() MapIter[K, V]

+ func (tr *Map[K, V]) KeyValuesMut() ([]K, []V)

+ func (tr *Map[K, V]) MaxMut() (K, V, bool)

+ func (tr *Map[K, V]) MinMut() (K, V, bool)

+ func (tr *Map[K, V]) ReverseMut(iter func(key K, value V) bool)

+ func (tr *Map[K, V]) ScanMut(iter func(key K, value V) bool)

+ func (tr *Map[K, V]) ValuesMut() []V

type Set

+ func (tr *Set[K]) IsoCopy() *Set[K]

Nov 3, 2022

Changes in this version

type BTree

+ func NewOptions(less func(a, b any) bool, opts Options) *BTree

type Map

+ func NewMap(degree int) *Map[K, V]

type Options

+ Degree int

Sep 13, 2022

Changes in this version

type BTree

+ func (tr *BTree) Clear()

type BTreeG

+ func (tr *BTreeG[T]) Clear()

type Map

+ func (tr *Map[K, V]) Clear()

type Set

+ func (tr *Set[K]) Clear()

Aug 12, 2022

Changes in this version

+ type BTreeG struct

+ func NewBTreeG(less func(a, b T) bool) *BTreeG[T]

+ func NewBTreeGOptions(less func(a, b T) bool, opts Options) *BTreeG[T]

+ func (tr *BTreeG[T]) Ascend(pivot T, iter func(item T) bool)

+ func (tr *BTreeG[T]) Copy() *BTreeG[T]

+ func (tr *BTreeG[T]) Delete(key T) (T, bool)

+ func (tr *BTreeG[T]) DeleteAt(index int) (T, bool)

+ func (tr *BTreeG[T]) DeleteHint(key T, hint *PathHint) (T, bool)

+ func (tr *BTreeG[T]) Descend(pivot T, iter func(item T) bool)

+ func (tr *BTreeG[T]) Get(key T) (T, bool)

+ func (tr *BTreeG[T]) GetAt(index int) (T, bool)

+ func (tr *BTreeG[T]) GetHint(key T, hint *PathHint) (value T, ok bool)

+ func (tr *BTreeG[T]) Height() int

+ func (tr *BTreeG[T]) Items() []T

+ func (tr *BTreeG[T]) Iter() GenericIter[T]

+ func (tr *BTreeG[T]) Len() int

+ func (tr *BTreeG[T]) Less(a, b T) bool

+ func (tr *BTreeG[T]) Load(item T) (T, bool)

+ func (tr *BTreeG[T]) Max() (T, bool)

+ func (tr *BTreeG[T]) Min() (T, bool)

+ func (tr *BTreeG[T]) PopMax() (T, bool)

+ func (tr *BTreeG[T]) PopMin() (T, bool)

+ func (tr *BTreeG[T]) Reverse(iter func(item T) bool)

+ func (tr *BTreeG[T]) Scan(iter func(item T) bool)

+ func (tr *BTreeG[T]) Set(item T) (T, bool)

+ func (tr *BTreeG[T]) SetHint(item T, hint *PathHint) (prev T, replaced bool)

+ func (tr *BTreeG[T]) Walk(iter func(item []T) bool)

Apr 13, 2022

Changes in this version

type Map

+ func (tr *Map[K, V]) Copy() *Map[K, V]

type Set

+ func (tr *Set[K]) Copy() *Set[K]

+ func (tr *Set[K]) Keys() []K

Mar 15, 2022

Changes in this version

+ type Generic struct

+ func NewGeneric(less func(a, b T) bool) *Generic[T]

+ func NewGenericOptions(less func(a, b T) bool, opts Options) *Generic[T]

+ func (tr *Generic[T]) Ascend(pivot T, iter func(item T) bool)

+ func (tr *Generic[T]) Copy() *Generic[T]

+ func (tr *Generic[T]) Delete(key T) (T, bool)

+ func (tr *Generic[T]) DeleteAt(index int) (T, bool)

+ func (tr *Generic[T]) DeleteHint(key T, hint *PathHint) (T, bool)

+ func (tr *Generic[T]) Descend(pivot T, iter func(item T) bool)

+ func (tr *Generic[T]) Get(key T) (T, bool)

+ func (tr *Generic[T]) GetAt(index int) (T, bool)

+ func (tr *Generic[T]) GetHint(key T, hint *PathHint) (T, bool)

+ func (tr *Generic[T]) Height() int

+ func (tr *Generic[T]) Items() []T

+ func (tr *Generic[T]) Iter() GenericIter[T]

+ func (tr *Generic[T]) Len() int

+ func (tr *Generic[T]) Less(a, b T) bool

+ func (tr *Generic[T]) Load(item T) (T, bool)

+ func (tr *Generic[T]) Max() (T, bool)

+ func (tr *Generic[T]) Min() (T, bool)

+ func (tr *Generic[T]) PopMax() (T, bool)

+ func (tr *Generic[T]) PopMin() (T, bool)

+ func (tr *Generic[T]) Reverse(iter func(item T) bool)

+ func (tr *Generic[T]) Scan(iter func(item T) bool)

+ func (tr *Generic[T]) Set(item T) (T, bool)

+ func (tr *Generic[T]) SetHint(item T, hint *PathHint) (prev T, replaced bool)

+ func (tr *Generic[T]) Walk(iter func(item []T) bool)

+ type GenericIter struct

+ func (iter *GenericIter[T]) First() bool

+ func (iter *GenericIter[T]) Item() T

+ func (iter *GenericIter[T]) Last() bool

+ func (iter *GenericIter[T]) Next() bool

+ func (iter *GenericIter[T]) Prev() bool

+ func (iter *GenericIter[T]) Release()

+ func (iter *GenericIter[T]) Seek(key T) bool

+ type Map struct

+ func (tr *Map[K, V]) Ascend(pivot K, iter func(key K, value V) bool)

+ func (tr *Map[K, V]) Delete(key K) (V, bool)

+ func (tr *Map[K, V]) DeleteAt(index int) (K, V, bool)

+ func (tr *Map[K, V]) Descend(pivot K, iter func(key K, value V) bool)

+ func (tr *Map[K, V]) Get(key K) (V, bool)

+ func (tr *Map[K, V]) GetAt(index int) (K, V, bool)

+ func (tr *Map[K, V]) Height() int

+ func (tr *Map[K, V]) Iter() MapIter[K, V]

+ func (tr *Map[K, V]) KeyValues() ([]K, []V)

+ func (tr *Map[K, V]) Keys() []K

+ func (tr *Map[K, V]) Len() int

+ func (tr *Map[K, V]) Load(key K, value V) (V, bool)

+ func (tr *Map[K, V]) Max() (K, V, bool)

+ func (tr *Map[K, V]) Min() (K, V, bool)

+ func (tr *Map[K, V]) PopMax() (K, V, bool)

+ func (tr *Map[K, V]) PopMin() (K, V, bool)

+ func (tr *Map[K, V]) Reverse(iter func(key K, value V) bool)

+ func (tr *Map[K, V]) Scan(iter func(key K, value V) bool)

+ func (tr *Map[K, V]) Set(key K, value V) (V, bool)

+ func (tr *Map[K, V]) Values() []V

+ type MapIter struct

+ func (iter *MapIter[K, V]) First() bool

+ func (iter *MapIter[K, V]) Key() K

+ func (iter *MapIter[K, V]) Last() bool

+ func (iter *MapIter[K, V]) Next() bool

+ func (iter *MapIter[K, V]) Prev() bool

+ func (iter *MapIter[K, V]) Seek(key K) bool

+ func (iter *MapIter[K, V]) Value() V

+ type Options struct

+ NoLocks bool

+ type Set struct

+ func (tr *Set[K]) Ascend(pivot K, iter func(key K) bool)

+ func (tr *Set[K]) Contains(key K) bool

+ func (tr *Set[K]) Delete(key K)

+ func (tr *Set[K]) DeleteAt(index int) (K, bool)

+ func (tr *Set[K]) Descend(pivot K, iter func(key K) bool)

+ func (tr *Set[K]) GetAt(index int) (K, bool)

+ func (tr *Set[K]) Height() int

+ func (tr *Set[K]) Insert(key K)

+ func (tr *Set[K]) Iter() SetIter[K]

+ func (tr *Set[K]) Len() int

+ func (tr *Set[K]) Load(key K)

+ func (tr *Set[K]) Max() (K, bool)

+ func (tr *Set[K]) Min() (K, bool)

+ func (tr *Set[K]) PopMax() (K, bool)

+ func (tr *Set[K]) PopMin() (K, bool)

+ func (tr *Set[K]) Reverse(iter func(key K) bool)

+ func (tr *Set[K]) Scan(iter func(key K) bool)

+ type SetIter struct

+ func (iter *SetIter[K]) First() bool

+ func (iter *SetIter[K]) Key() K

+ func (iter *SetIter[K]) Last() bool

+ func (iter *SetIter[K]) Next() bool

+ func (iter *SetIter[K]) Prev() bool

+ func (iter *SetIter[K]) Seek(key K) bool

Dec 18, 2021

Changes in this version

type BTree

+ func (tr *BTree) Iter() Iter

+ type Iter struct

+ func (iter *Iter) First() bool

+ func (iter *Iter) Item() interface{}

+ func (iter *Iter) Last() bool

+ func (iter *Iter) Next() bool

+ func (iter *Iter) Prev() bool

+ func (iter *Iter) Release()

+ func (iter *Iter) Seek(key interface{}) bool

Jul 31, 2021

Changes in this version

type BTree

+ func NewNonConcurrent(less func(a, b interface{}) bool) *BTree

Apr 26, 2021

Changes in this version

type BTree

+ func (tr *BTree) DeleteAt(index int) interface{}

+ func (tr *BTree) GetAt(index int) interface{}

Feb 12, 2021

Changes in this version

type BTree

+ func (tr *BTree) Copy() *BTree

Oct 27, 2020

Changes in this version

+ type PathHint struct

Oct 26, 2020

Changes in this version

type BTree

+ func (tr *BTree) Less(a, b interface{}) bool

Oct 26, 2020

Changes in this version

type BTree

+ func (tr *BTree) DeleteHint(key interface{}, hint *uint64) interface{}

+ func (tr *BTree) GetHint(key interface{}, hint *uint64) interface{}

+ func (tr *BTree) Height() int

+ func (tr *BTree) Load(item interface{}) interface{}

+ func (tr *BTree) PopMax() interface{}

+ func (tr *BTree) PopMin() interface{}

+ func (tr *BTree) Set(item interface{}) (prev interface{})

+ func (tr *BTree) SetHint(item interface{}, hint *uint64) (prev interface{})

+ func (tr *BTree) Walk(iter func(item []interface{}))

Oct 29, 2019

Changes in this version

+ const DefaultFreeListSize

+ type BTree struct

+ func New(degree int, ctx interface{}) *BTree

+ func NewWithFreeList(degree int, f *FreeList, ctx interface{}) *BTree

+ func (t *BTree) Ascend(iterator ItemIterator)

+ func (t *BTree) AscendGreaterOrEqual(pivot Item, iterator ItemIterator)

+ func (t *BTree) AscendLessThan(pivot Item, iterator ItemIterator)

+ func (t *BTree) AscendRange(greaterOrEqual, lessThan Item, iterator ItemIterator)

+ func (t *BTree) Clone() (t2 *BTree)

+ func (t *BTree) Context() interface{}

+ func (t *BTree) Cursor() *Cursor

+ func (t *BTree) Delete(item Item) Item

+ func (t *BTree) DeleteMax() Item

+ func (t *BTree) DeleteMin() Item

+ func (t *BTree) Descend(iterator ItemIterator)

+ func (t *BTree) DescendGreaterThan(pivot Item, iterator ItemIterator)

+ func (t *BTree) DescendLessOrEqual(pivot Item, iterator ItemIterator)

+ func (t *BTree) DescendRange(lessOrEqual, greaterThan Item, iterator ItemIterator)

+ func (t *BTree) Get(key Item) Item

+ func (t *BTree) Has(key Item) bool

+ func (t *BTree) Len() int

+ func (t *BTree) Max() Item

+ func (t *BTree) Min() Item

+ func (t *BTree) ReplaceOrInsert(item Item) Item

+ func (t *BTree) SetContext(ctx interface{})

+ type Cursor struct

+ func (c *Cursor) First() Item

+ func (c *Cursor) Last() Item

+ func (c *Cursor) Next() Item

+ func (c *Cursor) Prev() Item

+ func (c *Cursor) Seek(pivot Item) Item

+ type FreeList struct

+ func NewFreeList(size int) *FreeList

+ type Int int

+ func (a Int) Less(b Item, ctx interface{}) bool

+ type Item interface

+ Less func(than Item, ctx interface{}) bool

+ type ItemIterator func(i Item) bool