tscommons-esm-algorithms-ai 0.0.2

package/dist/classes/knearest-neighbour-classifier.d.mts

@@ -0,0 +1,41 @@
+import { ICommonsAiModelPredictable, ICommonsAiModelTrainable, TCommonsAiGenericTrainingData, TCommonsAiPrediction, TCommonsAiQuality, TCommonsAiTrainingStats } from 'tscommons-esm-ai';
+type TDataWithDistance<InputT, OutputT> = TCommonsAiGenericTrainingData<InputT, OutputT> & {
+    distance: number;
+};
+export type TCommonsAlgorithmAiOutputWithDistance<OutputT> = Pick<TDataWithDistance<unknown, OutputT>, 'output' | 'distance'>;
+export declare abstract class CommonsAlgorithmAiKNearestNeighbourClassifier<InputT, OutputT> implements ICommonsAiModelTrainable<InputT, OutputT, TCommonsAiTrainingStats>, ICommonsAiModelPredictable<InputT, OutputT> {
+    private k;
+    private expandKToIdenticalDistances;
+    private data;
+    constructor(k?: number, expandKToIdenticalDistances?: boolean);
+    load(data: TCommonsAiGenericTrainingData<InputT, OutputT>[]): void;
+    build(): Promise<void>;
+    train(): Promise<TCommonsAiTrainingStats | undefined>;
+    protected abstract calculateDistance(a: InputT, b: InputT): number;
+    protected abstract getConsensus(neighbours: TCommonsAlgorithmAiOutputWithDistance<OutputT>[]): TCommonsAiPrediction<OutputT> | undefined;
+    predict(input: InputT): Promise<TCommonsAiPrediction<OutputT> | undefined>;
+    protected abstract calculateQuality(actual: TCommonsAiPrediction<OutputT>, expected: OutputT): [number, number];
+    test(testData: TCommonsAiGenericTrainingData<InputT, OutputT>[]): Promise<TCommonsAiQuality>;
+}
+export declare abstract class CommonsAlgorithmAiKNearestNeighbourEnumClassifier<InputT, E extends string> extends CommonsAlgorithmAiKNearestNeighbourClassifier<InputT, E> {
+    protected values: E[];
+    constructor(values: E[], k?: number, expandKToIdenticalDistances?: boolean);
+    loadMap(data: Map<E, InputT[]>): void;
+}
+export declare abstract class CommonsAlgorithmAiKNearestNeighbourNormalisedNumericInputEnumClassifier<InputT, E extends string> implements ICommonsAiModelTrainable<InputT, E, TCommonsAiTrainingStats>, ICommonsAiModelPredictable<InputT, E> {
+    private values;
+    private k?;
+    private normaliseInput;
+    private expandKToIdenticalDistances;
+    private sourceData;
+    private numericClassifier;
+    constructor(values: E[], k?: number | undefined, normaliseInput?: boolean, expandKToIdenticalDistances?: boolean);
+    protected abstract numericiseInput(input: InputT): number[];
+    protected abstract getConsensus(neighbours: TCommonsAlgorithmAiOutputWithDistance<E>[]): TCommonsAiPrediction<E> | undefined;
+    loadMap(data: Map<E, InputT[]>): void;
+    build(): Promise<void>;
+    train(): Promise<TCommonsAiTrainingStats | undefined>;
+    predict(value: InputT): Promise<TCommonsAiPrediction<E> | undefined>;
+    test(testData: TCommonsAiGenericTrainingData<InputT, E>[]): Promise<TCommonsAiQuality>;
+}
+export {};

package/dist/classes/knearest-neighbour-classifier.mjs

@@ -0,0 +1,198 @@
+/* eslint-disable @typescript-eslint/require-await */
+import { commonsArrayEmpty, commonsArrayRapidSortHead } from 'tscommons-esm-core';
+import { commonsAlgorithmAiNormaliseInput } from '../helpers/normalise-input.mjs';
+export class CommonsAlgorithmAiKNearestNeighbourClassifier {
+    k;
+    expandKToIdenticalDistances;
+    data = [];
+    constructor(k = 1, expandKToIdenticalDistances = false) {
+        this.k = k;
+        this.expandKToIdenticalDistances = expandKToIdenticalDistances;
+        if (k < 1)
+            throw new Error('k cannot be less than 1');
+    }
+    load(data) {
+        this.data = data.slice();
+    }
+    async build() {
+        // do nothing
+    }
+    async train() {
+        // do nothing
+        return undefined;
+    }
+    async predict(input) {
+        if (this.data.length === 0)
+            return undefined;
+        // efficiency hack
+        const typecast = this.data;
+        for (const d of typecast) {
+            d.distance = this.calculateDistance(input, d.input);
+        }
+        try {
+            const nearests = commonsArrayRapidSortHead(typecast, this.k, (a, b) => a.distance < b.distance);
+            if (nearests.length === 0)
+                return undefined;
+            if (this.expandKToIdenticalDistances) {
+                const equals = [];
+                for (const nearest of nearests) {
+                    equals.push(...typecast
+                        .filter((d) => d.distance === nearest.distance));
+                }
+                equals
+                    .sort((a, b) => {
+                    if (a.distance < b.distance)
+                        return -1;
+                    if (a.distance > b.distance)
+                        return 1;
+                    return 0;
+                });
+                let cutoff = Math.min(this.k, equals.length);
+                while (cutoff < equals.length && equals[cutoff].distance === equals[0].distance)
+                    cutoff++;
+                commonsArrayEmpty(nearests);
+                nearests.push(...equals.slice(0, cutoff));
+                if (nearests.length === 0)
+                    throw new Error('Post expand nearest size was 0. This should not be possible');
+            }
+            return this.getConsensus(nearests);
+        }
+        finally {
+            // efficiency hack cleanup
+            for (const d of typecast) {
+                delete d.distance;
+            }
+        }
+    }
+    async test(testData) {
+        if (testData.length === 0)
+            throw new Error('No data to test on');
+        let positiveQuality = 0;
+        let negativeQuality = 0;
+        for (const test of testData) {
+            const prediction = await this.predict(test.input);
+            if (!prediction) {
+                negativeQuality++;
+            }
+            else {
+                const [positive, negative] = this.calculateQuality(prediction, test.output);
+                positiveQuality += positive;
+                negativeQuality += negative;
+            }
+        }
+        return {
+            positive: positiveQuality / testData.length,
+            negative: negativeQuality / testData.length
+        };
+    }
+}
+export class CommonsAlgorithmAiKNearestNeighbourEnumClassifier extends CommonsAlgorithmAiKNearestNeighbourClassifier {
+    values;
+    constructor(values, k, expandKToIdenticalDistances) {
+        super(k, expandKToIdenticalDistances);
+        this.values = values;
+    }
+    loadMap(data) {
+        const rebuild = [];
+        for (const value of this.values) {
+            rebuild.push(...(data.get(value) || [])
+                .map((input) => ({
+                input: input,
+                output: value
+            })));
+        }
+        this.load(rebuild);
+    }
+}
+class NumericClassifier extends CommonsAlgorithmAiKNearestNeighbourEnumClassifier {
+    getConsensusCallback;
+    constructor(getConsensusCallback, values, k, expandKToIdenticalDistances) {
+        super(values, k, expandKToIdenticalDistances);
+        this.getConsensusCallback = getConsensusCallback;
+    }
+    calculateDistance(a, b) {
+        if (a.length !== b.length)
+            throw new Error('a and b are not equal length');
+        let squares = 0;
+        for (let i = a.length; i-- > 0;)
+            squares += Math.pow(a[i] - b[i], 2);
+        return Math.sqrt(squares);
+    }
+    getConsensus(neighbours) {
+        return this.getConsensusCallback(neighbours);
+    }
+    calculateQuality(actual, expected) {
+        if (actual.prediction === expected)
+            return [1, 0];
+        return [0, 1];
+    }
+}
+export class CommonsAlgorithmAiKNearestNeighbourNormalisedNumericInputEnumClassifier {
+    values;
+    k;
+    normaliseInput;
+    expandKToIdenticalDistances;
+    sourceData;
+    numericClassifier;
+    constructor(values, k, normaliseInput = false, expandKToIdenticalDistances = false) {
+        this.values = values;
+        this.k = k;
+        this.normaliseInput = normaliseInput;
+        this.expandKToIdenticalDistances = expandKToIdenticalDistances;
+    }
+    loadMap(data) {
+        this.sourceData = data;
+    }
+    async build() {
+        if (!this.sourceData)
+            throw new Error('No source data. Use loadMap first');
+        const flattened = [];
+        for (const value of this.values) {
+            flattened.push(...(this.sourceData.get(value) || [])
+                .map((input) => ({
+                input: this.numericiseInput(input),
+                output: value
+            })));
+        }
+        if (this.normaliseInput)
+            commonsAlgorithmAiNormaliseInput(flattened);
+        this.numericClassifier = new NumericClassifier((neighbours) => this.getConsensus(neighbours), this.values, this.k, this.expandKToIdenticalDistances);
+        this.numericClassifier.load(flattened);
+    }
+    async train() {
+        if (!this.numericClassifier)
+            throw new Error('Model has not been built yet');
+        // do nothing
+        return undefined;
+    }
+    async predict(value) {
+        if (!this.numericClassifier)
+            throw new Error('Model has not been built yet');
+        const numericised = this.numericiseInput(value);
+        return this.numericClassifier.predict(numericised);
+    }
+    async test(testData) {
+        if (!this.numericClassifier)
+            throw new Error('Model has not been built yet');
+        if (testData.length === 0)
+            throw new Error('No data to test on');
+        let positiveQuality = 0;
+        let negativeQuality = 0;
+        for (const test of testData) {
+            const prediction = await this.predict(test.input);
+            if (!prediction) {
+                negativeQuality++;
+            }
+            else {
+                const [positive, negative] = this.numericClassifier.calculateQuality(prediction, test.output);
+                positiveQuality += positive;
+                negativeQuality += negative;
+            }
+        }
+        return {
+            positive: positiveQuality / testData.length,
+            negative: negativeQuality / testData.length
+        };
+    }
+}
+//# sourceMappingURL=knearest-neighbour-classifier.mjs.map

package/dist/classes/knearest-neighbour-classifier.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"knearest-neighbour-classifier.mjs","sourceRoot":"","sources":["../../src/classes/knearest-neighbour-classifier.mts"],"names":[],"mappings":"AAAA,qDAAqD;AAErD,OAAO,EAAE,iBAAiB,EAAE,yBAAyB,EAAE,MAAM,oBAAoB,CAAC;AAUlF,OAAO,EAAE,gCAAgC,EAAE,MAAM,gCAAgC,CAAC;AAOlF,MAAM,OAAgB,6CAA6C;IAQxD;IACA;IAJF,IAAI,GAAqD,EAAE,CAAC;IAEpE,YACU,IAAY,CAAC,EACb,8BAAuC,KAAK;QAD5C,MAAC,GAAD,CAAC,CAAY;QACb,gCAA2B,GAA3B,2BAA2B,CAAiB;QAErD,IAAI,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;IACvD,CAAC;IAEM,IAAI,CAAC,IAAsD;QACjE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;IAC1B,CAAC;IAEM,KAAK,CAAC,KAAK;QACjB,aAAa;IACd,CAAC;IAEM,KAAK,CAAC,KAAK;QACjB,aAAa;QAEb,OAAO,SAAS,CAAC;IAClB,CAAC;IAMM,KAAK,CAAC,OAAO,CAAC,KAAa;QACjC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE7C,kBAAkB;QAClB,MAAM,QAAQ,GAAyC,IAAI,CAAC,IAAuD,CAAC;QACpH,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YAC1B,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,CAAC;YACJ,MAAM,QAAQ,GAAyC,yBAAyB,CAC9E,QAAQ,EACR,IAAI,CAAC,CAAC,EACN,CAAC,CAAqC,EAAE,CAAqC,EAAW,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CACnH,CAAC;YAEF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,SAAS,CAAC;YAE5C,IAAI,IAAI,CAAC,2BAA2B,EAAE,CAAC;gBACtC,MAAM,MAAM,GAAyC,EAAE,CAAC;gBACxD,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;oBAChC,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ;yBACpB,MAAM,CAAC,CAAC,CAAqC,EAAW,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;gBACjG,CAAC;gBACD,MAAM;qBACH,IAAI,CAAC,CAAC,CAAqC,EAAE,CAAqC,EAAU,EAAE;oBAC9F,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ;wBAAE,OAAO,CAAC,CAAC,CAAC;oBACvC,IAAI,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ;wBAAE,OAAO,CAAC,CAAC;oBACtC,OAAO,CAAC,CAAC;gBACV,CAAC,CAAC,CAAC;gBAEL,IAAI,MAAM,GAAW,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;gBACrD,OAAO,MAAM,GAAG,MAAM,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ;oBAAE,MAAM,EAAE,CAAC;gBAE1F,iBAAiB,CAAC,QAAQ,CAAC,CAAC;gBAC5B,QAAQ,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;gBAE1C,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;oBAAE,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;YAC3G,CAAC;YAED,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC;QACpC,CAAC;gBAAS,CAAC;YACV,0BAA0B;YAC1B,KAAK,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;gBAC1B,OAAQ,CAA2B,CAAC,QAAQ,CAAC;YAC9C,CAAC;QACF,CAAC;IACF,CAAC;IAIM,KAAK,CAAC,IAAI,CAAC,QAA0D;QAC3E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;QAEjE,IAAI,eAAe,GAAW,CAAC,CAAC;QAChC,IAAI,eAAe,GAAW,CAAC,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,UAAU,GAA4C,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAE3F,IAAI,CAAC,UAAU,EAAE,CAAC;gBACjB,eAAe,EAAE,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACP,MAAM,CAAE,QAAQ,EAAE,QAAQ,CAAE,GAAuB,IAAI,CAAC,gBAAgB,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBAElG,eAAe,IAAI,QAAQ,CAAC;gBAC5B,eAAe,IAAI,QAAQ,CAAC;YAC7B,CAAC;QACF,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,eAAe,GAAG,QAAQ,CAAC,MAAM;YAC3C,QAAQ,EAAE,eAAe,GAAG,QAAQ,CAAC,MAAM;SAC5C,CAAC;IACH,CAAC;CACD;AAED,MAAM,OAAgB,iDAA4E,SAAQ,6CAAwD;IAErJ;IADZ,YACY,MAAW,EACrB,CAAU,EACV,2BAAqC;QAEtC,KAAK,CAAC,CAAC,EAAE,2BAA2B,CAAC,CAAC;QAJ3B,WAAM,GAAN,MAAM,CAAK;IAKvB,CAAC;IAEM,OAAO,CAAC,IAAsB;QACpC,MAAM,OAAO,GAA+C,EAAE,CAAC;QAE/D,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;iBACpC,GAAG,CAAC,CAAC,KAAa,EAA4C,EAAE,CAAC,CAAC;gBACjE,KAAK,EAAE,KAAK;gBACZ,MAAM,EAAE,KAAK;aACd,CAAC,CAAC,CACJ,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC;CACD;AAED,MAAM,iBAAoC,SAAQ,iDAA8D;IASrG;IADV,YACU,oBAAmH,EAC3H,MAAW,EACX,CAAU,EACV,2BAAqC;QAEtC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,2BAA2B,CAAC,CAAC;QALrC,yBAAoB,GAApB,oBAAoB,CAA+F;IAM7H,CAAC;IAEkB,iBAAiB,CAAC,CAAW,EAAE,CAAW;QAC5D,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAE3E,IAAI,OAAO,GAAW,CAAC,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC;YAAG,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAErE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3B,CAAC;IAEkB,YAAY,CAAC,UAAsD;QACrF,OAAO,IAAI,CAAC,oBAAoB,CAAC,UAAU,CAAC,CAAC;IAC9C,CAAC;IAEe,gBAAgB,CAAC,MAA+B,EAAE,QAAW;QAC5E,IAAI,MAAM,CAAC,UAAU,KAAK,QAAQ;YAAE,OAAO,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;QACpD,OAAO,CAAE,CAAC,EAAE,CAAC,CAAE,CAAC;IACjB,CAAC;CACD;AAED,MAAM,OAAgB,uEAAuE;IAgBlF;IACA;IACA;IACA;IARF,UAAU,CAA6B;IAEvC,iBAAiB,CAAiC;IAE1D,YACU,MAAW,EACX,CAAU,EACV,iBAA0B,KAAK,EAC/B,8BAAuC,KAAK;QAH5C,WAAM,GAAN,MAAM,CAAK;QACX,MAAC,GAAD,CAAC,CAAS;QACV,mBAAc,GAAd,cAAc,CAAiB;QAC/B,gCAA2B,GAA3B,2BAA2B,CAAiB;IACnD,CAAC;IAMG,OAAO,CAAC,IAAsB;QACpC,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;IACxB,CAAC;IAEM,KAAK,CAAC,KAAK;QACjB,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QAE3E,MAAM,SAAS,GAAiD,EAAE,CAAC;QAEnE,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YACjC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;iBACjD,GAAG,CAAC,CAAC,KAAa,EAA8C,EAAE,CAAC,CAAC;gBACnE,KAAK,EAAE,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC;gBAClC,MAAM,EAAE,KAAK;aACd,CAAC,CAAC,CACJ,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,cAAc;YAAE,gCAAgC,CAAW,SAAS,CAAC,CAAC;QAE/E,IAAI,CAAC,iBAAiB,GAAG,IAAI,iBAAiB,CAC5C,CAAC,UAAsD,EAAqC,EAAE,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,EAC5H,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,CAAC,EACN,IAAI,CAAC,2BAA2B,CACjC,CAAC;QACF,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IACxC,CAAC;IAEM,KAAK,CAAC,KAAK;QACjB,IAAI,CAAC,IAAI,CAAC,iBAAiB;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAE7E,aAAa;QAEb,OAAO,SAAS,CAAC;IAClB,CAAC;IAEM,KAAK,CAAC,OAAO,CAAC,KAAa;QACjC,IAAI,CAAC,IAAI,CAAC,iBAAiB;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAE7E,MAAM,WAAW,GAAa,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAE1D,OAAO,IAAI,CAAC,iBAAiB,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;IACpD,CAAC;IAEM,KAAK,CAAC,IAAI,CAAC,QAAoD;QACrE,IAAI,CAAC,IAAI,CAAC,iBAAiB;YAAE,MAAM,IAAI,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAE7E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,oBAAoB,CAAC,CAAC;QAEjE,IAAI,eAAe,GAAW,CAAC,CAAC;QAChC,IAAI,eAAe,GAAW,CAAC,CAAC;QAChC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,UAAU,GAAsC,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAErF,IAAI,CAAC,UAAU,EAAE,CAAC;gBACjB,eAAe,EAAE,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACP,MAAM,CAAE,QAAQ,EAAE,QAAQ,CAAE,GAAuB,IAAI,CAAC,iBAAiB,CAAC,gBAAgB,CAAC,UAAU,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;gBAEpH,eAAe,IAAI,QAAQ,CAAC;gBAC5B,eAAe,IAAI,QAAQ,CAAC;YAC7B,CAAC;QACF,CAAC;QAED,OAAO;YACL,QAAQ,EAAE,eAAe,GAAG,QAAQ,CAAC,MAAM;YAC3C,QAAQ,EAAE,eAAe,GAAG,QAAQ,CAAC,MAAM;SAC5C,CAAC;IACH,CAAC;CACD"}

package/dist/classes/q-learning-transition-model.d.mts

@@ -0,0 +1,18 @@
+import { TPrimative } from 'tscommons-esm-core';
+export declare abstract class CommonsAlgorithmAiQLearningTransitionModel<StateT, ActionT> {
+    private alpha;
+    private epsilon;
+    private q;
+    constructor(alpha: number, epsilon?: number);
+    protected abstract stateActionToIndex(state: StateT, action: ActionT): TPrimative;
+    protected abstract listAvailableActions(state: StateT): ActionT[];
+    private getStateQ;
+    private listActionsAndRewards;
+    private bestFutureReward;
+    chooseAction(state: StateT): ActionT | undefined;
+    private updateQ;
+    update(oldState: StateT, action: ActionT, newState: StateT, reward: number): void;
+    reward(oldState: StateT, action: ActionT, newState: StateT, magnitude?: number): void;
+    punish(oldState: StateT, action: ActionT, newState: StateT, magnitude?: number): void;
+    touch(oldState: StateT, action: ActionT, newState: StateT): void;
+}

package/dist/classes/q-learning-transition-model.mjs

@@ -0,0 +1,71 @@
+export class CommonsAlgorithmAiQLearningTransitionModel {
+    alpha;
+    epsilon;
+    q;
+    constructor(alpha, epsilon = 0) {
+        this.alpha = alpha;
+        this.epsilon = epsilon;
+        this.q = new Map();
+    }
+    getStateQ(state, action) {
+        const index = this.stateActionToIndex(state, action);
+        const q = this.q.get(index);
+        if (q === undefined)
+            return 0;
+        return q;
+    }
+    listActionsAndRewards(state) {
+        const actions = this.listAvailableActions(state);
+        return actions
+            .map((action) => ({
+            action: action,
+            reward: this.getStateQ(state, action)
+        }));
+    }
+    bestFutureReward(state) {
+        const actionsAndRewards = this.listActionsAndRewards(state);
+        if (actionsAndRewards.length === 0)
+            return 0;
+        return Math.max(...actionsAndRewards
+            .map((ar) => ar.reward));
+    }
+    chooseAction(state) {
+        const actionsAndRewards = this.listActionsAndRewards(state);
+        if (actionsAndRewards.length === 0)
+            return undefined;
+        const maxReward = Math.max(...actionsAndRewards
+            .map((ar) => ar.reward));
+        const bestActions = actionsAndRewards
+            .filter((ar) => ar.reward === maxReward)
+            .map((ar) => ar.action);
+        if (bestActions.length === 0)
+            return undefined;
+        if (Math.random() < this.epsilon) {
+            return actionsAndRewards[Math.floor(actionsAndRewards.length * Math.random())].action;
+        }
+        return bestActions[Math.floor(bestActions.length * Math.random())];
+    }
+    updateQ(state, action, oldQ, reward, futureRewards) {
+        const index = this.stateActionToIndex(state, action);
+        this.q.set(index, oldQ + (this.alpha * ((reward + futureRewards) - oldQ)));
+    }
+    update(oldState, action, newState, reward) {
+        const oldQ = this.getStateQ(oldState, action);
+        const bestFutureReward = this.bestFutureReward(newState);
+        this.updateQ(oldState, action, oldQ, reward, bestFutureReward);
+    }
+    reward(oldState, action, newState, magnitude = 1) {
+        if (magnitude < 0)
+            throw new Error('Reward cannot be negative. Use update for a generic any-magnitude');
+        this.update(oldState, action, newState, magnitude);
+    }
+    punish(oldState, action, newState, magnitude = 1) {
+        if (magnitude < 0)
+            throw new Error('Punishment cannot be negative. Use update for a generic any-magnitude');
+        this.update(oldState, action, newState, -magnitude);
+    }
+    touch(oldState, action, newState) {
+        this.update(oldState, action, newState, 0);
+    }
+}
+//# sourceMappingURL=q-learning-transition-model.mjs.map

package/dist/classes/q-learning-transition-model.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"q-learning-transition-model.mjs","sourceRoot":"","sources":["../../src/classes/q-learning-transition-model.mts"],"names":[],"mappings":"AAOA,MAAM,OAAgB,0CAA0C;IAOrD;IACA;IAJF,CAAC,CAA0B;IAEnC,YACU,KAAa,EACb,UAAkB,CAAC;QADnB,UAAK,GAAL,KAAK,CAAQ;QACb,YAAO,GAAP,OAAO,CAAY;QAE5B,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,EAAsB,CAAC;IACxC,CAAC;IAKO,SAAS,CAAC,KAAa,EAAE,MAAe;QAC/C,MAAM,KAAK,GAAe,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEjE,MAAM,CAAC,GAAqB,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC9C,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,CAAC,CAAC;QAE9B,OAAO,CAAC,CAAC;IACV,CAAC;IAEO,qBAAqB,CAAC,KAAa;QAC1C,MAAM,OAAO,GAAc,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE5D,OAAO,OAAO;aACX,GAAG,CAAC,CAAC,MAAe,EAA6B,EAAE,CAAC,CAAC;YACpD,MAAM,EAAE,MAAM;YACd,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,MAAM,CAAC;SACtC,CAAC,CAAC,CAAC;IACP,CAAC;IAEO,gBAAgB,CAAC,KAAa;QACrC,MAAM,iBAAiB,GAAgC,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACzF,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAE7C,OAAO,IAAI,CAAC,GAAG,CACb,GAAG,iBAAiB;aACjB,GAAG,CAAC,CAAC,EAA6B,EAAU,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAC7D,CAAC;IACH,CAAC;IAEM,YAAY,CAAC,KAAa;QAChC,MAAM,iBAAiB,GAAgC,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QACzF,IAAI,iBAAiB,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAErD,MAAM,SAAS,GAAW,IAAI,CAAC,GAAG,CAChC,GAAG,iBAAiB;aACjB,GAAG,CAAC,CAAC,EAA6B,EAAU,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAC7D,CAAC;QAEF,MAAM,WAAW,GAAc,iBAAiB;aAC7C,MAAM,CAAC,CAAC,EAA6B,EAAW,EAAE,CAAC,EAAE,CAAC,MAAM,KAAK,SAAS,CAAC;aAC3E,GAAG,CAAC,CAAC,EAA6B,EAAW,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QAC9D,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAE/C,IAAI,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YAClC,OAAO,iBAAiB,CAAC,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QACvF,CAAC;QAED,OAAO,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IACpE,CAAC;IAEO,OAAO,CACb,KAAa,EACb,MAAe,EACf,IAAY,EACZ,MAAc,EACd,aAAqB;QAEtB,MAAM,KAAK,GAAe,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAEjE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC,MAAM,GAAG,aAAa,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5E,CAAC;IAEM,MAAM,CACX,QAAgB,EAChB,MAAe,EACf,QAAgB,EAChB,MAAc;QAEf,MAAM,IAAI,GAAW,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;QACtD,MAAM,gBAAgB,GAAW,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAEjE,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;IAChE,CAAC;IAEM,MAAM,CACX,QAAgB,EAChB,MAAe,EACf,QAAgB,EAChB,YAAoB,CAAC;QAEtB,IAAI,SAAS,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,mEAAmE,CAAC,CAAC;QAExG,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;IACpD,CAAC;IAEM,MAAM,CACX,QAAgB,EAChB,MAAe,EACf,QAAgB,EAChB,YAAoB,CAAC;QAEtB,IAAI,SAAS,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,uEAAuE,CAAC,CAAC;QAE5G,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,SAAS,CAAC,CAAC;IACrD,CAAC;IAEM,KAAK,CACV,QAAgB,EAChB,MAAe,EACf,QAAgB;QAEjB,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;IAC5C,CAAC;CACD"}

package/dist/helpers/nearest-neighbour.d.mts

@@ -0,0 +1,4 @@
+import { TCommonsAiPrediction } from 'tscommons-esm-ai';
+import { TCommonsAlgorithmAiOutputWithDistance } from '../classes/knearest-neighbour-classifier.mjs';
+export declare function commonsAlgorithmAiNearestNeighbourSimpleConsensus<E extends string>(values: E[], neighbours: TCommonsAlgorithmAiOutputWithDistance<E>[]): TCommonsAiPrediction<E> | undefined;
+export declare function commonsAlgorithmAiNearestNeighbourWeightedConsensus<E extends string>(values: E[], neighbours: TCommonsAlgorithmAiOutputWithDistance<E>[]): TCommonsAiPrediction<E> | undefined;

package/dist/helpers/nearest-neighbour.mjs

@@ -0,0 +1,32 @@
+import { CommonsTally, commonsNumberAverage } from 'tscommons-esm-core';
+function genericConsensus(values, neighbours, handle) {
+    if (neighbours.length === 0)
+        return undefined;
+    const tally = new CommonsTally(values);
+    for (const neighbour of neighbours) {
+        handle(tally, neighbour);
+    }
+    const best = tally.winner;
+    if (best === undefined)
+        return undefined;
+    const distance = commonsNumberAverage(neighbours
+        .filter((neighbour) => neighbour.output === best)
+        .map((neighbour) => neighbour.distance));
+    if (distance === undefined)
+        throw new Error('Unable to determine distance for consensus');
+    return {
+        prediction: best,
+        certainty: distance
+    };
+}
+export function commonsAlgorithmAiNearestNeighbourSimpleConsensus(values, neighbours) {
+    return genericConsensus(values, neighbours, (tally, neighbour) => {
+        tally.increment(neighbour.output);
+    });
+}
+export function commonsAlgorithmAiNearestNeighbourWeightedConsensus(values, neighbours) {
+    return genericConsensus(values, neighbours, (tally, neighbour) => {
+        tally.add(neighbour.output, -neighbour.distance); // negative so we give bias towards the closest
+    });
+}
+//# sourceMappingURL=nearest-neighbour.mjs.map

package/dist/helpers/nearest-neighbour.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"nearest-neighbour.mjs","sourceRoot":"","sources":["../../src/helpers/nearest-neighbour.mts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,oBAAoB,EAAE,MAAM,oBAAoB,CAAC;AAKxE,SAAS,gBAAgB,CACvB,MAAW,EACX,UAAsD,EACtD,MAGS;IAEV,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAE9C,MAAM,KAAK,GAAoB,IAAI,YAAY,CAAI,MAAM,CAAC,CAAC;IAC3D,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACpC,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC1B,CAAC;IAED,MAAM,IAAI,GAAgB,KAAK,CAAC,MAAM,CAAC;IACvC,IAAI,IAAI,KAAK,SAAS;QAAE,OAAO,SAAS,CAAC;IAEzC,MAAM,QAAQ,GAAqB,oBAAoB,CACrD,UAAU;SACP,MAAM,CAAC,CAAC,SAAmD,EAAW,EAAE,CAAC,SAAS,CAAC,MAAM,KAAK,IAAI,CAAC;SACnG,GAAG,CAAC,CAAC,SAAmD,EAAU,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAC5F,CAAC;IACF,IAAI,QAAQ,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAE1F,OAAO;QACL,UAAU,EAAE,IAAI;QAChB,SAAS,EAAE,QAAQ;KACpB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,iDAAiD,CAC/D,MAAW,EACX,UAAsD;IAEvD,OAAO,gBAAgB,CACrB,MAAM,EACN,UAAU,EACV,CACE,KAAsB,EACtB,SAAmD,EAC7C,EAAE;QACT,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC,CACF,CAAC;AACH,CAAC;AAED,MAAM,UAAU,mDAAmD,CACjE,MAAW,EACX,UAAsD;IAEvD,OAAO,gBAAgB,CACrB,MAAM,EACN,UAAU,EACV,CACE,KAAsB,EACtB,SAAmD,EAC7C,EAAE;QACT,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,+CAA+C;IAClG,CAAC,CACF,CAAC;AACH,CAAC"}

package/dist/helpers/normalise-input.d.mts

@@ -0,0 +1,2 @@
+import { TCommonsAiGenericTrainingData } from 'tscommons-esm-ai';
+export declare function commonsAlgorithmAiNormaliseInput<I extends number[]>(data: TCommonsAiGenericTrainingData<I, unknown>[]): void;

package/dist/helpers/normalise-input.mjs

@@ -0,0 +1,24 @@
+export function commonsAlgorithmAiNormaliseInput(data) {
+    if (data.length === 0)
+        return;
+    const inputLength = data[0].input.length;
+    const minMaxs = [];
+    for (let i = 0; i < inputLength; i++) {
+        const values = data
+            .map((value) => value.input[i]);
+        const min = Math.min(...values);
+        const max = Math.max(...values);
+        minMaxs.push({
+            min: min,
+            max: max,
+            delta: min === max ? 1 : (max - min)
+        });
+    }
+    for (const item of data) {
+        if (item.input.length !== inputLength)
+            throw new Error('Inconsistent input lengths');
+        for (let i = inputLength; i-- > 0;)
+            item.input[i] = (item.input[i] - minMaxs[i].min) / minMaxs[i].delta;
+    }
+}
+//# sourceMappingURL=normalise-input.mjs.map

package/dist/helpers/normalise-input.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalise-input.mjs","sourceRoot":"","sources":["../../src/helpers/normalise-input.mts"],"names":[],"mappings":"AAEA,MAAM,UAAU,gCAAgC,CAAqB,IAAiD;IACrH,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO;IAE9B,MAAM,WAAW,GAAW,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC;IAOjD,MAAM,OAAO,GAAc,EAAE,CAAC;IAE9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,MAAM,GAAa,IAAI;aAC1B,GAAG,CAAC,CAAC,KAAgD,EAAU,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAErF,MAAM,GAAG,GAAW,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QACxC,MAAM,GAAG,GAAW,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QACxC,OAAO,CAAC,IAAI,CAAC;YACX,GAAG,EAAE,GAAG;YACR,GAAG,EAAE,GAAG;YACR,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC;SACrC,CAAC,CAAC;IACJ,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,WAAW;YAAE,MAAM,IAAI,KAAK,CAAC,4BAA4B,CAAC,CAAC;QAErF,KAAK,IAAI,CAAC,GAAG,WAAW,EAAE,CAAC,EAAE,GAAG,CAAC;YAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACzG,CAAC;AACF,CAAC"}

package/dist/index.d.mts

@@ -0,0 +1,5 @@
+import { commonsAlgorithmAiNormaliseInput } from './helpers/normalise-input.mjs';
+import { commonsAlgorithmAiNearestNeighbourSimpleConsensus, commonsAlgorithmAiNearestNeighbourWeightedConsensus } from './helpers/nearest-neighbour.mjs';
+import { CommonsAlgorithmAiQLearningTransitionModel } from './classes/q-learning-transition-model.mjs';
+import { TCommonsAlgorithmAiOutputWithDistance, CommonsAlgorithmAiKNearestNeighbourClassifier, CommonsAlgorithmAiKNearestNeighbourEnumClassifier, CommonsAlgorithmAiKNearestNeighbourNormalisedNumericInputEnumClassifier } from './classes/knearest-neighbour-classifier.mjs';
+export { commonsAlgorithmAiNormaliseInput, commonsAlgorithmAiNearestNeighbourSimpleConsensus, commonsAlgorithmAiNearestNeighbourWeightedConsensus, CommonsAlgorithmAiQLearningTransitionModel, TCommonsAlgorithmAiOutputWithDistance, CommonsAlgorithmAiKNearestNeighbourClassifier, CommonsAlgorithmAiKNearestNeighbourEnumClassifier, CommonsAlgorithmAiKNearestNeighbourNormalisedNumericInputEnumClassifier };

package/dist/index.mjs

@@ -0,0 +1,6 @@
+import { commonsAlgorithmAiNormaliseInput } from './helpers/normalise-input.mjs';
+import { commonsAlgorithmAiNearestNeighbourSimpleConsensus, commonsAlgorithmAiNearestNeighbourWeightedConsensus } from './helpers/nearest-neighbour.mjs';
+import { CommonsAlgorithmAiQLearningTransitionModel } from './classes/q-learning-transition-model.mjs';
+import { CommonsAlgorithmAiKNearestNeighbourClassifier, CommonsAlgorithmAiKNearestNeighbourEnumClassifier, CommonsAlgorithmAiKNearestNeighbourNormalisedNumericInputEnumClassifier } from './classes/knearest-neighbour-classifier.mjs';
+export { commonsAlgorithmAiNormaliseInput, commonsAlgorithmAiNearestNeighbourSimpleConsensus, commonsAlgorithmAiNearestNeighbourWeightedConsensus, CommonsAlgorithmAiQLearningTransitionModel, CommonsAlgorithmAiKNearestNeighbourClassifier, CommonsAlgorithmAiKNearestNeighbourEnumClassifier, CommonsAlgorithmAiKNearestNeighbourNormalisedNumericInputEnumClassifier };
+//# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.mjs","sourceRoot":"","sources":["../src/index.mts"],"names":[],"mappings":"AAAA,OAAO,EAAE,gCAAgC,EAAE,MAAM,+BAA+B,CAAC;AACjF,OAAO,EAAE,iDAAiD,EAAE,mDAAmD,EAAE,MAAM,iCAAiC,CAAC;AACzJ,OAAO,EAAE,0CAA0C,EAAE,MAAM,2CAA2C,CAAC;AACvG,OAAO,EAEL,6CAA6C,EAC7C,iDAAiD,EACjD,uEAAuE,EACxE,MAAM,6CAA6C,CAAC;AACrD,OAAO,EACN,gCAAgC,EAChC,iDAAiD,EACjD,mDAAmD,EACnD,0CAA0C,EAE1C,6CAA6C,EAC7C,iDAAiD,EACjD,uEAAuE,EACvE,CAAC"}

package/package.json

@@ -0,0 +1,31 @@
+{
+	"name": "tscommons-esm-algorithms-ai",
+	"version": "0.0.2",
+	"description": "",
+	"scripts": {
+		"tsc": "./node_modules/typescript/bin/tsc",
+		"preprepare": "rm -rf ./dist; php ~/Dev/etim.php src/ && npm run tsc",
+		"publish-major": "rm -rf dist; npm run tsc && npx eslint . && npm run preprepare && npm version major && npm install && npm publish && git add . && git commit -m 'publish'",
+		"publish-minor": "rm -rf dist; npm run tsc && npx eslint . && npm run preprepare && npm version minor && npm install && npm publish && git add . && git commit -m 'publish'",
+		"publish-patch": "rm -rf dist; npm run tsc && npx eslint . && npm run preprepare && npm version patch && npm install && npm publish && git add . && git commit -m 'publish'"
+	},
+	"main": "dist/index.mjs",
+	"types": "dist/index.d.mjs",
+	"type": "module",
+	"author": "Pete Morris",
+	"license": "ISC",
+	"devDependencies": {
+		"@stylistic/eslint-plugin-ts": "^2.10.1",
+		"eslint-plugin-import": "^2.31.0",
+		"eslint-plugin-prefer-arrow-functions": "^3.4.1",
+		"typescript": "^5.6.3",
+		"typescript-eslint": "^8.14.0"
+	},
+	"files": [
+		"dist/**/*"
+	],
+	"dependencies": {
+		"tscommons-esm-ai": "^0.0.2",
+		"tscommons-esm-core": "^0.0.2"
+	}
+}