@_linked/core 0.0.1 → 1.0.0-next.20260216062729

package/src/collections/CoreMap.ts

@@ -1,127 +0,0 @@
-/*
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at https://mozilla.org/MPL/2.0/.
- */
-import {ICoreIterable} from '../interfaces/ICoreIterable.js';
-
-export class CoreMap<K, V> extends Map<K, V> implements ICoreIterable<V> {
-  createNew(...args): this {
-    return new (<any>this.constructor)(...args) as this;
-  }
-
-  /**
-   * Determines whether all the members of an array satisfy the specified test.
-   * @param callbackfn A function that accepts up to three arguments. The every method calls the callbackfn function for each element in array1 until the callbackfn returns false, or until the end of the array.
-   * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
-   */
-  every(
-    callbackfn: (value: V, key: K, map: CoreMap<K, V>) => boolean,
-    thisArg?: any,
-  ): boolean {
-    for (let [key, value] of this) {
-      if (!callbackfn.apply(thisArg, [value, key, this])) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  /**
-   * Determines whether the specified callback function returns true for any element of an array.
-   * @param callbackfn A function that accepts up to three arguments. The some method calls the callbackfn function for each element in array1 until the callbackfn returns true, or until the end of the array.
-   * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
-   */
-  some(
-    callbackfn: (value: V, key: K, map: CoreMap<K, V>) => boolean,
-    thisArg?: any,
-  ): boolean {
-    for (let [key, value] of this) {
-      if (callbackfn.apply(thisArg, [value, key, this])) {
-        return true;
-      }
-    }
-    return false;
-  }
-
-  /**
-   * Calls a defined callback function on each element of an array, and returns an array that contains the results.
-   * @param callbackfn A function that accepts up to three arguments. The map method calls the callbackfn function one time for each element in the array.
-   * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
-   */
-  map<U>(
-    callbackfn: (value: V, key: K, map: Map<K, V>) => U,
-    thisArg?: any,
-  ): this {
-    //create the result map, whos values will be 'mapped' into new values from the current values of this map
-    //var mappedMap = new (<any> this.constructor)() as CoreMap<K,U>;
-    var mappedMap = new (<any>this.constructor)(); // as CoreMap<K,U>;
-    for (let [key, value] of this) {
-      //do the mapping
-      mappedMap.set(key, callbackfn.apply(thisArg, [value, key, this]));
-    }
-    return mappedMap;
-  }
-
-  /**
-   * Returns the elements of an array that meet the condition specified in a callback function.
-   * @param callbackfn A function that accepts up to three arguments. The filter method calls the callbackfn function one time for each element in the array.
-   * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
-   */
-  filter(
-    callbackfn: (value: V, key: K, map: Map<K, V>) => any,
-    thisArg?: any,
-  ): this {
-    //create the result map, whos values will be 'mapped' into new values from the current values of this map
-    var filteredMap = new (<any>this.constructor)(); //this.createNew();//new Map<K,V>();
-    for (let [key, value] of this) {
-      //do the mapping
-      if (callbackfn.apply(thisArg, [value, key, this])) {
-        filteredMap.set(key, value);
-      }
-    }
-    return filteredMap;
-  }
-
-  first(): V | null {
-    return this.values().next().value;
-  }
-
-  /**
-   * Returns the value of the first element in the Set where predicate is true, and undefined
-   * otherwise.
-   */
-  find(
-    predicate: (value: V, index: K, obj: CoreMap<K, V>) => boolean,
-    thisArg?: any,
-  ): V | undefined {
-    for (let [key, value] of this) {
-      if (predicate.apply(thisArg, [value, key, this])) {
-        return value;
-      }
-    }
-    return undefined;
-  }
-
-  merge(...maps: CoreMap<K, V>[]) {
-    var res = this.createNew(this);
-    for (var map of maps) {
-      map.forEach((value, index) => {
-        res.set(index, value);
-      });
-    }
-    return res;
-  }
-
-  toString() {
-    let res = 'Map:\n';
-    for (let [key, value] of this) {
-      res += '\t[' + key.toString() + '] => ' + value.toString() + '\n';
-    }
-    return res;
-  }
-
-  print() {
-    console.log(this.toString());
-  }
-}

package/src/collections/CoreSet.ts

@@ -1,171 +0,0 @@
-/*
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at https://mozilla.org/MPL/2.0/.
- */
-import {ICoreIterable} from '../interfaces/ICoreIterable.js';
-
-export class CoreSet<R> extends Set<R> implements ICoreIterable<R> {
-  createNew(...args): this {
-    return new (<any>this.constructor)(...args) as this;
-  }
-
-  filter(fn: (value: R, index: any, thisInstance: any) => any): this {
-    var res: this = this.createNew();
-    for (var item of this) {
-      if (fn(item, item, this)) {
-        res.add(item);
-      }
-    }
-    return res;
-  }
-
-  reduce<U>(
-    fn: (
-      previousValue: U,
-      currentValue: R,
-      currentIndex: number,
-      thisInstance: any,
-    ) => U,
-    initialValue: U,
-  ): U {
-    let i = 0;
-    let res = initialValue;
-    for (let item of this) {
-      res = fn(res, item, i++, this);
-    }
-    return res;
-  }
-
-  /**
-   * Returns the value of the first element in the Set where predicate is true, and undefined
-   * otherwise.
-   */
-  find(
-    predicate: (value: R, index: R, obj: CoreSet<R>) => boolean,
-    thisArg?: any,
-  ): R | undefined {
-    for (let item of this) {
-      if (predicate.apply(thisArg, [item, item, this])) {
-        return item;
-      }
-    }
-    return undefined;
-  }
-
-  first(): R | undefined {
-    return this.values().next().value;
-  }
-
-  /**
-   * Returns the last element added to the set
-   */
-  last(): R {
-    //unfortunately there is no efficient way to do this. Either we convert the set to an array or we loop over all values to discover the last
-    let item;
-    for (item of this);
-    return item;
-  }
-
-  getFirst(n: number) {
-    return this.createNew([...this].slice(0, n));
-  }
-
-  slice(start?: number, end?: number) {
-    return this.createNew([...this].slice(start, end));
-  }
-
-  sort(compareFn?: (a: R, b: R) => number, thisArg?): this {
-    //convert this set to an array, sort it with provided parameters, create a new set of the same type and provide the sorted array as content
-    var sortedArray = thisArg
-      ? [...this].sort.apply(thisArg, [compareFn])
-      : [...this].sort(compareFn);
-    return this.createNew(sortedArray);
-  }
-
-  /**
-   * Determines whether all the members of an array satisfy the specified test.
-   * @param callbackfn A function that accepts up to three arguments. The every method calls the callbackfn function for each element in array1 until the callbackfn returns false, or until the end of the array.
-   * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
-   */
-  every(
-    callbackfn: (item: R, set: CoreSet<R>) => boolean,
-    thisArg?: any,
-  ): boolean {
-    for (let item of this) {
-      if (!callbackfn.apply(thisArg, [item, this])) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  /**
-   * Determines whether the specified callback function returns true for any element of an array.
-   * @param callbackfn A function that accepts up to three arguments. The some method calls the callbackfn function for each element in array1 until the callbackfn returns true, or until the end of the array.
-   * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
-   */
-  some(
-    callbackfn: (item: R, set: CoreSet<R>) => boolean,
-    thisArg?: any,
-  ): boolean {
-    for (let item of this) {
-      if (callbackfn.apply(thisArg, [item, this])) {
-        return true;
-      }
-    }
-    return false;
-  }
-
-  /**
-   * Calls a defined callback function on each element of the set, and returns an ARRAY that contains the results.
-   * Note that this method returns an array so that sets can be more easily used with for example JSX
-   * @param callbackfn A function that accepts up to three arguments. The map method calls the callbackfn function one time for each element in the array.
-   * @param thisArg An object to which the this keyword can refer in the callbackfn function. If thisArg is omitted, undefined is used as the this value.
-   */
-  map<U>(callbackfn: (item: R, set: CoreSet<R>) => U, thisArg?: any): U[] {
-    //NOTE: we changed this method so that it returns an array because it
-    // causes trouble in ES5 when we create a new CoreSet and try to add the mapped results which may not have a unique toString() implementation (like in React)
-
-    //create the result map, whos values will be 'mapped' into new values from the current values of this map
-    var mapped: U[] = [];
-    for (let item of this) {
-      //do the mapping
-      mapped.push(callbackfn.apply(thisArg, [item, this]));
-    }
-    return mapped;
-  }
-
-  concat(...sets: ICoreIterable<R>[]): this {
-    var res = this.createNew(this);
-    for (var set of sets) {
-      set.forEach(res.add.bind(res));
-    }
-    return res;
-  }
-
-  clone(): this {
-    return this.createNew(this);
-  }
-
-  reverse(): this {
-    return this.createNew([...this].reverse());
-  }
-
-  print() {
-    console.log(this.toString());
-  }
-
-  /**
-   * Similar to concat, but adds all items to THIS set instead of creating a new one
-   * @param sets
-   */
-  addFrom(...sets: ICoreIterable<R>[]): this {
-    for (var set of sets) {
-      if (set) {
-        set.forEach(this.add.bind(this));
-      }
-    }
-    return this;
-  }
-}

package/src/collections/ShapeSet.ts

@@ -1,18 +0,0 @@
-/*
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at https://mozilla.org/MPL/2.0/.
- */
-import {CoreSet} from './CoreSet.js';
-import {Shape} from '../shapes/Shape.js';
-import {getLeastSpecificShapeClasses} from '../utils/ShapeClass.js';
-
-export class ShapeSet<R extends Shape = Shape> extends CoreSet<R> {
-  constructor(iterable?: Iterable<R>) {
-    super(iterable);
-  }
-
-  getLeastSpecificShape() {
-    return getLeastSpecificShapeClasses(this).shift();
-  }
-}

package/src/index.ts

@@ -1,88 +0,0 @@
-/*
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at https://mozilla.org/MPL/2.0/.
- */
-import * as Package from './utils/Package.js';
-import * as LinkedErrorLogging from './utils/LinkedErrorLogging.js';
-import * as LinkedFileStorage from './utils/LinkedFileStorage.js';
-import * as LinkedStorage from './utils/LinkedStorage.js';
-import * as CoreSet from './collections/CoreSet.js';
-import * as CoreMap from './collections/CoreMap.js';
-import * as Shape from './shapes/Shape.js';
-import * as SHACLShapes from './shapes/SHACL.js';
-import * as ShapeSet from './collections/ShapeSet.js';
-import * as Prefix from './utils/Prefix.js';
-import * as URI from './utils/URI.js';
-import * as SelectQuery from './queries/SelectQuery.js';
-import * as UpdateQuery from './queries/UpdateQuery.js';
-import * as MutationQuery from './queries/MutationQuery.js';
-import * as DeleteQuery from './queries/DeleteQuery.js';
-import * as CreateQuery from './queries/CreateQuery.js';
-import * as QueryParser from './queries/QueryParser.js';
-import * as QueryFactory from './queries/QueryFactory.js';
-import * as NameSpace from './utils/NameSpace.js';
-import * as ShapeClass from './utils/ShapeClass.js';
-import * as cached from './utils/cached.js';
-import * as List from './shapes/List.js';
-import * as ICoreIterable from './interfaces/ICoreIterable.js';
-import * as IFileStore from './interfaces/IFileStore.js';
-import * as IQuadStore from './interfaces/IQuadStore.js';
-import * as rdf from './ontologies/rdf.js';
-import * as rdfs from './ontologies/rdfs.js';
-import * as xsd from './ontologies/xsd.js';
-import * as shacl from './ontologies/shacl.js';
-import * as lincd from './ontologies/lincd.js';
-import * as owl from './ontologies/owl.js';
-import * as npm from './ontologies/npm.js';
-import nextTick from 'next-tick';
-export {nextTick};
-
-export function initModularApp() {
-  let publicFiles = {
-    Package,
-    LinkedErrorLogging,
-    LinkedFileStorage,
-    LinkedStorage,
-    CoreSet,
-    CoreMap,
-    Shape,
-    ShapeSet,
-    Prefix,
-    NameSpace,
-    cached,
-    URI,
-    ShapeClass,
-    List,
-    ICoreIterable,
-    IFileStore,
-    IQuadStore,
-    SelectQuery,
-    UpdateQuery,
-    MutationQuery,
-    DeleteQuery,
-    CreateQuery,
-    QueryParser,
-    QueryFactory,
-    SHACLShapes,
-    rdf,
-    rdfs,
-    xsd,
-    shacl,
-    lincd,
-    owl,
-    npm,
-  };
-  var lincdExport = {};
-  for (let fileKey in publicFiles) {
-    let exportedClasses = publicFiles[fileKey];
-    for (let className in exportedClasses) {
-      lincdExport[className] = exportedClasses[className];
-    }
-  }
-  if (typeof window !== 'undefined') {
-    Object.assign(window['lincd'], lincdExport);
-  } else if (typeof global !== 'undefined') {
-    Object.assign(global['lincd'], lincdExport);
-  }
-}

package/src/interfaces/ICoreIterable.ts

@@ -1,35 +0,0 @@
-/*
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at https://mozilla.org/MPL/2.0/.
- */
-/**
- * Pretty open and general interface that closely resembles JS Arrays.
- * other classes like CoreMap and CoreSet can implement this so that we know which methods are available
- */
-//extending Iterable<ANY> because Maps and Sets use different iterator setups that would not match with type definitions
-//this allows us to still use iterators for ICoreIterable but without typing information, although for all methods below it works
-export interface ICoreIterable<V> extends Iterable<any> {
-  forEach: (
-    callbackFn: (item: V, index?: any, iterable?: any) => void,
-    context?: any,
-  ) => void;
-  size?: number;
-  length?: number;
-
-  filter(
-    callbackfn: (value: V, index: any, thisInstance: any) => any,
-    thisArg?: any,
-  ): Iterable<any>;
-
-  find(
-    predicate: (value: V, index: any, obj: ICoreIterable<V>) => boolean,
-    thisArg?: any,
-  ): V | undefined;
-
-  every(callbackfn: (item: V) => boolean, thisArg?: any): boolean;
-
-  some(callbackfn: (item: V) => boolean, thisArg?: any): boolean;
-
-  map<U>(callbackfn: (item: V) => U, thisArg?: any): any;
-}

package/src/interfaces/IFileStore.ts

@@ -1,28 +0,0 @@
-import type {Readable} from 'stream';
-
-export interface IFileStore {
-  /**
-   * The base URL to access the filestore's files. For example:
-   * - http://localhost:4000
-   * - https://s3.amazonaws.com/my-bucket
-   * - https://my-bucket.nyc3.digitaloceanspaces.com
-   */
-  readonly accessURL: string;
-
-  init?(): Promise<any>;
-
-  deleteFile(filePath: string): Promise<void>;
-
-  fileExists(filePath: string): Promise<boolean>;
-
-  getFile(filePath: string): Promise<Buffer | null>;
-
-  listFiles(prefix?: string): Promise<string[]>;
-
-  saveFile(
-    filePath: string,
-    fileContent: string | Uint8Array | Buffer | Readable,
-    mimeType?: string,
-    preventDuplicates?: boolean,
-  ): Promise<string | null>;
-}

package/src/interfaces/IQuadStore.ts

@@ -1,16 +0,0 @@
-import {CreateQuery} from '../queries/CreateQuery.js';
-import {DeleteQuery, DeleteResponse} from '../queries/DeleteQuery.js';
-import {SelectQuery} from '../queries/SelectQuery.js';
-import {UpdateQuery} from '../queries/UpdateQuery.js';
-
-export interface IQuadStore {
-  /**
-   * Prepares the store to be used.
-   */
-  init?(): Promise<any>;
-
-  selectQuery<ResultType>(query: SelectQuery<any>): Promise<ResultType>;
-  updateQuery?<RType>(q: UpdateQuery<RType>): Promise<RType>;
-  createQuery?<R>(q: CreateQuery<R>): Promise<R>;
-  deleteQuery?(query: DeleteQuery): Promise<DeleteResponse>;
-}

package/src/interfaces/IQueryParser.ts

@@ -1,51 +0,0 @@
-import {
-  GetQueryResponseType,
-  QueryResponseToResultType,
-  SelectQueryFactory,
-} from '../queries/SelectQuery.js';
-import {Shape} from '../shapes/Shape.js';
-import {
-  AddId,
-  NodeReferenceValue,
-  UpdatePartial,
-} from '../queries/QueryFactory.js';
-import {CreateResponse} from '../queries/CreateQuery.js';
-import {NodeId} from '../queries/MutationQuery.js';
-import {DeleteResponse} from '../queries/DeleteQuery.js';
-
-export interface IQueryParser {
-  selectQuery<
-    ShapeType extends Shape,
-    ResponseType,
-    Source,
-    ResultType = QueryResponseToResultType<
-      GetQueryResponseType<SelectQueryFactory<ShapeType, ResponseType>>,
-      ShapeType
-    >[],
-  >(
-    query: SelectQueryFactory<ShapeType, ResponseType, Source>,
-  ): Promise<ResultType>;
-
-  updateQuery<ShapeType extends Shape, U extends UpdatePartial<ShapeType>>(
-    id: string | NodeReferenceValue,
-    updateObjectOrFn: U,
-    shapeClass: typeof Shape,
-  ): Promise<AddId<U>>;
-
-  createQuery<ShapeType extends Shape, U extends UpdatePartial<ShapeType>>(
-    updateObjectOrFn: U,
-    shapeClass: typeof Shape,
-  ): Promise<CreateResponse<U>>;
-
-  deleteQuery(
-    id: NodeId | NodeId[] | NodeReferenceValue[],
-    shapeClass: typeof Shape,
-  ): Promise<DeleteResponse>;
-}
-
-/* class decorator */
-export function staticImplements<T>() {
-  return <U extends T>(constructor: U) => {
-    constructor;
-  };
-}

package/src/ontologies/lincd.ts

@@ -1,25 +0,0 @@
-import {NodeReferenceValue} from '../utils/NodeReference.js';
-import {createNameSpace} from '../utils/NameSpace.js';
-import {Prefix} from '../utils/Prefix.js';
-
-export const ns = createNameSpace('https://purl.org/on/lincd/');
-export const _self: NodeReferenceValue = ns('');
-Prefix.add('lincd', _self.id);
-
-const Module = ns('Module');
-const ShapeClass = ns('ShapeClass');
-const definesShape = ns('definesShape');
-const moduleProperty = ns('module');
-const usesShapeClass = ns('usesShapeClass');
-const editInline = ns('editInline');
-const isExtending = ns('isExtending');
-
-export const lincd = {
-  Module,
-  ShapeClass,
-  definesShape,
-  module: moduleProperty,
-  usesShapeClass,
-  editInline,
-  isExtending,
-};

package/src/ontologies/npm.ts

@@ -1,15 +0,0 @@
-import {NodeReferenceValue} from '../utils/NodeReference.js';
-import {createNameSpace} from '../utils/NameSpace.js';
-import {Prefix} from '../utils/Prefix.js';
-
-const base = 'http://purl.org/on/npm/';
-export const ns = createNameSpace(base);
-Prefix.add('npm', base);
-
-const packageName: NodeReferenceValue = ns('packageName');
-const version: NodeReferenceValue = ns('version');
-
-export const npm = {
-  version,
-  packageName,
-};

package/src/ontologies/owl.ts

@@ -1,26 +0,0 @@
-/*
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at https://mozilla.org/MPL/2.0/.
- */
-import {NodeReferenceValue} from '../utils/NodeReference.js';
-import {Prefix} from '../utils/Prefix.js';
-
-//Important note: the actual ontology node is WITHOUT HASH, because in the ontology itself, that is how the node is defined
-//(other than RDF and RDFS who DO define their URL INCLUDING HASH as ontologies)
-//so here we make sure of that, by adding the hash after creating the ontology node
-let base = 'http://www.w3.org/2002/07/owl';
-export const _ontologyResource: NodeReferenceValue = {id: base};
-base += '#';
-Prefix.add('owl', base);
-
-const ObjectProperty = {id: base + 'ObjectProperty'};
-const DataProperty = {id: base + 'DataProperty'};
-const equivalentClass = {id: base + 'equivalentClass'};
-
-export const owl = {
-  _ontologyResource,
-  ObjectProperty,
-  DataProperty,
-  equivalentClass,
-};

package/src/ontologies/rdf.ts

@@ -1,32 +0,0 @@
-/*
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at https://mozilla.org/MPL/2.0/.
- */
-import {NodeReferenceValue} from '../utils/NodeReference.js';
-import {Prefix} from '../utils/Prefix.js';
-
-const base = 'http://www.w3.org/1999/02/22-rdf-syntax-ns#';
-export const ns = (term: string): NodeReferenceValue => ({id: base + term});
-
-export const _ontologyResource = ns('');
-Prefix.add('rdf', base);
-
-const langString = ns('langString');
-const type = ns('type');
-const Property = ns('Property');
-const List = ns('List');
-const rest = ns('rest');
-const first = ns('first');
-const nil = ns('nil');
-
-export const rdf = {
-  _ontologyResource,
-  langString,
-  type,
-  Property,
-  List,
-  rest,
-  first,
-  nil,
-};

package/src/ontologies/rdfs.ts

@@ -1,38 +0,0 @@
-/*
- * This Source Code Form is subject to the terms of the Mozilla Public
- * License, v. 2.0. If a copy of the MPL was not distributed with this
- * file, You can obtain one at https://mozilla.org/MPL/2.0/.
- */
-import {NodeReferenceValue} from '../utils/NodeReference.js';
-import {Prefix} from '../utils/Prefix.js';
-
-const base = 'http://www.w3.org/2000/01/rdf-schema#';
-export const ns = (term: string): NodeReferenceValue => ({id: base + term});
-
-export const _ontologyResource = ns('');
-Prefix.add('rdfs', base);
-
-const subPropertyOf = ns('subPropertyOf');
-const subClassOf = ns('subClassOf');
-const range = ns('range');
-const isDefinedBy = ns('isDefinedBy');
-const label = ns('label');
-const comment = ns('comment');
-const Literal = ns('Literal');
-const Datatype = ns('Datatype');
-const Class = ns('Class');
-const Resource = ns('Resource');
-
-export const rdfs = {
-  _ontologyResource,
-  subPropertyOf,
-  subClassOf,
-  range,
-  isDefinedBy,
-  label,
-  comment,
-  Literal,
-  Datatype,
-  Class,
-  Resource,
-};