tblswvs 0.1.0

package/lib/es5/helpers.d.ts

@@ -0,0 +1,8 @@
+export declare const INCOMPATIBLE_SEQ_MSG: string;
+export declare const NON_INTEGER_INPUTS = "Numbers must be integers";
+export declare const SELF_SIMILARITY_REQUIRES_COPRIMES: string;
+export declare const SCALE_DEGREE_ERROR = "Scale degrees must be negative or positive, but not 0";
+export declare const unique: (value: any, index: number, self: any) => boolean;
+export declare const areCoprime: (num1: number, num2: number) => boolean;
+export declare const rotate: (arr: any[], offset: number) => any[];
+export declare const inversionMap: (range: (number | number[])) => Map<number, number>;

package/lib/es5/helpers.js

@@ -0,0 +1,50 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.inversionMap = exports.rotate = exports.areCoprime = exports.unique = exports.SCALE_DEGREE_ERROR = exports.SELF_SIMILARITY_REQUIRES_COPRIMES = exports.NON_INTEGER_INPUTS = exports.INCOMPATIBLE_SEQ_MSG = void 0;
+const tblswvs_error_1 = require("./tblswvs_error");
+exports.INCOMPATIBLE_SEQ_MSG = "A Sequence can only be made new from and Array of Sequence " +
+    "objects that share the same rest symbol and mode";
+exports.NON_INTEGER_INPUTS = "Numbers must be integers";
+exports.SELF_SIMILARITY_REQUIRES_COPRIMES = "A self-similar melody can only be produced for an input sequence length " +
+    "that is coprime with the output sequence length";
+exports.SCALE_DEGREE_ERROR = "Scale degrees must be negative or positive, but not 0";
+const unique = (value, index, self) => {
+    return self.indexOf(value) === index;
+};
+exports.unique = unique;
+const areCoprime = (num1, num2) => {
+    if (!Number.isInteger(num1) || !Number.isInteger(num2))
+        throw new tblswvs_error_1.TblswvsError(exports.NON_INTEGER_INPUTS);
+    const smaller = num1 > num2 ? num2 : num1;
+    for (let i = 2; i <= smaller; i++)
+        if ((num1 % i === 0) && (num2 % i === 0))
+            return false;
+    return true;
+};
+exports.areCoprime = areCoprime;
+const rotate = (arr, offset) => {
+    let copy = arr.slice();
+    if (copy.length > offset) {
+        copy.unshift(...copy.splice(-offset));
+    }
+    else {
+        let i = 0;
+        while (i < offset) {
+            copy.unshift(copy.splice(-1));
+            i++;
+        }
+    }
+    return copy;
+};
+exports.rotate = rotate;
+const inversionMap = (range) => {
+    let map = new Map();
+    const intervals = (Array.isArray(range)) ?
+        range.filter(exports.unique).sort((a, b) => a - b) :
+        [...new Array(range).keys()].map(i => i + 1);
+    for (let i = 0; i < intervals.length; i++)
+        map.set(intervals[i], intervals[intervals.length - i - 1]);
+    return map;
+};
+exports.inversionMap = inversionMap;
+//# sourceMappingURL=helpers.js.map

package/lib/es5/helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.js","sourceRoot":"","sources":["../../../src/helpers.ts"],"names":[],"mappings":";;;AAAA,mDAA+C;AAGlC,QAAA,oBAAoB,GAC7B,6DAA6D;IAC7D,kDAAkD,CAAC;AAE1C,QAAA,kBAAkB,GAAG,0BAA0B,CAAC;AAEhD,QAAA,iCAAiC,GAC1C,0EAA0E;IAC1E,iDAAiD,CAAC;AAEzC,QAAA,kBAAkB,GAC3B,uDAAuD,CAAC;AAGrD,MAAM,MAAM,GAAG,CAAC,KAAU,EAAE,KAAa,EAAE,IAAS,EAAE,EAAE;IAC3D,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC;AACzC,CAAC,CAAA;AAFY,QAAA,MAAM,UAElB;AAGM,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,IAAY,EAAE,EAAE;IACrD,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC;QAClD,MAAM,IAAI,4BAAY,CAAC,0BAAkB,CAAC,CAAC;IAE/C,MAAM,OAAO,GAAG,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE;QAC7B,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC;YACpC,OAAO,KAAK,CAAC;IAErB,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAVW,QAAA,UAAU,cAUrB;AAGK,MAAM,MAAM,GAAG,CAAC,GAAU,EAAE,MAAc,EAAS,EAAE;IACxD,IAAI,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,CAAC;IACvB,IAAI,IAAI,CAAC,MAAM,GAAG,MAAM,EAAE;QACtB,IAAI,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;KACzC;SAAM;QACH,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,MAAM,EAAE;YACf,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC,EAAE,CAAC;SACP;KACJ;IACD,OAAO,IAAI,CAAC;AAChB,CAAC,CAAA;AAZY,QAAA,MAAM,UAYlB;AAGM,MAAM,YAAY,GAAG,CAAC,KAAwB,EAAuB,EAAE;IAC1E,IAAI,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC;IAEpB,MAAM,SAAS,GAAa,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC5C,KAAK,CAAC,MAAM,CAAC,cAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC,GAAG,IAAI,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE;QACrC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAE/D,OAAO,GAAG,CAAC;AACf,CAAC,CAAA;AAXY,QAAA,YAAY,gBAWxB"}

package/lib/es5/index.d.ts

@@ -0,0 +1,8 @@
+export * from "./melody";
+export * from "./mode";
+export * from "./key";
+export * from "./melodic_vector";
+export * from "./rhythm";
+export * from "./lindenmayer_system";
+export * from "./markov_chain";
+export * from "./helpers";

package/lib/es5/index.js

@@ -0,0 +1,25 @@
+"use strict";
+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 __exportStar = (this && this.__exportStar) || function(m, exports) {
+    for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+__exportStar(require("./melody"), exports);
+__exportStar(require("./mode"), exports);
+__exportStar(require("./key"), exports);
+__exportStar(require("./melodic_vector"), exports);
+__exportStar(require("./rhythm"), exports);
+__exportStar(require("./lindenmayer_system"), exports);
+__exportStar(require("./markov_chain"), exports);
+__exportStar(require("./helpers"), exports);
+//# sourceMappingURL=index.js.map

package/lib/es5/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/index.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;;AAAA,2CAAyB;AACzB,yCAAuB;AACvB,wCAAsB;AACtB,mDAAiC;AACjC,2CAAyB;AACzB,uDAAqC;AACrC,iDAA+B;AAC/B,4CAA0B"}

package/lib/es5/key.d.ts

@@ -0,0 +1,21 @@
+import { Mode, Scale } from "./mode";
+import * as noteData from "./note_data";
+export declare class Key {
+    #private;
+    scale: Scale;
+    scaleName: string;
+    name: string;
+    mode: Mode;
+    tonic: string;
+    midiTonic: number;
+    octave: number;
+    scaleNotes: string[];
+    inversions: Map<number, number>;
+    inversionMin: number;
+    inversionMax: number;
+    constructor(tonic: (number | string), scale: Scale);
+    degree(d: number, octaveTranspose?: number): noteData.note;
+    chord(degree: number, type: string, octaveTransposition?: number): noteData.chord;
+    midi2note(midiNoteNumber: number): string;
+    degreeInversion(scaleDegree: number): noteData.note;
+}

package/lib/es5/key.js

@@ -0,0 +1,178 @@
+"use strict";
+var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+};
+var _Key_instances, _Key_negativeDegree, _Key_calculateChordRoot, _Key_calculateChordDegree, _Key_calculateScaleNotes, _Key_calculateInversions;
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.Key = void 0;
+const mode_1 = require("./mode");
+const noteData = require("./note_data");
+const helpers = require("./helpers");
+const tblswvs_error_1 = require("./tblswvs_error");
+class Key {
+    constructor(tonic, scale) {
+        _Key_instances.add(this);
+        this.scale = scale;
+        this.mode = new mode_1.Mode(scale);
+        if (typeof tonic == "string") {
+            this.tonic = tonic;
+            this.midiTonic = noteData.chromaticScale.indexOf(tonic);
+            this.octave = 1;
+        }
+        else {
+            this.tonic = noteData.chromaticScale[tonic % 12];
+            this.midiTonic = tonic % 12;
+            this.octave = noteData.noteData[tonic].octave;
+        }
+        this.scaleName = mode_1.Scale[scale];
+        this.name = `${this.tonic} ${this.scaleName}`;
+        this.scaleNotes = __classPrivateFieldGet(this, _Key_instances, "m", _Key_calculateScaleNotes).call(this);
+        this.inversions = __classPrivateFieldGet(this, _Key_instances, "m", _Key_calculateInversions).call(this);
+        const inversionRange = Array.from(this.inversions.keys()).sort((a, b) => a - b);
+        this.inversionMin = inversionRange[0];
+        this.inversionMax = inversionRange[inversionRange.length - 1];
+    }
+    degree(d, octaveTranspose) {
+        if (d == 0)
+            throw new tblswvs_error_1.TblswvsError(helpers.SCALE_DEGREE_ERROR);
+        if (d < 0)
+            return __classPrivateFieldGet(this, _Key_instances, "m", _Key_negativeDegree).call(this, d, octaveTranspose);
+        // The degree octave may start higher than the current key's octave (e.g., the 9th in a diatonic scale)
+        let degreeOctave = this.octave + Math.floor((d - 1) / this.scaleNotes.length);
+        const noteIndex = this.mode.scaleOffsets[(d - 1) % this.scaleNotes.length] + this.midiTonic + (degreeOctave * 12) + 24;
+        let degree = Object.assign({}, noteData.noteData[noteIndex]);
+        // Reset the generic note to the scale notes to correctly identify when a scale degree should be a flat, rather than
+        // the default sharp for noteData.
+        degree.note = this.scaleNotes[(d - 1) % this.scaleNotes.length];
+        degree.scaleDegree = d;
+        if (octaveTranspose != undefined) {
+            degree.octave += octaveTranspose;
+            degree.midi += (octaveTranspose * 12);
+        }
+        return degree;
+    }
+    chord(degree, type, octaveTransposition) {
+        let quality = (type == "T") ? this.mode.chordQualities[degree - 1] : type;
+        /*
+         * octaveTransposition: the calling client may request transposition (-/+)
+         * this.midiTonic: scale pitch class (0-11)
+         * this.octave * 12: the Key has a default lowest octave
+         * + 24: lowest MIDI octave, -2, means this.octave*12 could be as low as -24, which should be brought up to MIDI note 0
+         */
+        let midiTransposition = (octaveTransposition == undefined ? 0 : octaveTransposition * 12) + this.midiTonic + (this.octave * 12) + 24;
+        let midi = noteData.chordTypes[quality].intervals.reduce((midiNotes, intv) => {
+            midiNotes.push(intv + this.mode.scaleOffsets[degree - 1] + midiTransposition);
+            return midiNotes;
+        }, []);
+        return {
+            midi: midi,
+            quality: quality,
+            root: __classPrivateFieldGet(this, _Key_instances, "m", _Key_calculateChordRoot).call(this, midi, quality),
+            degree: __classPrivateFieldGet(this, _Key_instances, "m", _Key_calculateChordDegree).call(this, quality, degree),
+            keyTransposition: octaveTransposition == undefined ? 0 : octaveTransposition
+        };
+    }
+    midi2note(midiNoteNumber) {
+        const normalizedNumber = midiNoteNumber % 12;
+        const normalizedIndex = this.mode.scaleOffsets.indexOf(normalizedNumber);
+        if (normalizedIndex != -1) {
+            return this.scaleNotes[normalizedIndex] + noteData.noteData[midiNoteNumber].octave;
+        }
+        else {
+            let note = noteData.noteData[midiNoteNumber].note;
+            const nearestNote = this.scaleNotes.find(n => n[0] == note[0]);
+            note += (nearestNote != undefined && nearestNote.length == 2) ? "♮" : "";
+            return note + noteData.noteData[midiNoteNumber].octave;
+        }
+    }
+    degreeInversion(scaleDegree) {
+        if (scaleDegree < this.inversionMin)
+            scaleDegree = this.inversionMin;
+        else if (scaleDegree > this.inversionMax)
+            scaleDegree = this.inversionMax;
+        const invertedScaleDegree = this.inversions.get(scaleDegree);
+        if (invertedScaleDegree == undefined)
+            return { octave: -3, note: "", midi: -1 };
+        else
+            return this.degree(invertedScaleDegree);
+    }
+}
+exports.Key = Key;
+_Key_instances = new WeakSet(), _Key_negativeDegree = function _Key_negativeDegree(d, octaveTranspose) {
+    // For negative indices, start by getting the step offsets in reverse order...
+    let revCopy = this.mode.stepOffsets.slice().reverse();
+    // Then determine how many copies of the array are needed to index the current scale degree
+    // (e.g., -8 for C Major would be the second B, so copies should be 2)
+    let copies = Math.ceil(-d / revCopy.length);
+    // Create a version of the reversed step offsets that can reach the scale degree needed.
+    let expanded = new Array(copies).fill(revCopy).flat();
+    // Finally, subtract negative offsets from the current Key's root and correct the default sharps to flats as needed.
+    const noteIndex = this.octave * 12 + this.midiTonic + 24 - expanded.slice(0, -d).reduce((total, offset) => total += offset, 0);
+    let degree = Object.assign({}, noteData.noteData[noteIndex]);
+    degree.note = this.scaleNotes.at(d % this.scaleNotes.length);
+    degree.scaleDegree = d;
+    if (octaveTranspose != undefined) {
+        degree.octave += octaveTranspose;
+        degree.midi += (octaveTranspose * 12);
+    }
+    return degree;
+}, _Key_calculateChordRoot = function _Key_calculateChordRoot(chordMidi, chordQuality) {
+    let inversion = chordQuality.split("/")[1];
+    if (inversion == undefined) {
+        return this.midi2note(chordMidi[0]).replace(/[0-9]/g, "");
+    }
+    else if (inversion == "2" || inversion == "3" || inversion == "4") {
+        return this.midi2note(chordMidi[2]).replace(/[0-9]/g, "");
+    }
+    else if (inversion == "5") {
+        return this.midi2note(chordMidi[1]).replace(/[0-9]/g, "");
+    }
+    else {
+        return this.midi2note(chordMidi[0]).replace(/[0-9]/g, "");
+    }
+}, _Key_calculateChordDegree = function _Key_calculateChordDegree(quality, degree) {
+    if (quality.startsWith("M")) {
+        return quality.replace("M", noteData.chordNumeralsMap[degree]);
+    }
+    else if (quality.startsWith("m")) {
+        return quality.replace("m", noteData.chordNumeralsMap[degree].toLowerCase());
+    }
+    else if (quality.startsWith("aug")) {
+        return quality.replace("aug", noteData.chordNumeralsMap[degree]) + "+";
+    }
+    else if (quality.startsWith("dim")) {
+        return quality.replace("dim", noteData.chordNumeralsMap[degree]).toLowerCase() + "o";
+    }
+    else if (quality.startsWith("sus2")) {
+        return noteData.chordNumeralsMap[degree] + quality;
+    }
+    else if (quality.startsWith("sus4")) {
+        return quality.replace("sus2", noteData.chordNumeralsMap[degree]) + "sus4";
+    }
+    else if (quality.startsWith("WT")) {
+        return quality.replace("WT", noteData.chordNumeralsMap[degree]).toLowerCase() + "WT";
+    }
+    else {
+        return degree + quality;
+    }
+}, _Key_calculateScaleNotes = function _Key_calculateScaleNotes() {
+    const rotatedAbsolute = helpers.rotate(noteData.scaleNoteCandidates, -noteData.scaleNoteCandidates.findIndex(n => n.includes(this.tonic)));
+    let scaleAbcNotes = helpers.rotate(noteData.abcNotesMidiOrder, -noteData.abcNotesMidiOrder.indexOf(this.tonic[0]));
+    if (this.mode.scaleDegreeMapping.length != 0) {
+        scaleAbcNotes = this.mode.scaleDegreeMapping.map(d => scaleAbcNotes[Math.floor(d) - 1]);
+    }
+    return scaleAbcNotes.map((n, i) => {
+        const absoluteIndex = this.mode.scaleOffsets[i];
+        return rotatedAbsolute[absoluteIndex].find((sn) => sn[0] == n);
+    });
+}, _Key_calculateInversions = function _Key_calculateInversions() {
+    const positiveDegrees = [...new Array(this.mode.stepOffsets.length * 2 + 1).keys()].map(d => d + 1);
+    const negativeDegrees = positiveDegrees.slice(0, this.mode.stepOffsets.length).reverse().map(d => d * -1);
+    this.inversionMin = negativeDegrees[0];
+    this.inversionMax = positiveDegrees[positiveDegrees.length - 1];
+    const blerg = negativeDegrees.concat(positiveDegrees);
+    return helpers.inversionMap(blerg);
+};
+//# sourceMappingURL=key.js.map

package/lib/es5/key.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"key.js","sourceRoot":"","sources":["../../../src/key.ts"],"names":[],"mappings":";;;;;;;;;AAAA,iCAAqC;AACrC,wCAAwC;AACxC,qCAAqC;AACrC,mDAA+C;AAG/C,MAAa,GAAG;IAcZ,YAAY,KAAwB,EAAE,KAAY;;QAC9C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAI,IAAI,WAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,OAAO,KAAK,IAAI,QAAQ,EAAE;YAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;YACnB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,cAAc,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACxD,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SACnB;aAAM;YACH,IAAI,CAAC,KAAK,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC;YACjD,IAAI,CAAC,SAAS,GAAG,KAAK,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;SACjD;QACD,IAAI,CAAC,SAAS,GAAG,YAAK,CAAC,KAAK,CAAC,CAAC;QAC9B,IAAI,CAAC,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAA;QAC7C,IAAI,CAAC,UAAU,GAAG,uBAAA,IAAI,gDAAqB,MAAzB,IAAI,CAAuB,CAAC;QAC9C,IAAI,CAAC,UAAU,GAAG,uBAAA,IAAI,gDAAqB,MAAzB,IAAI,CAAuB,CAAC;QAC9C,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAChF,IAAI,CAAC,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,YAAY,GAAG,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAClE,CAAC;IAGD,MAAM,CAAC,CAAS,EAAE,eAAwB;QACtC,IAAI,CAAC,IAAI,CAAC;YAAE,MAAM,IAAI,4BAAY,CAAC,OAAO,CAAC,kBAAkB,CAAC,CAAC;QAE/D,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,uBAAA,IAAI,2CAAgB,MAApB,IAAI,EAAiB,CAAC,EAAE,eAAe,CAAC,CAAC;QAE3D,uGAAuG;QACvG,IAAI,YAAY,GAAG,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC9E,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,YAAY,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QACvH,IAAI,MAAM,qBAAQ,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAE,CAAC;QACjD,oHAAoH;QACpH,kCAAkC;QAClC,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAChE,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;QACvB,IAAI,eAAe,IAAI,SAAS,EAAE;YAC9B,MAAM,CAAC,MAAM,IAAI,eAAe,CAAC;YACjC,MAAM,CAAC,IAAI,IAAM,CAAC,eAAe,GAAG,EAAE,CAAC,CAAC;SAC3C;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IA4BD,KAAK,CAAC,MAAc,EAAE,IAAY,EAAE,mBAA4B;QAC5D,IAAI,OAAO,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;QAE1E;;;;;WAKG;QACH,IAAI,iBAAiB,GAAG,CAAC,mBAAmB,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;QAErI,IAAI,IAAI,GAAG,QAAQ,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,SAAmB,EAAE,IAAY,EAAE,EAAE;YAC3F,SAAS,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,iBAAiB,CAAC,CAAC;YAC9E,OAAO,SAAS,CAAC;QACrB,CAAC,EAAE,EAAE,CAAC,CAAC;QAEP,OAAO;YACH,IAAI,EAAE,IAAI;YACV,OAAO,EAAE,OAAO;YAChB,IAAI,EAAE,uBAAA,IAAI,+CAAoB,MAAxB,IAAI,EAAqB,IAAI,EAAE,OAAO,CAAC;YAC7C,MAAM,EAAE,uBAAA,IAAI,iDAAsB,MAA1B,IAAI,EAAuB,OAAO,EAAE,MAAM,CAAC;YACnD,gBAAgB,EAAE,mBAAmB,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mBAAmB;SAC/E,CAAA;IACL,CAAC;IAsCD,SAAS,CAAC,cAAsB;QAC5B,MAAM,gBAAgB,GAAG,cAAc,GAAG,EAAE,CAAC;QAC7C,MAAM,eAAe,GAAI,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;QAC1E,IAAI,eAAe,IAAI,CAAC,CAAC,EAAE;YACvB,OAAO,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,GAAG,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC;SACtF;aAAM;YACH,IAAI,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC;YAClD,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;YAC9D,IAAI,IAAI,CAAC,WAAW,IAAI,SAAS,IAAI,WAAW,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACzE,OAAO,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,MAAM,CAAC;SAC1D;IACL,CAAC;IAkBD,eAAe,CAAC,WAAmB;QAC/B,IAAI,WAAW,GAAG,IAAI,CAAC,YAAY;YAAE,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;aAChE,IAAI,WAAW,GAAG,IAAI,CAAC,YAAY;YAAE,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC;QAE1E,MAAM,mBAAmB,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC7D,IAAI,mBAAmB,IAAI,SAAS;YAChC,OAAO,EAAC,MAAM,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAC,CAAC;;YAExC,OAAO,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;IAChD,CAAC;CAmBJ;AAxMD,kBAwMC;mFA/ImB,CAAS,EAAE,eAAwB;IAC/C,8EAA8E;IAC9E,IAAI,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,OAAO,EAAE,CAAC;IAEtD,2FAA2F;IAC3F,sEAAsE;IACtE,IAAI,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAE5C,wFAAwF;IACxF,IAAI,QAAQ,GAAG,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC;IAEtD,oHAAoH;IACpH,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,GAAG,EAAE,GAAG,IAAI,CAAC,SAAS,GAAG,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE,CAAC,KAAK,IAAI,MAAM,EAAE,CAAC,CAAC,CAAC;IAC/H,IAAI,MAAM,qBAAQ,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAE,CAAC;IACjD,MAAM,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAE,CAAC;IAC9D,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;IACvB,IAAI,eAAe,IAAI,SAAS,EAAE;QAC9B,MAAM,CAAC,MAAM,IAAI,eAAe,CAAC;QACjC,MAAM,CAAC,IAAI,IAAM,CAAC,eAAe,GAAG,EAAE,CAAC,CAAC;KAC3C;IAED,OAAO,MAAM,CAAC;AAClB,CAAC,6DA6BmB,SAAmB,EAAE,YAAoB;IACzD,IAAI,SAAS,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3C,IAAI,SAAS,IAAI,SAAS,EAAE;QACxB,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;KAC7D;SAAM,IAAI,SAAS,IAAI,GAAG,IAAI,SAAS,IAAI,GAAG,IAAI,SAAS,IAAI,GAAG,EAAE;QACjE,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;KAC7D;SAAM,IAAI,SAAS,IAAI,GAAG,EAAE;QACzB,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;KAC7D;SAAM;QACH,OAAO,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;KAC7D;AACL,CAAC,iEAGqB,OAAe,EAAE,MAAc;IACjD,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;QACzB,OAAO,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC;KAClE;SAAM,IAAI,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE;QAChC,OAAO,OAAO,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;KAChF;SAAM,IAAI,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE;QAClC,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;KAC1E;SAAM,IAAI,OAAO,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE;QAClC,OAAO,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,GAAG,CAAC;KACxF;SAAM,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE;QACnC,OAAO,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC;KACtD;SAAM,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE;QACnC,OAAO,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,GAAG,MAAM,CAAC;KAC9E;SAAM,IAAI,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE;QACjC,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,IAAI,CAAC;KACxF;SAAM;QACH,OAAO,MAAM,GAAG,OAAO,CAAC;KAC3B;AACL,CAAC;IAkBG,MAAM,eAAe,GAAG,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,mBAAmB,EAAE,CAAC,QAAQ,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3I,IAAM,aAAa,GAAK,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,iBAAiB,EAAE,CAAC,QAAQ,CAAC,iBAAiB,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAEvH,IAAI,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,MAAM,IAAI,CAAC,EAAE;QAC1C,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;KAC3F;IAED,OAAO,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC9B,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChD,OAAO,eAAe,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;AACP,CAAC;IAqBG,MAAM,eAAe,GAAG,CAAC,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpG,MAAM,eAAe,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1G,IAAI,CAAC,YAAY,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC;IACvC,IAAI,CAAC,YAAY,GAAG,eAAe,CAAC,eAAe,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAEhE,MAAM,KAAK,GAAG,eAAe,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC;IACtD,OAAO,OAAO,CAAC,YAAY,CACvB,KAAK,CACR,CAAC;AACN,CAAC"}

package/lib/es5/lindenmayer_system.d.ts

@@ -0,0 +1,62 @@
+type productionRule = {
+    matchStr: string;
+    output: string;
+};
+/**
+ * Lindenmayer Systems (or L-Systems) are string rewriting systems developed by, and named after, the Hungarian
+ * biologist who used the algorithm to model the growth of plants and cell structures.
+ *
+ * This class represents a simple implementation of L-Systems where you can create one with a starting axiom,
+ * add new "production rules," and generate new iterations of the L-System string. Additionally, this version
+ * implements branching using the square bracket characters '[' and ']'. Branching enables an L-System string
+ * to be translated into a 2-dimensional matrix.
+ */
+export declare class LindenmayerSystem {
+    axiom: string;
+    string: string;
+    productionRules: {
+        [index: string]: string;
+    };
+    /**
+     * Create a new LindenmayerSystem object.
+     *
+     * @param axiom the initial string for this L-System
+     */
+    constructor(axiom: string);
+    /**
+     * Add a new production rule to the L-System.
+     *
+     * @param rule a string rewriting rule in the form of an object that has the properties "matchStr" and "output"
+     */
+    add(rule: productionRule): void;
+    /**
+     * Get the current list of production rule matching strings. To see the rewriting output for each rule,
+     * access the productionRules property.
+     *
+     * @returns string[] the production rules matching strings
+     */
+    rules(): string[];
+    /**
+     * Advance the L-System by one generation.
+     *
+     * The current string, which is equal to the axiom until advanced,
+     * will have its letters run thru the production rules. When a letter matches a production rule's "matchStr"
+     * property, it will be replaced by the same production rule's "output" property in the resulting string.
+     * When no match is found the current letter will simply be added without replacement.
+     *
+     * This will update the object's "string" property.
+     */
+    advance(): void;
+    /**
+     * Get the current "string" as a matrix.
+     *
+     * A matrix representation is really only useful for L-System strings with branching characters so that
+     * the matrix has multiple rows. The intention is to return a 2-D table-like representation of a branching
+     * L-System string so that represents a polyphonic event sequence. The columns can be treated as sequencer
+     * steps and the rows as simultaneous/polyphonic events for the current step/column.
+     *
+     * @returns string[][] a 2-dimensional matrix representation of the current L-System string
+     */
+    matrix(): string[][];
+}
+export {};

package/lib/es5/lindenmayer_system.js

@@ -0,0 +1,94 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.LindenmayerSystem = void 0;
+/**
+ * Lindenmayer Systems (or L-Systems) are string rewriting systems developed by, and named after, the Hungarian
+ * biologist who used the algorithm to model the growth of plants and cell structures.
+ *
+ * This class represents a simple implementation of L-Systems where you can create one with a starting axiom,
+ * add new "production rules," and generate new iterations of the L-System string. Additionally, this version
+ * implements branching using the square bracket characters '[' and ']'. Branching enables an L-System string
+ * to be translated into a 2-dimensional matrix.
+ */
+class LindenmayerSystem {
+    /**
+     * Create a new LindenmayerSystem object.
+     *
+     * @param axiom the initial string for this L-System
+     */
+    constructor(axiom) {
+        this.axiom = axiom;
+        this.string = axiom;
+        this.productionRules = {};
+    }
+    /**
+     * Add a new production rule to the L-System.
+     *
+     * @param rule a string rewriting rule in the form of an object that has the properties "matchStr" and "output"
+     */
+    add(rule) {
+        this.productionRules[rule.matchStr] = rule.output;
+    }
+    /**
+     * Get the current list of production rule matching strings. To see the rewriting output for each rule,
+     * access the productionRules property.
+     *
+     * @returns string[] the production rules matching strings
+     */
+    rules() {
+        return Object.keys(this.productionRules);
+    }
+    /**
+     * Advance the L-System by one generation.
+     *
+     * The current string, which is equal to the axiom until advanced,
+     * will have its letters run thru the production rules. When a letter matches a production rule's "matchStr"
+     * property, it will be replaced by the same production rule's "output" property in the resulting string.
+     * When no match is found the current letter will simply be added without replacement.
+     *
+     * This will update the object's "string" property.
+     */
+    advance() {
+        this.string = this.string.split(" ").map(letter => {
+            return letter in this.productionRules ? this.productionRules[letter] : letter;
+        }).join(" ");
+    }
+    /**
+     * Get the current "string" as a matrix.
+     *
+     * A matrix representation is really only useful for L-System strings with branching characters so that
+     * the matrix has multiple rows. The intention is to return a 2-D table-like representation of a branching
+     * L-System string so that represents a polyphonic event sequence. The columns can be treated as sequencer
+     * steps and the rows as simultaneous/polyphonic events for the current step/column.
+     *
+     * @returns string[][] a 2-dimensional matrix representation of the current L-System string
+     */
+    matrix() {
+        let matrix = new Array();
+        matrix.push(new Array());
+        let rowIndex = 0, colIndex = 0, branchCoordinates = [rowIndex, colIndex];
+        this.string.split(" ").forEach((letter, i) => {
+            if (letter == "[") {
+                // When starting a new branch, note where the branch origin is for returning when the branch
+                // ceases, increment the row count and create an Array for the new row.
+                branchCoordinates = [rowIndex, colIndex];
+                rowIndex = matrix.length;
+                matrix.push(new Array());
+                colIndex -= 1;
+            }
+            else if (letter == "]") {
+                // When a branch terminates, return the cursor to the branching coordinates.
+                rowIndex = branchCoordinates[0];
+                colIndex = branchCoordinates[1];
+            }
+            else {
+                // Add the current letter to the next position
+                matrix[rowIndex][colIndex] = letter;
+                colIndex += 1;
+            }
+        });
+        return matrix;
+    }
+}
+exports.LindenmayerSystem = LindenmayerSystem;
+//# sourceMappingURL=lindenmayer_system.js.map

package/lib/es5/lindenmayer_system.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lindenmayer_system.js","sourceRoot":"","sources":["../../../src/lindenmayer_system.ts"],"names":[],"mappings":";;;AAMA;;;;;;;;GAQG;AACH,MAAa,iBAAiB;IAM1B;;;;OAIG;IACH,YAAY,KAAa;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC;IAC9B,CAAC;IAGD;;;;OAIG;IACH,GAAG,CAAC,IAAoB;QACpB,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtD,CAAC;IAGD;;;;;OAKG;IACH,KAAK;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;IAC7C,CAAC;IAGD;;;;;;;;;OASG;IACH,OAAO;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE;YAC9C,OAAO,MAAM,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;QAClF,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACjB,CAAC;IAGD;;;;;;;;;OASG;IACH,MAAM;QACF,IAAI,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;QACzB,IAAI,QAAQ,GAAG,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,iBAAiB,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAEzE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACzC,IAAI,MAAM,IAAI,GAAG,EAAE;gBAEf,4FAA4F;gBAC5F,uEAAuE;gBACvE,iBAAiB,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBACzC,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC;gBACzB,MAAM,CAAC,IAAI,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;gBACzB,QAAQ,IAAI,CAAC,CAAC;aAEjB;iBAAM,IAAI,MAAM,IAAI,GAAG,EAAE;gBAEtB,4EAA4E;gBAC5E,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;gBAChC,QAAQ,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;aAEnC;iBAAM;gBAEH,8CAA8C;gBAC9C,MAAM,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC;gBACpC,QAAQ,IAAI,CAAC,CAAC;aACjB;QACL,CAAC,CAAC,CAAC;QAEH,OAAO,MAAM,CAAC;IAClB,CAAC;CACJ;AAjGD,8CAiGC"}

package/lib/es5/markov_chain.d.ts

@@ -0,0 +1,8 @@
+import { Melody } from "./melody";
+export declare class MarkovChain {
+    input: Melody;
+    stateTransitionMatrix: Map<(string), (string | number)[]>;
+    constructor(input: Melody);
+    get(previous: number, current: number): (string | number);
+    private generateStm;
+}

package/lib/es5/markov_chain.js

@@ -0,0 +1,28 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MarkovChain = void 0;
+class MarkovChain {
+    constructor(input) {
+        this.input = input;
+        this.stateTransitionMatrix = this.generateStm();
+    }
+    get(previous, current) {
+        const candidates = this.stateTransitionMatrix.get(`${previous}:${current}`) || [];
+        return candidates[Math.floor(Math.random() * candidates.length)];
+    }
+    generateStm() {
+        return this.input.steps.reduce((stm, step, i, arr) => {
+            if (i < arr.length - 1) {
+                const prevStep = (i == 0) ? step : arr[i - 1];
+                const nextStep = arr[i + 1];
+                const key = `${prevStep}:${step}`;
+                const values = stm.get(key) || new Array();
+                values.push(nextStep);
+                stm.set(key, values);
+            }
+            return stm;
+        }, new Map);
+    }
+}
+exports.MarkovChain = MarkovChain;
+//# sourceMappingURL=markov_chain.js.map

package/lib/es5/markov_chain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"markov_chain.js","sourceRoot":"","sources":["../../../src/markov_chain.ts"],"names":[],"mappings":";;;AAGA,MAAa,WAAW;IAKpB,YAAY,KAAa;QACrB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,qBAAqB,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IACpD,CAAC;IAGD,GAAG,CAAC,QAAgB,EAAE,OAAe;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,GAAG,QAAQ,IAAI,OAAO,EAAE,CAAC,IAAI,EAAE,CAAC;QAClF,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IACrE,CAAC;IAGO,WAAW;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,EAAE;YACjD,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;gBACpB,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC9C,MAAM,QAAQ,GAAG,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC5B,MAAM,GAAG,GAAQ,GAAG,QAAQ,IAAI,IAAI,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,IAAI,KAAK,EAAE,CAAC;gBAC7C,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACtB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;aACxB;YACD,OAAO,GAAG,CAAC;QACf,CAAC,EAAE,IAAI,GAAgC,CAAC,CAAC;IAC7C,CAAC;CACJ;AA9BD,kCA8BC"}

package/lib/es5/melodic_vector.d.ts

@@ -0,0 +1,29 @@
+import { Sequence } from "./sequence";
+import { Melody } from "./melody";
+import { Transformation } from "./transformation";
+/**
+ * A MelodicVector is a sequence of numbers that can transform a Melody object by applying vector
+ * addition to a numerical representation of the Melody's note data.
+ *
+ * This class is not a true vector in the mathematical sense. For example, the steps property of
+ * this class that stores its sequence data does not need to have the same number of elements as
+ * in the Melody that it is transforming. The MelodicVector's steps will instead be repeated until
+ * it is expanded to the size of the Melody's steps.
+ */
+export declare class MelodicVector implements Sequence, Transformation {
+    steps: number[];
+    /**
+     * Create a new MelodicVector object.
+     *
+     * @param steps number[] the steps that represent the object's vector
+     */
+    constructor(steps: number[]);
+    /**
+     * Transforms a melody by vector addition. Note that the vector step length and melody step
+     * length do not need to be equal.
+     *
+     * @param Melody the melody to transform withe the current vector
+     * @returns new Melody with steps based on summing the input melody steps and the vector steps
+     */
+    applyTo(melody: Melody): Melody;
+}

package/lib/es5/melodic_vector.js

@@ -0,0 +1,49 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.MelodicVector = void 0;
+const melody_1 = require("./melody");
+/**
+ * A MelodicVector is a sequence of numbers that can transform a Melody object by applying vector
+ * addition to a numerical representation of the Melody's note data.
+ *
+ * This class is not a true vector in the mathematical sense. For example, the steps property of
+ * this class that stores its sequence data does not need to have the same number of elements as
+ * in the Melody that it is transforming. The MelodicVector's steps will instead be repeated until
+ * it is expanded to the size of the Melody's steps.
+ */
+class MelodicVector {
+    /**
+     * Create a new MelodicVector object.
+     *
+     * @param steps number[] the steps that represent the object's vector
+     */
+    constructor(steps) {
+        this.steps = steps;
+    }
+    /**
+     * Transforms a melody by vector addition. Note that the vector step length and melody step
+     * length do not need to be equal.
+     *
+     * @param Melody the melody to transform withe the current vector
+     * @returns new Melody with steps based on summing the input melody steps and the vector steps
+     */
+    applyTo(melody) {
+        // First generate an array of steps that will match the melody's length.
+        const size = Math.ceil((melody.steps.length / this.steps.length));
+        const expandedSteps = new Array(size).fill(this.steps).flat().slice(0, melody.steps.length);
+        // Create a copy of the melody so that the rest symbol and mode are carried forward.
+        // Then apply the vector addition.
+        const transformedMelody = melody.clone();
+        transformedMelody.steps = expandedSteps.map((step, i) => {
+            if (melody.melodicMode == melody_1.MelodyType.Degrees && melody.steps[i] == 0)
+                return 0;
+            else if (melody.steps[i] == melody.restSymbol)
+                return melody.steps[i];
+            else
+                return step + melody.steps[i];
+        });
+        return transformedMelody;
+    }
+}
+exports.MelodicVector = MelodicVector;
+//# sourceMappingURL=melodic_vector.js.map

package/lib/es5/melodic_vector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"melodic_vector.js","sourceRoot":"","sources":["../../../src/melodic_vector.ts"],"names":[],"mappings":";;;AACA,qCAA8C;AAI9C;;;;;;;;GAQG;AACH,MAAa,aAAa;IAItB;;;;OAIG;IACH,YAAY,KAAe;QACvB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACvB,CAAC;IAGD;;;;;;OAMG;IACH,OAAO,CAAC,MAAc;QAClB,wEAAwE;QACxE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAClE,MAAM,aAAa,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAE5F,oFAAoF;QACpF,kCAAkC;QAClC,MAAM,iBAAiB,GAAG,MAAM,CAAC,KAAK,EAAE,CAAC;QACzC,iBAAiB,CAAC,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACpD,IAAI,MAAM,CAAC,WAAW,IAAI,mBAAU,CAAC,OAAO,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;gBAChE,OAAO,CAAC,CAAC;iBACR,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,UAAU;gBACzC,OAAO,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;;gBAEvB,OAAO,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,OAAO,iBAAiB,CAAC;IAC7B,CAAC;CACJ;AAxCD,sCAwCC"}