Repository Public
1// Minimal QR Code encoder (ISO/IEC 18004): byte mode, error-correction level M, versions 1–10 (up to 213 bytes),2// automatic mask selection. Runs entirely in the browser: an invitation link never leaves the page to be drawn.34const ECC_PER_BLOCK = [0, 10, 16, 26, 18, 24, 16, 18, 22, 22, 26] as const; // level M5const NUM_BLOCKS = [0, 1, 1, 1, 2, 2, 4, 4, 4, 5, 5] as const; // level M6const ALIGN: readonly (readonly number[])[] = [[], [], [6, 18], [6, 22], [6, 26], [6, 30], [6, 34], [6, 22, 38], [6, 24, 42], [6, 26, 46], [6, 28, 50]];7export const QR_MAX_VERSION = 10;89function rawCodewords(version: number): number {10 let bits = (16 * version + 128) * version + 64;11 if (version >= 2) {12 const n = Math.floor(version / 7) + 2;13 bits -= (25 * n - 10) * n - 55;14 if (version >= 7) bits -= 36;15 }16 return Math.floor(bits / 8);17}18function dataCodewords(version: number): number {19 return rawCodewords(version) - (ECC_PER_BLOCK[version] ?? 0) * (NUM_BLOCKS[version] ?? 0);20}21/** Largest payload in bytes for a version (byte mode, level M). */22export function qrCapacityBytes(version: number): number {23 return Math.floor((dataCodewords(version) * 8 - 4 - (version < 10 ? 8 : 16)) / 8);24}2526function gfMul(x: number, y: number): number {27 let z = 0;28 for (let i = 7; i >= 0; i--) {29 z = (z << 1) ^ ((z >>> 7) * 0x11d);30 z ^= ((y >>> i) & 1) * x;31 }32 return z & 0xff;33}34function rsDivisor(degree: number): number[] {35 const result = new Array<number>(degree).fill(0);36 result[degree - 1] = 1;37 let root = 1;38 for (let i = 0; i < degree; i++) {39 for (let j = 0; j < degree; j++) {40 result[j] = gfMul(result[j] ?? 0, root);41 if (j + 1 < degree) result[j] = (result[j] ?? 0) ^ (result[j + 1] ?? 0);42 }43 root = gfMul(root, 2);44 }45 return result;46}47function rsRemainder(data: readonly number[], divisor: readonly number[]): number[] {48 const result = new Array<number>(divisor.length).fill(0);49 for (const b of data) {50 const factor = b ^ (result.shift() ?? 0);51 result.push(0);52 divisor.forEach((coef, i) => {53 result[i] = (result[i] ?? 0) ^ gfMul(coef, factor);54 });55 }56 return result;57}5859export class QrTooLongError extends Error {60 constructor() {61 super("qr_payload_too_long");62 this.name = "QrTooLongError";63 }64}6566export interface QrCode {67 version: number;68 size: number;69 mask: number;70 /** modules[y][x] — true is a dark module. */71 modules: boolean[][];72}7374export function encodeQr(text: string): QrCode {75 const bytes = new TextEncoder().encode(text);76 let version = 1;77 while (version <= QR_MAX_VERSION && qrCapacityBytes(version) < bytes.length) version++;78 if (version > QR_MAX_VERSION) throw new QrTooLongError();7980 // --- data bit stream81 const bits: number[] = [];82 const push = (value: number, length: number) => {83 for (let i = length - 1; i >= 0; i--) bits.push((value >>> i) & 1);84 };85 push(0b0100, 4);86 push(bytes.length, version < 10 ? 8 : 16);87 for (const b of bytes) push(b, 8);88 const capacity = dataCodewords(version) * 8;89 push(0, Math.min(4, capacity - bits.length));90 push(0, (8 - (bits.length % 8)) % 8);91 for (let pad = 0xec; bits.length < capacity; pad ^= 0xec ^ 0x11) push(pad, 8);92 const data: number[] = [];93 for (let i = 0; i < bits.length; i += 8) {94 let b = 0;95 for (let j = 0; j < 8; j++) b = (b << 1) | (bits[i + j] ?? 0);96 data.push(b);97 }9899 // --- error correction and interleaving100 const numBlocks = NUM_BLOCKS[version] ?? 1;101 const eccLen = ECC_PER_BLOCK[version] ?? 0;102 const raw = rawCodewords(version);103 const numShort = numBlocks - (raw % numBlocks);104 const shortLen = Math.floor(raw / numBlocks);105 const divisor = rsDivisor(eccLen);106 const blocks: number[][] = [];107 for (let i = 0, k = 0; i < numBlocks; i++) {108 const dat = data.slice(k, k + shortLen - eccLen + (i < numShort ? 0 : 1));109 k += dat.length;110 const ecc = rsRemainder(dat, divisor);111 if (i < numShort) dat.push(0);112 blocks.push(dat.concat(ecc));113 }114 const codewords: number[] = [];115 for (let i = 0; i < (blocks[0]?.length ?? 0); i++) {116 blocks.forEach((block, j) => {117 if (i !== shortLen - eccLen || j >= numShort) codewords.push(block[i] ?? 0);118 });119 }120121 // --- matrix122 const size = version * 4 + 17;123 const modules = Array.from({ length: size }, () => new Array<boolean>(size).fill(false));124 const isFn = Array.from({ length: size }, () => new Array<boolean>(size).fill(false));125 const setFn = (x: number, y: number, dark: boolean) => {126 const row = modules[y], frow = isFn[y];127 if (!row || !frow || x < 0 || x >= size) return;128 row[x] = dark;129 frow[x] = true;130 };131 const drawFormat = (mask: number) => {132 const d = (0b00 << 3) | mask; // level M133 let rem = d;134 for (let i = 0; i < 10; i++) rem = (rem << 1) ^ ((rem >>> 9) * 0x537);135 const f = ((d << 10) | rem) ^ 0x5412;136 const bit = (i: number) => ((f >>> i) & 1) !== 0;137 for (let i = 0; i <= 5; i++) setFn(8, i, bit(i));138 setFn(8, 7, bit(6));139 setFn(8, 8, bit(7));140 setFn(7, 8, bit(8));141 for (let i = 9; i < 15; i++) setFn(14 - i, 8, bit(i));142 for (let i = 0; i < 8; i++) setFn(size - 1 - i, 8, bit(i));143 for (let i = 8; i < 15; i++) setFn(8, size - 15 + i, bit(i));144 setFn(8, size - 8, true);145 };146 for (let i = 0; i < size; i++) {147 setFn(6, i, i % 2 === 0);148 setFn(i, 6, i % 2 === 0);149 }150 for (const [cx, cy] of [[3, 3], [size - 4, 3], [3, size - 4]] as const) {151 for (let dy = -4; dy <= 4; dy++) {152 for (let dx = -4; dx <= 4; dx++) {153 const dist = Math.max(Math.abs(dx), Math.abs(dy));154 const x = cx + dx, y = cy + dy;155 if (x >= 0 && x < size && y >= 0 && y < size) setFn(x, y, dist !== 2 && dist !== 4);156 }157 }158 }159 const align = ALIGN[version] ?? [];160 align.forEach((ax, i) => {161 align.forEach((ay, j) => {162 const n = align.length;163 if ((i === 0 && j === 0) || (i === 0 && j === n - 1) || (i === n - 1 && j === 0)) return;164 for (let dy = -2; dy <= 2; dy++) for (let dx = -2; dx <= 2; dx++) setFn(ax + dx, ay + dy, Math.max(Math.abs(dx), Math.abs(dy)) !== 1);165 });166 });167 drawFormat(0);168 if (version >= 7) {169 let rem = version;170 for (let i = 0; i < 12; i++) rem = (rem << 1) ^ ((rem >>> 11) * 0x1f25);171 const v = (version << 12) | rem;172 for (let i = 0; i < 18; i++) {173 const dark = ((v >>> i) & 1) !== 0;174 const a = size - 11 + (i % 3), b = Math.floor(i / 3);175 setFn(a, b, dark);176 setFn(b, a, dark);177 }178 }179 // zigzag placement180 let bi = 0;181 for (let right = size - 1; right >= 1; right -= 2) {182 if (right === 6) right = 5;183 for (let vert = 0; vert < size; vert++) {184 for (let j = 0; j < 2; j++) {185 const x = right - j;186 const upward = ((right + 1) & 2) === 0;187 const y = upward ? size - 1 - vert : vert;188 const row = modules[y];189 if (row && !isFn[y]?.[x] && bi < codewords.length * 8) {190 row[x] = (((codewords[bi >>> 3] ?? 0) >>> (7 - (bi & 7))) & 1) !== 0;191 bi++;192 }193 }194 }195 }196197 const maskFn: ((x: number, y: number) => boolean)[] = [198 (x, y) => (x + y) % 2 === 0,199 (_x, y) => y % 2 === 0,200 (x) => x % 3 === 0,201 (x, y) => (x + y) % 3 === 0,202 (x, y) => (Math.floor(x / 3) + Math.floor(y / 2)) % 2 === 0,203 (x, y) => ((x * y) % 2) + ((x * y) % 3) === 0,204 (x, y) => (((x * y) % 2) + ((x * y) % 3)) % 2 === 0,205 (x, y) => (((x + y) % 2) + ((x * y) % 3)) % 2 === 0,206 ];207 const applyMask = (m: number) => {208 const fn = maskFn[m];209 if (!fn) return;210 for (let y = 0; y < size; y++) {211 const row = modules[y];212 if (!row) continue;213 for (let x = 0; x < size; x++) if (!isFn[y]?.[x] && fn(x, y)) row[x] = !row[x];214 }215 };216 let best = 0;217 let bestPenalty = Infinity;218 for (let m = 0; m < 8; m++) {219 applyMask(m);220 drawFormat(m);221 const p = penalty(modules);222 if (p < bestPenalty) {223 bestPenalty = p;224 best = m;225 }226 applyMask(m); // undo (XOR)227 }228 applyMask(best);229 drawFormat(best);230 return { version, size, mask: best, modules };231}232233function penalty(m: boolean[][]): number {234 const size = m.length;235 const at = (x: number, y: number) => m[y]?.[x] === true;236 let result = 0;237 let dark = 0;238 const finder = [true, false, true, true, true, false, true];239 for (let axis = 0; axis < 2; axis++) {240 for (let a = 0; a < size; a++) {241 const get = (i: number) => (axis === 0 ? at(i, a) : at(a, i));242 let run = 1;243 for (let i = 1; i <= size; i++) {244 if (i < size && get(i) === get(i - 1)) run++;245 else {246 if (run >= 5) result += 3 + (run - 5);247 run = 1;248 }249 }250 for (let i = 0; i + 7 <= size; i++) {251 if (!finder.every((v, k) => get(i + k) === v)) continue;252 const lightBefore = [1, 2, 3, 4].every((k) => i - k < 0 || !get(i - k));253 const lightAfter = [7, 8, 9, 10].every((k) => i + k >= size || !get(i + k));254 if (lightBefore || lightAfter) result += 40;255 }256 }257 }258 for (let y = 0; y < size; y++) {259 for (let x = 0; x < size; x++) {260 if (at(x, y)) dark++;261 if (x + 1 < size && y + 1 < size) {262 const c = at(x, y);263 if (c === at(x + 1, y) && c === at(x, y + 1) && c === at(x + 1, y + 1)) result += 3;264 }265 }266 }267 const total = size * size;268 result += Math.floor(Math.abs(dark * 20 - total * 10) / total) * 10;269 return result;270}271272/** SVG path data (one unit per module) for the dark modules, offset by the quiet zone. */273export function qrPath(code: QrCode, quiet = 4): { d: string; viewBox: string } {274 const parts: string[] = [];275 code.modules.forEach((row, y) => {276 let x = 0;277 while (x < row.length) {278 if (!row[x]) {279 x++;280 continue;281 }282 let w = 1;283 while (row[x + w]) w++;284 parts.push(`M${x + quiet} ${y + quiet}h${w}v1h${-w}z`);285 x += w;286 }287 });288 const s = code.size + quiet * 2;289 return { d: parts.join(""), viewBox: `0 0 ${s} ${s}` };290}291