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

ordered

package

Go to main page

Versions in this module

v0

v0.0.6

Feb 24, 2023

v0.0.5

Dec 29, 2022

Changes in this version

type Map

+ func (s Map[K, V]) StableSort(less slice.Less[K]) Map[K, V]

type Set

+ func (s Set[T]) StableSort(less slice.Less[T]) Set[T]

v0.0.4

Dec 10, 2022

v0.0.3

Nov 26, 2022

v0.0.2

Jul 20, 2022

v0.0.1

Mar 17, 2022

Changes in this version

+ type Map struct

+ func ConvertKVsToMap(elements []c.KV[K, V]) Map[K, V]

+ func NewMap(elements map[K]V) Map[K, V]

+ func WrapMap(order []K, elements map[K]V) Map[K, V]

+ func (s Map[K, V]) Begin() c.KVIterator[K, V]

+ func (s Map[K, V]) Collect() map[K]V

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

+ func (s Map[K, V]) Filter(filter c.BiPredicate[K, V]) c.MapPipe[K, V, map[K]V]

+ func (s Map[K, V]) FilterKey(fit c.Predicate[K]) c.MapPipe[K, V, map[K]V]

+ func (s Map[K, V]) FilterValue(fit c.Predicate[V]) c.MapPipe[K, V, map[K]V]

+ func (s Map[K, V]) First() (it.OrderedKV[K, V], K, V, bool)

+ func (s Map[K, V]) For(walker func(c.KV[K, V]) error) error

+ func (s Map[K, V]) ForEach(walker func(c.KV[K, V]))

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

+ func (s Map[K, V]) Head() it.OrderedKV[K, V]

+ func (s Map[K, V]) IsEmpty() bool

+ func (s Map[K, V]) K() MapKeys[K]

+ func (s Map[K, V]) Keys() c.Collection[K, []K, c.Iterator[K]]

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

+ func (s Map[K, V]) Map(by c.BiConverter[K, V, K, V]) c.MapPipe[K, V, map[K]V]

+ func (s Map[K, V]) MapKey(by c.Converter[K, K]) c.MapPipe[K, V, map[K]V]

+ func (s Map[K, V]) MapValue(by c.Converter[V, V]) c.MapPipe[K, V, map[K]V]

+ func (s Map[K, V]) Reduce(by op.Quaternary[K, V]) (K, V)

+ func (s Map[K, V]) Sort(less func(k1, k2 K) bool) Map[K, V]

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

+ func (s Map[K, V]) Tail() it.OrderedKV[K, V]

+ func (s Map[K, V]) Track(tracker func(K, V) error) error

+ func (s Map[K, V]) TrackEach(tracker func(K, V))

+ func (s Map[K, V]) V() MapValues[K, V]

+ func (s Map[K, V]) Values() c.Collection[V, []V, c.Iterator[V]]

+ type MapKeys struct

+ func WrapKeys(elements []T) MapKeys[T]

+ func (s MapKeys[T]) Begin() c.Iterator[T]

+ func (s MapKeys[T]) Collect() []T

+ func (s MapKeys[T]) Filter(filter c.Predicate[T]) c.Pipe[T, []T]

+ func (s MapKeys[T]) First() (it.Iter[T], T, bool)

+ func (s MapKeys[T]) For(walker func(T) error) error

+ func (s MapKeys[T]) ForEach(walker func(T))

+ func (s MapKeys[T]) Get(index int) (T, bool)

+ func (s MapKeys[T]) Head() it.Iter[T]

+ func (s MapKeys[T]) IsEmpty() bool

+ func (s MapKeys[T]) Len() int

+ func (s MapKeys[T]) Map(by c.Converter[T, T]) c.Pipe[T, []T]

+ func (s MapKeys[T]) Reduce(by op.Binary[T]) T

+ func (s MapKeys[T]) String() string

+ type MapValues struct

+ func WrapVal(order []K, elements map[K]V) MapValues[K, V]

+ func (s MapValues[K, V]) Begin() c.Iterator[V]

+ func (s MapValues[K, V]) Collect() []V

+ func (s MapValues[K, V]) Filter(filter c.Predicate[V]) c.Pipe[V, []V]

+ func (s MapValues[K, V]) First() (*ValIter[K, V], V, bool)

+ func (s MapValues[K, V]) For(walker func(V) error) error

+ func (s MapValues[K, V]) ForEach(walker func(V))

+ func (s MapValues[K, V]) Get(index int) (V, bool)

+ func (s MapValues[K, V]) Head() *ValIter[K, V]

+ func (s MapValues[K, V]) IsEmpty() bool

+ func (s MapValues[K, V]) Len() int

+ func (s MapValues[K, V]) Map(by c.Converter[V, V]) c.Pipe[V, []V]

+ func (s MapValues[K, V]) Reduce(by op.Binary[V]) V

+ func (s MapValues[K, V]) String() string

+ type Set struct

+ func NewSet(elements []T) Set[T]

+ func WrapSet(order []T, elements map[T]struct{}) Set[T]

+ func (s Set[T]) Begin() c.Iterator[T]

+ func (s Set[T]) Collect() []T

+ func (s Set[T]) Contains(v T) bool

+ func (s Set[T]) Filter(filter c.Predicate[T]) c.Pipe[T, []T]

+ func (s Set[T]) First() (it.Iter[T], T, bool)

+ func (s Set[T]) For(walker func(T) error) error

+ func (s Set[T]) ForEach(walker func(T))

+ func (s Set[T]) Head() it.Iter[T]

+ func (s Set[T]) IsEmpty() bool

+ func (s Set[T]) Last() (it.Iter[T], T, bool)

+ func (s Set[T]) Len() int

+ func (s Set[T]) Map(by c.Converter[T, T]) c.Pipe[T, []T]

+ func (s Set[T]) Reduce(by op.Binary[T]) T

+ func (s Set[T]) Revert() it.Iter[T]

+ func (s Set[T]) Sort(less func(e1, e2 T) bool) Set[T]

+ func (s Set[T]) String() string

+ type ValIter struct

+ func NewValIter(elements []K, uniques map[K]V) *ValIter[K, V]

+ func (s *ValIter[K, V]) Cap() int

+ func (s *ValIter[K, V]) Next() (V, bool)