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

odmap

package module

Go to main page

Versions in this module

v1

v1.0.0

Jan 20, 2024

v0

v0.6.0

Jan 20, 2024

v0.5.6

Jan 20, 2024

Changes in this version

+ type Entry struct

+ func (n *Entry[K, V]) Key() K

+ func (n *Entry[K, V]) Next() *Entry[K, V]

+ func (n *Entry[K, V]) Prev() *Entry[K, V]

+ func (n *Entry[K, V]) Value() V

v0.5.5

Jan 19, 2024

Changes in this version

+ const BLACK

+ const RED

+ type Color bool

+ type ConstBidIterator interface

+ Prev func() ConstBidIterator[T]

+ type ConstIterator interface

+ Clone func() ConstIterator[T]

+ Equal func(other ConstIterator[T]) bool

+ IsValid func() bool

+ Next func() ConstIterator[T]

+ Value func() T

+ type KVisitor func(key K, value V) bool

+ type Map interface

+ func New[K cmp.Ordered, V any](opts ...Option[K, V]) Map[K, V]

+ type Node struct

+ func (n *Node[K, V]) Key() K

+ func (n *Node[K, V]) Next() *Node[K, V]

+ func (n *Node[K, V]) Prev() *Node[K, V]

+ func (n *Node[K, V]) SetValue(val V)

+ func (n *Node[K, V]) Value() V

+ type Option func(m *omap[K, V])

+ func WithComparer[K cmp.Ordered, V any](comparer func(K, K) int) Option[K, V]

+ type RBTree struct

+ func NewRBTree[K cmp.Ordered, V any](comparer func(K, K) int) *RBTree[K, V]

+ func (t *RBTree[K, V]) Begin() *Node[K, V]

+ func (t *RBTree[K, V]) Clear()

+ func (t *RBTree[K, V]) Delete(node *Node[K, V])

+ func (t *RBTree[K, V]) Empty() bool

+ func (t *RBTree[K, V]) FindLowerBoundNode(key K) *Node[K, V]

+ func (t *RBTree[K, V]) FindNode(key K) *Node[K, V]

+ func (t *RBTree[K, V]) FindUpperBoundNode(key K) *Node[K, V]

+ func (t *RBTree[K, V]) First() *Node[K, V]

+ func (t *RBTree[K, V]) Insert(key K, value V)

+ func (t *RBTree[K, V]) IterFirst() *RBTreeIterator[K, V]

+ func (t *RBTree[K, V]) IterLast() *RBTreeIterator[K, V]

+ func (t *RBTree[K, V]) Last() *Node[K, V]

+ func (t *RBTree[K, V]) RBegin() *Node[K, V]

+ func (t *RBTree[K, V]) Size() int

+ func (t *RBTree[K, V]) Traversal(visitor KVisitor[K, V])

+ type RBTreeIterator struct

+ func NewIterator[K cmp.Ordered, V any](node *Node[K, V]) *RBTreeIterator[K, V]

+ func (iter *RBTreeIterator[K, V]) Clone() ConstIterator[V]

+ func (iter *RBTreeIterator[K, V]) Equal(other ConstIterator[V]) bool

+ func (iter *RBTreeIterator[K, V]) IsValid() bool

+ func (iter *RBTreeIterator[K, V]) Key() K

+ func (iter *RBTreeIterator[K, V]) Next() ConstIterator[V]

+ func (iter *RBTreeIterator[K, V]) Prev() ConstBidIterator[V]

+ func (iter *RBTreeIterator[K, V]) SetValue(val V) error

+ func (iter *RBTreeIterator[K, V]) Value() V

v0.5.1

Jan 18, 2024

v0.5.0

Jan 18, 2024

v0.2.0

Jul 27, 2023

v0.1.5

Jun 26, 2023

v0.1.0

Jun 12, 2023