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

avltree

package module

Go to main page

Versions in this module

v2

v2.1.1

Aug 17, 2023

v2.1.0

Aug 16, 2023

v2.0.4

Aug 16, 2023

v2.0.3

Aug 2, 2023

v2.0.2

Feb 4, 2023

v2.0.1

Oct 6, 2022

Changes in this version

+ const AllowDuplicates

+ func Print(t *Tree[T], w io.Writer, f func(T) bool, itemSiz int)

+ func PrintMap(m *Map[K, V], w io.Writer, f func(K, V) bool, itemSiz int)

+ type Map struct

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

+ func NewMapOrdered() *Map[K, V]

+ func (m *Map[K, V]) Add(k K, v V) (*V, bool)

+ func (m *Map[K, V]) At(index int) *Pair[K, V]

+ func (m *Map[K, V]) Cap() int

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

+ func (m *Map[K, V]) Do(f func(K, V) bool)

+ func (m *Map[K, V]) Find(key K) *V

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

+ func (m *Map[K, V]) Iter() <-chan Pair[K, V]

+ func (m *Map[K, V]) IterContext(ctx context.Context) <-chan Pair[K, V]

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

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

+ func (m *Map[K, V]) Remove(key K) *V

+ func (m *Map[K, V]) RemoveAt(index int) *Pair[K, V]

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

+ type Pair struct

+ Key K

+ Value V

+ type Tree struct

+ func New(c func(T, T) int, flags byte) *Tree[T]

+ func NewOrdered(flags byte) *Tree[T]

+ func (t *Tree[T]) Add(o T) (val *T, isDupe bool)

+ func (t *Tree[T]) At(index int) *T

+ func (t *Tree[T]) Cap() int

+ func (t *Tree[T]) Clear()

+ func (t *Tree[T]) Data() []T

+ func (t *Tree[T]) Do(f func(T) bool)

+ func (t *Tree[T]) Find(key T) *T

+ func (t *Tree[T]) Height() int

+ func (t *Tree[T]) Iter() <-chan T

+ func (t *Tree[T]) IterContext(ctx context.Context) <-chan T

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

+ func (t *Tree[T]) Remove(ptr T) *T

+ func (t *Tree[T]) RemoveAt(index int) *T

Other modules containing this package

github.com/ancientlore/go-avltree