Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security Policy
  
  How Go can help keep you secure by default
Learn
Docs
- Effective Go
  
  Tips for writing clear, performant, and idiomatic Go code
- Go User Manual
  
  A complete introduction to building software with Go
- Standard library
  
  Reference documentation for Go's standard library
- Release Notes
  
  Learn what's new in each Go release
Packages
Community
- Recorded Talks
  
  Videos from prior events
- Meetups
  
  Meet other local Go developers
- Conferences
  
  Learn and network with Go developers from around the world
- Go blog
  
  The Go project's official blog.
- Go project
  
  Get help and stay informed from Go
- Get connected

btree

package module

Go to main page

Versions in this module

v1

v1.1.3

Aug 21, 2024

v1.1.2

Jun 15, 2022

v1.1.1

Jun 4, 2022

v1.1.0

Jun 4, 2022

Changes in this version

+ type BTreeG struct

+ func NewG(degree int, less LessFunc[T]) *BTreeG[T]

+ func NewOrderedG(degree int) *BTreeG[T]

+ func NewWithFreeListG(degree int, less LessFunc[T], f *FreeListG[T]) *BTreeG[T]

+ func (t *BTreeG[T]) Ascend(iterator ItemIteratorG[T])

+ func (t *BTreeG[T]) AscendGreaterOrEqual(pivot T, iterator ItemIteratorG[T])

+ func (t *BTreeG[T]) AscendLessThan(pivot T, iterator ItemIteratorG[T])

+ func (t *BTreeG[T]) AscendRange(greaterOrEqual, lessThan T, iterator ItemIteratorG[T])

+ func (t *BTreeG[T]) Clear(addNodesToFreelist bool)

+ func (t *BTreeG[T]) Clone() (t2 *BTreeG[T])

+ func (t *BTreeG[T]) Delete(item T) (T, bool)

+ func (t *BTreeG[T]) DeleteMax() (T, bool)

+ func (t *BTreeG[T]) DeleteMin() (T, bool)

+ func (t *BTreeG[T]) Descend(iterator ItemIteratorG[T])

+ func (t *BTreeG[T]) DescendGreaterThan(pivot T, iterator ItemIteratorG[T])

+ func (t *BTreeG[T]) DescendLessOrEqual(pivot T, iterator ItemIteratorG[T])

+ func (t *BTreeG[T]) DescendRange(lessOrEqual, greaterThan T, iterator ItemIteratorG[T])

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

+ func (t *BTreeG[T]) Has(key T) bool

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

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

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

+ func (t *BTreeG[T]) ReplaceOrInsert(item T) (_ T, _ bool)

+ type FreeListG struct

+ func NewFreeListG(size int) *FreeListG[T]

+ type ItemIteratorG func(item T) bool

+ type LessFunc func(a, b T) bool

+ func Less() LessFunc[T]

+ type Ordered interface

v1.0.1

Oct 16, 2019

v1.0.0

Aug 13, 2018

Changes in this version

+ const DefaultFreeListSize

+ type BTree struct

+ func New(degree int) *BTree

+ func NewWithFreeList(degree int, f *FreeList) *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) Clear(addNodesToFreelist bool)

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

+ 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

+ type FreeList struct

+ func NewFreeList(size int) *FreeList

+ type Int int

+ func (a Int) Less(b Item) bool

+ type Item interface

+ Less func(than Item) bool

+ type ItemIterator func(i Item) bool