linked-rolls 0.0.1 → 0.1.0

package/lib/Stage.js

@@ -1,165 +0,0 @@
-import { v4 } from "uuid";
-import { flat } from "./EditorialAssumption";
-import { dimensionOf } from "./Symbol";
-const versionType = [
-    /**
-     * The roll is in a state where it is used as
-     * the master roll for several new reproductions.
-     */
-    'edition',
-    /**
-     * This denotes a stage which is specific to (early)
-     * Welte-Mignon piano rolls, where rolls inteded to
-     * be pulished are revised by a controller first. These
-     * rolls typically carry a "controlliert" stamp. The
-     * revision is done on the same date as the perforation
-     * and the date is written on the roll towards its end.
-     */
-    'authorised-revision',
-    /**
-     * Unauthorised revisions are those, which cannot be linked
-     * to a specific controller and are likely done by
-     * a later, anonymous hand.
-     */
-    'unauthorised-revision',
-    /**
-     * In the case of Welte Mignon rolls, glosses are
-     * typically comments about the roll's condition, added
-     * e.g. by the collector.
-     */
-    'gloss'
-];
-export const traverseStages = (stage, callback) => {
-    callback(stage);
-    if (stage.basedOn) {
-        traverseStages(flat(stage.basedOn), callback);
-    }
-};
-export const getSnapshot = (stage) => {
-    const snapshot = [];
-    const toDelete = [];
-    traverseStages(stage, s => {
-        snapshot.push(...s.edits.flatMap(edit => edit.insert || []));
-        // as we travel further up, remove symbols that are 
-        // deleted in the stages further down
-        const deleted = [];
-        for (const toRemove of toDelete) {
-            const index = snapshot.findIndex(s => s === toRemove);
-            if (index !== -1) {
-                snapshot.splice(index, 1);
-                deleted.push(toRemove);
-            }
-        }
-        for (const del of deleted) {
-            toDelete.splice(toDelete.indexOf(del), 1);
-        }
-        // collect symbols that are deleted in the current stage
-        toDelete.push(...s.edits.flatMap(edit => edit.delete || []));
-    });
-    return snapshot.sort((a, b) => {
-        const aDimension = dimensionOf(a);
-        const bDimension = dimensionOf(b);
-        return aDimension.horizontal.from - bDimension.horizontal.from;
-    });
-};
-const isCollatable = (symbolA, symbolB) => {
-    // two symbols are collatible if they share the same 
-    // symbol characteristics (pitch, expression type etc.)
-    // and occur in the same horizontal position.
-    if (symbolA.type === 'note' && symbolB.type === 'note') {
-        if (symbolA.pitch !== symbolB.pitch)
-            return false;
-    }
-    else if (symbolA.type === 'expression' && symbolB.type === 'expression') {
-        if (symbolA.expressionType !== symbolB.expressionType)
-            return false;
-        if (symbolA.scope !== symbolB.scope)
-            return false;
-    }
-    const dimensionA = dimensionOf(symbolA);
-    const dimensionB = dimensionOf(symbolB);
-    const distanceStart = Math.abs(dimensionA.horizontal.from - dimensionB.horizontal.from);
-    const distanceEnd = Math.abs(dimensionA.horizontal.to - dimensionB.horizontal.to);
-    if (distanceStart > 5 || distanceEnd > 5) {
-        // the symbols are too far apart to be collated
-        return false;
-    }
-    return true;
-};
-const overlaps = (a, b) => {
-    const overlapsDimension = (a, b) => (a.from ?? 0) < (b.to ?? Infinity) && (b.from ?? 0) < (a.to ?? Infinity);
-    return overlapsDimension(a.horizontal, b.horizontal) && overlapsDimension(a.vertical, b.vertical);
-};
-/**
- * Walks through the stages. If it finds a symbol that is still
- * part of the tradition (i.e. it is included in the current snapshot)
- * and is equivalent with the given symbol, it will add the feature
- * carrying the symbol to the collated symbol. Otherwise, the
- * given symbol will be added to the current stage's insertions.
- *
- * All symbols of the tradition that are not included in the given
- * symbols are considered to be deleted.
- *
- * @param creation
- * @param symbols
- * @returns
- */
-export function fillEdits(currentStage, symbols) {
-    const snapshot = getSnapshot(currentStage);
-    const treatedSymbols = [];
-    // can it be collated with any of the symbols of 
-    // included in the current snapshot?
-    const insertions = [...symbols];
-    for (const symbol of symbols) {
-        snapshot
-            .filter(toCompare => isCollatable(symbol, toCompare))
-            .forEach(corresp => {
-            corresp.carriers.push(...symbol.carriers);
-            insertions.splice(insertions.indexOf(symbol), 1);
-            treatedSymbols.push(corresp);
-        });
-    }
-    // special treatment for covers
-    const covers = insertions.filter(symbol => symbol.type === 'cover');
-    for (const cover of covers) {
-        // find perforations in the snapshot that 
-        // overlap with the cover
-        snapshot
-            .filter(symbol => symbol.type === 'note' || symbol.type === 'expression')
-            .map(dimensionOf)
-            .filter(dimension => overlaps(dimension, dimensionOf(cover)))
-            .forEach(dimension => {
-            const coverDimension = dimensionOf(cover);
-            // check if the cover partially covers the beginning
-            if (dimension.horizontal.from >= coverDimension.horizontal.from &&
-                dimension.horizontal.from <= coverDimension.horizontal.to) {
-                // the note starts where the cover ends
-                dimension.horizontal.from = coverDimension.horizontal.to;
-            }
-            // check if the cover partially covers the ending
-            if (dimension.horizontal.to >= coverDimension.horizontal.from &&
-                dimension.horizontal.to <= coverDimension.horizontal.to) {
-                // the note ends where the cover starts
-                dimension.horizontal.to = coverDimension.horizontal.from;
-            }
-        });
-        insertions.splice(insertions.indexOf(cover), 1);
-    }
-    currentStage.edits.push(...insertions.map((symbol) => {
-        return {
-            insert: [symbol],
-            delete: [],
-            id: v4(),
-        };
-    }));
-    const deletions = snapshot.filter(sym => {
-        return !treatedSymbols.includes(sym);
-    });
-    for (const symbol of deletions) {
-        currentStage.edits.push({
-            insert: [],
-            delete: [symbol],
-            id: v4(),
-        });
-    }
-}

package/lib/Transcription.d.ts

@@ -1,7 +0,0 @@
-import { Observation } from "./EditorialAssumption";
-/**
- * Every transcription is an I1 Argumentation.
- */
-export interface Transcription extends Observation {
-    software?: string;
-}

package/lib/Transcription.js

@@ -1,9 +0,0 @@
-export {};
-// Example:
-// Edit -> carried out by -> "Anonym"
-// Edit -> concluded by -> Observation: der äußeren Erscheinung nach eine spätere Hinzufügung von unbekanntere Hand
-// Edit -> insert -> Symbol
-// Symbol -> is carried by -> Roll Feature -> condition -> damaged
-// Symbol -> concludedBy -> Transcription -> Die Perforationen wurden nicht präzise an die richtige Stelle gesetzt. 
-//                                           Wir gehen davon aus, dass sie jeweils auf der darüberliegenden Linie
-//                                           platziert werden sollten.

package/lib/WithId.d.ts

@@ -1,3 +0,0 @@
-export interface WithId {
-    'id': string;
-}

package/lib/WithId.js

@@ -1 +0,0 @@
-export {};

package/lib/alignRolls.d.ts

@@ -1,7 +0,0 @@
-import { AnySymbol } from "./Symbol";
-type AlignmentResult = {
-    shift: number;
-    stretch: number;
-};
-export declare function alignSymbols(rollA: AnySymbol[], rollB: AnySymbol[]): AlignmentResult;
-export {};

package/lib/alignRolls.js

@@ -1,49 +0,0 @@
-import { dimensionOf } from "./Symbol";
-export function alignSymbols(rollA, rollB) {
-    // 1. Only musical-note anchors
-    const XA = rollA.filter(e => e.type === 'note').map(e => dimensionOf(e).horizontal.from);
-    const YB = rollB.filter(e => e.type === 'note').map(e => dimensionOf(e).horizontal.from);
-    // 2. Initial LSQ fit for x2 = A*x + B
-    let { A, B } = fitAffine(XA, YB);
-    let stretch = A, shift = B / A;
-    // 3. Refinement
-    for (let i = 0; i < 10; i++) {
-        const transformed = XA.map(x => stretch * (x + shift));
-        const pairs = [];
-        for (let tx of transformed) {
-            const nearest = findClosest(tx, YB);
-            if (Math.abs(tx - nearest) <= 3) {
-                pairs.push([(tx / stretch) - shift, nearest]);
-            }
-        }
-        if (pairs.length < 2)
-            break;
-        const [Xin, Yin] = unzip(pairs);
-        const { A: A2, B: B2 } = fitAffine(Xin, Yin);
-        const b2 = B2 / A2;
-        if (Math.abs(A2 - A) < 1e-6 && Math.abs(b2 - shift) < 1e-3)
-            break;
-        A = A2;
-        B = B2;
-        stretch = A;
-        shift = b2;
-    }
-    return { stretch: stretch, shift: shift };
-}
-const mean = (arr) => arr.reduce((acc, val) => acc + val, 0) / arr.length;
-function fitAffine(X, Y) {
-    const mx = mean(X), my = mean(Y);
-    let num = 0, den = 0;
-    X.forEach((x, i) => { num += (x - mx) * (Y[i] - my); den += (x - mx) ** 2; });
-    const A = den === 0 ? 1 : num / den;
-    const B = my - A * mx;
-    return { A, B };
-}
-function findClosest(val, arr) {
-    return arr.reduce((best, curr) => Math.abs(curr - val) < Math.abs(best - val) ? curr : best);
-}
-function unzip(p) {
-    const X = [], Y = [];
-    p.forEach(([x, y]) => { X.push(x); Y.push(y); });
-    return [X, Y];
-}

package/lib/alignSymbols.d.ts

@@ -1,7 +0,0 @@
-import { AnySymbol } from "./Symbol";
-type AlignmentResult = {
-    shift: number;
-    stretch: number;
-};
-export declare function alignSymbols(rollA: AnySymbol[], rollB: AnySymbol[]): AlignmentResult;
-export {};

package/lib/alignSymbols.js

@@ -1,49 +0,0 @@
-import { dimensionOf } from "./Symbol";
-export function alignSymbols(rollA, rollB) {
-    // 1. Only musical-note anchors
-    const XA = rollA.filter(e => e.type === 'note').map(e => dimensionOf(e).horizontal.from);
-    const YB = rollB.filter(e => e.type === 'note').map(e => dimensionOf(e).horizontal.from);
-    // 2. Initial LSQ fit for x2 = A*x + B
-    let { A, B } = fitAffine(XA, YB);
-    let stretch = A, shift = B / A;
-    // 3. Refinement
-    for (let i = 0; i < 10; i++) {
-        const transformed = XA.map(x => stretch * (x + shift));
-        const pairs = [];
-        for (let tx of transformed) {
-            const nearest = findClosest(tx, YB);
-            if (Math.abs(tx - nearest) <= 3) {
-                pairs.push([(tx / stretch) - shift, nearest]);
-            }
-        }
-        if (pairs.length < 2)
-            break;
-        const [Xin, Yin] = unzip(pairs);
-        const { A: A2, B: B2 } = fitAffine(Xin, Yin);
-        const b2 = B2 / A2;
-        if (Math.abs(A2 - A) < 1e-6 && Math.abs(b2 - shift) < 1e-3)
-            break;
-        A = A2;
-        B = B2;
-        stretch = A;
-        shift = b2;
-    }
-    return { stretch: stretch, shift: shift };
-}
-const mean = (arr) => arr.reduce((acc, val) => acc + val, 0) / arr.length;
-function fitAffine(X, Y) {
-    const mx = mean(X), my = mean(Y);
-    let num = 0, den = 0;
-    X.forEach((x, i) => { num += (x - mx) * (Y[i] - my); den += (x - mx) ** 2; });
-    const A = den === 0 ? 1 : num / den;
-    const B = my - A * mx;
-    return { A, B };
-}
-function findClosest(val, arr) {
-    return arr.reduce((best, curr) => Math.abs(curr - val) < Math.abs(best - val) ? curr : best);
-}
-function unzip(p) {
-    const X = [], Y = [];
-    p.forEach(([x, y]) => { X.push(x); Y.push(y); });
-    return [X, Y];
-}

package/lib/aton/AtonParser.test.d.ts

@@ -1 +0,0 @@
-export {};

package/lib/aton/AtonParser.test.js

@@ -1,16 +0,0 @@
-import { expect, test } from 'vitest';
-import { AtonParser } from './AtonParser';
-test('it import ATON files correctly', () => {
-    const parser = new AtonParser();
-    const result = parser.parse(`
-@key1: value1
-@@START: key2
-@key2a: value2a
-@key2b: value2b
-@key2c: value2c
-@@END: key2
-@key3: value3`);
-    expect(result.key1).toBe('value1');
-    expect(result.key2.key2a).toBe('value2a');
-    expect(result.key3).toBe('value3');
-});

package/lib/build-schema.cjs

@@ -1,113 +0,0 @@
-"use strict";
-var __assign = (this && this.__assign) || function () {
-    __assign = Object.assign || function(t) {
-        for (var s, i = 1, n = arguments.length; i < n; i++) {
-            s = arguments[i];
-            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
-                t[p] = s[p];
-        }
-        return t;
-    };
-    return __assign.apply(this, arguments);
-};
-var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    var desc = Object.getOwnPropertyDescriptor(m, k);
-    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
-      desc = { enumerable: true, get: function() { return m[k]; } };
-    }
-    Object.defineProperty(o, k2, desc);
-}) : (function(o, m, k, k2) {
-    if (k2 === undefined) k2 = k;
-    o[k2] = m[k];
-}));
-var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
-    Object.defineProperty(o, "default", { enumerable: true, value: v });
-}) : function(o, v) {
-    o["default"] = v;
-});
-var __importStar = (this && this.__importStar) || (function () {
-    var ownKeys = function(o) {
-        ownKeys = Object.getOwnPropertyNames || function (o) {
-            var ar = [];
-            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
-            return ar;
-        };
-        return ownKeys(o);
-    };
-    return function (mod) {
-        if (mod && mod.__esModule) return mod;
-        var result = {};
-        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
-        __setModuleDefault(result, mod);
-        return result;
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-// build-schema.ts
-var ts_json_schema_generator_1 = require("ts-json-schema-generator");
-var fs = __importStar(require("fs"));
-/** Safely check if a referenced type is an ObjectType with a string `id` property. */
-function refTargetsRefableObject(ref, fmt) {
-    var _a;
-    var target = ref.getType();
-    // console.log('target', target, target instanceof ObjectType)
-    // if (!(target instanceof ObjectType)) return false;
-    // Ask the default formatter for the *object's* definition and inspect its properties.
-    // This is safe because 'target' isn't a ReferenceType, so the built-ins will produce
-    // the object schema (possibly via $ref creation behind the scenes).
-    var def = fmt.getDefinition(target);
-    console.log('def=', def);
-    var idSchema = (_a = def === null || def === void 0 ? void 0 : def.properties) === null || _a === void 0 ? void 0 : _a.id;
-    if (!idSchema)
-        return false;
-    // Accept plain string or unions that contain string
-    return idSchema.type === "string" ||
-        (Array.isArray(idSchema.anyOf) && idSchema.anyOf.some(function (s) { return (s === null || s === void 0 ? void 0 : s.type) === "string"; }));
-}
-/** Wrap only ReferenceType occurrences to ref-able objects as oneOf($ref, "#id"). */
-var RefableReferenceWrapper = /** @class */ (function () {
-    function RefableReferenceWrapper(child) {
-        this.child = child;
-    }
-    // Only intercept ReferenceType; let built-ins handle everything else.
-    RefableReferenceWrapper.prototype.supportsType = function (type) {
-        return type instanceof ts_json_schema_generator_1.ReferenceType;
-    };
-    RefableReferenceWrapper.prototype.getDefinition = function (type) {
-        console.log('ref type', type);
-        var isRefable = type.getType().type.type.properties.findIndex(function (p) { return p.name === 'id'; }) !== -1;
-        // Let the built-in ReferenceTypeFormatter do its thing first ($ref, etc.)
-        var original = this.child.getDefinition(type);
-        // If the reference points to an object with string `id`, allow "#id" as alternative.
-        if (isRefable) {
-            console.log('is refable', type);
-            // Avoid double-wrapping if something upstream already produced oneOf.
-            if (original && original.oneOf)
-                return original;
-            return original;
-            //return {
-            //  oneOf: [
-            //    original,                 // usually { "$ref": "#/definitions/..." }
-            //    { type: "string", pattern: "^#.+$" }, // your "#<id>" form; tighten regex if needed
-            //  ],
-            // };
-        }
-        return original;
-    };
-    RefableReferenceWrapper.prototype.getChildren = function (type) {
-        // Always delegate. Do NOT call .getType() here—let the chain manage traversal.
-        return this.child.getChildren(type);
-    };
-    return RefableReferenceWrapper;
-}());
-// ——— Wire up the generator ———
-var config = __assign(__assign({}, ts_json_schema_generator_1.DEFAULT_CONFIG), { path: "../src/**/*.ts", tsconfig: "tsconfig.json", type: "Edition" });
-var formatter = (0, ts_json_schema_generator_1.createFormatter)(config, function (fmt, circular) {
-    fmt.addTypeFormatter(new RefableReferenceWrapper(circular));
-});
-var program = (0, ts_json_schema_generator_1.createProgram)(config);
-var parser = (0, ts_json_schema_generator_1.createParser)(program, config);
-var generator = new ts_json_schema_generator_1.SchemaGenerator(program, parser, formatter, config);
-var schema = generator.createSchema(config.type);
-fs.writeFileSync("./context.json", JSON.stringify(schema, null, 2));