Fix queue potential bugs

johnteee · johnteee · commit a4f7c862aa70 · 2022-05-19T17:35:17.000+08:00
diff --git a/queue.go b/queue.go
@@ -420,11 +420,11 @@ func (q *LinkedListQueue[T]) Shift() (T, error) {
 	if q.first == nil {
 		q.last = nil
 	}
-	val := node.Val
+	val := *node.Val
 
 	q.recycleNode(node)
 
-	return *val, nil
+	return val, nil
 }
 
 // Unshift Unshift the T val to the first position(non-blocking)

Original file line number	Diff line number	Diff line change
`@@ -420,11 +420,11 @@ func (q *LinkedListQueue[T]) Shift() (T, error) {`
`420`	`420`	`if q.first == nil {`
`421`	`421`	`q.last = nil`
`422`	`422`	`}`
`423`		`- val := node.Val`
	`423`	`+ val := *node.Val`
`424`	`424`
`425`	`425`	`q.recycleNode(node)`
`426`	`426`
`427`		`- return *val, nil`
	`427`	`+ return val, nil`
`428`	`428`	`}`
`429`	`429`
`430`	`430`	`// Unshift Unshift the T val to the first position(non-blocking)`