From 68f0fd1d4cd1e59b96aee8adeafaac0f54303686 Mon Sep 17 00:00:00 2001 From: dudaodong Date: Tue, 26 Apr 2022 10:19:31 +0800 Subject: [PATCH] feat: add PriorityQueue --- datastructure/queue/priorityqueue.go | 1 + 1 file changed, 1 insertion(+) diff --git a/datastructure/queue/priorityqueue.go b/datastructure/queue/priorityqueue.go index 5007743..a25babd 100644 --- a/datastructure/queue/priorityqueue.go +++ b/datastructure/queue/priorityqueue.go @@ -11,6 +11,7 @@ type PriorityQueue[T any] struct { } // NewPriorityQueue return a pointer of PriorityQueue +// param `comparator` is used to compare valuse in the heap func NewPriorityQueue[T any](capacity int, comparator lancetconstraints.Comparator) *NewPriorityQueue[T] { return &NewPriorityQueue[T]{ items: make([]T, capacity+1),