priority_queue_local Namespace Reference [Internals]

Classes
class	internal_priority_queue
	Similar to std::priority_queue, with the following differences: Maximum size is fixed at construction time, so an array can be used. Provides access to underlying heap, so (parallel) sorting in place is possible. Can be cleared "at once", without reallocation. More...
class	internal_bounded_stack
	Similar to std::stack, with the following differences: Maximum size is fixed at compilation time, so an array can be used. Can be cleared "at once", without reallocation. More...
class	ext_merger
	External merger, based on the loser tree data structure. ! More...
class	loser_tree
	Loser tree from Knuth, "Sorting and Searching", Section 5.4.1 ! More...

---

Detailed Description

For internal use only.