Versions in this module Expand all Collapse all v0 v0.3.22 Apr 20, 2026 v0.3.21 Apr 20, 2026 v0.3.20 Apr 17, 2026 v0.3.19 Apr 17, 2026 v0.3.18 Apr 17, 2026 v0.3.17 Apr 16, 2026 v0.3.16 Apr 15, 2026 v0.3.15 Apr 15, 2026 v0.3.14 Apr 14, 2026 v0.3.13 Apr 13, 2026 v0.3.12 Apr 13, 2026 v0.3.11 Apr 8, 2026 v0.3.10 Apr 8, 2026 v0.3.9 Apr 7, 2026 v0.3.8 Apr 7, 2026 v0.3.7 Apr 7, 2026 v0.3.6 Apr 1, 2026 v0.3.0 Mar 28, 2026 Changes in this version + type List []T + func NewList[T any](capacity int) List[T] + func (l List[T]) All(ok func(T) bool) bool + func (l List[T]) AllIndexFunc(itemFn func(T) bool) List[int] + func (l List[T]) AllIndexed(ok func(int, T) bool) bool + func (l List[T]) Any(ok func(T) bool) bool + func (l List[T]) AnyIndexed(ok func(int, T) bool) bool + func (l List[T]) Apply(task func(T) T) List[T] + func (l List[T]) Cap() int + func (l List[T]) Copy() List[T] + func (l List[T]) CountFunc(ok func(T) bool) int + func (l List[T]) Filter(keep func(T) bool) List[T] + func (l List[T]) FilterIndexed(keep func(int, T) bool) List[T] + func (l List[T]) Get(index int) Option[T] + func (l List[T]) GetFuncOrDefault(itemFn func(T) bool, defaultValue T) T + func (l List[T]) GetRandom() Option[T] + func (l List[T]) IndexFunc(itemFn func(T) bool) int + func (l List[T]) IsEmpty() bool + func (l List[T]) Last(rank int) Option[T] + func (l List[T]) LastIndex() int + func (l List[T]) Len() int + func (l List[T]) MapList(indexes []int) List[T] + func (l List[T]) MustGetRandom() T + func (l List[T]) MustLast(rank int) T + func (l List[T]) NotAny(ok func(T) bool) bool + func (l List[T]) NotAnyIndexed(ok func(int, T) bool) bool + func (l List[T]) NotEmpty() bool + func (l List[T]) Reduce(initial T, reducer func(T, T) T) T + func (l List[T]) RemoveAllFunc(itemFn func(T) bool) List[T] + func (l List[T]) RemoveFunc(itemFn func(T) bool) (List[T], bool) + func (l List[T]) Shuffle() + func (l List[T]) ToAny() List[any] + type Map map[K]V + func ZipMap[K comparable, V any](keys List[K], values List[V]) Map[K, V] + func (m Map[K, V]) Clear() + func (m Map[K, V]) Copy() Map[K, V] + func (m Map[K, V]) Delete(key K) + func (m Map[K, V]) Entries() List[Tuple2[K, V]] + func (m Map[K, V]) Filter(keep func(K, V) bool) Map[K, V] + func (m Map[K, V]) Get(key K) Option[V] + func (m Map[K, V]) GetOrDefault(key K, defaultValue V) V + func (m Map[K, V]) HasKey(key K) bool + func (m Map[K, V]) HasKeyFunc(test func(K) bool) bool + func (m Map[K, V]) HasValueFunc(test func(V) bool) bool + func (m Map[K, V]) IsEmpty() bool + func (m Map[K, V]) Keys() List[K] + func (m Map[K, V]) KeysIter() iter.Seq[K] + func (m Map[K, V]) Len() int + func (m Map[K, V]) NoKey(key K) bool + func (m Map[K, V]) NoKeyFunc(test func(K) bool) bool + func (m Map[K, V]) NoValueFunc(test func(V) bool) bool + func (m Map[K, V]) NotEmpty() bool + func (m Map[K, V]) SetDefault(key K, defaultValue V) + func (m Map[K, V]) SortedEntriesFunc(sortFn func(Tuple2[K, V], Tuple2[K, V]) int) List[Tuple2[K, V]] + func (m Map[K, V]) SortedKeysFunc(sortFn func(K, K) int) List[K] + func (m Map[K, V]) SortedValuesFunc(sortFn func(V, V) int) List[V] + func (m Map[K, V]) String() string + func (m Map[K, V]) Unzip() (List[K], List[V]) + func (m Map[K, V]) Update(newMap Map[K, V]) + func (m Map[K, V]) Values() List[V] + func (m Map[K, V]) ValuesIter() iter.Seq[V] + type NumList List[T] + func (l NumList[T]) Product() T + func (l NumList[T]) Sum() T + func (l NumList[T]) ToList() List[T] + type Option struct + func NewOption[T any](value *T) Option[T] + func Nil[T any]() Option[T] + func (o Option[T]) Get() (T, bool) + func (o Option[T]) IsNil() bool + func (o Option[T]) NotNil() bool + func (o Option[T]) String() string + func (o Option[T]) Value() T + type Pair [2]T + func (p Pair[T]) Unpack() (T, T) + type Quad [4]T + func (q Quad[T]) Unpack() (T, T, T, T) + type Queue struct + func NewQueueFrom[T any](items []T) *Queue[T] + func NewQueue[T any]() *Queue[T] + func (q *Queue[T]) Clear() + func (q *Queue[T]) Copy() *Queue[T] + func (q *Queue[T]) Dequeue() Option[T] + func (q *Queue[T]) Enqueue(item T) + func (q *Queue[T]) Front() Option[T] + func (q *Queue[T]) IsEmpty() bool + func (q *Queue[T]) Items() List[T] + func (q *Queue[T]) Len() int + func (q *Queue[T]) MustDequeue() T + func (q *Queue[T]) MustFront() T + func (q *Queue[T]) NotEmpty() bool + func (q *Queue[T]) String() string + type Range struct + func NewInclusiveRange[T number.Integer](first, last T) Range[T] + func NewRange[T number.Integer](start, end T) Range[T] + func (r Range[T]) Copy() Range[T] + func (r Range[T]) Has(item T) bool + func (r Range[T]) IsReversed() bool + func (r Range[T]) Len() int + func (r Range[T]) Limits() (start, end T) + func (r Range[T]) Product() T + func (r Range[T]) String() string + func (r Range[T]) Sum() T + func (r Range[T]) ToList() List[T] + func (r Range[T]) ToSlice() []T + type Result struct + func Error[T any](err error) Result[T] + func NewResult[T any](value T, err error) Result[T] + func (r Result[T]) Error() error + func (r Result[T]) Get() (T, bool) + func (r Result[T]) IsError() bool + func (r Result[T]) NotError() bool + func (r Result[T]) String() string + func (r Result[T]) Value() T + type Set struct + func NewSetFrom[T comparable](items []T) Set[T] + func NewSetFunc[T any, K comparable](items []T, keyFn func(T) K) Set[K] + func NewSet[T comparable]() Set[T] + func (s Set[T]) Add(items ...T) + func (s Set[T]) Clear() + func (s Set[T]) Copy() Set[T] + func (s Set[T]) Delete(item T) + func (s Set[T]) Difference(s2 Set[T]) Set[T] + func (s Set[T]) Has(item T) bool + func (s Set[T]) HasDifference(s2 Set[T]) bool + func (s Set[T]) HasIntersection(s2 Set[T]) bool + func (s Set[T]) HasNo(item T) bool + func (s Set[T]) HasNoDifference(s2 Set[T]) bool + func (s Set[T]) HasNoIntersection(s2 Set[T]) bool + func (s Set[T]) Intersection(s2 Set[T]) Set[T] + func (s Set[T]) IsEmpty() bool + func (s Set[T]) Items() List[T] + func (s Set[T]) Len() int + func (s Set[T]) NotEmpty() bool + func (s Set[T]) String() string + func (s Set[T]) Union(s2 Set[T]) Set[T] + type Stack struct + func NewStackFrom[T any](items []T) *Stack[T] + func NewStack[T any]() *Stack[T] + func (s *Stack[T]) Clear() + func (s *Stack[T]) Copy() *Stack[T] + func (s *Stack[T]) IsEmpty() bool + func (s *Stack[T]) Items() List[T] + func (s *Stack[T]) Len() int + func (s *Stack[T]) MustPop() T + func (s *Stack[T]) MustTop() T + func (s *Stack[T]) NotEmpty() bool + func (s *Stack[T]) Pop() Option[T] + func (s *Stack[T]) Push(item T) + func (s *Stack[T]) String() string + func (s *Stack[T]) Top() Option[T] + type Triple [3]T + func (t Triple[T]) Unpack() (T, T, T) + type Tuple2 struct + V1 A + V2 B + func NewTuple2[A, B any](v1 A, v2 B) Tuple2[A, B] + func (t Tuple2[A, B]) Unpack() (A, B) + type Tuple3 struct + V1 A + V2 B + V3 C + func NewTuple3[A, B, C any](v1 A, v2 B, v3 C) Tuple3[A, B, C] + func (t Tuple3[A, B, C]) Unpack() (A, B, C) + type Tuple4 struct + V1 A + V2 B + V3 C + V4 D + func NewTuple4[A, B, C, D any](v1 A, v2 B, v3 C, v4 D) Tuple4[A, B, C, D] + func (t Tuple4[A, B, C, D]) Unpack() (A, B, C, D)
Go to main page