cp_library/ds/heap/heap_proto.py

• View this file on GitHub
• Last update: 2025-03-30 20:17:47+09:00

Required by

• cp_library/alg/graph/digraph_weighted_cls.py
• cp_library/alg/graph/fast/digraph_weighted_cls.py
• cp_library/alg/graph/fast/digraph_weighted_meta_cls.py
• cp_library/alg/graph/fast/graph_weighted_base_cls.py
• cp_library/alg/graph/fast/graph_weighted_cls.py
• cp_library/alg/graph/fast/graph_weighted_meta_cls.py
• cp_library/alg/graph/graph_weighted_cls.py
• cp_library/alg/graph/graph_weighted_proto.py
• cp_library/alg/graph/shortest_path_fn.py
• cp_library/alg/tree/fast/aux_tree_base_cls.py
• cp_library/alg/tree/fast/aux_tree_cls.py
• cp_library/alg/tree/fast/aux_tree_weighted_cls.py
• cp_library/alg/tree/fast/hld_weighted_cls.py
• cp_library/alg/tree/fast/tree_weighted_base_cls.py
• cp_library/alg/tree/fast/tree_weighted_cls.py
• cp_library/alg/tree/fast/tree_weighted_meta_cls.py
• cp_library/alg/tree/tree_weighted_cls.py
• cp_library/alg/tree/tree_weighted_proto.py
• cp_library/ds/heap/k_heap_mixin.py
• cp_library/ds/heap/max_heap_cls.py
• cp_library/ds/heap/max_k_heap_cls.py
• cp_library/ds/heap/max_priority_queue_cls.py
• cp_library/ds/heap/min_heap_cls.py
• cp_library/ds/heap/min_k_heap_cls.py
• cp_library/ds/heap/priority_queue_cls.py

Verified with

• test/aoj/grl/grl_1_a_dijkstra.test.py
• test/aoj/grl/grl_1_a_fast_dijkstra.test.py
• test/aoj/grl/grl_1_a_graph_distance.test.py
• test/aoj/grl/grl_1_b_bellman_ford.test.py
• test/aoj/grl/grl_1_b_fast_bellman_ford.test.py
• test/aoj/grl/grl_1_b_graph_bellman_ford.test.py
• test/aoj/grl/grl_1_c_fast_floyd_warshall.test.py
• test/aoj/grl/grl_1_c_floyd_warshall.test.py
• test/aoj/grl/grl_2_a_graph_kruskal.test.py
• test/aoj/grl/grl_5_a_diameter.test.py
• test/aoj/grl/grl_5_a_fast_diameter.test.py
• test/aoj/grl/grl_5_b_fast_height.test.py
• test/aoj/vol/0439_aux_dijkstra.test.py
• test/aoj/vol/0439_aux_rerooting_dp.test.py
• test/aoj/vol/0439_aux_weighted_rerooting_dp.test.py
• test/atcoder/abc/abc218_f_shortest_path_weighted.test.py
• test/atcoder/abc/abc249_f_max_k_heap.test.py
• test/atcoder/abc/abc249_f_min_k_heap.test.py
• test/atcoder/abc/abc294_g_fast_tree_hld.test.py
• test/atcoder/abc/abc294_g_fast_tree_hld_bit.test.py
• test/atcoder/abc/abc294_g_fast_tree_lca_table_weighted_bit.test.py
• test/atcoder/abc/abc361_e_tree_diameter.test.py
• test/atcoder/abc/abc375_g_find_bridges.test.py
• test/library-checker/graph/minimum_spanning_tree_kruskal.test.py
• test/library-checker/graph/minimum_spanning_tree_kruskal_heap.test.py
• test/library-checker/graph/shortest_path_fast_graph.test.py
• test/library-checker/graph/shortest_path_graph_weighted.test.py
• test/library-checker/graph/shortest_path_min_heap.test.py
• test/library-checker/tree/tree_diameter.test.py
• test/library-checker/tree/tree_path_composite_sum.test.py
• test/yukicoder/3407.test.py

Code

import cp_library.ds.heap.__header__
from typing import Generic
from cp_library.misc.typing import _T

class HeapProtocol(Generic[_T]):
    def pop(self) -> _T: ...
    def push(self, item: _T): ...
    def pushpop(self, item: _T) -> _T: ...
    def replace(self, item: _T) -> _T: ...

'''
╺━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━━╸
             https://kobejean.github.io/cp-library               
'''
from typing import Generic
from typing import TypeVar
_T = TypeVar('T')

class HeapProtocol(Generic[_T]):
    def pop(self) -> _T: ...
    def push(self, item: _T): ...
    def pushpop(self, item: _T) -> _T: ...
    def replace(self, item: _T) -> _T: ...

Back to top page