|
95 | 95 | e++ |
96 | 96 | ) { |
97 | 97 | var s = o.charCodeAt(e); |
98 | | - (n[2 * e] = s >>> 8), (n[2 * e + 1] = s % 256); |
| 98 | + ((n[2 * e] = s >>> 8), (n[2 * e + 1] = s % 256)); |
99 | 99 | } |
100 | 100 | return n; |
101 | 101 | }, |
|
162 | 162 | if (Object.prototype.hasOwnProperty.call(u, c)) { |
163 | 163 | if (c.charCodeAt(0) < 256) { |
164 | 164 | for (e = 0; e < h; e++) |
165 | | - (m <<= 1), |
166 | | - v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++; |
| 165 | + ((m <<= 1), |
| 166 | + v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++); |
167 | 167 | for (t = c.charCodeAt(0), e = 0; e < 8; e++) |
168 | | - (m = (m << 1) | (1 & t)), |
| 168 | + ((m = (m << 1) | (1 & t)), |
169 | 169 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
170 | | - (t >>= 1); |
| 170 | + (t >>= 1)); |
171 | 171 | } else { |
172 | 172 | for (t = 1, e = 0; e < h; e++) |
173 | | - (m = (m << 1) | t), |
| 173 | + ((m = (m << 1) | t), |
174 | 174 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
175 | | - (t = 0); |
| 175 | + (t = 0)); |
176 | 176 | for (t = c.charCodeAt(0), e = 0; e < 16; e++) |
177 | | - (m = (m << 1) | (1 & t)), |
| 177 | + ((m = (m << 1) | (1 & t)), |
178 | 178 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
179 | | - (t >>= 1); |
| 179 | + (t >>= 1)); |
180 | 180 | } |
181 | | - 0 == --l && ((l = Math.pow(2, h)), h++), delete u[c]; |
| 181 | + (0 == --l && ((l = Math.pow(2, h)), h++), delete u[c]); |
182 | 182 | } else |
183 | 183 | for (t = s[c], e = 0; e < h; e++) |
184 | | - (m = (m << 1) | (1 & t)), |
| 184 | + ((m = (m << 1) | (1 & t)), |
185 | 185 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
186 | | - (t >>= 1); |
187 | | - 0 == --l && ((l = Math.pow(2, h)), h++), |
| 186 | + (t >>= 1)); |
| 187 | + (0 == --l && ((l = Math.pow(2, h)), h++), |
188 | 188 | (s[p] = f++), |
189 | | - (c = String(a)); |
| 189 | + (c = String(a))); |
190 | 190 | } |
191 | 191 | if ("" !== c) { |
192 | 192 | if (Object.prototype.hasOwnProperty.call(u, c)) { |
193 | 193 | if (c.charCodeAt(0) < 256) { |
194 | 194 | for (e = 0; e < h; e++) |
195 | | - (m <<= 1), v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++; |
| 195 | + ((m <<= 1), |
| 196 | + v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++); |
196 | 197 | for (t = c.charCodeAt(0), e = 0; e < 8; e++) |
197 | | - (m = (m << 1) | (1 & t)), |
| 198 | + ((m = (m << 1) | (1 & t)), |
198 | 199 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
199 | | - (t >>= 1); |
| 200 | + (t >>= 1)); |
200 | 201 | } else { |
201 | 202 | for (t = 1, e = 0; e < h; e++) |
202 | | - (m = (m << 1) | t), |
| 203 | + ((m = (m << 1) | t), |
203 | 204 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
204 | | - (t = 0); |
| 205 | + (t = 0)); |
205 | 206 | for (t = c.charCodeAt(0), e = 0; e < 16; e++) |
206 | | - (m = (m << 1) | (1 & t)), |
| 207 | + ((m = (m << 1) | (1 & t)), |
207 | 208 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
208 | | - (t >>= 1); |
| 209 | + (t >>= 1)); |
209 | 210 | } |
210 | | - 0 == --l && ((l = Math.pow(2, h)), h++), delete u[c]; |
| 211 | + (0 == --l && ((l = Math.pow(2, h)), h++), delete u[c]); |
211 | 212 | } else |
212 | 213 | for (t = s[c], e = 0; e < h; e++) |
213 | | - (m = (m << 1) | (1 & t)), |
| 214 | + ((m = (m << 1) | (1 & t)), |
214 | 215 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
215 | | - (t >>= 1); |
| 216 | + (t >>= 1)); |
216 | 217 | 0 == --l && ((l = Math.pow(2, h)), h++); |
217 | 218 | } |
218 | 219 | for (t = 2, e = 0; e < h; e++) |
219 | | - (m = (m << 1) | (1 & t)), |
| 220 | + ((m = (m << 1) | (1 & t)), |
220 | 221 | v == o - 1 ? ((v = 0), d.push(n(m)), (m = 0)) : v++, |
221 | | - (t >>= 1); |
| 222 | + (t >>= 1)); |
222 | 223 | for (;;) { |
223 | 224 | if (((m <<= 1), v == o - 1)) { |
224 | 225 | d.push(n(m)); |
|
258 | 259 | }; |
259 | 260 | for (t = 0; t < 3; t += 1) l[t] = t; |
260 | 261 | for (s = 0, a = Math.pow(2, 2), p = 1; p != a; ) |
261 | | - (u = g.val & g.position), |
| 262 | + ((u = g.val & g.position), |
262 | 263 | (g.position >>= 1), |
263 | 264 | 0 == g.position && ((g.position = n), (g.val = e(g.index++))), |
264 | 265 | (s |= (u > 0 ? 1 : 0) * p), |
265 | | - (p <<= 1); |
| 266 | + (p <<= 1)); |
266 | 267 | switch (s) { |
267 | 268 | case 0: |
268 | 269 | for (s = 0, a = Math.pow(2, 8), p = 1; p != a; ) |
269 | | - (u = g.val & g.position), |
| 270 | + ((u = g.val & g.position), |
270 | 271 | (g.position >>= 1), |
271 | 272 | 0 == g.position && ((g.position = n), (g.val = e(g.index++))), |
272 | 273 | (s |= (u > 0 ? 1 : 0) * p), |
273 | | - (p <<= 1); |
| 274 | + (p <<= 1)); |
274 | 275 | c = r(s); |
275 | 276 | break; |
276 | 277 | case 1: |
277 | 278 | for (s = 0, a = Math.pow(2, 16), p = 1; p != a; ) |
278 | | - (u = g.val & g.position), |
| 279 | + ((u = g.val & g.position), |
279 | 280 | (g.position >>= 1), |
280 | 281 | 0 == g.position && ((g.position = n), (g.val = e(g.index++))), |
281 | 282 | (s |= (u > 0 ? 1 : 0) * p), |
282 | | - (p <<= 1); |
| 283 | + (p <<= 1)); |
283 | 284 | c = r(s); |
284 | 285 | break; |
285 | 286 | case 2: |
|
288 | 289 | for (l[3] = c, i = c, v.push(c); ; ) { |
289 | 290 | if (g.index > o) return ""; |
290 | 291 | for (s = 0, a = Math.pow(2, d), p = 1; p != a; ) |
291 | | - (u = g.val & g.position), |
| 292 | + ((u = g.val & g.position), |
292 | 293 | (g.position >>= 1), |
293 | 294 | 0 == g.position && ((g.position = n), (g.val = e(g.index++))), |
294 | 295 | (s |= (u > 0 ? 1 : 0) * p), |
295 | | - (p <<= 1); |
| 296 | + (p <<= 1)); |
296 | 297 | switch ((c = s)) { |
297 | 298 | case 0: |
298 | 299 | for (s = 0, a = Math.pow(2, 8), p = 1; p != a; ) |
299 | | - (u = g.val & g.position), |
| 300 | + ((u = g.val & g.position), |
300 | 301 | (g.position >>= 1), |
301 | 302 | 0 == g.position && ((g.position = n), (g.val = e(g.index++))), |
302 | 303 | (s |= (u > 0 ? 1 : 0) * p), |
303 | | - (p <<= 1); |
304 | | - (l[h++] = r(s)), (c = h - 1), f--; |
| 304 | + (p <<= 1)); |
| 305 | + ((l[h++] = r(s)), (c = h - 1), f--); |
305 | 306 | break; |
306 | 307 | case 1: |
307 | 308 | for (s = 0, a = Math.pow(2, 16), p = 1; p != a; ) |
308 | | - (u = g.val & g.position), |
| 309 | + ((u = g.val & g.position), |
309 | 310 | (g.position >>= 1), |
310 | 311 | 0 == g.position && ((g.position = n), (g.val = e(g.index++))), |
311 | 312 | (s |= (u > 0 ? 1 : 0) * p), |
312 | | - (p <<= 1); |
313 | | - (l[h++] = r(s)), (c = h - 1), f--; |
| 313 | + (p <<= 1)); |
| 314 | + ((l[h++] = r(s)), (c = h - 1), f--); |
314 | 315 | break; |
315 | 316 | case 2: |
316 | 317 | return v.join(""); |
|
321 | 322 | if (c !== h) return null; |
322 | 323 | m = i + i.charAt(0); |
323 | 324 | } |
324 | | - v.push(m), |
| 325 | + (v.push(m), |
325 | 326 | (l[h++] = i + m.charAt(0)), |
326 | 327 | (i = m), |
327 | | - 0 == --f && ((f = Math.pow(2, d)), d++); |
| 328 | + 0 == --f && ((f = Math.pow(2, d)), d++)); |
328 | 329 | } |
329 | 330 | }, |
330 | 331 | }; |
|
0 commit comments