| 895 | return 0 === t && n === e.length ? r.fromByteArray(e) : r.fromByteArray(e.slice(t, n)) |
| 896 | } |
| 897 | function O(e, t, n) { |
| 898 | n = Math.min(e.length, n); |
| 899 | for (var r = [], i = t; i < n; ) { |
| 900 | var o, a, s, u, c = e[i], l = null, f = c > 239 ? 4 : c > 223 ? 3 : c > 191 ? 2 : 1; |
| 901 | if (i + f <= n) |
| 902 | switch (f) { |
| 903 | case 1: |
| 904 | c < 128 && (l = c); |
| 905 | break; |
| 906 | case 2: |
| 907 | 128 == (192 & (o = e[i + 1])) && ((u = (31 & c) << 6 | 63 & o) > 127 && (l = u)); |
| 908 | break; |
| 909 | case 3: |
| 910 | o = e[i + 1], |
| 911 | a = e[i + 2], |
| 912 | 128 == (192 & o) && 128 == (192 & a) && ((u = (15 & c) << 12 | (63 & o) << 6 | 63 & a) > 2047 && (u < 55296 || u > 57343) && (l = u)); |
| 913 | break; |
| 914 | case 4: |
| 915 | o = e[i + 1], |
| 916 | a = e[i + 2], |
| 917 | s = e[i + 3], |
| 918 | 128 == (192 & o) && 128 == (192 & a) && 128 == (192 & s) && ((u = (15 & c) << 18 | (63 & o) << 12 | (63 & a) << 6 | 63 & s) > 65535 && u < 1114112 && (l = u)) |
| 919 | } |
| 920 | null === l ? (l = 65533, |
| 921 | f = 1) : l > 65535 && (l -= 65536, |
| 922 | r.push(l >>> 10 & 1023 | 55296), |
| 923 | l = 56320 | 1023 & l), |
| 924 | r.push(l), |
| 925 | i += f |
| 926 | } |
| 927 | return function(e) { |
| 928 | var t = e.length; |
| 929 | if (t <= k) |
| 930 | return String.fromCharCode.apply(String, e); |
| 931 | var n = "" |
| 932 | , r = 0; |
| 933 | for (; r < t; ) |
| 934 | n += String.fromCharCode.apply(String, e.slice(r, r += k)); |
| 935 | return n |
| 936 | }(r) |
| 937 | } |
| 938 | t.Buffer = u, |
| 939 | t.SlowBuffer = function(e) { |
| 940 | return +e != e && (e = 0), |