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
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

v0

v0.4.0

Apr 6, 2026

Changes in this version

type Map

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

+ func (m *Map[K, V]) ContainsAll(keys iter.Seq[K]) bool

+ func (m *Map[K, V]) DeleteAll(keys iter.Seq[K]) bool

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

+ func (m *Map[K, V]) SetAll(seq iter.Seq2[K, V]) bool

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

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

type ORange

+ func (r ORange[K, V]) Above(lo K) ORange[K, V]

+ func (r ORange[K, V]) From(lo K) ORange[K, V]

+ func (r ORange[K, V]) Keys() iter.Seq[K]

+ func (r ORange[K, V]) Values() iter.Seq[V]

type Range

+ func (r Range[K, V]) Above(lo K) Range[K, V]

+ func (r Range[K, V]) From(lo K) Range[K, V]

+ func (r Range[K, V]) Keys() iter.Seq[K]

+ func (r Range[K, V]) Values() iter.Seq[V]

v0.3.0

Mar 14, 2026

Changes in this version

type Map

+ func (m *Map[K, V]) Set(key K, val V) (old V, added bool)

+ type OMap struct

+ func (m *OMap[K, V]) Above(lo K) ORange[K, V]

+ func (m *OMap[K, V]) All() iter.Seq2[K, V]

+ func (m *OMap[K, V]) At(key K) V

+ func (m *OMap[K, V]) Backward() iter.Seq2[K, V]

+ func (m *OMap[K, V]) Below(hi K) ORange[K, V]

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

+ func (m *OMap[K, V]) Clone() *OMap[K, V]

+ func (m *OMap[K, V]) Delete(key K) bool

+ func (m *OMap[K, V]) From(lo K) ORange[K, V]

+ func (m *OMap[K, V]) Get(key K) (V, bool)

+ func (m *OMap[K, V]) Index(key K) int

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

+ func (m *OMap[K, V]) Max() (K, V, bool)

+ func (m *OMap[K, V]) Min() (K, V, bool)

+ func (m *OMap[K, V]) Nth(i int) (K, V)

+ func (m *OMap[K, V]) Set(key K, val V) (old V, added bool)

+ func (m *OMap[K, V]) To(hi K) ORange[K, V]

+ type ORange struct

+ func (r ORange[K, V]) All() iter.Seq2[K, V]

+ func (r ORange[K, V]) Backward() iter.Seq2[K, V]

+ func (r ORange[K, V]) Below(hi K) ORange[K, V]

+ func (r ORange[K, V]) Clear()

+ func (r ORange[K, V]) Clone() *OMap[K, V]

+ func (r ORange[K, V]) Index(key K) int

+ func (r ORange[K, V]) Len() int

+ func (r ORange[K, V]) Max() (K, V, bool)

+ func (r ORange[K, V]) Min() (K, V, bool)

+ func (r ORange[K, V]) Nth(i int) (K, V)

+ func (r ORange[K, V]) To(hi K) ORange[K, V]

v0.2.0

Mar 7, 2026

Changes in this version

+ type Map struct

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

+ func (m *Map[K, V]) Above(lo K) Range[K, V]

+ func (m *Map[K, V]) All() iter.Seq2[K, V]

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

+ func (m *Map[K, V]) Backward() iter.Seq2[K, V]

+ func (m *Map[K, V]) Below(hi K) Range[K, V]

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

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

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

+ func (m *Map[K, V]) From(lo K) Range[K, V]

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

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

+ func (m *Map[K, V]) Insert(key K, val V) (old V, added bool)

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

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

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

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

+ func (m *Map[K, V]) To(hi K) Range[K, V]

+ type OrderedMap struct

+ func (m *OrderedMap[K, V]) Above(lo K) OrderedRange[K, V]

+ func (m *OrderedMap[K, V]) All() iter.Seq2[K, V]

+ func (m *OrderedMap[K, V]) At(key K) V

+ func (m *OrderedMap[K, V]) Backward() iter.Seq2[K, V]

+ func (m *OrderedMap[K, V]) Below(hi K) OrderedRange[K, V]

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

+ func (m *OrderedMap[K, V]) Clone() *OrderedMap[K, V]

+ func (m *OrderedMap[K, V]) Delete(key K) bool

+ func (m *OrderedMap[K, V]) From(lo K) OrderedRange[K, V]

+ func (m *OrderedMap[K, V]) Get(key K) (V, bool)

+ func (m *OrderedMap[K, V]) Index(key K) int

+ func (m *OrderedMap[K, V]) Insert(key K, val V) (old V, added bool)

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

+ func (m *OrderedMap[K, V]) Max() (K, V, bool)

+ func (m *OrderedMap[K, V]) Min() (K, V, bool)

+ func (m *OrderedMap[K, V]) Nth(i int) (K, V)

+ func (m *OrderedMap[K, V]) To(hi K) OrderedRange[K, V]

+ type OrderedRange struct

+ func (r OrderedRange[K, V]) All() iter.Seq2[K, V]

+ func (r OrderedRange[K, V]) Backward() iter.Seq2[K, V]

+ func (r OrderedRange[K, V]) Below(hi K) OrderedRange[K, V]

+ func (r OrderedRange[K, V]) Clear()

+ func (r OrderedRange[K, V]) Clone() *OrderedMap[K, V]

+ func (r OrderedRange[K, V]) Index(key K) int

+ func (r OrderedRange[K, V]) Len() int

+ func (r OrderedRange[K, V]) Max() (K, V, bool)

+ func (r OrderedRange[K, V]) Min() (K, V, bool)

+ func (r OrderedRange[K, V]) Nth(i int) (K, V)

+ func (r OrderedRange[K, V]) To(hi K) OrderedRange[K, V]

+ type Range struct

+ func (r Range[K, V]) All() iter.Seq2[K, V]

+ func (r Range[K, V]) Backward() iter.Seq2[K, V]

+ func (r Range[K, V]) Below(hi K) Range[K, V]

+ func (r Range[K, V]) Clear()

+ func (r Range[K, V]) Clone() *Map[K, V]

+ func (r Range[K, V]) Index(key K) int

+ func (r Range[K, V]) Len() int

+ func (r Range[K, V]) Max() (K, V, bool)

+ func (r Range[K, V]) Min() (K, V, bool)

+ func (r Range[K, V]) Nth(i int) (K, V)

+ func (r Range[K, V]) To(hi K) Range[K, V]