Fix queue potential bugs

johnteee · johnteee · commit 875eaab2dae9 · 2022-05-19T18:19:32.000+08:00
diff --git a/queue.go b/queue.go
@@ -460,10 +460,10 @@ func (q *LinkedListQueue[T]) Pop() (T, error) {
 	if q.last == nil {
 		q.first = nil
 	}
-	val := node.Val
+	val := *node.Val
 	q.recycleNode(node)
 
-	return *val, nil
+	return val, nil
 }
 
 // Push Push the data to the last position(non-blocking)

Original file line number	Diff line number	Diff line change
`@@ -460,10 +460,10 @@ func (q *LinkedListQueue[T]) Pop() (T, error) {`
`460`	`460`	`if q.last == nil {`
`461`	`461`	`q.first = nil`
`462`	`462`	`}`
`463`		`- val := node.Val`
	`463`	`+ val := *node.Val`
`464`	`464`	`q.recycleNode(node)`
`465`	`465`
`466`		`- return *val, nil`
	`466`	`+ return val, nil`
`467`	`467`	`}`
`468`	`468`
`469`	`469`	`// Push Push the data to the last position(non-blocking)`