(s, o)
| 2870 | Qe, |
| 2871 | et = {} |
| 2872 | function iterateList(s, o) { |
| 2873 | var i = s._origin, |
| 2874 | a = s._capacity, |
| 2875 | u = getTailOffset(a), |
| 2876 | _ = s._tail |
| 2877 | return iterateNodeOrLeaf(s._root, s._level, 0) |
| 2878 | function iterateNodeOrLeaf(s, o, i) { |
| 2879 | return 0 === o ? iterateLeaf(s, i) : iterateNode(s, o, i) |
| 2880 | } |
| 2881 | function iterateLeaf(s, w) { |
| 2882 | var C = w === u ? _ && _.array : s && s.array, |
| 2883 | j = w > i ? 0 : i - w, |
| 2884 | L = a - w |
| 2885 | return ( |
| 2886 | L > x && (L = x), |
| 2887 | function () { |
| 2888 | if (j === L) return et |
| 2889 | var s = o ? --L : j++ |
| 2890 | return C && C[s] |
| 2891 | } |
| 2892 | ) |
| 2893 | } |
| 2894 | function iterateNode(s, u, _) { |
| 2895 | var C, |
| 2896 | j = s && s.array, |
| 2897 | L = _ > i ? 0 : (i - _) >> u, |
| 2898 | B = 1 + ((a - _) >> u) |
| 2899 | return ( |
| 2900 | B > x && (B = x), |
| 2901 | function () { |
| 2902 | for (;;) { |
| 2903 | if (C) { |
| 2904 | var s = C() |
| 2905 | if (s !== et) return s |
| 2906 | C = null |
| 2907 | } |
| 2908 | if (L === B) return et |
| 2909 | var i = o ? --B : L++ |
| 2910 | C = iterateNodeOrLeaf(j && j[i], u - w, _ + (i << u)) |
| 2911 | } |
| 2912 | } |
| 2913 | ) |
| 2914 | } |
| 2915 | } |
| 2916 | function makeList(s, o, i, a, u, _, w) { |
| 2917 | var x = Object.create(Ye) |
| 2918 | return ( |
no test coverage detected