git/lancet
1
0
Fork 0
mirror of https://github.com/duke-git/lancet.git synced 2026-02-15 18:22:27 +08:00
Code Issues Projects Releases Wiki Activity

feat: add PriorityQueue

Browse Source
This commit is contained in:
dudaodong
2022-04-26 10:18:43 +08:00
parent 55e62ed8ca
commit 70995c5098
1 changed files with 1 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
datastructure/queue/priorityqueue.go
View File

@@ -2,8 +2,7 @@ package datastructure
import "github.com/duke-git/lancet/v2/lancetconstraints" import "github.com/duke-git/lancet/v2/lancetconstraints"
// PriorityQueue is a implemented by binary heap tree // PriorityQueue is a priority queue implemented by binary heap tree
// which are referred to as the left child and the right child.
// type T should implements Compare function in lancetconstraints.Comparator interface. // type T should implements Compare function in lancetconstraints.Comparator interface.
type PriorityQueue[T any] struct { type PriorityQueue[T any] struct {
items []T items []T