Generated from: MR::Heap<float, MR::GraphVertId, std::greater<float>>
\\brief stores map from element id in[0, size) to T;
\\details provides two operations:
1) change the value of any element;
2) find the element with the largest value
| mrmeshpy.ConstHeap_float_GraphVertId_std_greater_float.__init__ |
( |
| self, |
|
|
* | args, |
|
|
** | kwargs ) |
__init__(*args, **kwargs)
Overloaded function.
1. __init__(self: meshlib.mrmeshpy.ConstHeap_float_GraphVertId_std_greater_float, pred: meshlib.mrmeshpy.std_greater_float = meshlib.mrmeshpy.std_greater_float()) -> None
constructs an empty heap
2. __init__(self: meshlib.mrmeshpy.ConstHeap_float_GraphVertId_std_greater_float, size: int, def_: float = 0.0, pred: meshlib.mrmeshpy.std_greater_float = meshlib.mrmeshpy.std_greater_float()) -> None
constructs heap for given number of elements, assigning given default value to each element
3. __init__(self: meshlib.mrmeshpy.ConstHeap_float_GraphVertId_std_greater_float, elms: meshlib.mrmeshpy.Const_std_vector_Heap_float_Id_GraphVertTag_std_greater_float_Element, pred: meshlib.mrmeshpy.std_greater_float = meshlib.mrmeshpy.std_greater_float()) -> None
constructs heap from given elements (id's shall not repeat, but can have spaces and be arbitrary shuffled)
4. __init__(self: meshlib.mrmeshpy.ConstHeap_float_GraphVertId_std_greater_float, arg0: meshlib.mrmeshpy.ConstHeap_float_GraphVertId_std_greater_float) -> None
Implicit copy constructor.
5. __init__(self: meshlib.mrmeshpy.ConstHeap_float_GraphVertId_std_greater_float, : meshlib.mrmeshpy.ConstHeap_float_GraphVertId_std_greater_float) -> None