Why Go
- Case Studies
  
  Common problems companies solve with Go
- Use Cases
  
  Stories about how and why companies use Go
- Security
  
  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
- API
  
  Reference documentation for the pkg.go.dev API
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

orderedbtree

package module

Go to main page

Versions in this module

v1

v1.1.0

Aug 19, 2026

v1.0.9

Aug 18, 2026

v1.0.8

Aug 17, 2026

v1.0.7

Aug 13, 2026

v1.0.6

Aug 13, 2026

v1.0.5

Aug 12, 2026

v1.0.4

Aug 11, 2026

retracted

v1.0.3

Aug 7, 2026

retracted

v1.0.2

Jul 21, 2026

retracted

v1.0.1

Jul 21, 2026

retracted

Changes in this version

+ const DefaultFreeListSize

+ var DefaultFreeAllocation = 1

+ type BTree BTreeG[Item]

+ 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 BTreeG struct

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

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

+ func NewWithFreeListG[T any](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 FreeList FreeListG[Item]

+ func NewFreeList(size int) *FreeList

+ type FreeListG struct

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

+ type Int int

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

+ type Item interface

+ Less func(than Item) bool

+ type ItemIterator ItemIteratorG[Item]

+ type ItemIteratorG func(item T) bool

+ type LessFunc func(a, b T) bool

+ func Less[T Ordered]() LessFunc[T]

+ type Ordered interface