View source code
Display the source code in std/container/binaryheap.d from which this
page was generated on github.
Report a bug
If you spot a problem with this page, click here to create a
Bugzilla issue.
Improve this page
Quickly fork, edit online, and submit a pull request for this page.
Requires a signed-in GitHub account. This works well for small changes.
If you'd like to make larger changes you may want to consider using
local clone.
Function std.container.binaryheap.BinaryHeap.conditionalInsert
If the heap has room to grow, inserts value into the store and
returns true. Otherwise, if less(value, front), calls replaceFront(value) and returns again true. Otherwise, leaves
the heap unaffected and returns false. This method is useful in
scenarios where the smallest k elements of a set of candidates
must be collected.
Authors
License
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at ).
Copyright © 1999-2024 by the D Language Foundation | Page generated by ddox.