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

tree

package

Go to main page

Versions in this module

v1

v1.6.0

Oct 27, 2023

v1.5.0

Apr 29, 2023

Changes in this version

type Tree

+ func Map(t Tree[T], f func(v T) U) (out Tree[U])

v1.4.0

Sep 7, 2022

Changes in this version

+ type Iterator interface

+ Next func() bool

+ Value func() T

+ func Empty() Iterator[T]

v1.3.0

Sep 7, 2022

v1.2.0

Aug 7, 2022

v1.1.0

Jul 18, 2022

v1.0.0

May 8, 2022

v0

v0.21.0

May 8, 2022

Changes in this version

+ func UseLHS(a, _ T) T

+ func UseRHS(_, b T) T

+ type Builder struct

+ func NewBuilder(capacity int) *Builder[T]

+ func (b *Builder[T]) Add(v T)

+ func (b *Builder[T]) Borrow() Tree[T]

+ func (b *Builder[T]) Count() int

+ func (b *Builder[T]) Finish() Tree[T]

+ func (b *Builder[T]) Get(el T) *T

+ func (b *Builder[T]) Remove(v T)

+ func (b Builder[T]) Format(state fmt.State, verb rune)

+ func (b Builder[T]) String() string

+ type CombineArgs struct

+ func DefaultNPCombineArgs() *CombineArgs[T]

+ func DefaultNPKeyCombineArgs() *CombineArgs[T]

+ func NewCombineArgs(ea *EqArgs[T], combine func(a, b T) T) *CombineArgs[T]

+ func (a *CombineArgs[T]) Flip() *CombineArgs[T]

+ type EqArgs struct

+ func DefaultNPEqArgs() *EqArgs[T]

+ func DefaultNPKeyEqArgs() *EqArgs[T]

+ func NewDefaultEqArgs(gauge depth.Gauge) *EqArgs[T]

+ func NewDefaultKeyEqArgs(gauge depth.Gauge) *EqArgs[T]

+ func NewEqArgs(gauge depth.Gauge, eq func(a, b T) bool, hash func(a T, seed uintptr) uintptr) *EqArgs[T]

+ type Less func(a, b T) bool

+ type NodeArgs struct

+ func NewNodeArgs(gauge depth.Gauge) NodeArgs

+ type Tree struct

+ func TreeMap(t Tree[T], f func(v T) U) (out Tree[U])

+ func (t Tree[T]) Combine(args *CombineArgs[T], u Tree[T]) (out Tree[T])

+ func (t Tree[T]) Count() int

+ func (t Tree[T]) Difference(gauge depth.Gauge, u Tree[T]) (out Tree[T])

+ func (t Tree[T]) Equal(args *EqArgs[T], u Tree[T]) bool

+ func (t Tree[T]) Format(f fmt.State, verb rune)

+ func (t Tree[T]) Gauge() depth.Gauge

+ func (t Tree[T]) Get(v T) *T

+ func (t Tree[T]) Intersection(gauge depth.Gauge, u Tree[T]) (out Tree[T])

+ func (t Tree[T]) Iterator() iterator.Iterator[T]

+ func (t Tree[T]) OrderedIterator(less Less[T], n int) iterator.Iterator[T]

+ func (t Tree[T]) Reduce(args NodeArgs, r func(values ...T) T) (_ T, _ bool)

+ func (t Tree[T]) String() string

+ func (t Tree[T]) SubsetOf(gauge depth.Gauge, u Tree[T]) bool

+ func (t Tree[T]) Vet()

+ func (t Tree[T]) Where(args *WhereArgs[T]) (out Tree[T])

+ func (t Tree[T]) With(v T) (out Tree[T])

+ func (t Tree[T]) Without(v T) (out Tree[T])

+ type WhereArgs struct

+ Pred func(elem T) bool