From 10a1706613c7c77226518c2a8586df42b2063468 Mon Sep 17 00:00:00 2001
From: dudaodong <lanliddd.2007@163.com>
Date: Sat, 28 May 2022 10:51:15 +0800
Subject: [PATCH] docs: update function comments

---
 datastructure/queue/arrayqueue.go    | 2 +-
 datastructure/queue/circularqueue.go | 2 +-
 datastructure/queue/linkedqueue.go   | 2 +-
 datastructure/queue/priorityqueue.go | 2 +-
 4 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/datastructure/queue/arrayqueue.go b/datastructure/queue/arrayqueue.go
index a2dfd2b..b4f4df7 100644
--- a/datastructure/queue/arrayqueue.go
+++ b/datastructure/queue/arrayqueue.go
@@ -24,7 +24,7 @@ func NewArrayQueue[T any](capacity int) *ArrayQueue[T] {
 	}
 }
 
-// Data return queue data
+// Data return slice of queue data
 func (q *ArrayQueue[T]) Data() []T {
 	items := []T{}
 	for i := q.head; i < q.tail; i++ {
diff --git a/datastructure/queue/circularqueue.go b/datastructure/queue/circularqueue.go
index d7ab4a7..eb905aa 100644
--- a/datastructure/queue/circularqueue.go
+++ b/datastructure/queue/circularqueue.go
@@ -21,7 +21,7 @@ func NewCircularQueue[T any](size int) *CircularQueue[T] {
 	return &CircularQueue[T]{data: data, front: 0, rear: 0, size: size}
 }
 
-// Data return queue data
+// Data return slice of queue data
 func (q *CircularQueue[T]) Data() []T {
 	data := []T{}
 
diff --git a/datastructure/queue/linkedqueue.go b/datastructure/queue/linkedqueue.go
index 1845ce0..bc154c8 100644
--- a/datastructure/queue/linkedqueue.go
+++ b/datastructure/queue/linkedqueue.go
@@ -19,7 +19,7 @@ func NewLinkedQueue[T any]() *LinkedQueue[T] {
 	return &LinkedQueue[T]{head: nil, tail: nil, length: 0}
 }
 
-// Data return queue data
+// Data return slice of queue data
 func (q *LinkedQueue[T]) Data() []T {
 	res := []T{}
 	current := q.head
diff --git a/datastructure/queue/priorityqueue.go b/datastructure/queue/priorityqueue.go
index 528446a..f33cf5e 100644
--- a/datastructure/queue/priorityqueue.go
+++ b/datastructure/queue/priorityqueue.go
@@ -34,7 +34,7 @@ func (q *PriorityQueue[T]) IsFull() bool {
 	return q.size == len(q.items)-1
 }
 
-// Data return data slice in the queue
+// Data return a slice of queue data
 func (q *PriorityQueue[T]) Data() []T {
 	data := make([]T, q.size)
 	for i := 1; i < q.size+1; i++ {