Versions in this module Expand all Collapse all v1 v1.3.0 Feb 3, 2022 Changes in this version + var ErrAlreadyUnsubscribed = errors.New("already unsubscribed") + var ErrSubscriptionNotInitalized = errors.New("subscription is not initialized") + func Abs(v T) T + func All(slice []T, cond func(value T) bool) bool + func Any(slice []T, cond func(value T) bool) bool + func Chunk(slice []T, size int) [][]T + func ChunkIter(slice []T, size int, callback func(chunk []T)) + func Clamp(v, min, max T) T + func Clamp01(v T) T + func Coal(values ...T) T + func Compare(a, b T) int + func Concat(a, b []T) []T + func Contains(slice []T, value T) bool + func ContainsFunc(slice []T, value T, equals func(a, b T) bool) bool + func ContainsValue(m map[K]V, value V) bool + func Digits10(v T) int + func DigitsSign10(v T) int + func Distinct(slice []T) []T + func DistinctFunc(slice []T, equals func(a, b T) bool) []T + func Except(slice []T, exclude []T) []T + func ExceptSet(slice []T, exclude Set[T]) []T + func Fill(slice []T, value T) + func Filter(slice []T, match func(value T) bool) []T + func Fold(slice []T, seed TState, acc func(state TState, value T) TState) TState + func FoldReverse(slice []T, seed TState, acc func(state TState, value T) TState) TState + func Index(slice []T, value T) int + func IndexFunc(slice []T, f func(value T) bool) int + func Insert(slice *[]T, index int, value T) + func InsertSlice(slice *[]T, index int, values []T) + func IsNil(value T) bool + func Last(slice []T) T + func MakeChanOf(_ T, size ...int) chan T + func MakeChanOfChan(_ chan T, size ...int) chan T + func MakeMapOf(_ K, _ V, size ...int) map[K]V + func MakeMapOfMap(_ map[K]V, size ...int) map[K]V + func MakeSliceOf(_ T, size ...int) []T + func MakeSliceOfKey(_ map[K]V, size ...int) []K + func MakeSliceOfSlice(_ []T, size ...int) []T + func MakeSliceOfValue(_ map[K]V, size ...int) []V + func Map(slice []TA, conv func(value TA) TB) []TB + func MapErr(slice []TA, conv func(value TA) (TB, error)) ([]TB, error) + func Max(v ...T) T + func Min(v ...T) T + func NewOf(*T) *T + func Pairs(slice []T) [][2]T + func PairsIter(slice []T, callback func(a, b T)) + func Product(v ...T) T + func Ptr(value T) *T + func RecvContext(ctx context.Context, ch <-chan T) (T, bool) + func RecvQueued(ch <-chan T, maxValues int) []T + func RecvQueuedFull(ch <-chan T, buf []T) int + func RecvTimeout(ch <-chan T, timeout time.Duration) (T, bool) + func Remove(slice *[]T, index int) + func RemoveSlice(slice *[]T, index int, length int) + func Repeat(value T, count int) []T + func Reverse(slice []T) + func SafeGet(slice []T, index int) T + func SafeGetOr(slice []T, index int, fallback T) T + func Search(slice []T, value T) int + func SendContext(ctx context.Context, ch chan<- T, value T) bool + func SendTimeout(ch chan<- T, value T, timeout time.Duration) bool + func Shuffle(slice []T) + func ShuffleRand(slice []T, rand *rand.Rand) + func Sort(slice []T) + func SortDesc(slice []T) + func Sum(v ...T) T + func Tern(cond bool, ifTrue, ifFalse T) T + func TernCast(cond bool, value any, ifFalse T) T + func Trim(slice []T, unwanted []T) []T + func TrimFunc(slice []T, unwanted func(value T) bool) []T + func TrimLeft(slice []T, unwanted []T) []T + func TrimLeftFunc(slice []T, unwanted func(value T) bool) []T + func TrimRight(slice []T, unwanted []T) []T + func TrimRightFunc(slice []T, unwanted func(value T) bool) []T + func TryGet(slice []T, index int) (T, bool) + func Windowed(slice []T, size int) [][]T + func WindowedIter(slice []T, size int, callback func(window []T)) + func Zero() T + func ZeroOf(T) T + type Array2D struct + func NewArray2D(width, height int) Array2D[T] + func NewArray2DFromSlice(width, height int, jagged [][]T) Array2D[T] + func NewArray2DFromValue(width, height int, value T) Array2D[T] + func (a Array2D[T]) Clone() Array2D[T] + func (a Array2D[T]) Fill(x1, y1, x2, y2 int, value T) + func (a Array2D[T]) Get(x, y int) T + func (a Array2D[T]) Height() int + func (a Array2D[T]) Row(y int) []T + func (a Array2D[T]) RowSpan(x1, x2, y int) []T + func (a Array2D[T]) Set(x, y int, value T) + func (a Array2D[T]) String() string + func (a Array2D[T]) Width() int + type AtomicValue struct + func (v *AtomicValue[T]) CompareAndSwap(old, new T) (swapped bool) + func (v *AtomicValue[T]) Load() (val T) + func (v *AtomicValue[T]) Store(val T) + func (v *AtomicValue[T]) Swap(new T) (old T) + type Counting struct + Count int + Key K + func CountBy(slice []V, keyer func(value V) K) []Counting[K] + type Element struct + Value T + func (l *Element[T]) Next() *Element[T] + func (l *Element[T]) Prev() *Element[T] + type Grouping struct + Key K + Values []V + func GroupBy(slice []V, keyer func(value V) K) []Grouping[K, V] + type KeyedLocker interface + LockKey func(key T) + UnlockKey func(key T) + type KeyedMutex struct + func (km *KeyedMutex[T]) ClearKey(key T) + func (km *KeyedMutex[T]) LockKey(key T) + func (km *KeyedMutex[T]) TryLockKey(key T) bool + func (km *KeyedMutex[T]) UnlockKey(key T) + type KeyedRWMutex struct + func (km *KeyedRWMutex[T]) ClearKey(key T) + func (km *KeyedRWMutex[T]) LockKey(key T) + func (km *KeyedRWMutex[T]) RLockKey(key T) + func (km *KeyedRWMutex[T]) RUnlockKey(key T) + func (km *KeyedRWMutex[T]) TryLockKey(key T) bool + func (km *KeyedRWMutex[T]) TryRLockKey(key T) bool + func (km *KeyedRWMutex[T]) UnlockKey(key T) + type List struct + func NewList() *List[T] + func (l *List[T]) Back() *Element[T] + func (l *List[T]) Front() *Element[T] + func (l *List[T]) Init() *List[T] + func (l *List[T]) InsertAfter(v T, mark *Element[T]) *Element[T] + func (l *List[T]) InsertBefore(v T, mark *Element[T]) *Element[T] + func (l *List[T]) Len() int + func (l *List[T]) MoveAfter(e, mark *Element[T]) + func (l *List[T]) MoveBefore(e, mark *Element[T]) + func (l *List[T]) MoveToBack(e *Element[T]) + func (l *List[T]) MoveToFront(e *Element[T]) + func (l *List[T]) PushBack(v T) *Element[T] + func (l *List[T]) PushBackList(other *List[T]) + func (l *List[T]) PushFront(v T) *Element[T] + func (l *List[T]) PushFrontList(other *List[T]) + func (l *List[T]) Remove(e *Element[T]) T + type Null struct + Set bool + Val T + Valid bool + func NewNull(value T, valid bool) Null[T] + func NullFrom(value T) Null[T] + func NullFromPtr(ptr *T) Null[T] + func (n *Null[T]) Scan(value any) error + func (n *Null[T]) SetValid(value T) + func (n *Null[T]) UnmarshalJSON(data []byte) error + func (n *Null[T]) UnmarshalText(text []byte) error + func (n Null[T]) IsSet() bool + func (n Null[T]) IsValid() bool + func (n Null[T]) IsZero() bool + func (n Null[T]) MarshalJSON() ([]byte, error) + func (n Null[T]) MarshalText() ([]byte, error) + func (n Null[T]) Ptr() *T + func (n Null[T]) Value() (driver.Value, error) + type Number interface + type OrderedSlice struct + func NewOrderedSlice(values []T) OrderedSlice[T] + func (s *OrderedSlice[T]) Add(value T) int + func (s *OrderedSlice[T]) Contains(value T) bool + func (s *OrderedSlice[T]) Get(index int) T + func (s *OrderedSlice[T]) Index(value T) int + func (s *OrderedSlice[T]) Len() int + func (s *OrderedSlice[T]) Remove(value T) int + func (s *OrderedSlice[T]) RemoveAt(index int) + func (s OrderedSlice[T]) String() string + type OrderedTree struct + func (n *OrderedTree[T]) Add(value T) + func (n *OrderedTree[T]) Clear() + func (n *OrderedTree[T]) Clone() OrderedTree[T] + func (n *OrderedTree[T]) Contains(value T) bool + func (n *OrderedTree[T]) Len() int + func (n *OrderedTree[T]) Remove(value T) bool + func (n *OrderedTree[T]) SliceInOrder() []T + func (n *OrderedTree[T]) SlicePostOrder() []T + func (n *OrderedTree[T]) SlicePreOrder() []T + func (n *OrderedTree[T]) WalkInOrder(walker func(value T)) + func (n *OrderedTree[T]) WalkPostOrder(walker func(value T)) + func (n *OrderedTree[T]) WalkPreOrder(walker func(value T)) + func (n OrderedTree[T]) String() string + type Pool struct + New func() T + func (p *Pool[T]) Get() T + func (p *Pool[T]) Put(x T) + type Publisher struct + OnPubTimeout func(ev T) + PubTimeoutAfter time.Duration + func (o *Publisher[T]) Pub(ev T) + func (o *Publisher[T]) PubSlice(evs []T) + func (o *Publisher[T]) PubSliceSync(evs []T) + func (o *Publisher[T]) PubSliceWait(evs []T) + func (o *Publisher[T]) PubSync(ev T) + func (o *Publisher[T]) PubWait(ev T) + func (o *Publisher[T]) Sub() <-chan T + func (o *Publisher[T]) SubBuf(size int) <-chan T + func (o *Publisher[T]) Unsub(sub <-chan T) error + func (o *Publisher[T]) UnsubAll() error + type Queue struct + func (q *Queue[T]) Dequeue() (T, bool) + func (q *Queue[T]) Enqueue(value T) + func (q *Queue[T]) Len() int + func (q *Queue[T]) Peek() (T, bool) + type Real interface + type Ring struct + Value T + func NewRing(n int) *Ring[T] + func (r *Ring[T]) Do(f func(T)) + func (r *Ring[T]) Len() int + func (r *Ring[T]) Link(s *Ring[T]) *Ring[T] + func (r *Ring[T]) Move(n int) *Ring[T] + func (r *Ring[T]) Next() *Ring[T] + func (r *Ring[T]) Prev() *Ring[T] + func (r *Ring[T]) Unlink(n int) *Ring[T] + type Set map[T]struct + func CartesianProduct(a Set[TA], b Set[TB]) Set[SetProduct[TA, TB]] + func NewSetOfKeys(m map[K]V) Set[K] + func NewSetOfSlice(slice []T) Set[T] + func NewSetOfValues(m map[K]V) Set[V] + func (s Set[T]) Add(value T) bool + func (s Set[T]) AddSet(set Set[T]) int + func (s Set[T]) Clone() Set[T] + func (s Set[T]) Has(value T) bool + func (s Set[T]) Intersect(other Set[T]) Set[T] + func (s Set[T]) Remove(value T) bool + func (s Set[T]) RemoveSet(set Set[T]) int + func (s Set[T]) SetDiff(other Set[T]) Set[T] + func (s Set[T]) Slice() []T + func (s Set[T]) String() string + func (s Set[T]) SymDiff(other Set[T]) Set[T] + func (s Set[T]) Union(other Set[T]) Set[T] + type SetProduct struct + A TA + B TB + type SortOrdered []T + func (s SortOrdered[T]) Len() int + func (s SortOrdered[T]) Less(i, j int) bool + func (s SortOrdered[T]) Swap(i, j int) + type SortedSlice struct + func NewSortedSlice(values []T, less func(a, b T) bool) SortedSlice[T] + func (s *SortedSlice[T]) Add(value T) int + func (s *SortedSlice[T]) Contains(value T) bool + func (s *SortedSlice[T]) Get(index int) T + func (s *SortedSlice[T]) Index(value T) int + func (s *SortedSlice[T]) Len() int + func (s *SortedSlice[T]) Remove(value T) int + func (s *SortedSlice[T]) RemoveAt(index int) + func (s SortedSlice[T]) String() string + type Stack []T + func (s *Stack[T]) Peek() (T, bool) + func (s *Stack[T]) Pop() (T, bool) + func (s *Stack[T]) Push(value T) + type SyncMap struct + func (m *SyncMap[K, V]) Delete(key K) + func (m *SyncMap[K, V]) Load(key K) (value V, ok bool) + func (m *SyncMap[K, V]) LoadAndDelete(key K) (value V, loaded bool) + func (m *SyncMap[K, V]) LoadOrStore(key K, value V) (actual V, loaded bool) + func (m *SyncMap[K, V]) Range(f func(key K, value V) bool) + func (m *SyncMap[K, V]) Store(key K, value V) v1.2.0 Jan 29, 2022 v1.1.1 Jan 26, 2022 v1.1.0 Jan 26, 2022 v1.0.1 Jan 25, 2022 v1.0.0 Jan 25, 2022 Other modules containing this package gopkg.in/typ.v2 gopkg.in/typ.v3 gopkg.in/typ.v4
Go to main page