BinaryHeap.this

Converts the store s into a heap. If initialSize is specified, only the first initialSize elements in s are transformed into a heap, after which the heap can grow up to r.length (if Store is a range) or indefinitely (if Store is a container with insertBack). Performs O(min(r.length, initialSize)) evaluations of less.

  1. this()
  2. this(Store s, size_t initialSize)
    struct BinaryHeap(alias less = "a < b", Store)
    this
    (
    Store s
    ,
    size_t initialSize = size_t.max
    )
    if (
    isRandomAccessRange!Store ||
    isRandomAccessRange!(typeof(Store.init[]))
    )

Meta