glossarist 0.4.42 → 0.4.43

package/src/rdf/{index.js → index.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Public RDF layer. Mirrors lib/glossarist/rdf/ in glossarist-ruby.
 export { PRED, PREFIXES, SKOSXL, WELL_KNOWN } from './prefixes.js';
 export {

package/src/rdf/{normalize-enum.js → normalize-enum.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Helpers for normalizing enumeration values that get interpolated into
 // URIs. Source data may contain compound forms ("preferred/admitted") or
 // path-like values that must be reduced to a single local name before

package/src/rdf/{prefixes.js → prefixes.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Re-export prefix map and predicate constants generated from the vendored
 // concept-model JSON-LD context. Downstream code should never duplicate
 // prefix bindings — always import from here.

package/src/rdf/{provenance-emitter.js → provenance-emitter.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Provenance emitter — emits prov:wasGeneratedBy + prov:Activity quads
 // for any resource that needs build/view-time provenance.
 //

package/src/rdf/{sections-builder.js → sections-builder.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Sections builder — transforms a Quad[] into the ClassInstance[]
 // shape consumed by Vue UI components (RdfInstanceSection,
 // RdfInstanceHeader, RdfSourcePanel).

package/src/rdf/{shacl-entry.js → shacl-entry.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Node-only SHACL validator entry. Separated from glossarist/rdf so that
 // browser bundles can import RDF emitters/writers without pulling in
 // node:fs/promises, node:path, node:url.

package/src/rdf/{shacl.js → shacl.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // SHACL validator wrapper. Loads vendored concept-model shapes once and
 // validates any RDFJS Dataset against them. Mirrors the mechanics of
 // glossarist-ruby's `Glossarist::Validation::ShaclValidator`.

package/src/rdf/{terms.js → terms.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Shared RDF/JS term constructors. Replaces the per-emitter
 // `const { namedNode, literal, quad } = DataFactory;` pattern that was
 // repeated across the RDF layer.

package/src/rdf/{version-emitter.js → version-emitter.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Version emitter — emits prov:Entity version chain per dataset.
 // Mirrors concept-browser's version-emitter.ts.
 //

package/src/rdf/{vocabulary-emitter.js → vocabulary-emitter.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Vocabulary graph emitter — emits SKOS ConceptSchemes for the
 // enumeration IRIs that glossarist emits in instance data
 // (gloss:status/*, gloss:entstatus/*, gloss:norm/*, gloss:srcstatus/*,

package/src/rdf/{write-turtle-sync.js → write-turtle-sync.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Sync Turtle writer — produces Turtle from RDF/JS Quads without
 // n3's callback API. Designed for UI use cases (Vue computed, React
 // render) that need synchronous output.

package/src/{reference-mention.js → reference-mention.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 /**
  * Mention parser for {{...}} inline references in concept text.
  *

package/src/{reference-resolver.js → reference-resolver.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { ConceptRef } from './models/concept-ref.js';
 import { parseMention } from './reference-mention.js';
 

package/src/{render-classification.js → render-classification.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { resolveBibliographyRecord, findNonVerbalEntity } from './reference-resolver.js';
 
 export class ReferenceClassifier {

package/src/{sort.js → sort.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 const NATURAL_SORT_RE = /(\d+|\D+)/g;
 const DIGIT_RE = /^\d+$/;
 

package/src/transforms/{concept-to-gloss.transform.js → concept-to-gloss.transform.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // ConceptToGlossTransform — JS port of glossarist-ruby's
 // `Transforms::ConceptToGlossTransform`. Converts a Concept model into
 // ontology-faithful RDF (Turtle, JSON-LD, N-Triples).

package/src/transforms/index.ts

@@ -0,0 +1,2 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
+export { ConceptToGlossTransform } from './concept-to-gloss.transform.js';

package/src/{uuid.js → uuid.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { createHash } from 'crypto';
 
 const NAMESPACE_UUID = '6ba7b810-9dad-11d1-80b4-00c04fd430c8';

package/src/{v1-reader.js → v1-reader.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import fs from 'fs';
 import path from 'path';
 import * as yaml from 'js-yaml';

package/src/validators/{asset-index.js → asset-index.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { DATASET_ASSETS } from '../dataset-asset.js';
 
 export class AssetIndex {

package/src/validators/{binary-has-part-redundancy-rule.js → binary-has-part-redundancy-rule.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Warns when binary `has_part` / `is_part_of` edges duplicate
 // PartitiveHyperedge members, or when a concept has many binary
 // has_part edges that should be consolidated into a PartitiveHyperedge.

package/src/validators/{concept-validator.js → concept-validator.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { ValidationRule } from './validation-rule.js';
 import { ValidationResult } from './validation-result.js';
 

package/src/validators/{delimiting-coherence-rule.js → delimiting-coherence-rule.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Validates delimiting coherence across a concept's PartitiveRelations
 // per ISO 704:2022.
 //

package/src/validators/{external-concept-shape-rule.js → external-concept-shape-rule.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Validates ExternalConcept shape (status: external).
 //
 // Per TODO.partitive-relation-v2 item 06, an ExternalConcept is a

package/src/validators/{gcr-validator.js → gcr-validator.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import * as yaml from 'js-yaml';
 import { DATASET_ASSETS } from '../dataset-asset.js';
 import { ValidationResult } from './validation-result.js';

package/src/validators/{hyperedge-coherence-rule.js → hyperedge-coherence-rule.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Validates hyperedge coherence per ISO 704 / ISO 12620.
 //
 // Applies to every AbstractHyperedge subclass (PartitiveHyperedge,

package/src/validators/{index.js → index.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 export { ValidationError } from './validation-error.js';
 export { ValidationRule } from './validation-rule.js';
 export { ValidationResult } from './validation-result.js';

package/src/validators/{partitive-relation-coherence-rule.js → partitive-relation-coherence-rule.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Deprecated. This rule has been generalized and renamed to
 // HyperedgeCoherenceRule (see ./hyperedge-coherence-rule.js). The
 // new rule is type-blind — it validates every AbstractHyperedge

package/src/validators/{ref-keys.js → ref-keys.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Shared identity-key helpers for cross-relation validators.
 //
 // Extracted from HyperedgeCoherenceRule and

package/src/validators/{register-validator.js → register-validator.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { ValidationResult } from './validation-result.js';
 
 export class RegisterValidator {

package/src/validators/{relationship-type-rule.js → relationship-type-rule.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { ValidationRule } from './validation-rule.js';
 import { RELATIONSHIP_TYPES } from '../models/related-concept.js';
 import { DESIGNATION_RELATIONSHIP_TYPES } from '../models/designation-relationship.js';

package/src/validators/{sourced-from-locality-rule.js → sourced-from-locality-rule.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 // Validates that every ConceptSource#sourced_from Citation includes a
 // locality. Per concept-model commit 9c065df ("sourced_from citations
 // must include locality"), a sourced_from entry without a locality is

package/src/validators/{v3-rules.js → v3-rules.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { ValidationRule } from './validation-rule.js';
 import { parseMention } from '../reference-mention.js';
 import { GraphicalSymbol } from '../models/designation.js';

package/src/validators/{validation-error.js → validation-error.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 export class ValidationError {
   constructor(path, message, severity = 'error') {
     this.path = path;

package/src/validators/{validation-result.js → validation-result.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 import { ValidationError } from './validation-error.js';
 
 export class ValidationResult {

package/src/validators/{validation-rule.js → validation-rule.ts}

@@ -1,3 +1,4 @@
+// @ts-nocheck — TEMPORARY during TS migration. TODO(Phase 2e): remove and type fully.
 export class ValidationRule {
   constructor(name, severity = 'error') {
     this.name = name;

package/src/diff/change.js

@@ -1,139 +0,0 @@
-import { GlossaristModel } from '../models/base.js';
-import { TextDiff } from './text-diff.js';
-
-export const CHANGE_ADDED = 'added';
-export const CHANGE_REMOVED = 'removed';
-export const CHANGE_CHANGED = 'changed';
-export const CHANGE_MATCHED = 'matched';
-
-function serializeValue(v) {
-  if (v == null) return null;
-  if (v instanceof GlossaristModel) return v.toJSON();
-  if (Array.isArray(v)) return v.map(serializeValue);
-  if (typeof v === 'object') {
-    const out = {};
-    for (const [k, val] of Object.entries(v)) out[k] = serializeValue(val);
-    return out;
-  }
-  return v;
-}
-
-export class Change extends GlossaristModel {
-  constructor(data = {}) {
-    super();
-    this.path = data.path ?? null;
-  }
-
-  get type() {
-    throw new Error(`${this.constructor.name} must override type getter`);
-  }
-
-  static fromJSON(data) {
-    return deserializeChange(data);
-  }
-}
-
-export class Added extends Change {
-  constructor(data = {}) {
-    super(data);
-    this.value = data.value ?? null;
-  }
-
-  get type() { return CHANGE_ADDED; }
-
-  toJSON() {
-    const obj = { type: CHANGE_ADDED };
-    if (this.path != null) obj.path = this.path;
-    obj.value = serializeValue(this.value);
-    return obj;
-  }
-
-  static fromJSON(data) {
-    return new Added(data);
-  }
-}
-
-export class Removed extends Change {
-  constructor(data = {}) {
-    super(data);
-    this.value = data.value ?? null;
-  }
-
-  get type() { return CHANGE_REMOVED; }
-
-  toJSON() {
-    const obj = { type: CHANGE_REMOVED };
-    if (this.path != null) obj.path = this.path;
-    obj.value = serializeValue(this.value);
-    return obj;
-  }
-
-  static fromJSON(data) {
-    return new Removed(data);
-  }
-}
-
-export class Changed extends Change {
-  constructor(data = {}) {
-    super(data);
-    this.oldValue = data.oldValue ?? data.old_value ?? null;
-    this.newValue = data.newValue ?? data.new_value ?? null;
-    this._textDiff = data.textDiff ?? (data.text_diff ? TextDiff.fromJSON(data.text_diff) : null);
-  }
-
-  get type() { return CHANGE_CHANGED; }
-
-  get textDiff() {
-    return this._textDiff;
-  }
-
-  toJSON() {
-    const obj = { type: CHANGE_CHANGED };
-    if (this.path != null) obj.path = this.path;
-    obj.old_value = serializeValue(this.oldValue);
-    obj.new_value = serializeValue(this.newValue);
-    if (this._textDiff) obj.text_diff = this._textDiff.toJSON();
-    return obj;
-  }
-
-  static fromJSON(data) {
-    return new Changed(data);
-  }
-}
-
-// Matched is for set-membership records that exist in both sides of a
-// comparison but have no directionality — used by ConceptCollectionDiff
-// to track which concepts were paired by id, distinct from those that
-// were genuinely Added or Removed. Distinct from Added because the data
-// has a different semantic meaning; conflating them caused type drift
-// in round 1 (TODO.hyperedges-v2/08).
-export class Matched extends Change {
-  constructor(data = {}) {
-    super(data);
-    this.value = data.value ?? null;
-  }
-
-  get type() { return CHANGE_MATCHED; }
-
-  toJSON() {
-    const obj = { type: CHANGE_MATCHED };
-    if (this.path != null) obj.path = this.path;
-    obj.value = serializeValue(this.value);
-    return obj;
-  }
-
-  static fromJSON(data) {
-    return new Matched(data);
-  }
-}
-
-export function deserializeChange(data) {
-  switch (data?.type) {
-    case CHANGE_ADDED: return Added.fromJSON(data);
-    case CHANGE_REMOVED: return Removed.fromJSON(data);
-    case CHANGE_CHANGED: return Changed.fromJSON(data);
-    case CHANGE_MATCHED: return Matched.fromJSON(data);
-    default:
-      throw new Error(`Unknown change type: ${data?.type}`);
-  }
-}

package/src/diff/list-diff.js

@@ -1,227 +0,0 @@
-import { GlossaristModel } from '../models/base.js';
-import { Added, Removed, Changed, deserializeChange } from './change.js';
-import { diffText } from './text-diff.js';
-
-export class ListDiff extends GlossaristModel {
-  constructor(data = {}) {
-    super();
-    this._added = (data.added ?? []).map(c => c instanceof Added ? c : Added.fromJSON(c));
-    this._removed = (data.removed ?? []).map(c => c instanceof Removed ? c : Removed.fromJSON(c));
-    this._changed = (data.changed ?? []).map(c => {
-      if (c instanceof Changed) return c;
-      return deserializeChange(c);
-    });
-  }
-
-  get added() { return this._added; }
-  get removed() { return this._removed; }
-  get changed() { return this._changed; }
-
-  get hasChanges() {
-    return this._added.length > 0 || this._removed.length > 0 || this._changed.length > 0;
-  }
-
-  get count() {
-    return this._added.length + this._removed.length + this._changed.length;
-  }
-
-  *entries() {
-    yield* this._added;
-    yield* this._removed;
-    yield* this._changed;
-  }
-
-  toJSON() {
-    return {
-      added: this._added.map(c => c.toJSON()),
-      removed: this._removed.map(c => c.toJSON()),
-      changed: this._changed.map(c => c.toJSON()),
-    };
-  }
-
-  static fromJSON(data) {
-    return new ListDiff(data);
-  }
-}
-
-/**
- * Diff two ordered lists using LCS alignment.
- *
- * - Items present in both (by identityKey) at the same relative position
- *   are "unchanged" and omitted from the result.
- * - Items only in the old list are "removed".
- * - Items only in the new list are "added".
- * - When an adjacent removed+added pair is detected at the same edit
- *   position, they are merged into a single "changed" entry. If both
- *   items expose text via textKey, a word-level TextDiff is attached.
- *
- * @param {Array} oldList
- * @param {Array} newList
- * @param {Object} [options]
- * @param {(item: any) => string} [options.identityKey] - equality key for matching items across lists
- * @param {(item: any) => string|null} [options.textKey] - extracts text content for word-level diff on changed items
- * @returns {ListDiff}
- */
-export function diffList(oldList = [], newList = [], options = {}) {
-  const identityKey = options.identityKey ?? defaultIdentityKey;
-  const textKey = options.textKey ?? null;
-
-  const oldArr = [...oldList];
-  const newArr = [...newList];
-
-  const oldKeys = oldArr.map(identityKey);
-  const newKeys = newArr.map(identityKey);
-
-  const dp = lcsTable(oldKeys, newKeys);
-  const ops = backtrackOps(dp, oldKeys, newKeys);
-
-  const added = [];
-  const removed = [];
-  const changed = [];
-
-  for (let k = 0; k < ops.length; k++) {
-    const op = ops[k];
-    if (op.type === 'equal') continue;
-
-    if (op.type === 'remove' && k + 1 < ops.length && ops[k + 1].type === 'add') {
-      const next = ops[k + 1];
-      const oldItem = oldArr[op.i];
-      const newItem = newArr[next.j];
-      changed.push(buildChanged(oldItem, newItem, textKey));
-      k++;
-    } else if (op.type === 'add' && k + 1 < ops.length && ops[k + 1].type === 'remove') {
-      const next = ops[k + 1];
-      const oldItem = oldArr[next.i];
-      const newItem = newArr[op.j];
-      changed.push(buildChanged(oldItem, newItem, textKey));
-      k++;
-    } else if (op.type === 'remove') {
-      removed.push(new Removed({ value: oldArr[op.i] }));
-    } else if (op.type === 'add') {
-      added.push(new Added({ value: newArr[op.j] }));
-    }
-  }
-
-  return new ListDiff({ added, removed, changed });
-}
-
-/**
- * Diff two unordered collections by identity key (set-based).
- *
- * - Items matched by identityKey in both lists are compared for full
- *   equality; if they differ → "changed".
- * - Items only in the old list are "removed".
- * - Items only in the new list are "added".
- *
- * Use this for collections where order does not carry meaning (e.g.
- * designations matched by term text, sources matched by ref, dates
- * matched by type).
- *
- * @param {Array} oldList
- * @param {Array} newList
- * @param {Object} options
- * @param {(item: any) => string} options.identityKey - key that identifies the same item across lists
- * @param {(item: any) => string|null} [options.textKey] - extracts text for word-level diff on changed items
- * @returns {ListDiff}
- */
-export function diffSet(oldList = [], newList = [], options = {}) {
-  const identityKey = options.identityKey ?? defaultIdentityKey;
-  const textKey = options.textKey ?? null;
-
-  const oldMap = new Map();
-  for (const item of oldList) {
-    oldMap.set(identityKey(item), item);
-  }
-
-  const seenKeys = new Set();
-  const added = [];
-  const changed = [];
-
-  for (const item of newList) {
-    const key = identityKey(item);
-    seenKeys.add(key);
-    if (oldMap.has(key)) {
-      const oldItem = oldMap.get(key);
-      if (!itemsEqual(oldItem, item)) {
-        changed.push(buildChanged(oldItem, item, textKey));
-      }
-    } else {
-      added.push(new Added({ value: item }));
-    }
-  }
-
-  const removed = [];
-  for (const item of oldList) {
-    if (!seenKeys.has(identityKey(item))) {
-      removed.push(new Removed({ value: item }));
-    }
-  }
-
-  return new ListDiff({ added, removed, changed });
-}
-
-function buildChanged(oldItem, newItem, textKey) {
-  const opts = { oldValue: oldItem, newValue: newItem };
-  if (textKey) {
-    const oldText = textKey(oldItem);
-    const newText = textKey(newItem);
-    if (oldText != null || newText != null) {
-      opts.textDiff = diffText(oldText ?? '', newText ?? '');
-    }
-  }
-  return new Changed(opts);
-}
-
-function itemsEqual(a, b) {
-  if (a === b) return true;
-  if (a instanceof GlossaristModel && b instanceof GlossaristModel) {
-    return a.equals(b);
-  }
-  return JSON.stringify(a) === JSON.stringify(b);
-}
-
-function defaultIdentityKey(item) {
-  if (item == null) return '';
-  if (typeof item === 'string') return item;
-  if (typeof item === 'number') return String(item);
-  if (item instanceof GlossaristModel) {
-    return JSON.stringify(item.toJSON());
-  }
-  return JSON.stringify(item);
-}
-
-function lcsTable(aKeys, bKeys) {
-  const m = aKeys.length;
-  const n = bKeys.length;
-  const dp = Array.from({ length: m + 1 }, () => new Uint32Array(n + 1));
-  for (let i = 1; i <= m; i++) {
-    for (let j = 1; j <= n; j++) {
-      dp[i][j] = aKeys[i - 1] === bKeys[j - 1]
-        ? dp[i - 1][j - 1] + 1
-        : Math.max(dp[i - 1][j], dp[i][j - 1]);
-    }
-  }
-  return dp;
-}
-
-function backtrackOps(dp, aKeys, bKeys) {
-  const ops = [];
-  let i = aKeys.length;
-  let j = bKeys.length;
-  while (i > 0 && j > 0) {
-    if (aKeys[i - 1] === bKeys[j - 1]) {
-      ops.push({ type: 'equal', i: i - 1, j: j - 1 });
-      i--; j--;
-    } else if (dp[i - 1][j] >= dp[i][j - 1]) {
-      ops.push({ type: 'remove', i: i - 1, j });
-      i--;
-    } else {
-      ops.push({ type: 'add', i, j: j - 1 });
-      j--;
-    }
-  }
-  while (i > 0) { ops.push({ type: 'remove', i: i - 1, j }); i--; }
-  while (j > 0) { ops.push({ type: 'add', i, j: j - 1 }); j--; }
-  ops.reverse();
-  return ops;
-}

package/src/transforms/index.js

@@ -1 +0,0 @@
-export { ConceptToGlossTransform } from './concept-to-gloss.transform.js';