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

Trees

package

Go to main page

Versions in this module

v0

v0.6.0

Nov 10, 2024

v0.5.1

Aug 24, 2024

v0.5.0

Aug 11, 2024

Changes in this version

+ type CTree struct

+ Cmp func(T, T) int

+ func FromC[T any, S Indexable](vs []T, cmp func(T, T) int) *CTree[T, S]

+ func NewC[T any, S Indexable](hint S, cmp func(T, T) int) *CTree[T, S]

+ func (u *CTree) Clear(zero bool)

+ func (u *CTree) Compact()

+ func (u *CTree) InOrder(f func(*T) bool, st []S) []S

+ func (u *CTree) InOrderR(f func(*T) bool, st []S) []S

+ func (u *CTree) RankK(k S) *T

+ func (u *CTree) Size() S

+ func (u *CTree[T, S]) Add(v T, st []uintptr) (bool, []uintptr)

+ func (u *CTree[T, S]) Clone() *CTree[T, S]

+ func (u *CTree[T, S]) Del(v T, st []uintptr) (bool, []uintptr)

+ func (u *CTree[T, S]) Get(v T) *T

+ func (u *CTree[T, S]) Predecessor(v T, strict bool) (p *T)

+ func (u *CTree[T, S]) RankOf(v T) (S, bool)

+ func (u *CTree[T, S]) Successor(v T, strict bool) (p *T)

+ func (u *CTree[T, S]) Zero() (count S)

+ type Indexable interface

type Tree

+ func From[T cmp.Ordered, S Indexable](vs []T) *Tree[T, S]

+ func (u *Tree) Clear(zero bool)

+ func (u *Tree) Compact()

+ func (u *Tree) InOrderR(f func(*T) bool, st []S) []S

+ func (u *Tree) RankK(k S) *T

+ func (u *Tree[T, S]) Add(v T, st []uintptr) (bool, []uintptr)

+ func (u *Tree[T, S]) Clone() *Tree[T, S]

+ func (u *Tree[T, S]) Del(v T, st []uintptr) (bool, []uintptr)

+ func (u *Tree[T, S]) Get(v T) *T

v0.4.1

Feb 19, 2023

v0.4.0

Feb 14, 2023

Changes in this version

type CSBTree

+ func Build1(sli []T, lessThan, equals func(T, T) bool) *CSBTree[T, S]

+ func New1(lessThan, equals func(T, T) bool) *CSBTree[T, S]

type SBTree

+ func Build(sli []T) *SBTree[T, S]

+ func New() *SBTree[T, S]

v0.3.0

Jan 28, 2023

v0.2.0

Jan 10, 2023

Changes in this version

+ func Max(a, b T) T

+ func Min(a, b T) T

+ type CSBTree struct

+ func BuildCSBTree(sli []T) *CSBTree[T, S]

+ func MakeCSBTree() *CSBTree[T, S]

+ func (u *CSBTree) AverageDepth() uint

+ func (u *CSBTree) InOrder() func() (T, bool)

+ func (u *CSBTree) KLargest(k uint) (T, bool)

+ func (u *CSBTree) Maximum() (T, bool)

+ func (u *CSBTree) Minimum() (T, bool)

+ func (u *CSBTree) Print()

+ func (u *CSBTree) Size() uint

+ func (u *CSBTree[T, S]) Corrupt() bool

+ func (u *CSBTree[T, S]) Has(v T) bool

+ func (u *CSBTree[T, S]) Insert(v T) bool

+ func (u *CSBTree[T, S]) Predecessor(v T) (T, bool)

+ func (u *CSBTree[T, S]) RankOf(v T) uint

+ func (u *CSBTree[T, S]) Remove(v T) bool

+ func (u *CSBTree[T, S]) Successor(v T) (T, bool)

+ type InvalidSliceError struct

+ A interface{}

+ B interface{}

+ C interface{}

+ D interface{}

+ func (e *InvalidSliceError) Error() string

+ type Ordered interface

+ Equals func(other Ordered) bool

+ LessThan func(other Ordered) bool

+ type SBTree struct

+ func BuildSBTree(sli []T) *SBTree[T, S]

+ func MakeSBTree() *SBTree[T, S]

+ func (u *SBTree) AverageDepth() uint

+ func (u *SBTree) InOrder() func() (T, bool)

+ func (u *SBTree) KLargest(k uint) (T, bool)

+ func (u *SBTree) Maximum() (T, bool)

+ func (u *SBTree) Minimum() (T, bool)

+ func (u *SBTree) Print()

+ func (u *SBTree) Size() uint

+ func (u *SBTree[T, S]) Corrupt() bool

+ func (u *SBTree[T, S]) Has(v T) bool

+ func (u *SBTree[T, S]) Insert(v T) bool

+ func (u *SBTree[T, S]) Predecessor(v T) (T, bool)

+ func (u *SBTree[T, S]) RankOf(v T) uint

+ func (u *SBTree[T, S]) Remove(v T) bool

+ func (u *SBTree[T, S]) Successor(v T) (T, bool)

+ type Tree interface

+ AverageDepth func() uint

+ Corrupt func() bool

+ Has func(v T) bool

+ InOrder func() func() (T, bool)

+ Insert func(v T) bool

+ KLargest func(k uint) (T, bool)

+ Maximum func() (T, bool)

+ Minimum func() (T, bool)

+ Predecessor func(v T) (T, bool)

+ Print func()

+ RankOf func(v T) uint

+ Remove func(v T) bool

+ Size func() uint

+ Successor func(T) (T, bool)