@teambit/objects 0.0.19

package/dist/models/symlink.js

@@ -0,0 +1,91 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+function _componentId() {
+  const data = require("@teambit/component-id");
+  _componentId = function () {
+    return data;
+  };
+  return data;
+}
+function _legacyBitId() {
+  const data = require("@teambit/legacy-bit-id");
+  _legacyBitId = function () {
+    return data;
+  };
+  return data;
+}
+function _legacy() {
+  const data = require("@teambit/legacy.utils");
+  _legacy = function () {
+    return data;
+  };
+  return data;
+}
+function _objects() {
+  const data = require("../objects");
+  _objects = function () {
+    return data;
+  };
+  return data;
+}
+function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
+function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+/**
+ * @deprecated
+ * this is not used since component-schema 2.0.0, where the component-id is always the full id.
+ */
+class Symlink extends _objects().BitObject {
+  constructor(props) {
+    super();
+    _defineProperty(this, "scope", void 0);
+    _defineProperty(this, "name", void 0);
+    _defineProperty(this, "realScope", void 0);
+    this.scope = props.scope;
+    this.name = props.name;
+    this.realScope = props.realScope;
+  }
+  id() {
+    return this.name;
+  }
+  getRealComponentId() {
+    return _componentId().ComponentID.fromObject({
+      scope: this.realScope,
+      name: this.name
+    });
+  }
+  toComponentId() {
+    return this.getRealComponentId();
+  }
+  static parse(contents) {
+    const rawContent = JSON.parse(contents.toString());
+    if (rawContent.box) rawContent.name = `${rawContent.box}/${rawContent.name}`;
+    return Symlink.from(rawContent);
+  }
+  toObject() {
+    return {
+      scope: this.scope,
+      name: this.name,
+      realScope: this.realScope
+    };
+  }
+  toBitId() {
+    return new (_legacyBitId().BitId)({
+      name: this.name
+    });
+  }
+  toBuffer(pretty) {
+    const args = (0, _legacy().getStringifyArgs)(pretty);
+    return Buffer.from(JSON.stringify(this.toObject(), ...args));
+  }
+  static from(props) {
+    return new Symlink(props);
+  }
+}
+exports.default = Symlink;
+
+//# sourceMappingURL=symlink.js.map

package/dist/models/symlink.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["_componentId","data","require","_legacyBitId","_legacy","_objects","_defineProperty","e","r","t","_toPropertyKey","Object","defineProperty","value","enumerable","configurable","writable","i","_toPrimitive","Symbol","toPrimitive","call","TypeError","String","Number","Symlink","BitObject","constructor","props","scope","name","realScope","id","getRealComponentId","ComponentID","fromObject","toComponentId","parse","contents","rawContent","JSON","toString","box","from","toObject","toBitId","BitId","toBuffer","pretty","args","getStringifyArgs","Buffer","stringify","exports","default"],"sources":["symlink.ts"],"sourcesContent":["import { ComponentID } from '@teambit/component-id';\nimport { BitId } from '@teambit/legacy-bit-id';\nimport { getStringifyArgs } from '@teambit/legacy.utils';\nimport { BitObject } from '../objects';\n\nexport type SymlinkProp = {\n  scope: string;\n  name: string;\n  realScope: string;\n};\n\n/**\n * @deprecated\n * this is not used since component-schema 2.0.0, where the component-id is always the full id.\n */\nexport default class Symlink extends BitObject {\n  scope: string;\n  name: string;\n  realScope: string;\n\n  constructor(props: SymlinkProp) {\n    super();\n    this.scope = props.scope;\n    this.name = props.name;\n    this.realScope = props.realScope;\n  }\n\n  id(): string {\n    return this.name;\n  }\n\n  getRealComponentId(): ComponentID {\n    return ComponentID.fromObject({ scope: this.realScope, name: this.name });\n  }\n\n  toComponentId(): ComponentID {\n    return this.getRealComponentId();\n  }\n\n  static parse(contents: Buffer): Symlink {\n    const rawContent = JSON.parse(contents.toString());\n    if (rawContent.box) rawContent.name = `${rawContent.box}/${rawContent.name}`;\n    return Symlink.from(rawContent);\n  }\n\n  toObject() {\n    return {\n      scope: this.scope,\n      name: this.name,\n      realScope: this.realScope,\n    };\n  }\n\n  toBitId(): BitId {\n    return new BitId({ name: this.name });\n  }\n\n  toBuffer(pretty?: boolean) {\n    const args = getStringifyArgs(pretty);\n    return Buffer.from(JSON.stringify(this.toObject(), ...args));\n  }\n\n  static from(props: SymlinkProp) {\n    return new Symlink(props);\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAAA,aAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,YAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,aAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,YAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,QAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,OAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,SAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,QAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAAuC,SAAAK,gBAAAC,CAAA,EAAAC,CAAA,EAAAC,CAAA,YAAAD,CAAA,GAAAE,cAAA,CAAAF,CAAA,MAAAD,CAAA,GAAAI,MAAA,CAAAC,cAAA,CAAAL,CAAA,EAAAC,CAAA,IAAAK,KAAA,EAAAJ,CAAA,EAAAK,UAAA,MAAAC,YAAA,MAAAC,QAAA,UAAAT,CAAA,CAAAC,CAAA,IAAAC,CAAA,EAAAF,CAAA;AAAA,SAAAG,eAAAD,CAAA,QAAAQ,CAAA,GAAAC,YAAA,CAAAT,CAAA,uCAAAQ,CAAA,GAAAA,CAAA,GAAAA,CAAA;AAAA,SAAAC,aAAAT,CAAA,EAAAD,CAAA,2BAAAC,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAF,CAAA,GAAAE,CAAA,CAAAU,MAAA,CAAAC,WAAA,kBAAAb,CAAA,QAAAU,CAAA,GAAAV,CAAA,CAAAc,IAAA,CAAAZ,CAAA,EAAAD,CAAA,uCAAAS,CAAA,SAAAA,CAAA,YAAAK,SAAA,yEAAAd,CAAA,GAAAe,MAAA,GAAAC,MAAA,EAAAf,CAAA;AAQvC;AACA;AACA;AACA;AACe,MAAMgB,OAAO,SAASC,oBAAS,CAAC;EAK7CC,WAAWA,CAACC,KAAkB,EAAE;IAC9B,KAAK,CAAC,CAAC;IAACtB,eAAA;IAAAA,eAAA;IAAAA,eAAA;IACR,IAAI,CAACuB,KAAK,GAAGD,KAAK,CAACC,KAAK;IACxB,IAAI,CAACC,IAAI,GAAGF,KAAK,CAACE,IAAI;IACtB,IAAI,CAACC,SAAS,GAAGH,KAAK,CAACG,SAAS;EAClC;EAEAC,EAAEA,CAAA,EAAW;IACX,OAAO,IAAI,CAACF,IAAI;EAClB;EAEAG,kBAAkBA,CAAA,EAAgB;IAChC,OAAOC,0BAAW,CAACC,UAAU,CAAC;MAAEN,KAAK,EAAE,IAAI,CAACE,SAAS;MAAED,IAAI,EAAE,IAAI,CAACA;IAAK,CAAC,CAAC;EAC3E;EAEAM,aAAaA,CAAA,EAAgB;IAC3B,OAAO,IAAI,CAACH,kBAAkB,CAAC,CAAC;EAClC;EAEA,OAAOI,KAAKA,CAACC,QAAgB,EAAW;IACtC,MAAMC,UAAU,GAAGC,IAAI,CAACH,KAAK,CAACC,QAAQ,CAACG,QAAQ,CAAC,CAAC,CAAC;IAClD,IAAIF,UAAU,CAACG,GAAG,EAAEH,UAAU,CAACT,IAAI,GAAG,GAAGS,UAAU,CAACG,GAAG,IAAIH,UAAU,CAACT,IAAI,EAAE;IAC5E,OAAOL,OAAO,CAACkB,IAAI,CAACJ,UAAU,CAAC;EACjC;EAEAK,QAAQA,CAAA,EAAG;IACT,OAAO;MACLf,KAAK,EAAE,IAAI,CAACA,KAAK;MACjBC,IAAI,EAAE,IAAI,CAACA,IAAI;MACfC,SAAS,EAAE,IAAI,CAACA;IAClB,CAAC;EACH;EAEAc,OAAOA,CAAA,EAAU;IACf,OAAO,KAAIC,oBAAK,EAAC;MAAEhB,IAAI,EAAE,IAAI,CAACA;IAAK,CAAC,CAAC;EACvC;EAEAiB,QAAQA,CAACC,MAAgB,EAAE;IACzB,MAAMC,IAAI,GAAG,IAAAC,0BAAgB,EAACF,MAAM,CAAC;IACrC,OAAOG,MAAM,CAACR,IAAI,CAACH,IAAI,CAACY,SAAS,CAAC,IAAI,CAACR,QAAQ,CAAC,CAAC,EAAE,GAAGK,IAAI,CAAC,CAAC;EAC9D;EAEA,OAAON,IAAIA,CAACf,KAAkB,EAAE;IAC9B,OAAO,IAAIH,OAAO,CAACG,KAAK,CAAC;EAC3B;AACF;AAACyB,OAAA,CAAAC,OAAA,GAAA7B,OAAA","ignoreList":[]}

package/dist/models/version-history.d.ts

@@ -0,0 +1,59 @@
+import { Graph } from '@teambit/graph.cleargraph';
+import { ComponentID } from '@teambit/component-id';
+import Ref from '../objects/ref';
+import { BitObject } from '../objects';
+import type Version from './version';
+import ModelComponent from './model-component';
+export type VersionParents = {
+    hash: Ref;
+    parents: Ref[];
+    unrelated?: Ref;
+    squashed?: Ref[];
+};
+export type VersionHistoryGraph = Graph<string | HashMetadata, string>;
+type VersionHistoryProps = {
+    name: string;
+    scope: string;
+    versions: VersionParents[];
+    graphCompleteRefs?: string[];
+};
+type HashMetadata = {
+    tag?: string;
+    pointers?: string[];
+};
+export default class VersionHistory extends BitObject {
+    name: string;
+    scope: string;
+    private versionsObj;
+    graphCompleteRefs: string[];
+    hasChanged: boolean;
+    constructor(props: VersionHistoryProps);
+    get versions(): VersionParents[];
+    private versionParentsToObject;
+    id(): string;
+    static fromId(name: string, scope: string): VersionHistory;
+    toObject(): Record<string, any>;
+    toString(pretty: boolean): string;
+    toBuffer(pretty: any): Buffer;
+    getVersionData(ref: Ref): VersionParents | undefined;
+    hasHash(ref: Ref): boolean;
+    addFromVersionsObjects(versions: Version[]): void;
+    isEmpty(): boolean;
+    getAllHashesFrom(start: Ref): {
+        found?: string[];
+        missing?: string[];
+    };
+    isRefPartOfHistory(startFrom: Ref, searchFor: Ref): boolean | undefined;
+    isGraphCompleteSince(ref: Ref): boolean;
+    getAllHashesAsString(): string[];
+    merge(versionHistory: VersionHistory): void;
+    getAncestor(numOfGenerationsToGoBack: number, ref: Ref): Ref;
+    getGraph(modelComponent?: ModelComponent, laneHeads?: {
+        [hash: string]: string[];
+    }, shortHash?: boolean): VersionHistoryGraph;
+    get compId(): ComponentID;
+    static create(name: string, scope: string, versions: VersionParents[]): VersionHistory;
+    static parse(contents: string): VersionHistory;
+}
+export declare function versionParentsToGraph(versions: VersionParents[]): Graph<string, string>;
+export {};

package/dist/models/version-history.js

@@ -0,0 +1,285 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.default = void 0;
+exports.versionParentsToGraph = versionParentsToGraph;
+function _graph() {
+  const data = require("@teambit/graph.cleargraph");
+  _graph = function () {
+    return data;
+  };
+  return data;
+}
+function _componentId() {
+  const data = require("@teambit/component-id");
+  _componentId = function () {
+    return data;
+  };
+  return data;
+}
+function _bitError() {
+  const data = require("@teambit/bit-error");
+  _bitError = function () {
+    return data;
+  };
+  return data;
+}
+function _lodash() {
+  const data = require("lodash");
+  _lodash = function () {
+    return data;
+  };
+  return data;
+}
+function _legacy() {
+  const data = require("@teambit/legacy.utils");
+  _legacy = function () {
+    return data;
+  };
+  return data;
+}
+function _ref() {
+  const data = _interopRequireDefault(require("../objects/ref"));
+  _ref = function () {
+    return data;
+  };
+  return data;
+}
+function _objects() {
+  const data = require("../objects");
+  _objects = function () {
+    return data;
+  };
+  return data;
+}
+function _component() {
+  const data = require("@teambit/component.snap-distance");
+  _component = function () {
+    return data;
+  };
+  return data;
+}
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+function _defineProperty(e, r, t) { return (r = _toPropertyKey(r)) in e ? Object.defineProperty(e, r, { value: t, enumerable: !0, configurable: !0, writable: !0 }) : e[r] = t, e; }
+function _toPropertyKey(t) { var i = _toPrimitive(t, "string"); return "symbol" == typeof i ? i : i + ""; }
+function _toPrimitive(t, r) { if ("object" != typeof t || !t) return t; var e = t[Symbol.toPrimitive]; if (void 0 !== e) { var i = e.call(t, r || "default"); if ("object" != typeof i) return i; throw new TypeError("@@toPrimitive must return a primitive value."); } return ("string" === r ? String : Number)(t); }
+class VersionHistory extends _objects().BitObject {
+  // whether the version history has changed since the last persist
+  constructor(props) {
+    super();
+    _defineProperty(this, "name", void 0);
+    _defineProperty(this, "scope", void 0);
+    _defineProperty(this, "versionsObj", void 0);
+    _defineProperty(this, "graphCompleteRefs", void 0);
+    _defineProperty(this, "hasChanged", false);
+    this.name = props.name;
+    this.scope = props.scope;
+    this.versionsObj = this.versionParentsToObject(props.versions);
+    this.graphCompleteRefs = props.graphCompleteRefs || [];
+  }
+  get versions() {
+    return Object.values(this.versionsObj);
+  }
+  versionParentsToObject(versions) {
+    return versions.reduce((acc, version) => {
+      acc[version.hash.hash] = version;
+      return acc;
+    }, {});
+  }
+  id() {
+    return `${this.scope}/${this.name}:${VersionHistory.name}`;
+  }
+  static fromId(name, scope) {
+    return new VersionHistory({
+      scope,
+      name,
+      versions: []
+    });
+  }
+  toObject() {
+    return {
+      name: this.name,
+      scope: this.scope,
+      versions: this.versions.map(v => ({
+        hash: v.hash.toString(),
+        parents: v.parents.map(p => p.toString()),
+        unrelated: v.unrelated?.toString(),
+        squashed: v.squashed ? v.squashed.map(p => p.toString()) : undefined
+      })),
+      graphCompleteRefs: this.graphCompleteRefs
+    };
+  }
+  toString(pretty) {
+    const args = (0, _legacy().getStringifyArgs)(pretty);
+    return JSON.stringify(this.toObject(), ...args);
+  }
+  toBuffer(pretty) {
+    return Buffer.from(this.toString(pretty));
+  }
+  getVersionData(ref) {
+    return this.versionsObj[ref.toString()];
+  }
+  hasHash(ref) {
+    return Boolean(this.getVersionData(ref));
+  }
+  addFromVersionsObjects(versions) {
+    versions.forEach(version => {
+      const exists = this.getVersionData(version.hash());
+      if (exists) {
+        // just in case the parents got updated as a result of a merge/squash
+        exists.parents = version.parents;
+        exists.unrelated = version.unrelated?.head;
+        exists.squashed = version.squashed?.previousParents;
+      } else {
+        const versionData = (0, _component().getVersionParentsFromVersion)(version);
+        this.versionsObj[version.hash().hash] = versionData;
+      }
+    });
+  }
+  isEmpty() {
+    return !this.versions.length;
+  }
+  getAllHashesFrom(start) {
+    const item = this.getVersionData(start);
+    if (!item) return {
+      missing: [start.toString()]
+    };
+    const allHashes = [item.hash.toString()];
+    const missing = [];
+    const addHashesRecursively = ver => {
+      ver.parents.forEach(parent => {
+        if (allHashes.includes(parent.toString())) return;
+        const parentVer = this.getVersionData(parent);
+        if (!parentVer) {
+          missing.push(parent.toString());
+          return;
+        }
+        allHashes.push(parent.toString());
+        if (parentVer.parents.length) addHashesRecursively(parentVer);
+      });
+    };
+    addHashesRecursively(item);
+    return {
+      found: allHashes,
+      missing
+    };
+  }
+  isRefPartOfHistory(startFrom, searchFor) {
+    const {
+      found
+    } = this.getAllHashesFrom(startFrom);
+    return found?.includes(searchFor.toString());
+  }
+  isGraphCompleteSince(ref) {
+    if (this.graphCompleteRefs.includes(ref.toString())) return true;
+    const {
+      missing
+    } = this.getAllHashesFrom(ref);
+    const isComplete = !missing || !missing.length;
+    if (isComplete) {
+      this.graphCompleteRefs.push(ref.toString());
+      this.hasChanged = true;
+    }
+    return isComplete;
+  }
+  getAllHashesAsString() {
+    return Object.keys(this.versionsObj);
+  }
+  merge(versionHistory) {
+    const existingHashes = this.getAllHashesAsString();
+    const incomingHashes = versionHistory.getAllHashesAsString();
+    const hashesInExistingOnly = (0, _lodash().difference)(existingHashes, incomingHashes);
+    const versionsDataOnExistingOnly = this.versions.filter(v => hashesInExistingOnly.includes(v.hash.toString()));
+    const newVersions = [...versionHistory.versions, ...versionsDataOnExistingOnly];
+    this.versionsObj = this.versionParentsToObject(newVersions);
+  }
+  getAncestor(numOfGenerationsToGoBack, ref) {
+    const errorMsg = `unable to get an older parent of ${this.compId.toString()}`;
+    const versionData = this.getVersionData(ref);
+    if (!versionData) throw new (_bitError().BitError)(`${errorMsg}, version "${ref.toString()}" was not found in the version history`);
+    if (numOfGenerationsToGoBack === 0) return versionData.hash;
+    if (!versionData.parents.length) throw new (_bitError().BitError)(`${errorMsg}, version "${ref.toString()}" has no parents`);
+    const parent = versionData.parents[0];
+    return this.getAncestor(numOfGenerationsToGoBack - 1, parent);
+  }
+  getGraph(modelComponent, laneHeads, shortHash = false) {
+    const refToStr = ref => shortHash ? ref.toShortString() : ref.toString();
+    const graph = new (_graph().Graph)();
+    const allHashes = this.versions.map(v => (0, _lodash().compact)([v.hash, ...v.parents, ...(v.squashed || []), v.unrelated])).flat();
+    const getMetadata = ref => {
+      if (!modelComponent || !laneHeads) return undefined;
+      const tag = modelComponent.getTagOfRefIfExists(ref);
+      const pointers = laneHeads[ref.toString()];
+      return {
+        tag,
+        pointers
+      };
+    };
+    const nodes = allHashes.map(v => new (_graph().Node)(refToStr(v), getMetadata(v) || refToStr(v)));
+    const edges = this.versions.map(v => {
+      const verEdges = v.parents.map(p => new (_graph().Edge)(refToStr(v.hash), refToStr(p), 'parent'));
+      if (v.unrelated) verEdges.push(new (_graph().Edge)(refToStr(v.hash), refToStr(v.unrelated), 'unrelated'));
+      if (v.squashed) {
+        const squashed = v.squashed.filter(s => !v.parents.find(p => p.isEqual(s)));
+        squashed.map(p => verEdges.push(new (_graph().Edge)(refToStr(v.hash), refToStr(p), 'squashed')));
+      }
+      return verEdges;
+    }).flat();
+    graph.setNodes(nodes);
+    graph.setEdges(edges);
+    return graph;
+  }
+  get compId() {
+    return _componentId().ComponentID.fromObject({
+      scope: this.scope,
+      name: this.name
+    });
+  }
+  static create(name, scope, versions) {
+    return new VersionHistory({
+      name,
+      scope,
+      versions
+    });
+  }
+  static parse(contents) {
+    const parsed = JSON.parse(contents);
+    const props = {
+      name: parsed.name,
+      scope: parsed.scope,
+      versions: parsed.versions.map(ver => ({
+        hash: _ref().default.from(ver.hash),
+        parents: ver.parents.map(p => _ref().default.from(p)),
+        unrelated: ver.unrelated ? _ref().default.from(ver.unrelated) : undefined,
+        squashed: ver.squashed ? ver.squashed.map(p => _ref().default.from(p)) : undefined
+      })),
+      graphCompleteRefs: parsed.graphCompleteRefs
+    };
+    return new VersionHistory(props);
+  }
+}
+exports.default = VersionHistory;
+function versionParentsToGraph(versions) {
+  const refToStr = ref => ref.toString();
+  const graph = new (_graph().Graph)();
+  const allHashes = (0, _lodash().uniqBy)(versions.map(v => {
+    return (0, _lodash().compact)([v.hash, ...v.parents, ...(v.squashed || []), v.unrelated]);
+  }).flat(), 'hash');
+  const nodes = allHashes.map(v => new (_graph().Node)(refToStr(v), refToStr(v)));
+  const edges = versions.map(v => {
+    const verEdges = v.parents.map(p => new (_graph().Edge)(refToStr(v.hash), refToStr(p), 'parent'));
+    if (v.unrelated) verEdges.push(new (_graph().Edge)(refToStr(v.hash), refToStr(v.unrelated), 'unrelated'));
+    if (v.squashed) {
+      const squashed = v.squashed.filter(s => !v.parents.find(p => p.isEqual(s)));
+      squashed.map(p => verEdges.push(new (_graph().Edge)(refToStr(v.hash), refToStr(p), 'squashed')));
+    }
+    return verEdges;
+  }).flat();
+  graph.setNodes(nodes);
+  graph.setEdges(edges);
+  return graph;
+}
+
+//# sourceMappingURL=version-history.js.map

package/dist/models/version-history.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["_graph","data","require","_componentId","_bitError","_lodash","_legacy","_ref","_interopRequireDefault","_objects","_component","e","__esModule","default","_defineProperty","r","t","_toPropertyKey","Object","defineProperty","value","enumerable","configurable","writable","i","_toPrimitive","Symbol","toPrimitive","call","TypeError","String","Number","VersionHistory","BitObject","constructor","props","name","scope","versionsObj","versionParentsToObject","versions","graphCompleteRefs","values","reduce","acc","version","hash","id","fromId","toObject","map","v","toString","parents","p","unrelated","squashed","undefined","pretty","args","getStringifyArgs","JSON","stringify","toBuffer","Buffer","from","getVersionData","ref","hasHash","Boolean","addFromVersionsObjects","forEach","exists","head","previousParents","versionData","getVersionParentsFromVersion","isEmpty","length","getAllHashesFrom","start","item","missing","allHashes","addHashesRecursively","ver","parent","includes","parentVer","push","found","isRefPartOfHistory","startFrom","searchFor","isGraphCompleteSince","isComplete","hasChanged","getAllHashesAsString","keys","merge","versionHistory","existingHashes","incomingHashes","hashesInExistingOnly","difference","versionsDataOnExistingOnly","filter","newVersions","getAncestor","numOfGenerationsToGoBack","errorMsg","compId","BitError","getGraph","modelComponent","laneHeads","shortHash","refToStr","toShortString","graph","Graph","compact","flat","getMetadata","tag","getTagOfRefIfExists","pointers","nodes","Node","edges","verEdges","Edge","s","find","isEqual","setNodes","setEdges","ComponentID","fromObject","create","parse","contents","parsed","Ref","exports","versionParentsToGraph","uniqBy"],"sources":["version-history.ts"],"sourcesContent":["import { Graph, Edge, Node } from '@teambit/graph.cleargraph';\nimport { ComponentID } from '@teambit/component-id';\nimport { BitError } from '@teambit/bit-error';\nimport { compact, difference, uniqBy } from 'lodash';\nimport { getStringifyArgs } from '@teambit/legacy.utils';\nimport Ref from '../objects/ref';\nimport { BitObject } from '../objects';\nimport type Version from './version';\nimport { getVersionParentsFromVersion } from '@teambit/component.snap-distance';\nimport ModelComponent from './model-component';\n\nexport type VersionParents = {\n  hash: Ref;\n  parents: Ref[];\n  unrelated?: Ref;\n  squashed?: Ref[];\n};\n\nexport type VersionHistoryGraph = Graph<string | HashMetadata, string>;\n\ntype VersionHistoryProps = {\n  name: string;\n  scope: string;\n  versions: VersionParents[];\n  graphCompleteRefs?: string[];\n};\n\ntype HashMetadata = {\n  tag?: string;\n  pointers?: string[];\n};\n\nexport default class VersionHistory extends BitObject {\n  name: string;\n  scope: string;\n  private versionsObj: { [hash: string]: VersionParents };\n  graphCompleteRefs: string[];\n  hasChanged = false; // whether the version history has changed since the last persist\n  constructor(props: VersionHistoryProps) {\n    super();\n    this.name = props.name;\n    this.scope = props.scope;\n    this.versionsObj = this.versionParentsToObject(props.versions);\n    this.graphCompleteRefs = props.graphCompleteRefs || [];\n  }\n\n  get versions() {\n    return Object.values(this.versionsObj);\n  }\n\n  private versionParentsToObject(versions: VersionParents[]) {\n    return versions.reduce((acc, version) => {\n      acc[version.hash.hash] = version;\n      return acc;\n    }, {});\n  }\n\n  id() {\n    return `${this.scope}/${this.name}:${VersionHistory.name}`;\n  }\n\n  static fromId(name: string, scope: string) {\n    return new VersionHistory({ scope, name, versions: [] });\n  }\n\n  toObject(): Record<string, any> {\n    return {\n      name: this.name,\n      scope: this.scope,\n      versions: this.versions.map((v) => ({\n        hash: v.hash.toString(),\n        parents: v.parents.map((p) => p.toString()),\n        unrelated: v.unrelated?.toString(),\n        squashed: v.squashed ? v.squashed.map((p) => p.toString()) : undefined,\n      })),\n      graphCompleteRefs: this.graphCompleteRefs,\n    };\n  }\n\n  toString(pretty: boolean): string {\n    const args = getStringifyArgs(pretty);\n    return JSON.stringify(this.toObject(), ...args);\n  }\n\n  toBuffer(pretty): Buffer {\n    return Buffer.from(this.toString(pretty));\n  }\n\n  getVersionData(ref: Ref): VersionParents | undefined {\n    return this.versionsObj[ref.toString()];\n  }\n\n  hasHash(ref: Ref) {\n    return Boolean(this.getVersionData(ref));\n  }\n\n  addFromVersionsObjects(versions: Version[]) {\n    versions.forEach((version) => {\n      const exists = this.getVersionData(version.hash());\n      if (exists) {\n        // just in case the parents got updated as a result of a merge/squash\n        exists.parents = version.parents;\n        exists.unrelated = version.unrelated?.head;\n        exists.squashed = version.squashed?.previousParents;\n      } else {\n        const versionData = getVersionParentsFromVersion(version);\n        this.versionsObj[version.hash().hash] = versionData;\n      }\n    });\n  }\n\n  isEmpty() {\n    return !this.versions.length;\n  }\n\n  getAllHashesFrom(start: Ref): { found?: string[]; missing?: string[] } {\n    const item = this.getVersionData(start);\n    if (!item) return { missing: [start.toString()] };\n    const allHashes: string[] = [item.hash.toString()];\n    const missing: string[] = [];\n    const addHashesRecursively = (ver: VersionParents) => {\n      ver.parents.forEach((parent) => {\n        if (allHashes.includes(parent.toString())) return;\n        const parentVer = this.getVersionData(parent);\n        if (!parentVer) {\n          missing.push(parent.toString());\n          return;\n        }\n        allHashes.push(parent.toString());\n        if (parentVer.parents.length) addHashesRecursively(parentVer);\n      });\n    };\n    addHashesRecursively(item);\n    return { found: allHashes, missing };\n  }\n\n  isRefPartOfHistory(startFrom: Ref, searchFor: Ref) {\n    const { found } = this.getAllHashesFrom(startFrom);\n    return found?.includes(searchFor.toString());\n  }\n\n  isGraphCompleteSince(ref: Ref) {\n    if (this.graphCompleteRefs.includes(ref.toString())) return true;\n    const { missing } = this.getAllHashesFrom(ref);\n    const isComplete = !missing || !missing.length;\n    if (isComplete) {\n      this.graphCompleteRefs.push(ref.toString());\n      this.hasChanged = true;\n    }\n    return isComplete;\n  }\n\n  getAllHashesAsString(): string[] {\n    return Object.keys(this.versionsObj);\n  }\n\n  merge(versionHistory: VersionHistory) {\n    const existingHashes = this.getAllHashesAsString();\n    const incomingHashes = versionHistory.getAllHashesAsString();\n    const hashesInExistingOnly = difference(existingHashes, incomingHashes);\n    const versionsDataOnExistingOnly = this.versions.filter((v) => hashesInExistingOnly.includes(v.hash.toString()));\n    const newVersions = [...versionHistory.versions, ...versionsDataOnExistingOnly];\n    this.versionsObj = this.versionParentsToObject(newVersions);\n  }\n\n  getAncestor(numOfGenerationsToGoBack: number, ref: Ref): Ref {\n    const errorMsg = `unable to get an older parent of ${this.compId.toString()}`;\n    const versionData = this.getVersionData(ref);\n    if (!versionData)\n      throw new BitError(`${errorMsg}, version \"${ref.toString()}\" was not found in the version history`);\n    if (numOfGenerationsToGoBack === 0) return versionData.hash;\n    if (!versionData.parents.length) throw new BitError(`${errorMsg}, version \"${ref.toString()}\" has no parents`);\n    const parent = versionData.parents[0];\n    return this.getAncestor(numOfGenerationsToGoBack - 1, parent);\n  }\n\n  getGraph(\n    modelComponent?: ModelComponent,\n    laneHeads?: { [hash: string]: string[] },\n    shortHash = false\n  ): VersionHistoryGraph {\n    const refToStr = (ref: Ref) => (shortHash ? ref.toShortString() : ref.toString());\n    const graph = new Graph<string | HashMetadata, string>();\n    const allHashes = this.versions\n      .map((v) => compact([v.hash, ...v.parents, ...(v.squashed || []), v.unrelated]))\n      .flat();\n\n    const getMetadata = (ref: Ref): HashMetadata | undefined => {\n      if (!modelComponent || !laneHeads) return undefined;\n      const tag = modelComponent.getTagOfRefIfExists(ref);\n      const pointers = laneHeads[ref.toString()];\n      return { tag, pointers };\n    };\n    const nodes = allHashes.map((v) => new Node(refToStr(v), getMetadata(v) || refToStr(v)));\n    const edges = this.versions\n      .map((v) => {\n        const verEdges = v.parents.map((p) => new Edge(refToStr(v.hash), refToStr(p), 'parent'));\n        if (v.unrelated) verEdges.push(new Edge(refToStr(v.hash), refToStr(v.unrelated), 'unrelated'));\n        if (v.squashed) {\n          const squashed = v.squashed.filter((s) => !v.parents.find((p) => p.isEqual(s)));\n          squashed.map((p) => verEdges.push(new Edge(refToStr(v.hash), refToStr(p), 'squashed')));\n        }\n        return verEdges;\n      })\n      .flat();\n    graph.setNodes(nodes);\n    graph.setEdges(edges);\n    return graph;\n  }\n\n  get compId() {\n    return ComponentID.fromObject({ scope: this.scope, name: this.name });\n  }\n\n  static create(name: string, scope: string, versions: VersionParents[]) {\n    return new VersionHistory({\n      name,\n      scope,\n      versions,\n    });\n  }\n\n  static parse(contents: string): VersionHistory {\n    const parsed = JSON.parse(contents);\n    const props: VersionHistoryProps = {\n      name: parsed.name,\n      scope: parsed.scope,\n      versions: parsed.versions.map((ver) => ({\n        hash: Ref.from(ver.hash),\n        parents: ver.parents.map((p) => Ref.from(p)),\n        unrelated: ver.unrelated ? Ref.from(ver.unrelated) : undefined,\n        squashed: ver.squashed ? ver.squashed.map((p) => Ref.from(p)) : undefined,\n      })),\n      graphCompleteRefs: parsed.graphCompleteRefs,\n    };\n    return new VersionHistory(props);\n  }\n}\n\nexport function versionParentsToGraph(versions: VersionParents[]): Graph<string, string> {\n  const refToStr = (ref: Ref) => ref.toString();\n  const graph = new Graph<string, string>();\n  const allHashes = uniqBy(\n    versions\n      .map((v) => {\n        return compact([v.hash, ...v.parents, ...(v.squashed || []), v.unrelated]);\n      })\n      .flat(),\n    'hash'\n  );\n  const nodes = allHashes.map((v) => new Node(refToStr(v), refToStr(v)));\n  const edges = versions\n    .map((v) => {\n      const verEdges = v.parents.map((p) => new Edge(refToStr(v.hash), refToStr(p), 'parent'));\n      if (v.unrelated) verEdges.push(new Edge(refToStr(v.hash), refToStr(v.unrelated), 'unrelated'));\n      if (v.squashed) {\n        const squashed = v.squashed.filter((s) => !v.parents.find((p) => p.isEqual(s)));\n        squashed.map((p) => verEdges.push(new Edge(refToStr(v.hash), refToStr(p), 'squashed')));\n      }\n      return verEdges;\n    })\n    .flat();\n  graph.setNodes(nodes);\n  graph.setEdges(edges);\n  return graph;\n}\n"],"mappings":";;;;;;;AAAA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,aAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,YAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,UAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,SAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,QAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,OAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAK,QAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,OAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAM,KAAA;EAAA,MAAAN,IAAA,GAAAO,sBAAA,CAAAN,OAAA;EAAAK,IAAA,YAAAA,CAAA;IAAA,OAAAN,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAQ,SAAA;EAAA,MAAAR,IAAA,GAAAC,OAAA;EAAAO,QAAA,YAAAA,CAAA;IAAA,OAAAR,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAS,WAAA;EAAA,MAAAT,IAAA,GAAAC,OAAA;EAAAQ,UAAA,YAAAA,CAAA;IAAA,OAAAT,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAAgF,SAAAO,uBAAAG,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAAA,SAAAG,gBAAAH,CAAA,EAAAI,CAAA,EAAAC,CAAA,YAAAD,CAAA,GAAAE,cAAA,CAAAF,CAAA,MAAAJ,CAAA,GAAAO,MAAA,CAAAC,cAAA,CAAAR,CAAA,EAAAI,CAAA,IAAAK,KAAA,EAAAJ,CAAA,EAAAK,UAAA,MAAAC,YAAA,MAAAC,QAAA,UAAAZ,CAAA,CAAAI,CAAA,IAAAC,CAAA,EAAAL,CAAA;AAAA,SAAAM,eAAAD,CAAA,QAAAQ,CAAA,GAAAC,YAAA,CAAAT,CAAA,uCAAAQ,CAAA,GAAAA,CAAA,GAAAA,CAAA;AAAA,SAAAC,aAAAT,CAAA,EAAAD,CAAA,2BAAAC,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAL,CAAA,GAAAK,CAAA,CAAAU,MAAA,CAAAC,WAAA,kBAAAhB,CAAA,QAAAa,CAAA,GAAAb,CAAA,CAAAiB,IAAA,CAAAZ,CAAA,EAAAD,CAAA,uCAAAS,CAAA,SAAAA,CAAA,YAAAK,SAAA,yEAAAd,CAAA,GAAAe,MAAA,GAAAC,MAAA,EAAAf,CAAA;AAwBjE,MAAMgB,cAAc,SAASC,oBAAS,CAAC;EAKhC;EACpBC,WAAWA,CAACC,KAA0B,EAAE;IACtC,KAAK,CAAC,CAAC;IAACrB,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA;IAAAA,eAAA,qBAFG,KAAK;IAGhB,IAAI,CAACsB,IAAI,GAAGD,KAAK,CAACC,IAAI;IACtB,IAAI,CAACC,KAAK,GAAGF,KAAK,CAACE,KAAK;IACxB,IAAI,CAACC,WAAW,GAAG,IAAI,CAACC,sBAAsB,CAACJ,KAAK,CAACK,QAAQ,CAAC;IAC9D,IAAI,CAACC,iBAAiB,GAAGN,KAAK,CAACM,iBAAiB,IAAI,EAAE;EACxD;EAEA,IAAID,QAAQA,CAAA,EAAG;IACb,OAAOtB,MAAM,CAACwB,MAAM,CAAC,IAAI,CAACJ,WAAW,CAAC;EACxC;EAEQC,sBAAsBA,CAACC,QAA0B,EAAE;IACzD,OAAOA,QAAQ,CAACG,MAAM,CAAC,CAACC,GAAG,EAAEC,OAAO,KAAK;MACvCD,GAAG,CAACC,OAAO,CAACC,IAAI,CAACA,IAAI,CAAC,GAAGD,OAAO;MAChC,OAAOD,GAAG;IACZ,CAAC,EAAE,CAAC,CAAC,CAAC;EACR;EAEAG,EAAEA,CAAA,EAAG;IACH,OAAO,GAAG,IAAI,CAACV,KAAK,IAAI,IAAI,CAACD,IAAI,IAAIJ,cAAc,CAACI,IAAI,EAAE;EAC5D;EAEA,OAAOY,MAAMA,CAACZ,IAAY,EAAEC,KAAa,EAAE;IACzC,OAAO,IAAIL,cAAc,CAAC;MAAEK,KAAK;MAAED,IAAI;MAAEI,QAAQ,EAAE;IAAG,CAAC,CAAC;EAC1D;EAEAS,QAAQA,CAAA,EAAwB;IAC9B,OAAO;MACLb,IAAI,EAAE,IAAI,CAACA,IAAI;MACfC,KAAK,EAAE,IAAI,CAACA,KAAK;MACjBG,QAAQ,EAAE,IAAI,CAACA,QAAQ,CAACU,GAAG,CAAEC,CAAC,KAAM;QAClCL,IAAI,EAAEK,CAAC,CAACL,IAAI,CAACM,QAAQ,CAAC,CAAC;QACvBC,OAAO,EAAEF,CAAC,CAACE,OAAO,CAACH,GAAG,CAAEI,CAAC,IAAKA,CAAC,CAACF,QAAQ,CAAC,CAAC,CAAC;QAC3CG,SAAS,EAAEJ,CAAC,CAACI,SAAS,EAAEH,QAAQ,CAAC,CAAC;QAClCI,QAAQ,EAAEL,CAAC,CAACK,QAAQ,GAAGL,CAAC,CAACK,QAAQ,CAACN,GAAG,CAAEI,CAAC,IAAKA,CAAC,CAACF,QAAQ,CAAC,CAAC,CAAC,GAAGK;MAC/D,CAAC,CAAC,CAAC;MACHhB,iBAAiB,EAAE,IAAI,CAACA;IAC1B,CAAC;EACH;EAEAW,QAAQA,CAACM,MAAe,EAAU;IAChC,MAAMC,IAAI,GAAG,IAAAC,0BAAgB,EAACF,MAAM,CAAC;IACrC,OAAOG,IAAI,CAACC,SAAS,CAAC,IAAI,CAACb,QAAQ,CAAC,CAAC,EAAE,GAAGU,IAAI,CAAC;EACjD;EAEAI,QAAQA,CAACL,MAAM,EAAU;IACvB,OAAOM,MAAM,CAACC,IAAI,CAAC,IAAI,CAACb,QAAQ,CAACM,MAAM,CAAC,CAAC;EAC3C;EAEAQ,cAAcA,CAACC,GAAQ,EAA8B;IACnD,OAAO,IAAI,CAAC7B,WAAW,CAAC6B,GAAG,CAACf,QAAQ,CAAC,CAAC,CAAC;EACzC;EAEAgB,OAAOA,CAACD,GAAQ,EAAE;IAChB,OAAOE,OAAO,CAAC,IAAI,CAACH,cAAc,CAACC,GAAG,CAAC,CAAC;EAC1C;EAEAG,sBAAsBA,CAAC9B,QAAmB,EAAE;IAC1CA,QAAQ,CAAC+B,OAAO,CAAE1B,OAAO,IAAK;MAC5B,MAAM2B,MAAM,GAAG,IAAI,CAACN,cAAc,CAACrB,OAAO,CAACC,IAAI,CAAC,CAAC,CAAC;MAClD,IAAI0B,MAAM,EAAE;QACV;QACAA,MAAM,CAACnB,OAAO,GAAGR,OAAO,CAACQ,OAAO;QAChCmB,MAAM,CAACjB,SAAS,GAAGV,OAAO,CAACU,SAAS,EAAEkB,IAAI;QAC1CD,MAAM,CAAChB,QAAQ,GAAGX,OAAO,CAACW,QAAQ,EAAEkB,eAAe;MACrD,CAAC,MAAM;QACL,MAAMC,WAAW,GAAG,IAAAC,yCAA4B,EAAC/B,OAAO,CAAC;QACzD,IAAI,CAACP,WAAW,CAACO,OAAO,CAACC,IAAI,CAAC,CAAC,CAACA,IAAI,CAAC,GAAG6B,WAAW;MACrD;IACF,CAAC,CAAC;EACJ;EAEAE,OAAOA,CAAA,EAAG;IACR,OAAO,CAAC,IAAI,CAACrC,QAAQ,CAACsC,MAAM;EAC9B;EAEAC,gBAAgBA,CAACC,KAAU,EAA4C;IACrE,MAAMC,IAAI,GAAG,IAAI,CAACf,cAAc,CAACc,KAAK,CAAC;IACvC,IAAI,CAACC,IAAI,EAAE,OAAO;MAAEC,OAAO,EAAE,CAACF,KAAK,CAAC5B,QAAQ,CAAC,CAAC;IAAE,CAAC;IACjD,MAAM+B,SAAmB,GAAG,CAACF,IAAI,CAACnC,IAAI,CAACM,QAAQ,CAAC,CAAC,CAAC;IAClD,MAAM8B,OAAiB,GAAG,EAAE;IAC5B,MAAME,oBAAoB,GAAIC,GAAmB,IAAK;MACpDA,GAAG,CAAChC,OAAO,CAACkB,OAAO,CAAEe,MAAM,IAAK;QAC9B,IAAIH,SAAS,CAACI,QAAQ,CAACD,MAAM,CAAClC,QAAQ,CAAC,CAAC,CAAC,EAAE;QAC3C,MAAMoC,SAAS,GAAG,IAAI,CAACtB,cAAc,CAACoB,MAAM,CAAC;QAC7C,IAAI,CAACE,SAAS,EAAE;UACdN,OAAO,CAACO,IAAI,CAACH,MAAM,CAAClC,QAAQ,CAAC,CAAC,CAAC;UAC/B;QACF;QACA+B,SAAS,CAACM,IAAI,CAACH,MAAM,CAAClC,QAAQ,CAAC,CAAC,CAAC;QACjC,IAAIoC,SAAS,CAACnC,OAAO,CAACyB,MAAM,EAAEM,oBAAoB,CAACI,SAAS,CAAC;MAC/D,CAAC,CAAC;IACJ,CAAC;IACDJ,oBAAoB,CAACH,IAAI,CAAC;IAC1B,OAAO;MAAES,KAAK,EAAEP,SAAS;MAAED;IAAQ,CAAC;EACtC;EAEAS,kBAAkBA,CAACC,SAAc,EAAEC,SAAc,EAAE;IACjD,MAAM;MAAEH;IAAM,CAAC,GAAG,IAAI,CAACX,gBAAgB,CAACa,SAAS,CAAC;IAClD,OAAOF,KAAK,EAAEH,QAAQ,CAACM,SAAS,CAACzC,QAAQ,CAAC,CAAC,CAAC;EAC9C;EAEA0C,oBAAoBA,CAAC3B,GAAQ,EAAE;IAC7B,IAAI,IAAI,CAAC1B,iBAAiB,CAAC8C,QAAQ,CAACpB,GAAG,CAACf,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI;IAChE,MAAM;MAAE8B;IAAQ,CAAC,GAAG,IAAI,CAACH,gBAAgB,CAACZ,GAAG,CAAC;IAC9C,MAAM4B,UAAU,GAAG,CAACb,OAAO,IAAI,CAACA,OAAO,CAACJ,MAAM;IAC9C,IAAIiB,UAAU,EAAE;MACd,IAAI,CAACtD,iBAAiB,CAACgD,IAAI,CAACtB,GAAG,CAACf,QAAQ,CAAC,CAAC,CAAC;MAC3C,IAAI,CAAC4C,UAAU,GAAG,IAAI;IACxB;IACA,OAAOD,UAAU;EACnB;EAEAE,oBAAoBA,CAAA,EAAa;IAC/B,OAAO/E,MAAM,CAACgF,IAAI,CAAC,IAAI,CAAC5D,WAAW,CAAC;EACtC;EAEA6D,KAAKA,CAACC,cAA8B,EAAE;IACpC,MAAMC,cAAc,GAAG,IAAI,CAACJ,oBAAoB,CAAC,CAAC;IAClD,MAAMK,cAAc,GAAGF,cAAc,CAACH,oBAAoB,CAAC,CAAC;IAC5D,MAAMM,oBAAoB,GAAG,IAAAC,oBAAU,EAACH,cAAc,EAAEC,cAAc,CAAC;IACvE,MAAMG,0BAA0B,GAAG,IAAI,CAACjE,QAAQ,CAACkE,MAAM,CAAEvD,CAAC,IAAKoD,oBAAoB,CAAChB,QAAQ,CAACpC,CAAC,CAACL,IAAI,CAACM,QAAQ,CAAC,CAAC,CAAC,CAAC;IAChH,MAAMuD,WAAW,GAAG,CAAC,GAAGP,cAAc,CAAC5D,QAAQ,EAAE,GAAGiE,0BAA0B,CAAC;IAC/E,IAAI,CAACnE,WAAW,GAAG,IAAI,CAACC,sBAAsB,CAACoE,WAAW,CAAC;EAC7D;EAEAC,WAAWA,CAACC,wBAAgC,EAAE1C,GAAQ,EAAO;IAC3D,MAAM2C,QAAQ,GAAG,oCAAoC,IAAI,CAACC,MAAM,CAAC3D,QAAQ,CAAC,CAAC,EAAE;IAC7E,MAAMuB,WAAW,GAAG,IAAI,CAACT,cAAc,CAACC,GAAG,CAAC;IAC5C,IAAI,CAACQ,WAAW,EACd,MAAM,KAAIqC,oBAAQ,EAAC,GAAGF,QAAQ,cAAc3C,GAAG,CAACf,QAAQ,CAAC,CAAC,wCAAwC,CAAC;IACrG,IAAIyD,wBAAwB,KAAK,CAAC,EAAE,OAAOlC,WAAW,CAAC7B,IAAI;IAC3D,IAAI,CAAC6B,WAAW,CAACtB,OAAO,CAACyB,MAAM,EAAE,MAAM,KAAIkC,oBAAQ,EAAC,GAAGF,QAAQ,cAAc3C,GAAG,CAACf,QAAQ,CAAC,CAAC,kBAAkB,CAAC;IAC9G,MAAMkC,MAAM,GAAGX,WAAW,CAACtB,OAAO,CAAC,CAAC,CAAC;IACrC,OAAO,IAAI,CAACuD,WAAW,CAACC,wBAAwB,GAAG,CAAC,EAAEvB,MAAM,CAAC;EAC/D;EAEA2B,QAAQA,CACNC,cAA+B,EAC/BC,SAAwC,EACxCC,SAAS,GAAG,KAAK,EACI;IACrB,MAAMC,QAAQ,GAAIlD,GAAQ,IAAMiD,SAAS,GAAGjD,GAAG,CAACmD,aAAa,CAAC,CAAC,GAAGnD,GAAG,CAACf,QAAQ,CAAC,CAAE;IACjF,MAAMmE,KAAK,GAAG,KAAIC,cAAK,EAAgC,CAAC;IACxD,MAAMrC,SAAS,GAAG,IAAI,CAAC3C,QAAQ,CAC5BU,GAAG,CAAEC,CAAC,IAAK,IAAAsE,iBAAO,EAAC,CAACtE,CAAC,CAACL,IAAI,EAAE,GAAGK,CAAC,CAACE,OAAO,EAAE,IAAIF,CAAC,CAACK,QAAQ,IAAI,EAAE,CAAC,EAAEL,CAAC,CAACI,SAAS,CAAC,CAAC,CAAC,CAC/EmE,IAAI,CAAC,CAAC;IAET,MAAMC,WAAW,GAAIxD,GAAQ,IAA+B;MAC1D,IAAI,CAAC+C,cAAc,IAAI,CAACC,SAAS,EAAE,OAAO1D,SAAS;MACnD,MAAMmE,GAAG,GAAGV,cAAc,CAACW,mBAAmB,CAAC1D,GAAG,CAAC;MACnD,MAAM2D,QAAQ,GAAGX,SAAS,CAAChD,GAAG,CAACf,QAAQ,CAAC,CAAC,CAAC;MAC1C,OAAO;QAAEwE,GAAG;QAAEE;MAAS,CAAC;IAC1B,CAAC;IACD,MAAMC,KAAK,GAAG5C,SAAS,CAACjC,GAAG,CAAEC,CAAC,IAAK,KAAI6E,aAAI,EAACX,QAAQ,CAAClE,CAAC,CAAC,EAAEwE,WAAW,CAACxE,CAAC,CAAC,IAAIkE,QAAQ,CAAClE,CAAC,CAAC,CAAC,CAAC;IACxF,MAAM8E,KAAK,GAAG,IAAI,CAACzF,QAAQ,CACxBU,GAAG,CAAEC,CAAC,IAAK;MACV,MAAM+E,QAAQ,GAAG/E,CAAC,CAACE,OAAO,CAACH,GAAG,CAAEI,CAAC,IAAK,KAAI6E,aAAI,EAACd,QAAQ,CAAClE,CAAC,CAACL,IAAI,CAAC,EAAEuE,QAAQ,CAAC/D,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;MACxF,IAAIH,CAAC,CAACI,SAAS,EAAE2E,QAAQ,CAACzC,IAAI,CAAC,KAAI0C,aAAI,EAACd,QAAQ,CAAClE,CAAC,CAACL,IAAI,CAAC,EAAEuE,QAAQ,CAAClE,CAAC,CAACI,SAAS,CAAC,EAAE,WAAW,CAAC,CAAC;MAC9F,IAAIJ,CAAC,CAACK,QAAQ,EAAE;QACd,MAAMA,QAAQ,GAAGL,CAAC,CAACK,QAAQ,CAACkD,MAAM,CAAE0B,CAAC,IAAK,CAACjF,CAAC,CAACE,OAAO,CAACgF,IAAI,CAAE/E,CAAC,IAAKA,CAAC,CAACgF,OAAO,CAACF,CAAC,CAAC,CAAC,CAAC;QAC/E5E,QAAQ,CAACN,GAAG,CAAEI,CAAC,IAAK4E,QAAQ,CAACzC,IAAI,CAAC,KAAI0C,aAAI,EAACd,QAAQ,CAAClE,CAAC,CAACL,IAAI,CAAC,EAAEuE,QAAQ,CAAC/D,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;MACzF;MACA,OAAO4E,QAAQ;IACjB,CAAC,CAAC,CACDR,IAAI,CAAC,CAAC;IACTH,KAAK,CAACgB,QAAQ,CAACR,KAAK,CAAC;IACrBR,KAAK,CAACiB,QAAQ,CAACP,KAAK,CAAC;IACrB,OAAOV,KAAK;EACd;EAEA,IAAIR,MAAMA,CAAA,EAAG;IACX,OAAO0B,0BAAW,CAACC,UAAU,CAAC;MAAErG,KAAK,EAAE,IAAI,CAACA,KAAK;MAAED,IAAI,EAAE,IAAI,CAACA;IAAK,CAAC,CAAC;EACvE;EAEA,OAAOuG,MAAMA,CAACvG,IAAY,EAAEC,KAAa,EAAEG,QAA0B,EAAE;IACrE,OAAO,IAAIR,cAAc,CAAC;MACxBI,IAAI;MACJC,KAAK;MACLG;IACF,CAAC,CAAC;EACJ;EAEA,OAAOoG,KAAKA,CAACC,QAAgB,EAAkB;IAC7C,MAAMC,MAAM,GAAGjF,IAAI,CAAC+E,KAAK,CAACC,QAAQ,CAAC;IACnC,MAAM1G,KAA0B,GAAG;MACjCC,IAAI,EAAE0G,MAAM,CAAC1G,IAAI;MACjBC,KAAK,EAAEyG,MAAM,CAACzG,KAAK;MACnBG,QAAQ,EAAEsG,MAAM,CAACtG,QAAQ,CAACU,GAAG,CAAEmC,GAAG,KAAM;QACtCvC,IAAI,EAAEiG,cAAG,CAAC9E,IAAI,CAACoB,GAAG,CAACvC,IAAI,CAAC;QACxBO,OAAO,EAAEgC,GAAG,CAAChC,OAAO,CAACH,GAAG,CAAEI,CAAC,IAAKyF,cAAG,CAAC9E,IAAI,CAACX,CAAC,CAAC,CAAC;QAC5CC,SAAS,EAAE8B,GAAG,CAAC9B,SAAS,GAAGwF,cAAG,CAAC9E,IAAI,CAACoB,GAAG,CAAC9B,SAAS,CAAC,GAAGE,SAAS;QAC9DD,QAAQ,EAAE6B,GAAG,CAAC7B,QAAQ,GAAG6B,GAAG,CAAC7B,QAAQ,CAACN,GAAG,CAAEI,CAAC,IAAKyF,cAAG,CAAC9E,IAAI,CAACX,CAAC,CAAC,CAAC,GAAGG;MAClE,CAAC,CAAC,CAAC;MACHhB,iBAAiB,EAAEqG,MAAM,CAACrG;IAC5B,CAAC;IACD,OAAO,IAAIT,cAAc,CAACG,KAAK,CAAC;EAClC;AACF;AAAC6G,OAAA,CAAAnI,OAAA,GAAAmB,cAAA;AAEM,SAASiH,qBAAqBA,CAACzG,QAA0B,EAAyB;EACvF,MAAM6E,QAAQ,GAAIlD,GAAQ,IAAKA,GAAG,CAACf,QAAQ,CAAC,CAAC;EAC7C,MAAMmE,KAAK,GAAG,KAAIC,cAAK,EAAiB,CAAC;EACzC,MAAMrC,SAAS,GAAG,IAAA+D,gBAAM,EACtB1G,QAAQ,CACLU,GAAG,CAAEC,CAAC,IAAK;IACV,OAAO,IAAAsE,iBAAO,EAAC,CAACtE,CAAC,CAACL,IAAI,EAAE,GAAGK,CAAC,CAACE,OAAO,EAAE,IAAIF,CAAC,CAACK,QAAQ,IAAI,EAAE,CAAC,EAAEL,CAAC,CAACI,SAAS,CAAC,CAAC;EAC5E,CAAC,CAAC,CACDmE,IAAI,CAAC,CAAC,EACT,MACF,CAAC;EACD,MAAMK,KAAK,GAAG5C,SAAS,CAACjC,GAAG,CAAEC,CAAC,IAAK,KAAI6E,aAAI,EAACX,QAAQ,CAAClE,CAAC,CAAC,EAAEkE,QAAQ,CAAClE,CAAC,CAAC,CAAC,CAAC;EACtE,MAAM8E,KAAK,GAAGzF,QAAQ,CACnBU,GAAG,CAAEC,CAAC,IAAK;IACV,MAAM+E,QAAQ,GAAG/E,CAAC,CAACE,OAAO,CAACH,GAAG,CAAEI,CAAC,IAAK,KAAI6E,aAAI,EAACd,QAAQ,CAAClE,CAAC,CAACL,IAAI,CAAC,EAAEuE,QAAQ,CAAC/D,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;IACxF,IAAIH,CAAC,CAACI,SAAS,EAAE2E,QAAQ,CAACzC,IAAI,CAAC,KAAI0C,aAAI,EAACd,QAAQ,CAAClE,CAAC,CAACL,IAAI,CAAC,EAAEuE,QAAQ,CAAClE,CAAC,CAACI,SAAS,CAAC,EAAE,WAAW,CAAC,CAAC;IAC9F,IAAIJ,CAAC,CAACK,QAAQ,EAAE;MACd,MAAMA,QAAQ,GAAGL,CAAC,CAACK,QAAQ,CAACkD,MAAM,CAAE0B,CAAC,IAAK,CAACjF,CAAC,CAACE,OAAO,CAACgF,IAAI,CAAE/E,CAAC,IAAKA,CAAC,CAACgF,OAAO,CAACF,CAAC,CAAC,CAAC,CAAC;MAC/E5E,QAAQ,CAACN,GAAG,CAAEI,CAAC,IAAK4E,QAAQ,CAACzC,IAAI,CAAC,KAAI0C,aAAI,EAACd,QAAQ,CAAClE,CAAC,CAACL,IAAI,CAAC,EAAEuE,QAAQ,CAAC/D,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC;IACzF;IACA,OAAO4E,QAAQ;EACjB,CAAC,CAAC,CACDR,IAAI,CAAC,CAAC;EACTH,KAAK,CAACgB,QAAQ,CAACR,KAAK,CAAC;EACrBR,KAAK,CAACiB,QAAQ,CAACP,KAAK,CAAC;EACrB,OAAOV,KAAK;AACd","ignoreList":[]}