min_max_heap 2.0.2 min_max_heap: ^2.0.2 copied to clipboard
A Min-max binary heap data structure implementation. AKA double ended priority queue. Supports generics.
Changelog #
1.1.0 #
- Initial published version.
2.0.0 #
A great update is here! New getters and changes.
- Major changes:
- Constructor now doesn't have the input parameter. To build a heap from an iterable, use the factory constructor fromIterable.
- Prefer the new alias, like enqueue and dequeue.
printTree
now islogTree
and uses thelog.info
method insteadprint
.
- Another changes
- Removed the following properties, methods and getters:
listMode
.operator []
.
- New getters:
isEmpty
.isNotEmpty
._lastFather
.dequeueMin
.tryMin
.tryDequeueMin
.dequeueMax
.tryMax
.tryDequeueMax
.asMapOfLevels
.
- New methods:
sortedView
.enqueue
.enqueueAll
.
- Changes:
- New factory constructor to build the heap from iterable.
iterable
.listMode
now isasList
.- Now the
Criteria
enum doesn't used anymore. A bool approach is used instead. - Improving doc comments.
- Removed the following properties, methods and getters:
2.0.1 #
- Renaming methods, like
enqueue*
anddequeue*
toadd*
and backing toremove*
. - New method
updateWhere
. This fix an issue at Github's repository. - Fixed
sorted
method - Some docs improvements.
2.0.2 #
- Better test coverage.
- New functions
isValidMinMaxHeapListView
getSubtreeOf
- New method
clear
, makes the heap empty.