@campfire-interactive/master-data-client 5.17.0 → 5.19.0

package/dist/attributeDefinitions.d.ts

@@ -1,5 +1,5 @@
 import { HttpTransport } from './http';
-import type { AttributeDefinition, CreateAttributeDefinitionInput, UpdateAttributeDefinitionInput, ListAttributeDefinitionsOptions, SingleResponse, ListResponse, CreateResponse, BulkArchiveResult } from './types';
+import type { AttributeDefinition, CreateAttributeDefinitionInput, UpdateAttributeDefinitionInput, ListAttributeDefinitionsOptions, SingleResponse, ListResponse, CreateResponse, BulkArchiveResult, AttributeValuesTemplate, AttributeDefinitionImportReport } from './types';
 export declare class AttributeDefinitionResource {
     private readonly http;
     private readonly basePath;
@@ -25,6 +25,17 @@ export declare class AttributeDefinitionResource {
     archive(id: string): Promise<void>;
     restore(id: string): Promise<void>;
     batchArchive(ids: string[]): Promise<SingleResponse<BulkArchiveResult>>;
+    /** The workbook for uploading definitions: an Attributes sheet (one row per
+     *  definition, any entity type) and a Values sheet (one row per value of a
+     *  select attribute). Platform owner. */
+    template(): Promise<SingleResponse<AttributeValuesTemplate>>;
+    /** Check a filled-in definitions workbook (base64), or with `commit: true`
+     *  create what it describes. A commit writes nothing unless every row
+     *  passes; it creates, never edits — a key that already exists is an error.
+     *  Platform owner. */
+    importFile(fileContent: string, options?: {
+        commit?: boolean;
+    }): Promise<SingleResponse<AttributeDefinitionImportReport>>;
     /** Switch one STANDARD attribute (a default definition) on or off for the
      *  calling tenant. Tenant owner/admin. Not available on
      *  `defaultAttributes.definitions`, where it has no meaning. */

package/dist/attributeDefinitions.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"attributeDefinitions.d.ts","sourceRoot":"","sources":["../src/attributeDefinitions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,KAAK,EACV,mBAAmB,EACnB,8BAA8B,EAC9B,8BAA8B,EAC9B,+BAA+B,EAC/B,cAAc,EACd,YAAY,EACZ,cAAc,EACd,iBAAiB,EAClB,MAAM,SAAS,CAAC;AAQjB,qBAAa,2BAA2B;IAIpC,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAJ3B;4FACwF;gBAErE,IAAI,EAAE,aAAa,EACnB,QAAQ,GAAE,MAAoC;IAG3D,IAAI,CAAC,OAAO,EAAE,+BAA+B,GAAG,OAAO,CAAC,YAAY,CAAC,mBAAmB,CAAC,CAAC;IAuBhG;;;;;;;0CAOsC;IAChC,GAAG,CACP,EAAE,EAAE,MAAM,EACV,OAAO,GAAE;QAAE,cAAc,CAAC,EAAE,OAAO,CAAC;QAAC,eAAe,CAAC,EAAE,OAAO,CAAA;KAAO,GACpE,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IAczC,MAAM,CACV,KAAK,EAAE,8BAA8B,EACrC,cAAc,CAAC,EAAE,MAAM,GACtB,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IASzC,MAAM,CACV,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,8BAA8B,EACrC,cAAc,CAAC,EAAE,MAAM,GACtB,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IAS/C,mFAAmF;IAC7E,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAOlC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAOlC,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC;IAQ7E;;oEAEgE;IAC1D,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IAQ5F;;uCAEmC;IAC7B,WAAW,CACf,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE;QAAE,OAAO,CAAC,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GACrD,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;CAOhD"}
+{"version":3,"file":"attributeDefinitions.d.ts","sourceRoot":"","sources":["../src/attributeDefinitions.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AACvC,OAAO,KAAK,EACV,mBAAmB,EACnB,8BAA8B,EAC9B,8BAA8B,EAC9B,+BAA+B,EAC/B,cAAc,EACd,YAAY,EACZ,cAAc,EACd,iBAAiB,EACjB,uBAAuB,EACvB,+BAA+B,EAChC,MAAM,SAAS,CAAC;AAQjB,qBAAa,2BAA2B;IAIpC,OAAO,CAAC,QAAQ,CAAC,IAAI;IACrB,OAAO,CAAC,QAAQ,CAAC,QAAQ;IAJ3B;4FACwF;gBAErE,IAAI,EAAE,aAAa,EACnB,QAAQ,GAAE,MAAoC;IAG3D,IAAI,CAAC,OAAO,EAAE,+BAA+B,GAAG,OAAO,CAAC,YAAY,CAAC,mBAAmB,CAAC,CAAC;IAuBhG;;;;;;;0CAOsC;IAChC,GAAG,CACP,EAAE,EAAE,MAAM,EACV,OAAO,GAAE;QAAE,cAAc,CAAC,EAAE,OAAO,CAAC;QAAC,eAAe,CAAC,EAAE,OAAO,CAAA;KAAO,GACpE,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IAczC,MAAM,CACV,KAAK,EAAE,8BAA8B,EACrC,cAAc,CAAC,EAAE,MAAM,GACtB,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IASzC,MAAM,CACV,EAAE,EAAE,MAAM,EACV,KAAK,EAAE,8BAA8B,EACrC,cAAc,CAAC,EAAE,MAAM,GACtB,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IAS/C,mFAAmF;IAC7E,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAOlC,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAOlC,YAAY,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,OAAO,CAAC,cAAc,CAAC,iBAAiB,CAAC,CAAC;IAQ7E;;6CAEyC;IACnC,QAAQ,IAAI,OAAO,CAAC,cAAc,CAAC,uBAAuB,CAAC,CAAC;IAOlE;;;0BAGsB;IAChB,UAAU,CACd,WAAW,EAAE,MAAM,EACnB,OAAO,GAAE;QAAE,MAAM,CAAC,EAAE,OAAO,CAAA;KAAO,GACjC,OAAO,CAAC,cAAc,CAAC,+BAA+B,CAAC,CAAC;IAQ3D;;oEAEgE;IAC1D,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;IAQ5F;;uCAEmC;IAC7B,WAAW,CACf,EAAE,EAAE,MAAM,EACV,QAAQ,EAAE;QAAE,OAAO,CAAC,EAAE,OAAO,CAAC;QAAC,KAAK,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;KAAE,GACrD,OAAO,CAAC,cAAc,CAAC,mBAAmB,CAAC,CAAC;CAOhD"}

package/dist/attributeDefinitions.js

@@ -95,6 +95,26 @@ class AttributeDefinitionResource {
             body: { ids },
         });
     }
+    /** The workbook for uploading definitions: an Attributes sheet (one row per
+     *  definition, any entity type) and a Values sheet (one row per value of a
+     *  select attribute). Platform owner. */
+    async template() {
+        return this.http.request({
+            method: 'GET',
+            path: `${this.basePath}/template`,
+        });
+    }
+    /** Check a filled-in definitions workbook (base64), or with `commit: true`
+     *  create what it describes. A commit writes nothing unless every row
+     *  passes; it creates, never edits — a key that already exists is an error.
+     *  Platform owner. */
+    async importFile(fileContent, options = {}) {
+        return this.http.request({
+            method: 'POST',
+            path: `${this.basePath}/import`,
+            body: { fileContent, commit: options.commit === true },
+        });
+    }
     /** Switch one STANDARD attribute (a default definition) on or off for the
      *  calling tenant. Tenant owner/admin. Not available on
      *  `defaultAttributes.definitions`, where it has no meaning. */

package/dist/attributeDefinitions.js.map

@@ -1 +1 @@
-{"version":3,"file":"attributeDefinitions.js","sourceRoot":"","sources":["../src/attributeDefinitions.ts"],"names":[],"mappings":";;;AAYA,8DAA8D;AAC9D,gFAAgF;AAChF,gFAAgF;AAChF,kFAAkF;AAClF,8EAA8E;AAC9E,4CAA4C;AAC5C,MAAa,2BAA2B;IAInB;IACA;IAJnB;4FACwF;IACxF,YACmB,IAAmB,EACnB,WAAmB,2BAA2B;QAD9C,SAAI,GAAJ,IAAI,CAAe;QACnB,aAAQ,GAAR,QAAQ,CAAsC;IAC9D,CAAC;IAEJ,KAAK,CAAC,IAAI,CAAC,OAAwC;QACjD,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAoC;YAC1D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,KAAK,EAAE;gBACL,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;gBACnD,OAAO,EAAE,OAAO,CAAC,OAAO;gBACxB,qEAAqE;gBACrE,kEAAkE;gBAClE,uDAAuD;gBACvD,eAAe,EAAE,OAAO,CAAC,eAAe,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;gBACxE,oEAAoE;gBACpE,uEAAuE;gBACvE,wEAAwE;gBACxE,2DAA2D;gBAC3D,cAAc,EAAE,OAAO,CAAC,cAAc,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;gBACtE,gEAAgE;gBAChE,eAAe,EAAE,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;aAC9D;SACF,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;0CAOsC;IACtC,KAAK,CAAC,GAAG,CACP,EAAU,EACV,UAAmE,EAAE;QAErE,mEAAmE;QACnE,MAAM,MAAM,GAAG;YACb,GAAG,CAAC,OAAO,CAAC,cAAc,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxE,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAChE,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QAClE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE;YAClD,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5B,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,MAAM,CACV,KAAqC,EACrC,cAAuB;QAEvB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,MAAM;YACd,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,IAAI,EAAE,KAAK;YACX,cAAc;SACf,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,MAAM,CACV,EAAU,EACV,KAAqC,EACrC,cAAuB;QAEvB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE;YAClD,IAAI,EAAE,KAAK;YACX,cAAc;SACf,CAAC,CAAC;IACL,CAAC;IAED,mFAAmF;IACnF,KAAK,CAAC,OAAO,CAAC,EAAU;QACtB,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAY;YACjC,MAAM,EAAE,QAAQ;YAChB,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE;SACnD,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,EAAU;QACtB,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAY;YACjC,MAAM,EAAE,MAAM;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,UAAU;SAC3D,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,GAAa;QAC9B,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAoC;YAC1D,MAAM,EAAE,MAAM;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,gBAAgB;YACtC,IAAI,EAAE,EAAE,GAAG,EAAE;SACd,CAAC,CAAC;IACL,CAAC;IAED;;oEAEgE;IAChE,KAAK,CAAC,UAAU,CAAC,EAAU,EAAE,OAAgB;QAC3C,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,UAAU;YAC1D,IAAI,EAAE,EAAE,OAAO,EAAE;SAClB,CAAC,CAAC;IACL,CAAC;IAED;;uCAEmC;IACnC,KAAK,CAAC,WAAW,CACf,EAAU,EACV,QAAsD;QAEtD,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,WAAW;YAC3D,IAAI,EAAE,QAAQ;SACf,CAAC,CAAC;IACL,CAAC;CACF;AAhID,kEAgIC"}
+{"version":3,"file":"attributeDefinitions.js","sourceRoot":"","sources":["../src/attributeDefinitions.ts"],"names":[],"mappings":";;;AAcA,8DAA8D;AAC9D,gFAAgF;AAChF,gFAAgF;AAChF,kFAAkF;AAClF,8EAA8E;AAC9E,4CAA4C;AAC5C,MAAa,2BAA2B;IAInB;IACA;IAJnB;4FACwF;IACxF,YACmB,IAAmB,EACnB,WAAmB,2BAA2B;QAD9C,SAAI,GAAJ,IAAI,CAAe;QACnB,aAAQ,GAAR,QAAQ,CAAsC;IAC9D,CAAC;IAEJ,KAAK,CAAC,IAAI,CAAC,OAAwC;QACjD,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAoC;YAC1D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,KAAK,EAAE;gBACL,UAAU,EAAE,OAAO,CAAC,UAAU;gBAC9B,UAAU,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;gBACnD,OAAO,EAAE,OAAO,CAAC,OAAO;gBACxB,qEAAqE;gBACrE,kEAAkE;gBAClE,uDAAuD;gBACvD,eAAe,EAAE,OAAO,CAAC,eAAe,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;gBACxE,oEAAoE;gBACpE,uEAAuE;gBACvE,wEAAwE;gBACxE,2DAA2D;gBAC3D,cAAc,EAAE,OAAO,CAAC,cAAc,KAAK,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS;gBACtE,gEAAgE;gBAChE,eAAe,EAAE,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS;aAC9D;SACF,CAAC,CAAC;IACL,CAAC;IAED;;;;;;;0CAOsC;IACtC,KAAK,CAAC,GAAG,CACP,EAAU,EACV,UAAmE,EAAE;QAErE,mEAAmE;QACnE,MAAM,MAAM,GAAG;YACb,GAAG,CAAC,OAAO,CAAC,cAAc,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxE,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAChE,CAAC;QACF,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;QAClE,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE;YAClD,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC5B,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,MAAM,CACV,KAAqC,EACrC,cAAuB;QAEvB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,MAAM;YACd,IAAI,EAAE,IAAI,CAAC,QAAQ;YACnB,IAAI,EAAE,KAAK;YACX,cAAc;SACf,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,MAAM,CACV,EAAU,EACV,KAAqC,EACrC,cAAuB;QAEvB,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE;YAClD,IAAI,EAAE,KAAK;YACX,cAAc;SACf,CAAC,CAAC;IACL,CAAC;IAED,mFAAmF;IACnF,KAAK,CAAC,OAAO,CAAC,EAAU;QACtB,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAY;YACjC,MAAM,EAAE,QAAQ;YAChB,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,EAAE;SACnD,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,EAAU;QACtB,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,CAAY;YACjC,MAAM,EAAE,MAAM;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,UAAU;SAC3D,CAAC,CAAC;IACL,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,GAAa;QAC9B,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAoC;YAC1D,MAAM,EAAE,MAAM;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,gBAAgB;YACtC,IAAI,EAAE,EAAE,GAAG,EAAE;SACd,CAAC,CAAC;IACL,CAAC;IAED;;6CAEyC;IACzC,KAAK,CAAC,QAAQ;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAA0C;YAChE,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,WAAW;SAClC,CAAC,CAAC;IACL,CAAC;IAED;;;0BAGsB;IACtB,KAAK,CAAC,UAAU,CACd,WAAmB,EACnB,UAAgC,EAAE;QAElC,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAkD;YACxE,MAAM,EAAE,MAAM;YACd,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,SAAS;YAC/B,IAAI,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,KAAK,IAAI,EAAE;SACvD,CAAC,CAAC;IACL,CAAC;IAED;;oEAEgE;IAChE,KAAK,CAAC,UAAU,CAAC,EAAU,EAAE,OAAgB;QAC3C,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,UAAU;YAC1D,IAAI,EAAE,EAAE,OAAO,EAAE;SAClB,CAAC,CAAC;IACL,CAAC;IAED;;uCAEmC;IACnC,KAAK,CAAC,WAAW,CACf,EAAU,EACV,QAAsD;QAEtD,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAsC;YAC5D,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,GAAG,IAAI,CAAC,QAAQ,IAAI,kBAAkB,CAAC,EAAE,CAAC,WAAW;YAC3D,IAAI,EAAE,QAAQ;SACf,CAAC,CAAC;IACL,CAAC;CACF;AAzJD,kEAyJC"}

package/dist/attributeHierarchy.d.ts

@@ -0,0 +1,157 @@
+/**
+ * Picking a value out of a hierarchy from ANY level, not only the top.
+ *
+ * A hierarchy is OEM > Program > Platform, and the picker used to insist you
+ * start at OEM: every level below the chosen one was disabled and listed
+ * nothing. Someone who knows the Platform had to remember which OEM it sits
+ * under and walk down to it — the app asking the user for the answer it already
+ * holds.
+ *
+ * Nothing about the DATA required that. The bag stores ONE option value and the
+ * ancestors are derived by walking `parentId` upward, so a directly-picked
+ * Platform already implies its Program and OEM. Only the UI forbade it.
+ *
+ * The model here is one selected node. Every level lists the nodes CONSISTENT
+ * with it — its ancestors, itself, its descendants — and every node at that
+ * level when nothing is selected yet. So picking a Platform back-fills the two
+ * above it, and picking an OEM narrows the two below without forcing an order.
+ *
+ * ## Why these functions take an INDEX
+ *
+ * The rules above were first written against a plain array, which meant every
+ * parent lookup was a linear scan: `ancestryOf` scanned once per level climbed,
+ * and the descendants filter called it once per candidate node. On a 52,488-node
+ * tree one render of the picker spent ~490 ms here — and it paid that on EVERY
+ * render, because an attribute form re-renders every field when any one of
+ * them is typed in.
+ *
+ * So the callers build an `OptionIndex` once (memoized on the definition) and
+ * pass it in. Every function still accepts a bare array and indexes it on the
+ * spot, which keeps the unit tests — and any incidental caller — working
+ * unchanged. The RULES below are untouched; only how they are computed moved.
+ * The test suite is the proof: it was not edited for this.
+ */
+export interface HierarchyNode {
+    id: string;
+    value: string;
+    label: string;
+    level: number;
+    parentId: string | null;
+}
+/**
+ * The lookups every rule below needs, built once in O(n).
+ *
+ * `childrenByParent` keys roots under `null`, which a Map handles natively.
+ * `byValue` exists because the selected node is found by its STORED value (the
+ * bag holds a value, not an id) and that lookup used to be a scan too.
+ */
+export interface OptionIndex {
+    readonly nodes: readonly HierarchyNode[];
+    readonly byId: ReadonlyMap<string, HierarchyNode>;
+    readonly byValue: ReadonlyMap<string, HierarchyNode>;
+    readonly byLevel: readonly (readonly HierarchyNode[])[];
+    readonly childrenByParent: ReadonlyMap<string | null, readonly HierarchyNode[]>;
+    readonly maxLevel: number;
+}
+/** Everything the rules need, in one pass. Order within each bucket is the
+ *  source array's order, which is what the registry curated. */
+export declare function buildOptionIndex(nodes: readonly HierarchyNode[]): OptionIndex;
+/** Either form a caller may hold. Arrays are indexed on the spot. */
+export type OptionSource = readonly HierarchyNode[] | OptionIndex;
+/** The chain from a node up to its root, indexed by level. */
+export declare function ancestryOf(src: OptionSource, node: HierarchyNode | undefined): (HierarchyNode | undefined)[];
+/**
+ * What one level should offer, given the whole option list and the current
+ * selection.
+ *
+ * With nothing selected, every node at that level — which is what makes a
+ * bottom-up pick possible at all. With a selection, the nodes on its own branch:
+ * above it, its ancestors (so the level reads as filled in); below it, its
+ * descendants (so the next choice is narrowed); at its own level, its siblings
+ * under the same parent, so a wrong turn is one click to correct rather than a
+ * reset.
+ */
+export declare function optionsForLevel(src: OptionSource, selected: HierarchyNode | undefined, level: number): HierarchyNode[];
+/**
+ * The node selected after picking `pickedId`.
+ *
+ * Re-affirming a node the selection already implies is a no-op: clicking the
+ * OEM that is already showing must not throw away the Platform beneath it,
+ * which is what setting the selection to the picked node every time would do.
+ * Picking anything else moves the selection there, because a node off the
+ * current branch invalidates what sat below.
+ *
+ * Returns the NODE, not just its value. Values repeat across branches (an
+ * "Ownership" level of "100" under every division), so a value alone cannot
+ * say which node was picked — see `resolveSelected`.
+ */
+export declare function nodeAfterPick(src: OptionSource, selected: HierarchyNode | undefined, pickedId: string): HierarchyNode | undefined;
+/** The stored value after picking `pickedId`. See `nodeAfterPick`. */
+export declare function valueAfterPick(src: OptionSource, selected: HierarchyNode | undefined, pickedId: string): string;
+/**
+ * The node selected after CLEARING `level`: the ancestor above it, or nothing
+ * at the top. Clearing a level cannot keep a selection beneath it — that node
+ * is the very thing being cleared.
+ */
+export declare function nodeAfterClear(src: OptionSource, selected: HierarchyNode | undefined, level: number): HierarchyNode | undefined;
+/** The stored value after clearing `level`. See `nodeAfterClear`. */
+export declare function valueAfterClear(src: OptionSource, selected: HierarchyNode | undefined, level: number): string;
+/**
+ * Walk down from `node` while there is exactly one way to go.
+ *
+ * A level with a single option under the current pick is not a question — the
+ * answer is already fixed — so asking the user to open a dropdown and click
+ * the only row in it is busywork. Descending stops at the first node with two
+ * or more children, or at a leaf.
+ *
+ * Only a PICK descends, never a clear: clearing a level and having it refill
+ * itself from its only child would make that level impossible to empty.
+ * Cycle-guarded like every other walk here.
+ */
+export declare function descendOnlyChildren(src: OptionSource, node: HierarchyNode | undefined): HierarchyNode | undefined;
+/**
+ * Which node a stored value stands for, preferring the node the user picked.
+ *
+ * The bag stores an option VALUE, and a value can sit on several branches:
+ * Ownership "100" under every Country, say. `byValue` answers with the first
+ * such node, so resolving a fresh pick through it alone moved the selection
+ * to a different branch — the levels above jumped to some other Division and
+ * Country the moment "100" was chosen.
+ *
+ * So the picker remembers the id it just chose and asks for it by id first.
+ * The remembered id is only trusted while it still carries the stored value;
+ * once the value changes from outside (a prefill, a reset), resolution falls
+ * back to `byValue` as before.
+ */
+export declare function resolveSelected(src: OptionSource, value: unknown, preferredId: string | null | undefined): HierarchyNode | undefined;
+/**
+ * How to label an option so two nodes that read alike can be told apart.
+ *
+ * Option values are NOT unique across a tree — "Explorer" can sit under Ford
+ * and under GM, and nothing in the schema forbids it. That was survivable while
+ * the picker was strictly top-down, because the parent was already chosen by
+ * the time you saw the child. Choosing a deep node directly is exactly when two
+ * identical labels appear side by side, so the ambiguous ones carry their
+ * parent.
+ *
+ * Only the ambiguous ones: appending a parent to every row would be noise on
+ * the overwhelming majority of lists, where labels are already distinct.
+ *
+ * Ambiguity is judged against `shown`, the rows actually offered — so a picker
+ * that renders a capped window disambiguates what the user can see, which is
+ * the only set the question means anything for.
+ *
+ * Rendering a whole level calls `labelsFor` instead: this is O(shown) per row
+ * and was the single most expensive thing in the picker before the rows were
+ * capped (46,080 rows meant 2.1 billion comparisons).
+ */
+export declare function labelFor(src: OptionSource, shown: readonly HierarchyNode[], node: HierarchyNode): string;
+/**
+ * `labelFor` for a whole set of rows, in one pass instead of one pass per row.
+ *
+ * Counts each label once, then resolves only the ambiguous rows' parents.
+ * Identical output to calling `labelFor` per row; the difference is O(shown)
+ * against O(shown squared).
+ */
+export declare function labelsFor(src: OptionSource, shown: readonly HierarchyNode[]): Map<string, string>;
+//# sourceMappingURL=attributeHierarchy.d.ts.map

package/dist/attributeHierarchy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"attributeHierarchy.d.ts","sourceRoot":"","sources":["../src/attributeHierarchy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;CACzB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,CAAC;IACzC,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IAClD,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC;IACrD,QAAQ,CAAC,OAAO,EAAE,SAAS,CAAC,SAAS,aAAa,EAAE,CAAC,EAAE,CAAC;IACxD,QAAQ,CAAC,gBAAgB,EAAE,WAAW,CAAC,MAAM,GAAG,IAAI,EAAE,SAAS,aAAa,EAAE,CAAC,CAAC;IAChF,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED;gEACgE;AAChE,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,aAAa,EAAE,GAAG,WAAW,CAiD7E;AAED,qEAAqE;AACrE,MAAM,MAAM,YAAY,GAAG,SAAS,aAAa,EAAE,GAAG,WAAW,CAAC;AAoClE,8DAA8D;AAC9D,wBAAgB,UAAU,CACxB,GAAG,EAAE,YAAY,EACjB,IAAI,EAAE,aAAa,GAAG,SAAS,GAC9B,CAAC,aAAa,GAAG,SAAS,CAAC,EAAE,CAY/B;AAWD;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,YAAY,EACjB,QAAQ,EAAE,aAAa,GAAG,SAAS,EACnC,KAAK,EAAE,MAAM,GACZ,aAAa,EAAE,CAuBjB;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,aAAa,CAC3B,GAAG,EAAE,YAAY,EACjB,QAAQ,EAAE,aAAa,GAAG,SAAS,EACnC,QAAQ,EAAE,MAAM,GACf,aAAa,GAAG,SAAS,CAS3B;AAED,sEAAsE;AACtE,wBAAgB,cAAc,CAC5B,GAAG,EAAE,YAAY,EACjB,QAAQ,EAAE,aAAa,GAAG,SAAS,EACnC,QAAQ,EAAE,MAAM,GACf,MAAM,CAER;AAED;;;;GAIG;AACH,wBAAgB,cAAc,CAC5B,GAAG,EAAE,YAAY,EACjB,QAAQ,EAAE,aAAa,GAAG,SAAS,EACnC,KAAK,EAAE,MAAM,GACZ,aAAa,GAAG,SAAS,CAG3B;AAED,qEAAqE;AACrE,wBAAgB,eAAe,CAC7B,GAAG,EAAE,YAAY,EACjB,QAAQ,EAAE,aAAa,GAAG,SAAS,EACnC,KAAK,EAAE,MAAM,GACZ,MAAM,CAER;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,mBAAmB,CACjC,GAAG,EAAE,YAAY,EACjB,IAAI,EAAE,aAAa,GAAG,SAAS,GAC9B,aAAa,GAAG,SAAS,CAW3B;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,OAAO,EACd,WAAW,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS,GACrC,aAAa,GAAG,SAAS,CAM3B;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,wBAAgB,QAAQ,CACtB,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,SAAS,aAAa,EAAE,EAC/B,IAAI,EAAE,aAAa,GAClB,MAAM,CAKR;AAED;;;;;;GAMG;AACH,wBAAgB,SAAS,CACvB,GAAG,EAAE,YAAY,EACjB,KAAK,EAAE,SAAS,aAAa,EAAE,GAC9B,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAgBrB"}

package/dist/attributeHierarchy.js

@@ -0,0 +1,296 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildOptionIndex = buildOptionIndex;
+exports.ancestryOf = ancestryOf;
+exports.optionsForLevel = optionsForLevel;
+exports.nodeAfterPick = nodeAfterPick;
+exports.valueAfterPick = valueAfterPick;
+exports.nodeAfterClear = nodeAfterClear;
+exports.valueAfterClear = valueAfterClear;
+exports.descendOnlyChildren = descendOnlyChildren;
+exports.resolveSelected = resolveSelected;
+exports.labelFor = labelFor;
+exports.labelsFor = labelsFor;
+/** Everything the rules need, in one pass. Order within each bucket is the
+ *  source array's order, which is what the registry curated. */
+function buildOptionIndex(nodes) {
+    const byId = new Map();
+    const byValue = new Map();
+    const byLevel = [];
+    const childrenByParent = new Map();
+    let maxLevel = 0;
+    for (const n of nodes) {
+        byId.set(n.id, n);
+        // First wins: two nodes CAN share a value across branches, and the old
+        // `find` returned the first, so this has to as well.
+        if (!byValue.has(n.value))
+            byValue.set(n.value, n);
+        (byLevel[n.level] ??= []).push(n);
+        const bucket = childrenByParent.get(n.parentId);
+        if (bucket)
+            bucket.push(n);
+        else
+            childrenByParent.set(n.parentId, [n]);
+        if (n.level > maxLevel)
+            maxLevel = n.level;
+    }
+    // A node whose CHILD carries the same value resolves to the child.
+    //
+    // The bag stores one option VALUE, and values are not unique down a branch:
+    // Magna's Product Hierarchy ends "… > ALL-WHEEL DRIVE > ALL-WHEEL DRIVE",
+    // the last level repeating the one above it. Taking the first match made the
+    // deepest node unreachable — picking it stored a string the lookup then
+    // resolved back to its ancestor, so the level below stayed empty and the row
+    // read as un-clickable. Nothing was broken except the display: the value
+    // written was already correct.
+    //
+    // Descending is free rather than a guess. The two nodes are indistinguishable
+    // to everything downstream (same stored string, so the same filters and the
+    // same reports), and the deeper reading is the more specific one, which
+    // implies its ancestors anyway. Only a value repeated PARENT-TO-CHILD moves;
+    // the same value on two different branches still takes the first, because
+    // there the choice would be a real guess.
+    for (const [value, node] of byValue) {
+        let cur = node;
+        const seen = new Set([cur.id]);
+        for (;;) {
+            const sameChild = (childrenByParent.get(cur.id) ?? [])
+                .find((c) => c.value === value && !seen.has(c.id));
+            if (!sameChild)
+                break;
+            seen.add(sameChild.id);
+            cur = sameChild;
+        }
+        if (cur !== node)
+            byValue.set(value, cur);
+    }
+    return { nodes, byId, byValue, byLevel, childrenByParent, maxLevel };
+}
+function toIndex(src) {
+    return Array.isArray(src) ? buildOptionIndex(src) : src;
+}
+/** Children of one parent, restricted to a level. The restriction is belt and
+ *  braces: children of a node are all at one level in any well-formed tree,
+ *  and the array version filtered by level, so this matches it exactly. */
+function childrenAtLevel(ix, parentId, level) {
+    return (ix.childrenByParent.get(parentId) ?? []).filter((o) => o.level === level);
+}
+/** The ids of every node beneath `root`, exclusive. Iterative and cycle-guarded
+ *  — the tree is parent-pointer only with no database constraint preventing a
+ *  loop, and a bad row must not hang the form.
+ *
+ *  Returns a SET rather than a list because the caller filters the level's own
+ *  array by it: walking the subtree yields traversal order, and the rows have
+ *  to come back in the registry's curated order, which is the order the source
+ *  array is in. (The unit suite caught exactly this.) */
+function subtreeIdsOf(ix, root) {
+    const seen = new Set([root.id]);
+    const stack = [root];
+    while (stack.length > 0) {
+        const node = stack.pop();
+        for (const child of ix.childrenByParent.get(node.id) ?? []) {
+            if (seen.has(child.id))
+                continue;
+            seen.add(child.id);
+            stack.push(child);
+        }
+    }
+    seen.delete(root.id);
+    return seen;
+}
+/** The chain from a node up to its root, indexed by level. */
+function ancestryOf(src, node) {
+    const ix = toIndex(src);
+    const byLevel = [];
+    let cur = node;
+    const seen = new Set();
+    // Guarded against a cycle: see subtreeIdsOf.
+    while (cur && !seen.has(cur.id)) {
+        seen.add(cur.id);
+        byLevel[cur.level] = cur;
+        cur = cur.parentId ? ix.byId.get(cur.parentId) : undefined;
+    }
+    return byLevel;
+}
+/** True when `node` is `maybeAncestor` or sits beneath it. */
+function isSelfOrDescendantOf(ix, node, maybeAncestor) {
+    return ancestryOf(ix, node).some((a) => a?.id === maybeAncestor.id);
+}
+/**
+ * What one level should offer, given the whole option list and the current
+ * selection.
+ *
+ * With nothing selected, every node at that level — which is what makes a
+ * bottom-up pick possible at all. With a selection, the nodes on its own branch:
+ * above it, its ancestors (so the level reads as filled in); below it, its
+ * descendants (so the next choice is narrowed); at its own level, its siblings
+ * under the same parent, so a wrong turn is one click to correct rather than a
+ * reset.
+ */
+function optionsForLevel(src, selected, level) {
+    const ix = toIndex(src);
+    const atLevel = ix.byLevel[level] ?? [];
+    if (!selected)
+        return [...atLevel];
+    if (level < selected.level) {
+        // Shallower: its own ancestor, plus that ancestor's siblings — changing one
+        // has to remain possible, and listing only the ancestor would make the
+        // control read as frozen.
+        const ancestor = ancestryOf(ix, selected)[level];
+        if (!ancestor)
+            return [...atLevel];
+        return childrenAtLevel(ix, ancestor.parentId, level);
+    }
+    if (level === selected.level) {
+        return childrenAtLevel(ix, selected.parentId, level);
+    }
+    // Deeper: walk DOWN the selection's subtree once and keep the level's own
+    // rows that fall inside it. Same answer and same order, at the cost of the
+    // subtree plus one pass, rather than (rows at this level x depth x array).
+    const inSubtree = subtreeIdsOf(ix, selected);
+    return atLevel.filter((o) => inSubtree.has(o.id));
+}
+/**
+ * The node selected after picking `pickedId`.
+ *
+ * Re-affirming a node the selection already implies is a no-op: clicking the
+ * OEM that is already showing must not throw away the Platform beneath it,
+ * which is what setting the selection to the picked node every time would do.
+ * Picking anything else moves the selection there, because a node off the
+ * current branch invalidates what sat below.
+ *
+ * Returns the NODE, not just its value. Values repeat across branches (an
+ * "Ownership" level of "100" under every division), so a value alone cannot
+ * say which node was picked — see `resolveSelected`.
+ */
+function nodeAfterPick(src, selected, pickedId) {
+    const ix = toIndex(src);
+    const picked = ix.byId.get(pickedId);
+    if (!picked)
+        return undefined;
+    if (selected && isSelfOrDescendantOf(ix, selected, picked)) {
+        // Already on this branch, at or below the pick — keep the deeper answer.
+        return selected;
+    }
+    return picked;
+}
+/** The stored value after picking `pickedId`. See `nodeAfterPick`. */
+function valueAfterPick(src, selected, pickedId) {
+    return nodeAfterPick(src, selected, pickedId)?.value ?? '';
+}
+/**
+ * The node selected after CLEARING `level`: the ancestor above it, or nothing
+ * at the top. Clearing a level cannot keep a selection beneath it — that node
+ * is the very thing being cleared.
+ */
+function nodeAfterClear(src, selected, level) {
+    if (!selected || level <= 0)
+        return undefined;
+    return ancestryOf(src, selected)[level - 1];
+}
+/** The stored value after clearing `level`. See `nodeAfterClear`. */
+function valueAfterClear(src, selected, level) {
+    return nodeAfterClear(src, selected, level)?.value ?? '';
+}
+/**
+ * Walk down from `node` while there is exactly one way to go.
+ *
+ * A level with a single option under the current pick is not a question — the
+ * answer is already fixed — so asking the user to open a dropdown and click
+ * the only row in it is busywork. Descending stops at the first node with two
+ * or more children, or at a leaf.
+ *
+ * Only a PICK descends, never a clear: clearing a level and having it refill
+ * itself from its only child would make that level impossible to empty.
+ * Cycle-guarded like every other walk here.
+ */
+function descendOnlyChildren(src, node) {
+    if (!node)
+        return undefined;
+    const ix = toIndex(src);
+    let cur = node;
+    const seen = new Set([cur.id]);
+    for (;;) {
+        const children = ix.childrenByParent.get(cur.id) ?? [];
+        if (children.length !== 1 || seen.has(children[0].id))
+            return cur;
+        cur = children[0];
+        seen.add(cur.id);
+    }
+}
+/**
+ * Which node a stored value stands for, preferring the node the user picked.
+ *
+ * The bag stores an option VALUE, and a value can sit on several branches:
+ * Ownership "100" under every Country, say. `byValue` answers with the first
+ * such node, so resolving a fresh pick through it alone moved the selection
+ * to a different branch — the levels above jumped to some other Division and
+ * Country the moment "100" was chosen.
+ *
+ * So the picker remembers the id it just chose and asks for it by id first.
+ * The remembered id is only trusted while it still carries the stored value;
+ * once the value changes from outside (a prefill, a reset), resolution falls
+ * back to `byValue` as before.
+ */
+function resolveSelected(src, value, preferredId) {
+    if (typeof value !== 'string' || value === '')
+        return undefined;
+    const ix = toIndex(src);
+    const preferred = preferredId ? ix.byId.get(preferredId) : undefined;
+    if (preferred && preferred.value === value)
+        return preferred;
+    return ix.byValue.get(value);
+}
+/**
+ * How to label an option so two nodes that read alike can be told apart.
+ *
+ * Option values are NOT unique across a tree — "Explorer" can sit under Ford
+ * and under GM, and nothing in the schema forbids it. That was survivable while
+ * the picker was strictly top-down, because the parent was already chosen by
+ * the time you saw the child. Choosing a deep node directly is exactly when two
+ * identical labels appear side by side, so the ambiguous ones carry their
+ * parent.
+ *
+ * Only the ambiguous ones: appending a parent to every row would be noise on
+ * the overwhelming majority of lists, where labels are already distinct.
+ *
+ * Ambiguity is judged against `shown`, the rows actually offered — so a picker
+ * that renders a capped window disambiguates what the user can see, which is
+ * the only set the question means anything for.
+ *
+ * Rendering a whole level calls `labelsFor` instead: this is O(shown) per row
+ * and was the single most expensive thing in the picker before the rows were
+ * capped (46,080 rows meant 2.1 billion comparisons).
+ */
+function labelFor(src, shown, node) {
+    const duplicated = shown.filter((o) => o.label === node.label).length > 1;
+    if (!duplicated)
+        return node.label;
+    const parent = node.parentId ? toIndex(src).byId.get(node.parentId) : undefined;
+    return parent ? `${node.label} (${parent.label})` : node.label;
+}
+/**
+ * `labelFor` for a whole set of rows, in one pass instead of one pass per row.
+ *
+ * Counts each label once, then resolves only the ambiguous rows' parents.
+ * Identical output to calling `labelFor` per row; the difference is O(shown)
+ * against O(shown squared).
+ */
+function labelsFor(src, shown) {
+    const counts = new Map();
+    for (const o of shown)
+        counts.set(o.label, (counts.get(o.label) ?? 0) + 1);
+    const out = new Map();
+    let ix;
+    for (const o of shown) {
+        if ((counts.get(o.label) ?? 0) <= 1) {
+            out.set(o.id, o.label);
+            continue;
+        }
+        ix ??= toIndex(src);
+        const parent = o.parentId ? ix.byId.get(o.parentId) : undefined;
+        out.set(o.id, parent ? `${o.label} (${parent.label})` : o.label);
+    }
+    return out;
+}
+//# sourceMappingURL=attributeHierarchy.js.map

package/dist/attributeHierarchy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"attributeHierarchy.js","sourceRoot":"","sources":["../src/attributeHierarchy.ts"],"names":[],"mappings":";;AA2DA,4CAiDC;AAwCD,gCAeC;AAsBD,0CA2BC;AAeD,sCAaC;AAGD,wCAMC;AAOD,wCAOC;AAGD,0CAMC;AAcD,kDAcC;AAgBD,0CAUC;AAuBD,4BASC;AASD,8BAmBC;AAzUD;gEACgE;AAChE,SAAgB,gBAAgB,CAAC,KAA+B;IAC9D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IACjD,MAAM,OAAO,GAAsB,EAAE,CAAC;IACtC,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAkC,CAAC;IACnE,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QAClB,uEAAuE;QACvE,qDAAqD;QACrD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACnD,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;YACtB,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3C,IAAI,CAAC,CAAC,KAAK,GAAG,QAAQ;YAAE,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC;IAC7C,CAAC;IAED,mEAAmE;IACnE,EAAE;IACF,4EAA4E;IAC5E,0EAA0E;IAC1E,6EAA6E;IAC7E,wEAAwE;IACxE,6EAA6E;IAC7E,yEAAyE;IACzE,+BAA+B;IAC/B,EAAE;IACF,8EAA8E;IAC9E,4EAA4E;IAC5E,wEAAwE;IACxE,6EAA6E;IAC7E,0EAA0E;IAC1E,0CAA0C;IAC1C,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;QACpC,IAAI,GAAG,GAAG,IAAI,CAAC;QACf,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;QACvC,SAAS,CAAC;YACR,MAAM,SAAS,GAAG,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;iBACnD,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,SAAS;gBAAE,MAAM;YACtB,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACvB,GAAG,GAAG,SAAS,CAAC;QAClB,CAAC;QACD,IAAI,GAAG,KAAK,IAAI;YAAE,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;IAC5C,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,CAAC;AACvE,CAAC;AAKD,SAAS,OAAO,CAAC,GAAiB;IAChC,OAAO,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAE,GAAmB,CAAC;AAC3E,CAAC;AAED;;2EAE2E;AAC3E,SAAS,eAAe,CAAC,EAAe,EAAE,QAAuB,EAAE,KAAa;IAC9E,OAAO,CAAC,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,KAAK,CAAC,CAAC;AACpF,CAAC;AAED;;;;;;;yDAOyD;AACzD,SAAS,YAAY,CAAC,EAAe,EAAE,IAAmB;IACxD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACxC,MAAM,KAAK,GAAoB,CAAC,IAAI,CAAC,CAAC;IACtC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3D,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,SAAS;YACjC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IACD,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACrB,OAAO,IAAI,CAAC;AACd,CAAC;AAED,8DAA8D;AAC9D,SAAgB,UAAU,CACxB,GAAiB,EACjB,IAA+B;IAE/B,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,OAAO,GAAkC,EAAE,CAAC;IAClD,IAAI,GAAG,GAAG,IAAI,CAAC;IACf,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,6CAA6C;IAC7C,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;QAChC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC;QACzB,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7D,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,8DAA8D;AAC9D,SAAS,oBAAoB,CAC3B,EAAe,EACf,IAAmB,EACnB,aAA4B;IAE5B,OAAO,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,aAAa,CAAC,EAAE,CAAC,CAAC;AACtE,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAgB,eAAe,CAC7B,GAAiB,EACjB,QAAmC,EACnC,KAAa;IAEb,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IACxC,IAAI,CAAC,QAAQ;QAAE,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;IAEnC,IAAI,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;QAC3B,4EAA4E;QAC5E,uEAAuE;QACvE,0BAA0B;QAC1B,MAAM,QAAQ,GAAG,UAAU,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC;QACjD,IAAI,CAAC,QAAQ;YAAE,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;QACnC,OAAO,eAAe,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,IAAI,KAAK,KAAK,QAAQ,CAAC,KAAK,EAAE,CAAC;QAC7B,OAAO,eAAe,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,0EAA0E;IAC1E,2EAA2E;IAC3E,2EAA2E;IAC3E,MAAM,SAAS,GAAG,YAAY,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;IAC7C,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACpD,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAgB,aAAa,CAC3B,GAAiB,EACjB,QAAmC,EACnC,QAAgB;IAEhB,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,MAAM,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACrC,IAAI,CAAC,MAAM;QAAE,OAAO,SAAS,CAAC;IAC9B,IAAI,QAAQ,IAAI,oBAAoB,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,EAAE,CAAC;QAC3D,yEAAyE;QACzE,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sEAAsE;AACtE,SAAgB,cAAc,CAC5B,GAAiB,EACjB,QAAmC,EACnC,QAAgB;IAEhB,OAAO,aAAa,CAAC,GAAG,EAAE,QAAQ,EAAE,QAAQ,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;AAC7D,CAAC;AAED;;;;GAIG;AACH,SAAgB,cAAc,CAC5B,GAAiB,EACjB,QAAmC,EACnC,KAAa;IAEb,IAAI,CAAC,QAAQ,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,OAAO,UAAU,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED,qEAAqE;AACrE,SAAgB,eAAe,CAC7B,GAAiB,EACjB,QAAmC,EACnC,KAAa;IAEb,OAAO,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,KAAK,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;AAC3D,CAAC;AAED;;;;;;;;;;;GAWG;AACH,SAAgB,mBAAmB,CACjC,GAAiB,EACjB,IAA+B;IAE/B,IAAI,CAAC,IAAI;QAAE,OAAO,SAAS,CAAC;IAC5B,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACxB,IAAI,GAAG,GAAG,IAAI,CAAC;IACf,MAAM,IAAI,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACvC,SAAS,CAAC;QACR,MAAM,QAAQ,GAAG,EAAE,CAAC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACvD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAAE,OAAO,GAAG,CAAC;QAClE,GAAG,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACnB,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAgB,eAAe,CAC7B,GAAiB,EACjB,KAAc,EACd,WAAsC;IAEtC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,EAAE;QAAE,OAAO,SAAS,CAAC;IAChE,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IACxB,MAAM,SAAS,GAAG,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACrE,IAAI,SAAS,IAAI,SAAS,CAAC,KAAK,KAAK,KAAK;QAAE,OAAO,SAAS,CAAC;IAC7D,OAAO,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AAC/B,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,SAAgB,QAAQ,CACtB,GAAiB,EACjB,KAA+B,EAC/B,IAAmB;IAEnB,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1E,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC,KAAK,CAAC;IACnC,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAChF,OAAO,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;AACjE,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,SAAS,CACvB,GAAiB,EACjB,KAA+B;IAE/B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAE3E,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,IAAI,EAA2B,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACpC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;YACvB,SAAS;QACX,CAAC;QACD,EAAE,KAAK,OAAO,CAAC,GAAG,CAAC,CAAC;QACpB,MAAM,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,KAAK,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/attributeHierarchyChain.d.ts

@@ -0,0 +1,42 @@
+/**
+ * A stored hierarchy value, expanded into the chain it stands for.
+ *
+ * The bag holds one option value: the node that was picked. Read views showed
+ * just that node's label, so "ALL-WHEEL DRIVE" arrived with none of the context
+ * that makes it mean anything, and the two other things a reader needs — which
+ * branch it sits on, and what each tier of the branch is called — were only
+ * visible by opening the editor and reading the dropdowns.
+ *
+ * The ancestors are derivable (that is the whole premise of storing one value),
+ * so this walks them and pairs each with the tier name the definition declares
+ * in `validation.levels`.
+ */
+import { type HierarchyNode } from './attributeHierarchy';
+export interface HierarchyTier {
+    /** The tier's declared name, or null when the definition names no levels. */
+    tier: string | null;
+    /** The chosen node's label at this tier. */
+    label: string;
+    /** The tier's index, which is the node's own level. Stable key for a list. */
+    level: number;
+}
+interface ChainSource {
+    validation?: {
+        levels?: string[];
+    } | null;
+    attributeOptions?: readonly HierarchyNode[] | null;
+}
+/**
+ * The chain a stored value stands for, shallowest tier first.
+ *
+ * `null` when there is nothing better to show than the raw value: no options
+ * loaded, an empty value, or a value that names no node (legacy data, or an
+ * option archived since it was chosen). Callers fall back to the ordinary
+ * single-value formatter in that case rather than rendering an empty list.
+ *
+ * A single-tier chain also returns null: one row captioned "Level 1" is
+ * strictly more furniture than the plain label it replaces.
+ */
+export declare function hierarchyChain(def: ChainSource, value: unknown): HierarchyTier[] | null;
+export {};
+//# sourceMappingURL=attributeHierarchyChain.d.ts.map

package/dist/attributeHierarchyChain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"attributeHierarchyChain.d.ts","sourceRoot":"","sources":["../src/attributeHierarchyChain.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,OAAO,EAAgC,KAAK,aAAa,EAAE,MAAM,sBAAsB,CAAC;AAExF,MAAM,WAAW,aAAa;IAC5B,6EAA6E;IAC7E,IAAI,EAAE,MAAM,GAAG,IAAI,CAAC;IACpB,4CAA4C;IAC5C,KAAK,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,KAAK,EAAE,MAAM,CAAC;CACf;AAED,UAAU,WAAW;IACnB,UAAU,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,MAAM,EAAE,CAAA;KAAE,GAAG,IAAI,CAAC;IAC1C,gBAAgB,CAAC,EAAE,SAAS,aAAa,EAAE,GAAG,IAAI,CAAC;CACpD;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,GAAG,aAAa,EAAE,GAAG,IAAI,CAmBvF"}

package/dist/attributeHierarchyChain.js

@@ -0,0 +1,50 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.hierarchyChain = hierarchyChain;
+/**
+ * A stored hierarchy value, expanded into the chain it stands for.
+ *
+ * The bag holds one option value: the node that was picked. Read views showed
+ * just that node's label, so "ALL-WHEEL DRIVE" arrived with none of the context
+ * that makes it mean anything, and the two other things a reader needs — which
+ * branch it sits on, and what each tier of the branch is called — were only
+ * visible by opening the editor and reading the dropdowns.
+ *
+ * The ancestors are derivable (that is the whole premise of storing one value),
+ * so this walks them and pairs each with the tier name the definition declares
+ * in `validation.levels`.
+ */
+const attributeHierarchy_1 = require("./attributeHierarchy");
+/**
+ * The chain a stored value stands for, shallowest tier first.
+ *
+ * `null` when there is nothing better to show than the raw value: no options
+ * loaded, an empty value, or a value that names no node (legacy data, or an
+ * option archived since it was chosen). Callers fall back to the ordinary
+ * single-value formatter in that case rather than rendering an empty list.
+ *
+ * A single-tier chain also returns null: one row captioned "Level 1" is
+ * strictly more furniture than the plain label it replaces.
+ */
+function hierarchyChain(def, value) {
+    if (typeof value !== 'string' || value.trim() === '')
+        return null;
+    const options = def.attributeOptions;
+    if (!options || options.length === 0)
+        return null;
+    const index = (0, attributeHierarchy_1.buildOptionIndex)(options);
+    const node = index.byValue.get(value);
+    if (!node)
+        return null;
+    const levels = def.validation?.levels ?? [];
+    const chain = [];
+    (0, attributeHierarchy_1.ancestryOf)(index, node).forEach((ancestor, level) => {
+        // ancestryOf is indexed BY LEVEL and is sparse: a tree that starts at
+        // level 1, or a gap left by a malformed row, leaves holes to skip.
+        if (!ancestor)
+            return;
+        chain.push({ tier: levels[level]?.trim() || null, label: ancestor.label, level });
+    });
+    return chain.length > 1 ? chain : null;
+}
+//# sourceMappingURL=attributeHierarchyChain.js.map