Indexed binary min-heap holding at most one entry per vertex for resolution-aware coarsening.
More...
#include <meshkit/coarseningqueue.hpp>
|
| | CoarseningQueue (std::size_t vertices, std::size_t maximumEntries=0) |
| | Create an empty queue for vertex ids in [0, vertices).
|
| |
| bool | empty () const |
| | True when no entry is queued.
|
| |
| std::size_t | size () const |
| | Number of queued entries (at most one per vertex).
|
| |
| std::size_t | capacityBytes () const |
| | Bytes of allocated heap and index storage (capacity, not size).
|
| |
| void | update (Entry entry) |
| | Insert the vertex's entry, or replace its existing entry, and restore heap order.
|
| |
| Entry | pop () |
| | Remove and return the first entry in queue order.
|
| |
Indexed binary min-heap holding at most one entry per vertex for resolution-aware coarsening.
Entries are ordered by tile, then importance, then density, then vertex id, all ascending.
◆ CoarseningQueue()
| meshkit::CoarseningQueue::CoarseningQueue |
( |
std::size_t | vertices, |
|
|
std::size_t | maximumEntries = 0 ) |
|
inlineexplicit |
Create an empty queue for vertex ids in [0, vertices).
- Parameters
-
| [in] | vertices | Size of the vertex-to-slot index (one int per vertex). |
| [in] | maximumEntries | Heap capacity to reserve, capped at vertices; 0 reserves none. |
◆ capacityBytes()
| std::size_t meshkit::CoarseningQueue::capacityBytes |
( |
| ) |
const |
|
inline |
Bytes of allocated heap and index storage (capacity, not size).
◆ empty()
| bool meshkit::CoarseningQueue::empty |
( |
| ) |
const |
|
inline |
True when no entry is queued.
◆ pop()
| Entry meshkit::CoarseningQueue::pop |
( |
| ) |
|
|
inline |
Remove and return the first entry in queue order.
- Returns
- The removed entry; the queue must not be empty (unchecked).
◆ size()
| std::size_t meshkit::CoarseningQueue::size |
( |
| ) |
const |
|
inline |
Number of queued entries (at most one per vertex).
◆ update()
| void meshkit::CoarseningQueue::update |
( |
Entry | entry | ) |
|
|
inline |
Insert the vertex's entry, or replace its existing entry, and restore heap order.
- Parameters
-
| [in] | entry | New priority; entry.vertex must lie in [0, vertices) (unchecked). |
The documentation for this class was generated from the following file: