gitflarePublicPartly agent-ready50
cf-r2-drop
Drag-and-drop file sharing on Cloudflare R2: multipart uploads, expiring share links, previews, download counts, lifecycle expiry.
- LicenseApache-2.0
- LanguageTypeScript
- Last landed
0e4544fOct 20, 2026
Serve the share page from the extensionless asset path
0e4544f// Byte-mode, ECC level M QR encoder, versions 1-10. Returns a boolean matrix (true = dark).// [ecPerBlock, g1Blocks, g1Data, g2Blocks, g2Data]const M: number[][] = [ [10, 1, 16, 0, 0], [16, 1, 28, 0, 0], [26, 1, 44, 0, 0], [18, 2, 32, 0, 0], [24, 2, 43, 0, 0], [16, 4, 27, 0, 0], [18, 4, 31, 0, 0], [22, 2, 38, 2, 39], [22, 3, 36, 2, 37], [26, 4, 43, 1, 44],];const ALIGN: number[][] = [[], [6, 18], [6, 22], [6, 26], [6, 30], [6, 34], [6, 22, 38], [6, 24, 42], [6, 26, 46], [6, 28, 50]]; const EXP = new Uint8Array(512), LOG = new Uint8Array(256);for (let i = 0, x = 1; i < 255; i++) { EXP[i] = x; LOG[x] = i; x <<= 1; if (x & 256) x ^= 0x11d; }for (let i = 255; i < 512; i++) EXP[i] = EXP[i - 255];const mul = (a: number, b: number) => (a && b ? EXP[LOG[a] + LOG[b]] : 0); export function rsEncode(data: number[], ecLen: number): number[] { let gen = [1]; for (let i = 0; i < ecLen; i++) { const next = new Array(gen.length + 1).fill(0); gen.forEach((c, j) => { next[j] ^= c; next[j + 1] ^= mul(c, EXP[i]); }); gen = next; } const res = new Array(ecLen).fill(0); for (const d of data) { const f = d ^ res.shift()!; res.push(0); if (f) for (let i = 0; i < ecLen; i++) res[i] ^= mul(gen[i + 1], f); } return res;} const capacity = (v: number) => { const t = M[v - 1]; return t[1] * t[2] + t[3] * t[4]; }; function bch(value: number, gen: number, bits: number): number { let r = value << bits; const gl = 31 - Math.clz32(gen); for (let i = 31 - Math.clz32(r); i >= gl; i--) if (r >> i & 1) r ^= gen << (i - gl); return (value << bits) | r;} function buildCodewords(bytes: Uint8Array, v: number): number[] { const bits: number[] = []; const push = (val: number, n: number) => { for (let i = n - 1; i >= 0; i--) bits.push(val >> i & 1); }; push(4, 4); push(bytes.length, v < 10 ? 8 : 16); bytes.forEach((b) => push(b, 8)); const cap = capacity(v) * 8; push(0, Math.min(4, cap - bits.length)); while (bits.length % 8) bits.push(0); const cw: number[] = []; for (let i = 0; i < bits.length; i += 8) cw.push(parseInt(bits.slice(i, i + 8).join(""), 2)); for (let p = 0xec; cw.length < capacity(v); p ^= 0xec ^ 0x11) cw.push(p); const [ec, b1, d1, b2, d2] = M[v - 1]; const blocks: number[][] = []; let o = 0; for (let i = 0; i < b1 + b2; i++) { const n = i < b1 ? d1 : d2; blocks.push(cw.slice(o, o + n)); o += n; } const eccs = blocks.map((b) => rsEncode(b, ec)); const out: number[] = []; for (let i = 0; i < Math.max(d1, d2); i++) blocks.forEach((b) => { if (i < b.length) out.push(b[i]); }); for (let i = 0; i < ec; i++) eccs.forEach((e) => out.push(e[i])); return out;} const MASKS: ((r: number, c: number) => boolean)[] = [ (r, c) => (r + c) % 2 === 0, (r) => r % 2 === 0, (_r, c) => c % 3 === 0, (r, c) => (r + c) % 3 === 0, (r, c) => (Math.floor(r / 2) + Math.floor(c / 3)) % 2 === 0, (r, c) => ((r * c) % 2) + ((r * c) % 3) === 0, (r, c) => (((r * c) % 2) + ((r * c) % 3)) % 2 === 0, (r, c) => (((r + c) % 2) + ((r * c) % 3)) % 2 === 0,]; function penalty(m: boolean[][]): number { const n = m.length; let p = 0; const line = (get: (i: number) => boolean) => { let run = 1; for (let i = 1; i < n; i++) { if (get(i) === get(i - 1)) { run++; if (run === 5) p += 3; else if (run > 5) p++; } else run = 1; } }; for (let i = 0; i < n; i++) { line((j) => m[i][j]); line((j) => m[j][i]); } for (let r = 0; r < n - 1; r++) for (let c = 0; c < n - 1; c++) { const x = m[r][c]; if (x === m[r][c + 1] && x === m[r + 1][c] && x === m[r + 1][c + 1]) p += 3; } const pat = [1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0], rev = [...pat].reverse(); const match = (get: (i: number) => boolean, s: number, q: number[]) => q.every((b, k) => (get(s + k) ? 1 : 0) === b); for (let i = 0; i < n; i++) for (let s = 0; s <= n - 11; s++) { for (const q of [pat, rev]) { if (match((j) => m[i][j], s, q)) p += 40; if (match((j) => m[j][i], s, q)) p += 40; } } let dark = 0; m.forEach((r) => r.forEach((x) => { if (x) dark++; })); p += Math.floor(Math.abs((dark * 100) / (n * n) - 50) / 5) * 10; return p;} export function encodeQR(text: string): boolean[][] { const bytes = new TextEncoder().encode(text); let v = 1; while (v <= 10 && capacity(v) < bytes.length + (v < 10 ? 2 : 3)) v++; if (v > 10) throw new RangeError("text too long for QR version 10"); const data = buildCodewords(bytes, v); const n = 17 + 4 * v; const mod: boolean[][] = Array.from({ length: n }, () => new Array(n).fill(false)); const fn: boolean[][] = Array.from({ length: n }, () => new Array(n).fill(false)); const set = (r: number, c: number, d: boolean) => { if (r >= 0 && c >= 0 && r < n && c < n) { mod[r][c] = d; fn[r][c] = true; } }; const finder = (r0: number, c0: number) => { for (let dr = -1; dr <= 7; dr++) for (let dc = -1; dc <= 7; dc++) { const d = dr >= 0 && dr <= 6 && dc >= 0 && dc <= 6 && (dr === 0 || dr === 6 || dc === 0 || dc === 6 || (dr >= 2 && dr <= 4 && dc >= 2 && dc <= 4)); set(r0 + dr, c0 + dc, d); } }; finder(0, 0); finder(0, n - 7); finder(n - 7, 0); for (let i = 8; i < n - 8; i++) { set(6, i, i % 2 === 0); set(i, 6, i % 2 === 0); } const al = ALIGN[v - 1]; for (const r of al) for (const c of al) { if (fn[r][c]) continue; for (let dr = -2; dr <= 2; dr++) for (let dc = -2; dc <= 2; dc++) set(r + dr, c + dc, Math.max(Math.abs(dr), Math.abs(dc)) !== 1); } set(n - 8, 8, true); const formatCells: [number, number][][] = [[], []]; for (let i = 0; i < 15; i++) { const a: [number, number] = i < 6 ? [i, 8] : i < 8 ? [i + 1, 8] : i === 8 ? [8, 7] : [8, 14 - i]; const b: [number, number] = i < 8 ? [8, n - 1 - i] : [n - 15 + i, 8]; formatCells[0].push(a); formatCells[1].push(b); set(a[0], a[1], false); set(b[0], b[1], false); } if (v >= 7) { const info = bch(v, 0x1f25, 12); for (let i = 0; i < 18; i++) { const d = (info >> i & 1) === 1, a = Math.floor(i / 3), b = (i % 3) + n - 11; set(a, b, d); set(b, a, d); } } const bits: boolean[] = []; data.forEach((b) => { for (let i = 7; i >= 0; i--) bits.push((b >> i & 1) === 1); }); const place = (): void => { let k = 0, up = true; for (let c = n - 1; c > 0; c -= 2) { if (c === 6) c--; for (let i = 0; i < n; i++) { const r = up ? n - 1 - i : i; for (const cc of [c, c - 1]) if (!fn[r][cc]) mod[r][cc] = k < bits.length ? bits[k++] : false; } up = !up; } }; place(); let best: boolean[][] | null = null, bestP = Infinity; for (let mk = 0; mk < 8; mk++) { const t = mod.map((row) => row.slice()); for (let r = 0; r < n; r++) for (let c = 0; c < n; c++) if (!fn[r][c] && MASKS[mk](r, c)) t[r][c] = !t[r][c]; const f = bch(mk, 0x537, 10) ^ 0x5412; // ECC M = 00, then mask for (let i = 0; i < 15; i++) for (const cells of formatCells) t[cells[i][0]][cells[i][1]] = (f >> i & 1) === 1; const p = penalty(t); if (p < bestP) { bestP = p; best = t; } } return best!;}