MCPcopy Create free account
hub / github.com/TheAlgorithms/Go / DequeueFront

Method DequeueFront

structure/deque/deque.go:37–45  ·  view source on GitHub ↗

DequeueFront deletes an item from front of Deque and returns it.

()

Source from the content-addressed store, hash-verified

35
36// DequeueFront deletes an item from front of Deque and returns it.
37func (dq *DoublyEndedQueue[T]) DequeueFront() (T, error) {
38 if len(dq.deque) == 0 {
39 var zeroVal T
40 return zeroVal, ErrEmptyDequeue
41 }
42 frontElement := dq.deque[0]
43 dq.deque = dq.deque[1:]
44 return frontElement, nil
45}
46
47// DequeueRear deletes an item from rear of Deque and returns it.
48func (dq *DoublyEndedQueue[T]) DequeueRear() (T, error) {

Callers 1

TestDequeFunction · 0.80

Calls

no outgoing calls

Tested by 1

TestDequeFunction · 0.64