README
¶
A priority queue written in Go that signals using channels
Installation 
go get -v -u github.com/caffix/queue@main
Licensing
This program is free software: you can redistribute it and/or modify it under the terms of the Apache license.
Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Queue ¶
type Queue interface {
// Append adds the data to the Queue at priority level PriorityNormal.
Append(data any)
// AppendPriority adds the data to the Queue with respect to priority.
AppendPriority(data any, priority QueuePriority)
// Signal returns the Queue signal channel.
Signal() <-chan struct{}
// Next returns the data at the front of the Queue.
Next() (any, bool)
// Process will execute the callback parameter for each element on the Queue.
Process(callback func(any))
// Empty returns true if the Queue is empty.
Empty() bool
// Len returns the current length of the Queue.
Len() int
}
Queue implements a FIFO data structure that can support a few priorities.
type QueuePriority ¶ added in v0.3.0
type QueuePriority int
const ( PriorityLow QueuePriority = 0 PriorityNormal QueuePriority = 1 PriorityHigh QueuePriority = 2 PriorityCritical QueuePriority = 3 )
The priority levels for the priority Queue.
Source Files
Click to show internal directories.
Click to hide internal directories.