package
Version:
v0.0.0-...-78eaa40
Opens a new window with list of versions in this module.
Published: Nov 10, 2019
License: MIT
Opens a new window with license information.
Imports: 2
Opens a new window with list of imports.
Imported by: 0
Opens a new window with list of known importers.
Documentation
¶
type CQArray struct {
Items []interface{}
L *sync.Mutex
}
CQArray is slice based thread safe queue implementation for concurrent access.
NewCQArray initializes and returns new CQArray.
Len returns the item length of queue.
func (q *CQArray) Pop() (n interface{})
Pop returns first item from the queue.
func (q *CQArray) Push(n interface{})
Push adds new item tail of the queue.
CQList is container/list based thread safe queue implementation for concurrent access.
NewCQList initializes and returns new CQList.
Len returns the item length of queue.
func (l *CQList) Pop() (n interface{})
Pop returns first item from the queue.
func (l *CQList) Push(n interface{})
Push adds new item tail of the queue.
type QArray struct {
Items []interface{}
}
QArray is slice based standard queue implementation without thread safety for concurrent access.
NewQArray initializes and returns new QArray.
Len returns the item length of queue.
func (q *QArray) Pop() (n interface{})
Pop returns first item from the queue.
func (q *QArray) Push(n interface{})
Push adds new item tail of the queue.
QList is container/list based standard queue implementation without thread safety for concurrent access.
NewQList initializes and returns new QList.
Len returns the item length of queue.
func (l *QList) Pop() (n interface{})
Pop returns first item from the queue.
func (l *QList) Push(n interface{})
Push adds new item tail of the queue.
Source Files
¶
Click to show internal directories.
Click to hide internal directories.
