Agreed, and as graff's second update points out, this is a dependency ordering problem which can better be solved with graph techniques that don't involve priority numbering.
In reply to Re^3: a hash with priority
by simonm
in thread a hash with priority
by meirgold
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |