pipe

Documentation

Index

• Constants
• func NoPriority[E any](E) bool
• type Factory
  • func NewSimpleHashableFactory() Factory[SimpleHashable]
  • func NewSimpleNothashableFactory() Factory[SimpleNothashable]
• type Hashable
• type InfinitePipe
  • func (ch *InfinitePipe[E]) Close()
  • func (ch *InfinitePipe[E]) Discard()
  • func (ch *InfinitePipe[E]) In() chan<- E
  • func (ch *InfinitePipe[E]) Len() int
  • func (ch *InfinitePipe[E]) Out() <-chan E
  • func (ch *InfinitePipe[E]) TryAdd(e E, log func(msg string, args ...interface{}))
• type IntConvertible
• type LimitedPriorityHashQueue
  • func (q *LimitedPriorityHashQueue[E]) Add(elem E) bool
  • func (q *LimitedPriorityHashQueue[E]) Get(i int) E
  • func (q *LimitedPriorityHashQueue[E]) Length() int
  • func (q *LimitedPriorityHashQueue[E]) Peek() E
  • func (q *LimitedPriorityHashQueue[E]) Remove() E
• type Pipe
  • func NewHashInfinitePipe[E Hashable]() Pipe[E]
  • func NewInfinitePipe[E any]() Pipe[E]
  • func NewLimitHashInfinitePipe[E Hashable](limit int) Pipe[E]
  • func NewLimitInfinitePipe[E any](limit int) Pipe[E]
  • func NewLimitPriorityHashInfinitePipe[E Hashable](priorityFun func(E) bool, limit int) Pipe[E]
  • func NewLimitPriorityInfinitePipe[E any](priorityFun func(E) bool, limit int) Pipe[E]
  • func NewPriorityHashInfinitePipe[E Hashable](priorityFun func(E) bool) Pipe[E]
  • func NewPriorityInfinitePipe[E any](priorityFun func(E) bool) Pipe[E]
• type Queue
  • func NewHashLimitedPriorityHashQueue[E Hashable]() Queue[E]
  • func NewLimitHashLimitedPriorityHashQueue[E Hashable](limit int) Queue[E]
  • func NewLimitLimitedPriorityHashQueue[E any](limit int) Queue[E]
  • func NewLimitPriorityHashLimitedPriorityHashQueue[E Hashable](priorityFun func(E) bool, limit int) Queue[E]
  • func NewLimitPriorityLimitedPriorityHashQueue[E any](priorityFun func(E) bool, limit int) Queue[E]
  • func NewLimitedPriorityHashQueue[E any]() Queue[E]
  • func NewPriorityHashLimitedPriorityHashQueue[E Hashable](priorityFun func(E) bool) Queue[E]
  • func NewPriorityLimitedPriorityHashQueue[E any](priorityFun func(E) bool) Queue[E]
• type SimpleHashable
  • func (sh SimpleHashable) AsInt() int
  • func (sh SimpleHashable) GetHash() hashing.HashValue
• type SimpleHashableFactory
  • func (*SimpleHashableFactory) Create(i int) SimpleHashable
• type SimpleNothashable
  • func (snh SimpleNothashable) AsInt() int
• type SimpleNothashableFactory
  • func (*SimpleNothashableFactory) Create(i int) SimpleNothashable

Constants

const Infinity = 0

Functions

func NoPriority

func NoPriority[E any](E) bool

Types

type Factory

type Factory[E IntConvertible] interface {
	Create(int) E
}

func NewSimpleHashableFactory

func NewSimpleHashableFactory() Factory[SimpleHashable]

func NewSimpleNothashableFactory

func NewSimpleNothashableFactory() Factory[SimpleNothashable]

type Hashable

type Hashable interface {
	GetHash() hashing.HashValue
}

type InfinitePipe

type InfinitePipe[E any] struct {
	// contains filtered or unexported fields
}

InfinitePipe provides deserialised sender and receiver: it queues messages sent by the sender and returns them to the receiver whenever it is ready, without blocking the sender process. Depending on the backing queue, the pipe might have other characteristics.

func (*InfinitePipe[E]) Close

func (ch *InfinitePipe[E]) Close()

func (*InfinitePipe[E]) Discard

func (ch *InfinitePipe[E]) Discard()

func (*InfinitePipe[E]) In

func (ch *InfinitePipe[E]) In() chan<- E

func (*InfinitePipe[E]) Len

func (ch *InfinitePipe[E]) Len() int

func (*InfinitePipe[E]) Out

func (ch *InfinitePipe[E]) Out() <-chan E

func (*InfinitePipe[E]) TryAdd

func (ch *InfinitePipe[E]) TryAdd(e E, log func(msg string, args ...interface{}))

type IntConvertible

type IntConvertible interface {
	AsInt() int
}

type LimitedPriorityHashQueue

type LimitedPriorityHashQueue[E any] struct {
	// contains filtered or unexported fields
}

LimitedPriorityHashQueue is a queue, which can prioritize elements, limit its growth and reject already included elements.

func (*LimitedPriorityHashQueue[E]) Add

func (q *LimitedPriorityHashQueue[E]) Add(elem E) bool

func (*LimitedPriorityHashQueue[E]) Get

func (q *LimitedPriorityHashQueue[E]) Get(i int) E

Get returns the element at index i in the queue. If the index is invalid, the call will panic. This method accepts both positive and negative index values. Index 0 refers to the first element, and index -1 refers to the last.

func (*LimitedPriorityHashQueue[E]) Length

func (q *LimitedPriorityHashQueue[E]) Length() int

Length returns the number of elements currently stored in the queue.

func (*LimitedPriorityHashQueue[E]) Peek

func (q *LimitedPriorityHashQueue[E]) Peek() E

Peek returns the element at the head of the queue. This call panics if the queue is empty.

func (*LimitedPriorityHashQueue[E]) Remove

func (q *LimitedPriorityHashQueue[E]) Remove() E

Remove removes and returns the element from the front of the queue. If the queue is empty, the call will panic.

type Pipe

type Pipe[E any] interface {
	In() chan<- E
	Out() <-chan E
	Len() int
	Close()
	Discard()
	TryAdd(e E, log func(msg string, args ...interface{}))
}

func NewHashInfinitePipe

func NewHashInfinitePipe[E Hashable]() Pipe[E]

func NewInfinitePipe

func NewInfinitePipe[E any]() Pipe[E]

func NewLimitHashInfinitePipe

func NewLimitHashInfinitePipe[E Hashable](limit int) Pipe[E]

func NewLimitInfinitePipe

func NewLimitInfinitePipe[E any](limit int) Pipe[E]

func NewLimitPriorityHashInfinitePipe

func NewLimitPriorityHashInfinitePipe[E Hashable](priorityFun func(E) bool, limit int) Pipe[E]

func NewLimitPriorityInfinitePipe

func NewLimitPriorityInfinitePipe[E any](priorityFun func(E) bool, limit int) Pipe[E]

func NewPriorityHashInfinitePipe

func NewPriorityHashInfinitePipe[E Hashable](priorityFun func(E) bool) Pipe[E]

func NewPriorityInfinitePipe

func NewPriorityInfinitePipe[E any](priorityFun func(E) bool) Pipe[E]

type Queue

type Queue[E any] interface {
	Length() int
	Add(elem E) bool
	Peek() E
	Get(i int) E
	Remove() E
}

func NewHashLimitedPriorityHashQueue

func NewHashLimitedPriorityHashQueue[E Hashable]() Queue[E]

func NewLimitHashLimitedPriorityHashQueue

func NewLimitHashLimitedPriorityHashQueue[E Hashable](limit int) Queue[E]

func NewLimitLimitedPriorityHashQueue

func NewLimitLimitedPriorityHashQueue[E any](limit int) Queue[E]

func NewLimitPriorityHashLimitedPriorityHashQueue

func NewLimitPriorityHashLimitedPriorityHashQueue[E Hashable](priorityFun func(E) bool, limit int) Queue[E]

func NewLimitPriorityLimitedPriorityHashQueue

func NewLimitPriorityLimitedPriorityHashQueue[E any](priorityFun func(E) bool, limit int) Queue[E]

func NewLimitedPriorityHashQueue

func NewLimitedPriorityHashQueue[E any]() Queue[E]

func NewPriorityHashLimitedPriorityHashQueue

func NewPriorityHashLimitedPriorityHashQueue[E Hashable](priorityFun func(E) bool) Queue[E]

func NewPriorityLimitedPriorityHashQueue

func NewPriorityLimitedPriorityHashQueue[E any](priorityFun func(E) bool) Queue[E]

type SimpleHashable

type SimpleHashable int

func (SimpleHashable) AsInt

func (sh SimpleHashable) AsInt() int

func (SimpleHashable) GetHash

func (sh SimpleHashable) GetHash() hashing.HashValue

type SimpleHashableFactory

type SimpleHashableFactory struct{}

func (*SimpleHashableFactory) Create

func (*SimpleHashableFactory) Create(i int) SimpleHashable

type SimpleNothashable

type SimpleNothashable int

func (SimpleNothashable) AsInt

func (snh SimpleNothashable) AsInt() int

type SimpleNothashableFactory

type SimpleNothashableFactory struct{}

func (*SimpleNothashableFactory) Create

func (*SimpleNothashableFactory) Create(i int) SimpleNothashable