From 38a7f9423f678dc5c6c86ee40dbe9fdf489eb762 Mon Sep 17 00:00:00 2001 From: dudaodong Date: Wed, 8 Jun 2022 14:40:37 +0800 Subject: [PATCH] fmt: gofmt package datastructure/queue --- datastructure/queue/circularqueue.go | 8 ++++---- datastructure/queue/linkedqueue.go | 1 - 2 files changed, 4 insertions(+), 5 deletions(-) diff --git a/datastructure/queue/circularqueue.go b/datastructure/queue/circularqueue.go index 5fdf3e5..53f655e 100644 --- a/datastructure/queue/circularqueue.go +++ b/datastructure/queue/circularqueue.go @@ -9,10 +9,10 @@ import ( // CircularQueue implements circular queue with slice, // last index of CircularQueue don't contain value, so acturl capacity is capacity - 1 type CircularQueue[T any] struct { - data []T - front int - rear int - capacity int + data []T + front int + rear int + capacity int } // NewCircularQueue return a empty CircularQueue pointer diff --git a/datastructure/queue/linkedqueue.go b/datastructure/queue/linkedqueue.go index 93c6ff8..8e4f90d 100644 --- a/datastructure/queue/linkedqueue.go +++ b/datastructure/queue/linkedqueue.go @@ -42,7 +42,6 @@ func (q *LinkedQueue[T]) IsEmpty() bool { return q.length == 0 } - // Enqueue put element into queue func (q *LinkedQueue[T]) Enqueue(value T) { newNode := datastructure.NewQueueNode(value)