Lines Matching refs:heaps
39 * *Mergable*: While all heaps can be merged, some can be merged efficiently.
52 [note _heap_ implements priority queues as max-heaps to be consistent with the STL heap functions. …
53 the typical textbook design, which uses min-heaps.]
165 heaps element by element using =value_compare=.
168 heap order. On heaps without ordered iterators, the heap needs to be copied internally. The typical…
195 _heap_ provides a =heap_merge()= algorithm that is can be used to merge different kinds of heaps. U…
306 …[@http://en.wikipedia.org/wiki/D-ary_heap D-ary heaps] are a generalization of binary heap with ea…
308 … child node is bigger. D-ary heaps are implemented as container adaptors based on a =std::vector=.
316 …[@http://en.wikipedia.org/wiki/Binomial_heap Binomial heaps] are node-base heaps, that are impleme…
318 In contrast to d-ary heaps, binomial heaps can also be merged in O(log n).
324 …[@http://en.wikipedia.org/wiki/Fibonacci_heap Fibonacci heaps] are node-base heaps, that are imple…
325 …heap-ordered trees. They provide better amortized performance than binomial heaps. Except =pop()= …
332 …[@http://en.wikipedia.org/wiki/Pairing_heap Pairing heaps] are self-adjusting node-based heaps. Al…
335 …Pettie, Seth (2005), "Towards a final analysis of pairing heaps", Proc. 46th Annual IEEE Symposium…
341 …[@http://en.wikipedia.org/wiki/Skew_heap Skew heaps] are self-adjusting node-based heaps. Although…