queue

package

v0.0.2-alpha Latest Latest Go to latest Published: Sep 8, 2021 License: MIT Imports: 2 Imported by: 0

Details

This section is empty.

View Source

var ListQueue []interface{}

func BackQueue() interface{}

BackQueue return the Back value

func DeQueue() interface{}

DeQueue it will be removed the first value that added into the list

func EnQueue(n interface{})

EnQueue it will be added new value into our list

func FrontQueue() interface{}

FrontQueue return the Front value

func IsEmptyQueue() bool

IsEmptyQueue check our list is empty or not

func LenQueue() int

LenQueue will return the length of the queue list

type LQueue struct {
	// contains filtered or unexported fields
}

LQueue will be store the value into the list

func (lq *LQueue) Back() (interface{}, error)

Back it will return the back value

func (lq *LQueue) Dequeue() error

Dequeue will be removed the first value that input (First In First Out - FIFO)

func (lq *LQueue) Empty() bool

Empty is check our list is empty or not

func (lq *LQueue) Enqueue(value interface{})

Enqueue will be added new value

func (lq *LQueue) Front() (interface{}, error)

Front it will return the front value

func (lq *LQueue) Len() int

Len it will return the length of list

type Node struct {
	Data interface{}
	Next *Node
}

Node will be store the value and the next node as well

type Queue struct {
	// contains filtered or unexported fields
}

Queue structure is tell us what our head is and what tail should be with length of the list