(tree, n, m, depth)
| 22902 | * the subtrees have equal frequency. This minimizes the worst case length. |
| 22903 | */ |
| 22904 | function smaller(tree, n, m, depth) { |
| 22905 | var _n2 = n * 2; |
| 22906 | var _m2 = m * 2; |
| 22907 | return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || |
| 22908 | (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); |
| 22909 | } |
| 22910 | |
| 22911 | /* =========================================================================== |
| 22912 | * Restore the heap property by moving down the tree starting at node k, |