std.container.binaryheap

This module provides a BinaryHeap (aka priority queue) adaptor that makes a binary heap out of any user-provided random-access range.

This module is a submodule of std.container.

Public Imports

std.container.util public import std.container.util;: Undocumented in source.

Members

Functions

heapify BinaryHeap!(Store, less) heapify(Store s, size_t initialSize): Convenience function that returns a BinaryHeap!Store object initialized with s and initialSize.

Structs

BinaryHeap struct BinaryHeap(Store, alias less = "a < b"): Implements a binary heap container on top of a given random-access range type (usually T[]) or a random-access container type (usually Array!T). The documentation of BinaryHeap will refer to the underlying range or container as the store of the heap.

Meta

Source

See Source File
std/container/binaryheap.d

License

Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at ).

Copyright

2010- Andrei Alexandrescu. All rights reserved by the respective holders.

Authors

Andrei Alexandrescu

std container modules

structs

TotalContainer