Iosevka/font-src/support/variant-data.mjs
be5invis 86e1191854 Change the mechanism of variants of not-equal ligation (#1400):
- The "dotted" ligation groups (`exeqeq-dotted`, `eqexeq-dotted`, `eqexeq-dl-dotted`, `exeq-dotted`) are removed.
   - A character variant, "lig-neq" (feature tag `VXAF`), is added to control the shape instead.
2022-08-15 00:00:03 -07:00

192 lines
5.8 KiB
JavaScript

export function apply(data, para, argv) {
const parsed = parse(data, argv);
let tagSet = new Set();
for (const prime of parsed.primes.values()) {
if (!prime.tag) continue;
if (!tagSet.has(prime.tag)) tagSet.add(prime.tag);
else throw new Error(`CV tag conflict: ${prime.tag}`);
}
const variantSelector = {};
parsed.defaultComposite.resolve(para, parsed.selectorTree, parsed.composites, variantSelector);
if (argv.shape.serifs === "slab") {
const slabComp = parsed.composites.get("slab");
slabComp.resolve(para, parsed.selectorTree, parsed.composites, variantSelector);
}
if (argv.variants) {
const userComposite = new Composite("{user}", argv.variants);
userComposite.resolve(para, parsed.selectorTree, parsed.composites, variantSelector);
}
para.variants = {
selectorTree: parsed.selectorTree,
primes: parsed.primes,
composites: parsed.composites
};
para.variantSelector = variantSelector;
}
export function parse(data, argv) {
const primes = new Map();
const selectorTree = new SelectorTree();
for (const k in data.prime) {
const p = new Prime(k, data.prime[k]);
p.register(selectorTree);
primes.set(k, p);
}
const defaultComposite = new Composite("{default}", data.default);
const composites = new Map();
for (const k in data.composite) {
const comp = new Composite(k, data.composite[k]);
composites.set(k, comp);
}
if (argv && argv.compositesFromBuildPlan) {
for (const k in argv.compositesFromBuildPlan) {
const key = `buildPlans.${k}`;
const comp = new Composite(key, argv.compositesFromBuildPlan[k]);
composites.set(key, comp);
}
}
return { selectorTree: selectorTree, primes, composites, defaultComposite };
}
class SelectorTree {
constructor() {
this.m_mapping = new Map();
}
get(kPrime, kVariant) {
if (!this.m_mapping.has(kPrime)) return undefined;
return this.m_mapping.get(kPrime).get(kVariant);
}
set(kPrime, kVariant, prime, variant) {
if (!this.m_mapping.has(kPrime)) this.m_mapping.set(kPrime, new Map());
this.m_mapping.get(kPrime).set(kVariant, [prime, variant]);
}
*[Symbol.iterator]() {
for (const m of this.m_mapping.values()) yield* m.values();
}
}
class Prime {
constructor(key, cfg) {
if (!cfg.variants) throw new Error(`Missing variants in ${key}`);
this.key = key;
this.sampler = cfg.sampler;
this.samplerExplain = cfg.samplerExplain;
this.isSpecial = cfg.isSpecial || false;
this.description = cfg.description || null;
this.ligatureSampler = / /.test(cfg.sampler || "");
this.descSampleText = this.ligatureSampler
? cfg.sampler.split(" ").filter(x => !!x.trim())
: [...(cfg.sampler || "")];
this.tag = cfg.tag;
this.slopeDependent = !!cfg.slopeDependent;
this.variants = new Map();
this.hotChars = cfg.hotChars ? [...cfg.hotChars] : this.descSampleText;
for (const varKey in cfg.variants) {
const variant = cfg.variants[varKey];
this.variants.set(varKey, new PrimeVariant(varKey, cfg.tag, variant));
}
}
register(tree) {
for (const [k, v] of this.variants) tree.set(this.key, k, this, v);
if (this.tag) {
for (const v of this.variants.values()) if (v.rank) tree.set(this.tag, v.rank, this, v);
}
}
toJson() {
const gr = {
key: this.key,
sampler: this.sampler,
samplerExplain: this.samplerExplain,
isSpecial: this.isSpecial,
description: this.description,
tag: this.tag,
slopeDependent: this.slopeDependent,
ligatureSampler: this.ligatureSampler,
descSampleText: this.descSampleText,
hotChars: this.hotChars,
variants: []
};
for (const variant of this.variants.values()) {
gr.variants.push({
key: variant.key,
rank: variant.rank,
rankGroup: variant.rankGroup,
description: variant.description,
snapshotFeatureApplication: variant.snapshotFeatureApplication
});
}
gr.variants.sort((a, b) => (a.rank || 0x7fffffff) - (b.rank || 0x7fffffff));
return gr;
}
}
class PrimeVariant {
constructor(key, tag, cfg) {
this.key = key;
this.tag = tag;
this.description = cfg.description;
this.rank = cfg.rank;
this.rankGroup = cfg.rankGroup || 0;
this.selector = cfg.selector;
this.nonDeriving = cfg.nonDeriving;
this.snapshotFeatureApplication = cfg.snapshotFeatureApplication;
}
resolveFor(para, gn) {
let vs = {};
this.resolve(para, vs);
return vs[gn];
}
resolve(para, vs) {
Object.assign(vs, this.selector);
}
}
class Composite {
constructor(key, cfg) {
this.key = key;
this.tag = cfg.tag;
this.description = cfg.description;
this.inherits = cfg.inherits;
this.design = cfg.design;
this.upright = cfg.upright || cfg["upright-oblique"];
this.oblique = cfg.oblique || cfg["upright-oblique"];
this.italic = cfg.italic;
const slabOverrideCfg = cfg["slab-override"] || {};
this.slabOverride = {
design: slabOverrideCfg.design,
override: slabOverrideCfg.upright || slabOverrideCfg["upright-oblique"],
oblique: slabOverrideCfg.oblique || slabOverrideCfg["upright-oblique"],
italic: slabOverrideCfg.italic
};
}
decompose(para, selTree) {
const ans = [];
const cfg = Object.assign(
{},
this.design,
this.decomposeSlope(this, para),
!para.slab ? {} : this.slabOverride.design,
!para.slab ? {} : this.decomposeSlope(this.slabOverride, para)
);
for (const [k, v] of Object.entries(cfg)) {
const pv = selTree.get(k, v);
if (!pv) throw new Error(`Composite ${this.key} cannot be resolved: ${[k, v]}.`);
ans.push(pv);
}
return ans;
}
decomposeSlope(base, para) {
return para.isItalic ? base.italic : para.isOblique ? base.oblique : base.upright;
}
resolve(para, selTree, catalog, vs) {
if (this.inherits) {
if (!catalog.has(this.inherits)) {
throw new Error(`Cannot find composite variant: ${this.inherits}`);
}
catalog.get(this.inherits).resolve(para, selTree, catalog, vs);
}
for (const [prime, variant] of this.decompose(para, selTree)) {
variant.resolve(para, vs);
}
}
}