DequeueRear deletes an item from rear of Deque and returns it.
()
| 46 | |
| 47 | // DequeueRear deletes an item from rear of Deque and returns it. |
| 48 | func (dq *DoublyEndedQueue[T]) DequeueRear() (T, error) { |
| 49 | if len(dq.deque) == 0 { |
| 50 | var zeroVal T |
| 51 | return zeroVal, ErrEmptyDequeue |
| 52 | } |
| 53 | rearElement := dq.deque[len(dq.deque)-1] |
| 54 | dq.deque = dq.deque[:len(dq.deque)-1] |
| 55 | return rearElement, nil |
| 56 | } |
| 57 | |
| 58 | // Front gets the front item from queue. |
| 59 | func (dq *DoublyEndedQueue[T]) Front() (T, error) { |