Documentation
¶
Overview ¶
Package queue implements a FIFO (first in first out) data structure supporting arbitrary types (even a mixture).
Internally it uses a dynamically growing circular slice of blocks, resulting in faster resizes than a simple dynamic array/slice would allow.
Package stack implements a LIFO (last in first out) data structure supporting arbitrary types (even a mixture).
Internally it uses a dynamically growing slice of blocks, resulting in faster resizes than a simple dynamic array/slice would allow.
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Priority ¶
type Priority struct {
Order []Feature
Worst *Query
// contains filtered or unexported fields
}
func NewPriority ¶
type Queue ¶
type Queue struct {
// contains filtered or unexported fields
}
First in, first out data structure.
Source Files
Click to show internal directories.
Click to hide internal directories.