refactor: name a var

Author: ChALkeR

fallback/encoding.util.js

@@ -36,27 +36,28 @@ export function unfinishedBytes(u, len, enc) {
 // otherwise returns a prefix with no unfinished bytes
 export function mergePrefix(u, chunk, enc) {
   if (u.length === 0) return chunk
+  const cl = chunk.length
   if (u.length < 3) {
     // No reason to bruteforce offsets, also it's possible this doesn't yet end the sequence
-    const a = new Uint8Array(u.length + chunk.length)
+    const a = new Uint8Array(u.length + cl)
     a.set(chunk)
-    a.set(u, chunk.length)
+    a.set(u, cl)
     return a
   }
 
   // Slice off a small portion of u into prefix chunk so we can decode them separately without extending array size
-  const t = new Uint8Array(chunk.length + 3) // We have 1-3 bytes and need 1-3 more bytes
+  const t = new Uint8Array(cl + 3) // We have 1-3 bytes and need 1-3 more bytes
   t.set(chunk)
-  t.set(u.subarray(0, 3), chunk.length)
+  t.set(u.subarray(0, 3), cl)
 
   // Stop at the first offset where unfinished bytes reaches 0 or fits into u
   // If that doesn't happen (u too short), just concat chunk and u completely (above)
   for (let i = 1; i <= 3; i++) {
-    const unfinished = unfinishedBytes(t, chunk.length + i, enc) // 0-3
+    const unfinished = unfinishedBytes(t, cl + i, enc) // 0-3
     if (unfinished <= i) {
       // Always reachable at 3, but we still need 'unfinished' value for it
       const add = i - unfinished // 0-3
-      return add > 0 ? t.subarray(0, chunk.length + add) : chunk
+      return add > 0 ? t.subarray(0, cl + add) : chunk
     }
   }