Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
Types ¶
type Queue ¶ added in v1.3.3
type Queue[T comparable] struct { // contains filtered or unexported fields }
Queue implements a FIFO Queue data structure.
func NewQueue ¶ added in v1.3.3
func NewQueue[T comparable]() *Queue[T]
NewQueue creates a new FIFO queue where the items are stored in a plain slice.
func (*Queue[T]) Clear ¶ added in v1.3.3
func (q *Queue[T]) Clear()
Clear erase all the items from the queue.
func (*Queue[T]) Dequeue ¶ added in v1.3.3
Dequeue retrieves and removes the first element from the queue. The queue size will be decreased by one.
func (*Queue[T]) Enqueue ¶ added in v1.3.3
func (q *Queue[T]) Enqueue(item T)
Enqueue inserts a new element at the end of the queue.
func (*Queue[T]) Peek ¶ added in v1.3.3
func (q *Queue[T]) Peek() (item T)
Peek returns the first element of the queue without removing it.
type SccResult ¶
type SccResult []SccResultItem
func (SccResult) GetScc ¶
func (scc SccResult) GetScc(n Node) SccResultItem
type SccResultItem ¶
type SccResultItem struct {
// contains filtered or unexported fields
}
func NewSccResult ¶
func NewSccResult(scc *TrSCC) *SccResultItem
func Run ¶
func Run(rootNode Node) []SccResultItem
func (*SccResultItem) InInput ¶
func (scc *SccResultItem) InInput(n Node) bool
func (*SccResultItem) InNodes ¶
func (scc *SccResultItem) InNodes(n Node) bool
func (*SccResultItem) InOutput ¶
func (scc *SccResultItem) InOutput(n Node) bool
Click to show internal directories.
Click to hide internal directories.