/* * Copyright 2013 Mozilla Foundation * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ const base64alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; function decodeFontData(base64) { const result = []; let bits = 0, bitsLength = 0; for (let i = 0, ii = base64.length; i < ii; i++) { const ch = base64[i]; if (ch <= " ") { continue; } const index = base64alphabet.indexOf(ch); if (index < 0) { throw new Error("Invalid character"); } if (index >= 64) { break; } bits = (bits << 6) | index; bitsLength += 6; if (bitsLength >= 8) { bitsLength -= 8; const code = (bits >> bitsLength) & 0xff; result.push(code); } } return new Uint8Array(result); } function encodeFontData(data) { let buffer = ""; let i, n; for (i = 0, n = data.length; i < n; i += 3) { const b1 = data[i] & 0xff; const b2 = data[i + 1] & 0xff; const b3 = data[i + 2] & 0xff; const d1 = b1 >> 2, d2 = ((b1 & 3) << 4) | (b2 >> 4); const d3 = i + 1 < n ? ((b2 & 0xf) << 2) | (b3 >> 6) : 64; const d4 = i + 2 < n ? b3 & 0x3f : 64; buffer += base64alphabet.charAt(d1) + base64alphabet.charAt(d2) + base64alphabet.charAt(d3) + base64alphabet.charAt(d4); } return buffer; } async function ttx(data) { const response = await fetch("/ttx", { method: "POST", body: encodeFontData(data), }); if (!response.ok) { throw new Error(response.statusText); } return response.text(); } function verifyTtxOutput(output) { const m = /^(.*?)<\/error>/.exec(output); if (m) { throw m[1]; } } export { decodeFontData, encodeFontData, ttx, verifyTtxOutput };