Iosevka/font-src/gen/finalize/gc.js
2020-11-01 10:22:19 -08:00

150 lines
4.4 KiB
JavaScript

"use strict";
const { Radical } = require("../../support/gr");
module.exports = function gcFont(glyphStore, excludedChars, restFont, cfg) {
markSweepOtlLookups(restFont.GSUB);
markSweepOtlLookups(restFont.GPOS);
const sink = markGlyphs(glyphStore, excludedChars, restFont, cfg);
return sweep(glyphStore, sink);
};
function markSweepOtlLookups(table) {
if (!table || !table.features || !table.lookups) return;
const accessibleLookupsIds = new Set();
markLookups(table, accessibleLookupsIds);
sweepLookups(table, accessibleLookupsIds);
sweepFeatures(table, accessibleLookupsIds);
}
function markLookups(table, sink) {
if (!table || !table.features) return;
markLookupsStart(table, sink);
let loop = 0,
lookupSetChanged = false;
do {
lookupSetChanged = false;
let sizeBefore = sink.size;
for (const l of Array.from(sink)) {
const lookup = table.lookups[l];
if (!lookup || !lookup.subtables) continue;
if (lookup.type === "gsub_chaining" || lookup.type === "gpos_chaining") {
for (let st of lookup.subtables) {
if (!st || !st.apply) continue;
for (const app of st.apply) sink.add(app.lookup);
}
}
}
loop++;
lookupSetChanged = sizeBefore !== sink.size;
} while (loop < 0xff && lookupSetChanged);
}
function markLookupsStart(table, sink) {
for (let f in table.features) {
const feature = table.features[f];
if (!feature) continue;
for (const l of feature) sink.add(l);
}
}
function sweepLookups(table, accessibleLookupsIds) {
let lookups1 = {};
for (const l in table.lookups) {
if (accessibleLookupsIds.has(l)) lookups1[l] = table.lookups[l];
}
table.lookups = lookups1;
return accessibleLookupsIds;
}
function sweepFeatures(table, accessibleLookupsIds) {
let features1 = {};
for (let f in table.features) {
const feature = table.features[f];
if (!feature) continue;
const featureFiltered = [];
for (const l of feature) if (accessibleLookupsIds.has(l)) featureFiltered.push(l);
if (!featureFiltered.length) continue;
features1[f] = featureFiltered;
}
table.features = features1;
}
function markGlyphs(glyphStore, excludedChars, restFont, cfg) {
const sink = markGlyphsInitial(glyphStore, excludedChars);
while (markGlyphsStep(glyphStore, sink, restFont, cfg));
return sink;
}
function markGlyphsInitial(glyphStore, excludedChars) {
let sink = new Set();
for (const [gName, g] of glyphStore.namedEntries()) {
if (!g) continue;
if (g.glyphRank > 0) sink.add(gName);
if (Radical.get(g)) sink.add(gName);
const unicodeSet = glyphStore.queryUnicodeOf(g);
if (unicodeSet) {
for (const u of unicodeSet) {
if (!excludedChars.has(u)) sink.add(gName);
}
}
}
return sink;
}
function markGlyphsStep(glyphStore, sink, restFont, cfg) {
const glyphCount = sink.size;
if (restFont.GSUB) {
for (const l in restFont.GSUB.lookups) {
const lookup = restFont.GSUB.lookups[l];
if (!lookup || !lookup.subtables) continue;
for (let st of lookup.subtables) {
markGlyphsSubtable(sink, lookup.type, st, cfg);
}
}
}
const glyphCount1 = sink.size;
return glyphCount1 > glyphCount;
}
function markGlyphsSubtable(sink, type, st, cfg) {
switch (type) {
case "gsub_single":
return markGlyphsGsubSingle(sink, st, cfg);
case "gsub_multiple":
return markGlyphsGsubMultiple(sink, st, cfg);
case "gsub_alternate":
return markGlyphsGsubAlternate(sink, st, cfg);
case "gsub_ligature":
return markGlyphsGsubLigature(sink, st, cfg);
case "gsub_chaining":
break;
case "gsub_reverse":
return markGlyphsGsubReverse(sink, st, cfg);
}
}
function markGlyphsGsubSingle(sink, st, cfg) {
for (const k in st) if (sink.has(k) && st[k]) sink.add(st[k]);
}
function markGlyphsGsubMultiple(sink, st, cfg) {
for (const k in st) if (sink.has(k) && st[k]) for (const g of st[k]) sink.add(g);
}
function markGlyphsGsubAlternate(sink, st, cfg) {
if (!cfg || !cfg.ignoreAltSub) {
for (const k in st) if (sink.has(k) && st[k]) for (const g of st[k]) sink.add(g);
}
}
function markGlyphsGsubLigature(sink, st, cfg) {
for (const sub of st.substitutions) {
let check = true;
for (const g of sub.from) if (!sink.has(g)) check = false;
if (check && sub.to) sink.add(sub.to);
}
}
function markGlyphsGsubReverse(sink, st, cfg) {
if (st.match && st.to) {
const matchCoverage = st.match[st.inputIndex];
for (let j = 0; j < matchCoverage.length; j++) {
if (sink.has(matchCoverage[j]) && st.to[j]) sink.add(st.to[j]);
}
}
}
function sweep(glyphStore, gnSet) {
return glyphStore.filterByName(gnSet);
}