zishuo/lancet
1
0
Fork 0
mirror of https://github.com/duke-git/lancet.git synced 2025-10-04 07:06:30 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: rename function 'EnQueue' -> 'Enqueue', 'DeQueue' -> 'Dequeue'

Browse Source
This commit is contained in:
dudaodong
2022-06-04 18:53:46 +08:00
parent 1aa1f95524
commit 4718da44f4
4 changed files with 73 additions and 73 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
datastructure/queue/linkedqueue.go
View File

@@ -41,8 +41,8 @@ func (q *LinkedQueue[T]) IsEmpty() bool {
return q.length == 0
}
// EnQueue add element into queue
func (q *LinkedQueue[T]) EnQueue(value T) {
// Enqueue put element into queue
func (q *LinkedQueue[T]) Enqueue(value T) {
newNode := datastructure.NewQueueNode(value)
if q.IsEmpty() {
@@ -55,8 +55,8 @@ func (q *LinkedQueue[T]) EnQueue(value T) {
q.length++
}
// DeQueue delete head element of queue then return it, if queue is empty, return nil and error
func (q *LinkedQueue[T]) DeQueue() (*T, error) {
// Dequeue delete head element of queue then return it, if queue is empty, return nil and error
func (q *LinkedQueue[T]) Dequeue() (*T, error) {
if q.IsEmpty() {
return nil, errors.New("queue is empty")
}