- Initial published version.
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:
- 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.
- Better test coverage.
- New functions
isValidMinMaxHeapListView
getSubtreeOf
- New method
clear
, makes the heap empty.
- Fixing a hint to try achieve 140 pub points
These update changes the signature of updateWhere
method and release a replaceWhere
method.
- The
updateWhere
method now isreplaceWhere
.replaceWhere
, as the name says, replace every element which predicate is satisfied.
- A new funtion
updateWhere
.- This function have change the signature. Now you should pass a void function.
For more details, see min_max_heap_test.dart
file.