mirror of
https://github.com/emirpasic/gods
synced 2024-11-08 13:10:26 +00:00
62 lines
2.6 KiB
Go
62 lines
2.6 KiB
Go
|
/*
|
||
|
|
Copyright (c) 2015, Emir Pasic
|
||
|
|
All rights reserved.
|
||
|
|
|
||
|
|
Redistribution and use in source and binary forms, with or without
|
||
|
|
modification, are permitted provided that the following conditions are met:
|
||
|
|
|
||
|
|
* Redistributions of source code must retain the above copyright notice, this
|
||
|
|
list of conditions and the following disclaimer.
|
||
|
|
|
||
|
|
* Redistributions in binary form must reproduce the above copyright notice,
|
||
|
|
this list of conditions and the following disclaimer in the documentation
|
||
|
|
and/or other materials provided with the distribution.
|
||
|
|
|
||
|
|
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
||
|
|
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
|
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
|
||
|
|
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
|
||
|
|
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
|
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
|
||
|
|
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
||
|
|
CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
|
||
|
|
OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
|
OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
*/
|
||
|
|
|
||
|
|
package examples
|
||
|
|
|
||
|
|
import (
|
||
|
|
"github.com/emirpasic/gods/trees/binaryheap"
|
||
|
|
"github.com/emirpasic/gods/utils"
|
||
|
|
)
|
||
|
|
|
||
|
|
func BinaryHeapExample() {
|
||
|
|
|
||
|
|
// Min-heap
|
||
|
|
heap := binaryheap.NewWithIntComparator() // empty (min-heap)
|
||
|
|
heap.Push(2) // 2
|
||
|
|
heap.Push(3) // 2, 3
|
||
|
|
heap.Push(1) // 1, 3, 2
|
||
|
|
heap.Values() // 1, 3, 2
|
||
|
|
_, _ = heap.Peek() // 1,true
|
||
|
|
_, _ = heap.Pop() // 1, true
|
||
|
|
_, _ = heap.Pop() // 2, true
|
||
|
|
_, _ = heap.Pop() // 3, true
|
||
|
|
_, _ = heap.Pop() // nil, false (nothing to pop)
|
||
|
|
heap.Push(1) // 1
|
||
|
|
heap.Clear() // empty
|
||
|
|
heap.Empty() // true
|
||
|
|
heap.Size() // 0
|
||
|
|
|
||
|
|
// Max-heap
|
||
|
|
inverseIntComparator := func(a, b interface{}) int {
|
||
|
|
return -utils.IntComparator(a, b)
|
||
|
|
}
|
||
|
|
heap = binaryheap.NewWith(inverseIntComparator) // empty (min-heap)
|
||
|
|
heap.Push(2) // 2
|
||
|
|
heap.Push(3) // 3, 2
|
||
|
|
heap.Push(1) // 3, 2, 1
|
||
|
|
heap.Values() // 3, 2, 1
|
||
|
|
}
|