mirror of
https://github.com/emirpasic/gods.git
synced 2026-06-15 16:16:35 +03:00
Paul Chesnais
14f714261f
* Generics migration This attempts to migrate this library in the least invasive way by preserving as much of the original API as possible. It does not change the tests in a meaningful way nor does it attempt to upgrade any logic that can be simplified or improved with generics. This is purely an API migration, and still requires a lot of additional work to be fully ready. * Fix a few broken tests around serialization * Add v2 suffix * Temporarily change mod name for testing * Rename module to /v2
44 lines
1.3 KiB
Go
44 lines
1.3 KiB
Go
// Copyright (c) 2015, Emir Pasic. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package main
|
|
|
|
import (
|
|
"cmp"
|
|
|
|
pq "github.com/emirpasic/gods/v2/queues/priorityqueue"
|
|
)
|
|
|
|
// Element is an entry in the priority queue
|
|
type Element struct {
|
|
name string
|
|
priority int
|
|
}
|
|
|
|
// Comparator function (sort by element's priority value in descending order)
|
|
func byPriority(a, b Element) int {
|
|
return -cmp.Compare(a.priority, b.priority) // "-" descending order
|
|
}
|
|
|
|
// PriorityQueueExample to demonstrate basic usage of BinaryHeap
|
|
func main() {
|
|
a := Element{name: "a", priority: 1}
|
|
b := Element{name: "b", priority: 2}
|
|
c := Element{name: "c", priority: 3}
|
|
|
|
queue := pq.NewWith(byPriority) // empty
|
|
queue.Enqueue(a) // {a 1}
|
|
queue.Enqueue(c) // {c 3}, {a 1}
|
|
queue.Enqueue(b) // {c 3}, {b 2}, {a 1}
|
|
_ = queue.Values() // [{c 3} {b 2} {a 1}]
|
|
_, _ = queue.Peek() // {c 3} true
|
|
_, _ = queue.Dequeue() // {c 3} true
|
|
_, _ = queue.Dequeue() // {b 2} true
|
|
_, _ = queue.Dequeue() // {a 1} true
|
|
_, _ = queue.Dequeue() // <nil> false (nothing to dequeue)
|
|
queue.Clear() // empty
|
|
_ = queue.Empty() // true
|
|
_ = queue.Size() // 0
|
|
}
|