moonbitlang / core / 3149

push

github

fix(priority_queue): rewrite copy() iteratively to prevent stack overflow

The recursive copy_node() walked both sibling and child chains via
recursion. In a pairing heap, monotonic insert patterns create linear
sibling chains, so copy() would overflow the stack on large queues
(e.g., 200k elements).

Rewrite to use an explicit work stack, processing child and sibling
links iteratively. Add a regression test with 10k monotonic inserts
to verify copy works on deep structures.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>

5 of 7 new or added lines in 1 file covered. (71.43%)

13826 of 14444 relevant lines covered (95.72%)

175992.02 hits per line