Вы не можете выбрать более 25 тем Темы должны начинаться с буквы или цифры, могут содержать дефисы(-) и должны содержать не более 35 символов.

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240
  1. 'use strict';
  2. // #ifdef MP-WEIXIN
  3. (function(r) {
  4. function x() {}
  5. function y() {}
  6. var z = String.fromCharCode,
  7. v = {}.toString,
  8. A = v.call(r.SharedArrayBuffer),
  9. B = v(),
  10. q = r.Uint8Array,
  11. t = q || Array,
  12. w = q ? ArrayBuffer : t,
  13. C = w.isView || function(g) {
  14. return g && "length" in g
  15. },
  16. D = v.call(w.prototype);
  17. w = y.prototype;
  18. var E = r.TextEncoder,
  19. a = new(q ? Uint16Array : t)(32);
  20. x.prototype.decode = function(g) {
  21. if (!C(g)) {
  22. var l = v.call(g);
  23. if (l !== D && l !== A && l !== B) throw TypeError(
  24. "Failed to execute 'decode' on 'TextDecoder': The provided value is not of type '(ArrayBuffer or ArrayBufferView)'"
  25. );
  26. g = q ? new t(g) : g || []
  27. }
  28. for (var f = l = "", b = 0, c = g.length | 0, u = c - 32 | 0, e, d, h = 0, p = 0, m, k = 0, n = -1; b <
  29. c;) {
  30. for (e = b <= u ? 32 : c - b | 0; k < e; b = b + 1 | 0, k = k + 1 | 0) {
  31. d = g[b] & 255;
  32. switch (d >> 4) {
  33. case 15:
  34. m = g[b = b + 1 | 0] & 255;
  35. if (2 !== m >> 6 || 247 < d) {
  36. b = b - 1 | 0;
  37. break
  38. }
  39. h = (d & 7) << 6 | m & 63;
  40. p = 5;
  41. d = 256;
  42. case 14:
  43. m = g[b = b + 1 | 0] & 255, h <<= 6, h |= (d & 15) << 6 | m & 63, p = 2 === m >> 6 ? p +
  44. 4 | 0 : 24, d = d + 256 & 768;
  45. case 13:
  46. case 12:
  47. m = g[b = b + 1 | 0] & 255, h <<= 6, h |= (d & 31) << 6 | m & 63, p = p + 7 | 0, b <
  48. c && 2 === m >> 6 && h >> p && 1114112 > h ? (d = h, h = h - 65536 | 0, 0 <= h && (
  49. n = (h >> 10) + 55296 | 0, d = (h & 1023) + 56320 | 0, 31 > k ? (a[k] = n,
  50. k = k + 1 | 0, n = -1) :
  51. (m = n, n = d, d = m))) : (d >>= 8, b = b - d - 1 | 0, d = 65533), h = p = 0,
  52. e = b <= u ? 32 : c - b | 0;
  53. default:
  54. a[k] = d;
  55. continue;
  56. case 11:
  57. case 10:
  58. case 9:
  59. case 8:
  60. }
  61. a[k] = 65533
  62. }
  63. f += z(a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8], a[9], a[10], a[11], a[12], a[13], a[
  64. 14], a[15], a[16], a[17], a[18], a[19], a[20], a[21], a[22], a[23], a[24], a[25], a[26], a[
  65. 27], a[28], a[29], a[30], a[31]);
  66. 32 > k && (f = f.slice(0, k - 32 | 0));
  67. if (b < c) {
  68. if (a[0] = n, k = ~n >>> 31, n = -1, f.length < l.length) continue
  69. } else - 1 !== n && (f += z(n));
  70. l += f;
  71. f = ""
  72. }
  73. return l
  74. };
  75. w.encode = function(g) {
  76. g = void 0 === g ? "" : "" + g;
  77. var l = g.length |
  78. 0,
  79. f = new t((l << 1) + 8 | 0),
  80. b, c = 0,
  81. u = !q;
  82. for (b = 0; b < l; b = b + 1 | 0, c = c + 1 | 0) {
  83. var e = g.charCodeAt(b) | 0;
  84. if (127 >= e) f[c] = e;
  85. else {
  86. if (2047 >= e) f[c] = 192 | e >> 6;
  87. else {
  88. a: {
  89. if (55296 <= e)
  90. if (56319 >= e) {
  91. var d = g.charCodeAt(b = b + 1 | 0) | 0;
  92. if (56320 <= d && 57343 >= d) {
  93. e = (e << 10) + d - 56613888 | 0;
  94. if (65535 < e) {
  95. f[c] = 240 | e >> 18;
  96. f[c = c + 1 | 0] = 128 | e >> 12 & 63;
  97. f[c = c + 1 | 0] = 128 | e >> 6 & 63;
  98. f[c = c + 1 | 0] = 128 | e & 63;
  99. continue
  100. }
  101. break a
  102. }
  103. e = 65533
  104. } else 57343 >= e && (e = 65533);!u && b << 1 < c && b << 1 < (c - 7 | 0) && (u = !
  105. 0, d = new t(3 * l), d.set(f), f = d)
  106. }
  107. f[c] = 224 | e >> 12;f[c = c + 1 | 0] = 128 | e >> 6 & 63
  108. }
  109. f[c = c + 1 | 0] = 128 | e & 63
  110. }
  111. }
  112. return q ?
  113. f.subarray(0, c) : f.slice(0, c)
  114. };
  115. E || (r.TextDecoder = x, r.TextEncoder = y)
  116. })("" + void 0 == typeof global ? "" + void 0 == typeof self ? this : self : global); //AnonyCo
  117. //# sourceMappingURL=https://cdn.jsdelivr.net/gh/AnonyCo/FastestSmallestTextEncoderDecoder/EncoderDecoderTogether.min.js.map
  118. // #endif
  119. // #ifdef MP-ALIPAY
  120. (function(r) {
  121. function x() {}
  122. function y() {}
  123. var z = String.fromCharCode,
  124. v = {}.toString,
  125. A = v.call(r.SharedArrayBuffer),
  126. B = v(),
  127. q = r.Uint8Array,
  128. t = q || Array,
  129. w = q ? ArrayBuffer : t,
  130. C = w.isView || function(g) {
  131. return g && "length" in g
  132. },
  133. D = v.call(w.prototype);
  134. w = y.prototype;
  135. var E = r.TextEncoder,
  136. a = new(q ? Uint16Array : t)(32);
  137. x.prototype.decode = function(g) {
  138. if (!C(g)) {
  139. var l = v.call(g);
  140. if (l !== D && l !== A && l !== B) throw TypeError(
  141. "Failed to execute 'decode' on 'TextDecoder': The provided value is not of type '(ArrayBuffer or ArrayBufferView)'"
  142. );
  143. g = q ? new t(g) : g || []
  144. }
  145. for (var f = l = "", b = 0, c = g.length | 0, u = c - 32 | 0, e, d, h = 0, p = 0, m, k = 0, n = -1; b <
  146. c;) {
  147. for (e = b <= u ? 32 : c - b | 0; k < e; b = b + 1 | 0, k = k + 1 | 0) {
  148. d = g[b] & 255;
  149. switch (d >> 4) {
  150. case 15:
  151. m = g[b = b + 1 | 0] & 255;
  152. if (2 !== m >> 6 || 247 < d) {
  153. b = b - 1 | 0;
  154. break
  155. }
  156. h = (d & 7) << 6 | m & 63;
  157. p = 5;
  158. d = 256;
  159. case 14:
  160. m = g[b = b + 1 | 0] & 255, h <<= 6, h |= (d & 15) << 6 | m & 63, p = 2 === m >> 6 ? p +
  161. 4 | 0 : 24, d = d + 256 & 768;
  162. case 13:
  163. case 12:
  164. m = g[b = b + 1 | 0] & 255, h <<= 6, h |= (d & 31) << 6 | m & 63, p = p + 7 | 0, b <
  165. c && 2 === m >> 6 && h >> p && 1114112 > h ? (d = h, h = h - 65536 | 0, 0 <= h && (
  166. n = (h >> 10) + 55296 | 0, d = (h & 1023) + 56320 | 0, 31 > k ? (a[k] = n,
  167. k = k + 1 | 0, n = -1) :
  168. (m = n, n = d, d = m))) : (d >>= 8, b = b - d - 1 | 0, d = 65533), h = p = 0,
  169. e = b <= u ? 32 : c - b | 0;
  170. default:
  171. a[k] = d;
  172. continue;
  173. case 11:
  174. case 10:
  175. case 9:
  176. case 8:
  177. }
  178. a[k] = 65533
  179. }
  180. f += z(a[0], a[1], a[2], a[3], a[4], a[5], a[6], a[7], a[8], a[9], a[10], a[11], a[12], a[13], a[
  181. 14], a[15], a[16], a[17], a[18], a[19], a[20], a[21], a[22], a[23], a[24], a[25], a[26], a[
  182. 27], a[28], a[29], a[30], a[31]);
  183. 32 > k && (f = f.slice(0, k - 32 | 0));
  184. if (b < c) {
  185. if (a[0] = n, k = ~n >>> 31, n = -1, f.length < l.length) continue
  186. } else - 1 !== n && (f += z(n));
  187. l += f;
  188. f = ""
  189. }
  190. return l
  191. };
  192. w.encode = function(g) {
  193. g = void 0 === g ? "" : "" + g;
  194. var l = g.length |
  195. 0,
  196. f = new t((l << 1) + 8 | 0),
  197. b, c = 0,
  198. u = !q;
  199. for (b = 0; b < l; b = b + 1 | 0, c = c + 1 | 0) {
  200. var e = g.charCodeAt(b) | 0;
  201. if (127 >= e) f[c] = e;
  202. else {
  203. if (2047 >= e) f[c] = 192 | e >> 6;
  204. else {
  205. a: {
  206. if (55296 <= e)
  207. if (56319 >= e) {
  208. var d = g.charCodeAt(b = b + 1 | 0) | 0;
  209. if (56320 <= d && 57343 >= d) {
  210. e = (e << 10) + d - 56613888 | 0;
  211. if (65535 < e) {
  212. f[c] = 240 | e >> 18;
  213. f[c = c + 1 | 0] = 128 | e >> 12 & 63;
  214. f[c = c + 1 | 0] = 128 | e >> 6 & 63;
  215. f[c = c + 1 | 0] = 128 | e & 63;
  216. continue
  217. }
  218. break a
  219. }
  220. e = 65533
  221. } else 57343 >= e && (e = 65533);!u && b << 1 < c && b << 1 < (c - 7 | 0) && (u = !
  222. 0, d = new t(3 * l), d.set(f), f = d)
  223. }
  224. f[c] = 224 | e >> 12;f[c = c + 1 | 0] = 128 | e >> 6 & 63
  225. }
  226. f[c = c + 1 | 0] = 128 | e & 63
  227. }
  228. }
  229. return q ?
  230. f.subarray(0, c) : f.slice(0, c)
  231. };
  232. E || (r.TextDecoder = x, r.TextEncoder = y)
  233. })("" + void 0 == typeof $global ? "" + void 0 == typeof self ? this : self : $global); //AnonyCo
  234. //# sourceMappingURL=https://cdn.jsdelivr.net/gh/AnonyCo/FastestSmallestTextEncoderDecoder/EncoderDecoderTogether.min.js.map
  235. // #endif