breeze-client 2.2.2 → 3.0.0

package/{fesm2022/breeze-client-mixin-get-entity-graph.mjs → mixins/mixin-get-entity-graph.js}

@@ -1,254 +1,332 @@
-import { EntityManager, EntityQuery, EntityState, ExpandClause } from 'breeze-client';
-
-//#region Copyright, Version, and Description
-function mixinEntityGraph(emclass) {
-    const proto = EntityManager.prototype;
-    if (!proto.getEntityGraph) {
-        proto.getEntityGraph = getEntityGraph;
-    }
-}
-mixinEntityGraph(EntityManager);
-function getEntityGraph(roots, expand) {
-    if (roots instanceof EntityQuery) {
-        let newRoots = this.executeQueryLocally(roots);
-        return getEntityGraphCore(newRoots, expand || roots.expandClause);
-    }
-    else {
-        return getEntityGraphCore(roots, expand);
-    }
-}
-function getEntityGraphCore(root, expand) {
-    let entityGroupMap;
-    let graph = [];
-    let rootType;
-    let roots = Array.isArray(root) ? root : [root];
-    addToGraph(roots); // removes dups & nulls
-    roots = graph.slice(); // copy of de-duped roots
-    if (roots.length) {
-        getRootInfo();
-        getExpand();
-        buildGraph();
-    }
-    return graph;
-    function addToGraph(entities) {
-        entities.forEach(function (entity) {
-            if (entity && graph.indexOf(entity) < 0) {
-                graph.push(entity);
-            }
-        });
-    }
-    function getRootInfo() {
-        let compatTypes;
-        roots.forEach(function (root, ix) {
-            let aspect;
-            if (!root || !(aspect = root.entityAspect)) {
-                throw getRootErr(ix, 'is not an entity');
-            }
-            if (aspect.entityState === EntityState.Detached) {
-                throw getRootErr(ix, 'is a detached entity');
-            }
-            let em = aspect.entityManager;
-            if (entityGroupMap) {
-                if (entityGroupMap !== em._entityGroupMap) {
-                    throw getRootErr(ix, "has a different 'EntityManager' than other roots");
-                }
-            }
-            else {
-                entityGroupMap = em._entityGroupMap;
-            }
-            getRootType(root, ix);
-        });
-        function getRootErr(ix, msg) {
-            return new Error("'getEntityGraph' root[" + ix + "] " + msg);
-        }
-        function getRootType(root, ix) {
-            let thisType = root.entityType;
-            if (!rootType) {
-                rootType = thisType;
-                return;
-            }
-            else if (rootType === thisType) {
-                return;
-            }
-            // Types differs. Look for closest common base type
-            // does thisType derive from current rootType?
-            let baseType = rootType;
-            do {
-                compatTypes = compatTypes || baseType.getSelfAndSubtypes();
-                if (compatTypes.indexOf(thisType) > -1) {
-                    rootType = baseType;
-                    return;
-                }
-                baseType = baseType.baseEntityType;
-                compatTypes = null;
-            } while (baseType);
-            // does current rootType derives from thisType?
-            baseType = thisType;
-            do {
-                compatTypes = baseType.getSelfAndSubtypes();
-                if (compatTypes.indexOf(rootType) > -1) {
-                    rootType = baseType;
-                    return;
-                }
-                baseType = baseType.baseEntityType;
-            } while (baseType);
-            throw getRootErr(ix, "is not EntityType-compatible with other roots");
-        }
-    }
-    function getExpand() {
-        try {
-            if (!expand) {
-                expand = [];
-            }
-            else if (typeof expand === 'string') {
-                // tricky because Breeze expandClause not exposed publically
-                expand = new EntityQuery().expand(expand).expandClause;
-            }
-            if (expand instanceof ExpandClause && expand.propertyPaths) { // expand clause
-                expand = expand.propertyPaths;
-            }
-            else if (Array.isArray(expand)) {
-                if (!expand.every(function (elem) { return typeof elem === 'string'; })) {
-                    throw '';
-                }
-            }
-            else {
-                throw '';
-            }
-        }
-        catch (_) {
-            throw new Error("expand must be an expand string, array of string paths, or a query expand clause");
-        }
-    }
-    function buildGraph() {
-        if (expand && expand instanceof Array && expand.length) {
-            let fns = expand.map(makePathFn);
-            fns.forEach(function (fn) { fn(roots); });
-        }
-    }
-    // Make function to get entities along a single expand path
-    // such as 'Orders.OrderDetails.Product'
-    function makePathFn(path) {
-        let fns = [], segments = path.split('.'), type = rootType;
-        for (let i = 0, slen = segments.length; i < slen; i++) {
-            let f = makePathSegmentFn(type, segments[i]);
-            type = f.navType;
-            fns.push(f);
-        }
-        return function pathFn(entities) {
-            for (let j = 0, flen = fns.length; j < flen; j++) {
-                let elen = entities.length;
-                if (elen === 0) {
-                    return;
-                } // nothing left to explore
-                // fn to get related entities for this path segment
-                let fn = fns[j];
-                // get entities related by this path segment
-                let related = [];
-                for (let k = 0; k < elen; k++) {
-                    related = related.concat(fn(entities[k]));
-                }
-                addToGraph(related);
-                if (j >= flen - 1) {
-                    return;
-                } // no more path segments
-                // reset entities to deduped related entities
-                entities = [];
-                for (let l = 0, rlen = related.length; l < rlen; l++) {
-                    let r = related[l];
-                    if (entities.indexOf(r) < 0) {
-                        entities.push(r);
-                    }
-                }
-            }
-        };
-    }
-    // Make function to get entities along a single expand path segment
-    // such as the 'OrderDetails' in the 'Orders.OrderDetails.Product' path
-    function makePathSegmentFn(baseType, segment) {
-        let baseTypeName, fn = undefined, navType;
-        try {
-            baseTypeName = baseType.name;
-            let nav = baseType.getNavigationProperty(segment);
-            let fkName = nav.foreignKeyNames[0];
-            if (!nav) {
-                throw new Error(segment + " is not a navigation property of " + baseTypeName);
-            }
-            navType = nav.entityType;
-            // add derived types
-            let navTypes = navType.getSelfAndSubtypes();
-            let grps = []; // non-empty groups for these types
-            navTypes.forEach(function (t) {
-                let grp = entityGroupMap[t.name];
-                if (grp && grp._entities.length > 0) {
-                    grps.push(grp);
-                }
-            });
-            let grpCount = grps.length;
-            if (grpCount === 0) {
-                // no related entities in cache
-                fn = function () { return []; };
-            }
-            else if (fkName) {
-                fn = function (entity) {
-                    let val = null;
-                    try {
-                        let keyValue = entity.getProperty(fkName);
-                        for (let i = 0; i < grpCount; i += 1) {
-                            val = grps[i]._entities[grps[i]._indexMap[keyValue]];
-                            if (val) {
-                                break;
-                            }
-                        }
-                    }
-                    catch (e) {
-                        rethrow(e);
-                    }
-                    return val;
-                };
-            }
-            else {
-                fkName = nav.inverse ?
-                    nav.inverse.foreignKeyNames[0] :
-                    nav.invForeignKeyNames[0];
-                if (!fkName) {
-                    throw new Error("No inverse keys");
-                }
-                fn = function (entity) {
-                    let vals = [];
-                    try {
-                        let keyValue = entity.entityAspect.getKey().values[0];
-                        grps.forEach(function (grp) {
-                            vals = vals.concat(grp._entities.filter(function (en) {
-                                return en && en.getProperty(fkName) === keyValue;
-                            }));
-                        });
-                    }
-                    catch (e) {
-                        rethrow(e);
-                    }
-                    return vals;
-                };
-            }
-            fn.navType = navType;
-            fn.path = segment;
-        }
-        catch (err) {
-            rethrow(err);
-        }
-        return fn;
-        function rethrow(e) {
-            let typeName = baseTypeName || baseType;
-            let error = new Error("'getEntityGraph' can't expand '" + segment + "' for " + typeName);
-            error.innerError = e;
-            throw error;
-        }
-    }
-}
-
-/**
- * Generated bundle index. Do not edit.
+//#region Copyright, Version, and Description
+/*
+ * Copyright 2015-2026 IdeaBlade, Inc.  All Rights Reserved.
+ * Use, reproduction, distribution, and modification of this code is subject to the terms and
+ * conditions of the IdeaBlade Breeze license, available at http://www.breezejs.com/license
+ *
+ * Author: Ward Bell
+ * Version: 0.9.5 - Steve Schmitt - convert to TypeScript, migrate to breeze-client repo, add HasEntityGraph and mixinEntityGraph
+ * Version: 0.9.4 - Marcel Good - fix UMD module name
+ * --------------------------------------------------------------------------------
+ * Adds getEntityGraph method to Breeze EntityManager prototype.
+ * Call   mixinEntityGraph(EntityManager)   to apply the mixin in a tree-shaking-resistant way.
+ * Then   (manager as any).getEntityGraph(entity, "child");
+ *
+ * Depends on Breeze which it patches
+ *
+ * For discussion, see:
+ * http://www.breezejs.com/documentation/getentitygraph
+ *
+ * For example usage, see:
+ * https://github.com/Breeze/breeze.js.samples/tree/master/net/DocCode/DocCode/tests/getEntityGraphTests.js
+ */
+//#endregion
+import { EntityManager, EntityQuery, EntityState, ExpandClause } from '../breeze.js';
+/**
+ * Adds `getEntityGraph` to `EntityManager.prototype`.
+ *
+ * Importing this module calls it, so an application only needs the import:
+ *
+ * ```ts
+ * import 'breeze-client/mixin-get-entity-graph';
+ * import type { HasEntityGraph } from 'breeze-client/mixin-get-entity-graph';
+ *
+ * const graph = (em as HasEntityGraph).getEntityGraph(customer, 'orders.orderDetails');
+ * ```
+ *
+ * Calling it yourself is for a bundler aggressive enough to drop a module imported only for its
+ * effect. This is the one module in the package that `sideEffects` in package.json names for
+ * that reason.
+ *
+ * @param emclass - Accepted for backwards compatibility and not used: the method always goes on
+ *   `EntityManager.prototype`. Adding it twice is a no-op.
+ *
+ * @see {@link HasEntityGraph} for the method it adds.
  */
-
-export { mixinEntityGraph };
-//# sourceMappingURL=breeze-client-mixin-get-entity-graph.mjs.map
+export function mixinEntityGraph(emclass) {
+    const proto = EntityManager.prototype;
+    if (!proto.getEntityGraph) {
+        proto.getEntityGraph = getEntityGraph;
+    }
+}
+mixinEntityGraph(EntityManager);
+function getEntityGraph(roots, expand) {
+    if (roots instanceof EntityQuery) {
+        let newRoots = this.executeQueryLocally(roots);
+        return getEntityGraphCore(newRoots, expand || roots.expandClause);
+    }
+    else {
+        return getEntityGraphCore(roots, expand);
+    }
+}
+function getEntityGraphCore(root, expand) {
+    let entityGroupMap;
+    let graph = [];
+    // Membership of `graph`, kept beside it. The graph stays an array because that is what is
+    // returned and its order is part of the result; the Set is only how "is it already in there"
+    // is answered, which `indexOf` made cost the size of the graph so far - quadratic over an
+    // expand that pulls in thousands of entities.
+    let inGraph = new Set();
+    let rootType;
+    let roots = Array.isArray(root) ? root : [root];
+    addToGraph(roots); // removes dups & nulls
+    roots = graph.slice(); // copy of de-duped roots
+    if (roots.length) {
+        getRootInfo();
+        getExpand();
+        buildGraph();
+    }
+    return graph;
+    function addToGraph(entities) {
+        entities.forEach(function (entity) {
+            if (entity && !inGraph.has(entity)) {
+                inGraph.add(entity);
+                graph.push(entity);
+            }
+        });
+    }
+    function getRootInfo() {
+        let compatTypes;
+        roots.forEach(function (root, ix) {
+            let aspect;
+            if (!root || !(aspect = root.entityAspect)) {
+                throw getRootErr(ix, 'is not an entity');
+            }
+            if (aspect.entityState === EntityState.Detached) {
+                throw getRootErr(ix, 'is a detached entity');
+            }
+            // roots are rejected above if Detached, so an attached root always has a manager
+            let em = aspect.entityManager;
+            if (entityGroupMap) {
+                if (entityGroupMap !== em._entityGroupMap) {
+                    throw getRootErr(ix, "has a different 'EntityManager' than other roots");
+                }
+            }
+            else {
+                entityGroupMap = em._entityGroupMap;
+            }
+            getRootType(root, ix);
+        });
+        function getRootErr(ix, msg) {
+            return new Error("'getEntityGraph' root[" + ix + "] " + msg);
+        }
+        function getRootType(root, ix) {
+            let thisType = root.entityType;
+            if (!rootType) {
+                rootType = thisType;
+                return;
+            }
+            else if (rootType === thisType) {
+                return;
+            }
+            // Types differs. Look for closest common base type
+            // does thisType derive from current rootType?
+            let baseType = rootType;
+            do {
+                compatTypes = compatTypes || baseType.getSelfAndSubtypes();
+                if (compatTypes.indexOf(thisType) > -1) {
+                    rootType = baseType;
+                    return;
+                }
+                baseType = baseType.baseEntityType;
+                compatTypes = null;
+            } while (baseType);
+            // does current rootType derives from thisType?
+            baseType = thisType;
+            do {
+                compatTypes = baseType.getSelfAndSubtypes();
+                if (compatTypes.indexOf(rootType) > -1) {
+                    rootType = baseType;
+                    return;
+                }
+                baseType = baseType.baseEntityType;
+            } while (baseType);
+            throw getRootErr(ix, "is not EntityType-compatible with other roots");
+        }
+    }
+    function getExpand() {
+        try {
+            if (!expand) {
+                expand = [];
+            }
+            else if (typeof expand === 'string') {
+                // tricky because Breeze expandClause not exposed publically
+                expand = new EntityQuery().expand(expand).expandClause;
+            }
+            if (expand instanceof ExpandClause && expand.propertyPaths) { // expand clause
+                expand = expand.propertyPaths;
+            }
+            else if (Array.isArray(expand)) {
+                if (!expand.every(function (elem) { return typeof elem === 'string'; })) {
+                    throw '';
+                }
+            }
+            else {
+                throw '';
+            }
+        }
+        catch (_) {
+            throw new Error("expand must be an expand string, array of string paths, or a query expand clause");
+        }
+    }
+    function buildGraph() {
+        if (expand && expand instanceof Array && expand.length) {
+            let fns = expand.map(makePathFn);
+            fns.forEach(function (fn) { fn(roots); });
+        }
+    }
+    // Make function to get entities along a single expand path
+    // such as 'Orders.OrderDetails.Product'
+    function makePathFn(path) {
+        let fns = [], segments = path.split('.'), type = rootType;
+        for (let i = 0, slen = segments.length; i < slen; i++) {
+            let f = makePathSegmentFn(type, segments[i]);
+            type = f.navType;
+            fns.push(f);
+        }
+        return function pathFn(entities) {
+            for (let j = 0, flen = fns.length; j < flen; j++) {
+                let elen = entities.length;
+                if (elen === 0) {
+                    return;
+                } // nothing left to explore
+                // fn to get related entities for this path segment
+                let fn = fns[j];
+                // get entities related by this path segment
+                // `related = related.concat(...)` per source entity copied the whole array each time,
+                // which is quadratic in its own right; push into the one array instead.
+                let related = [];
+                for (let k = 0; k < elen; k++) {
+                    let next = fn(entities[k]);
+                    if (Array.isArray(next)) {
+                        for (let m = 0, nlen = next.length; m < nlen; m++)
+                            related.push(next[m]);
+                    }
+                    else if (next) {
+                        related.push(next);
+                    }
+                }
+                addToGraph(related);
+                if (j >= flen - 1) {
+                    return;
+                } // no more path segments
+                // reset entities to deduped related entities - by Set, for the same reason as addToGraph
+                entities = [];
+                let seen = new Set();
+                for (let l = 0, rlen = related.length; l < rlen; l++) {
+                    let r = related[l];
+                    if (!seen.has(r)) {
+                        seen.add(r);
+                        entities.push(r);
+                    }
+                }
+            }
+        };
+    }
+    // Make function to get entities along a single expand path segment
+    // such as the 'OrderDetails' in the 'Orders.OrderDetails.Product' path
+    function makePathSegmentFn(baseType, segment) {
+        let baseTypeName, fn = undefined, navType;
+        try {
+            baseTypeName = baseType.name;
+            let nav = baseType.getNavigationProperty(segment);
+            let fkName = nav.foreignKeyNames[0];
+            if (!nav) {
+                throw new Error(segment + " is not a navigation property of " + baseTypeName);
+            }
+            navType = nav.entityType;
+            // add derived types
+            let navTypes = navType.getSelfAndSubtypes();
+            let grps = []; // non-empty groups for these types
+            navTypes.forEach(function (t) {
+                let grp = entityGroupMap.get(t.name);
+                if (grp && grp._entities.length > 0) {
+                    grps.push(grp);
+                }
+            });
+            let grpCount = grps.length;
+            if (grpCount === 0) {
+                // no related entities in cache
+                fn = function () { return []; };
+            }
+            else if (fkName) {
+                fn = function (entity) {
+                    let val = null;
+                    try {
+                        // `_indexMap` is keyed by the key *string*; a foreign key value is often a number.
+                        let keyValue = String(entity.getProperty(fkName));
+                        for (let i = 0; i < grpCount; i += 1) {
+                            let ix = grps[i]._indexMap.get(keyValue);
+                            val = ix === undefined ? null : grps[i]._entities[ix];
+                            if (val) {
+                                break;
+                            }
+                        }
+                    }
+                    catch (e) {
+                        rethrow(e);
+                    }
+                    return val;
+                };
+            }
+            else {
+                fkName = nav.inverse ?
+                    nav.inverse.foreignKeyNames[0] :
+                    nav.invForeignKeyNames[0];
+                if (!fkName) {
+                    throw new Error("No inverse keys");
+                }
+                // The children of one parent, indexed by the foreign key that points at it. This used to
+                // filter every entity of the navigated type for every parent entity, so an expand over n
+                // parents and m children cost n*m: `getEntityGraph(customer, 'orders.orderDetails')` on
+                // 8,000 orders and 24,000 details took about 5 s, nearly all of it here.
+                //
+                // Built on first use, so a path segment with no parents to walk still costs nothing, and
+                // in the same order the filter produced: group by group, and index order within a group.
+                // The lookup is by the raw property value, which is what the `===` comparison used.
+                let byFk;
+                fn = function (entity) {
+                    try {
+                        if (byFk === undefined) {
+                            byFk = new Map();
+                            grps.forEach(function (grp) {
+                                grp._entities.forEach(function (en) {
+                                    if (!en)
+                                        return;
+                                    let fkValue = en.getProperty(fkName);
+                                    let siblings = byFk.get(fkValue);
+                                    if (siblings) {
+                                        siblings.push(en);
+                                    }
+                                    else {
+                                        byFk.set(fkValue, [en]);
+                                    }
+                                });
+                            });
+                        }
+                        let keyValue = entity.entityAspect.getKey().values[0];
+                        return byFk.get(keyValue) ?? [];
+                    }
+                    catch (e) {
+                        rethrow(e);
+                    }
+                    return [];
+                };
+            }
+            fn.navType = navType;
+            fn.path = segment;
+        }
+        catch (err) {
+            rethrow(err);
+        }
+        // every path above either assigns fn or rethrows
+        return fn;
+        function rethrow(e) {
+            let typeName = baseTypeName || baseType;
+            let error = new Error("'getEntityGraph' can't expand '" + segment + "' for " + typeName);
+            error.innerError = e;
+            throw error;
+        }
+    }
+}
+//# sourceMappingURL=mixin-get-entity-graph.js.map

package/mixins/mixin-get-entity-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mixin-get-entity-graph.js","sourceRoot":"","sources":["../../src/mixins/mixin-get-entity-graph.ts"],"names":[],"mappings":"AAAA,6CAA6C;AAC7C;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,YAAY;AACZ,OAAO,EAAU,aAAa,EAAE,WAAW,EAAE,WAAW,EAAc,YAAY,EAAE,MAAM,cAAc,CAAC;AAiDzG;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,gBAAgB,CAAC,OAAiC;IAChE,MAAM,KAAK,GAAG,aAAa,CAAC,SAAS,CAAC;IAEtC,IAAI,CAAE,KAAa,CAAC,cAAc,EAAE,CAAC;QAClC,KAAa,CAAC,cAAc,GAAG,cAAc,CAAC;IACjD,CAAC;AACH,CAAC;AAED,gBAAgB,CAAC,aAAa,CAAC,CAAC;AAGhC,SAAS,cAAc,CAAC,KAA2C,EAAE,MAA8C;IACjH,IAAI,KAAK,YAAY,WAAW,EAAE,CAAC;QACjC,IAAI,QAAQ,GAAG,IAAI,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;QAC/C,OAAO,kBAAkB,CAAC,QAAQ,EAAE,MAAM,IAAI,KAAK,CAAC,YAAY,CAAC,CAAC;IACpE,CAAC;SAAM,CAAC;QACN,OAAO,kBAAkB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CAAC,IAA4B,EAAE,MAA8C;IACtG,IAAI,cAAwC,CAAC;IAC7C,IAAI,KAAK,GAAG,EAAmB,CAAC;IAChC,0FAA0F;IAC1F,6FAA6F;IAC7F,0FAA0F;IAC1F,8CAA8C;IAC9C,IAAI,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,IAAI,QAAoB,CAAC;IACzB,IAAI,KAAK,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAChD,UAAU,CAAC,KAAK,CAAC,CAAC,CAAK,uBAAuB;IAC9C,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,yBAAyB;IAChD,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjB,WAAW,EAAE,CAAC;QACd,SAAS,EAAE,CAAC;QACZ,UAAU,EAAE,CAAC;IACf,CAAC;IACD,OAAO,KAAK,CAAC;IAEb,SAAS,UAAU,CAAC,QAAuB;QACzC,QAAQ,CAAC,OAAO,CAAC,UAAU,MAAM;YAC/B,IAAI,MAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACnC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;IAED,SAAS,WAAW;QAClB,IAAI,WAAqC,CAAC;QAE1C,KAAK,CAAC,OAAO,CAAC,UAAU,IAAI,EAAE,EAAE;YAC9B,IAAI,MAAM,CAAC;YACX,IAAI,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC;gBAC3C,MAAM,UAAU,CAAC,EAAE,EAAE,kBAAkB,CAAC,CAAC;YAC3C,CAAC;YACD,IAAI,MAAM,CAAC,WAAW,KAAK,WAAW,CAAC,QAAQ,EAAE,CAAC;gBAChD,MAAM,UAAU,CAAC,EAAE,EAAE,sBAAsB,CAAC,CAAC;YAC/C,CAAC;YAED,iFAAiF;YACjF,IAAI,EAAE,GAAG,MAAM,CAAC,aAAc,CAAC;YAC/B,IAAI,cAAc,EAAE,CAAC;gBACnB,IAAI,cAAc,KAAK,EAAE,CAAC,eAAe,EAAE,CAAC;oBAC1C,MAAM,UAAU,CAAC,EAAE,EAAE,kDAAkD,CAAC,CAAC;gBAC3E,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,cAAc,GAAG,EAAE,CAAC,eAAe,CAAC;YACtC,CAAC;YACD,WAAW,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAExB,CAAC,CAAC,CAAC;QAEH,SAAS,UAAU,CAAC,EAAU,EAAE,GAAW;YACzC,OAAO,IAAI,KAAK,CAAC,wBAAwB,GAAG,EAAE,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC;QAC/D,CAAC;QAED,SAAS,WAAW,CAAC,IAAY,EAAE,EAAU;YAC3C,IAAI,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC;YAC/B,IAAI,CAAC,QAAQ,EAAE,CAAC;gBACd,QAAQ,GAAG,QAAQ,CAAC;gBACpB,OAAO;YACT,CAAC;iBAAM,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;gBACjC,OAAO;YACT,CAAC;YACD,mDAAmD;YACnD,8CAA8C;YAC9C,IAAI,QAAQ,GAAG,QAAQ,CAAC;YACxB,GAAG,CAAC;gBACF,WAAW,GAAG,WAAW,IAAI,QAAQ,CAAC,kBAAkB,EAAE,CAAC;gBAC3D,IAAI,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBACvC,QAAQ,GAAG,QAAQ,CAAC;oBACpB,OAAO;gBACT,CAAC;gBACD,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC;gBACnC,WAAW,GAAG,IAAI,CAAC;YACrB,CAAC,QAAQ,QAAQ,EAAE;YAEnB,+CAA+C;YAC/C,QAAQ,GAAG,QAAQ,CAAC;YACpB,GAAG,CAAC;gBACF,WAAW,GAAG,QAAQ,CAAC,kBAAkB,EAAE,CAAC;gBAC5C,IAAI,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;oBACvC,QAAQ,GAAG,QAAQ,CAAC;oBACpB,OAAO;gBACT,CAAC;gBACD,QAAQ,GAAG,QAAQ,CAAC,cAAc,CAAC;YACrC,CAAC,QAAQ,QAAQ,EAAE;YAEnB,MAAM,UAAU,CAAC,EAAE,EAAE,+CAA+C,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED,SAAS,SAAS;QAChB,IAAI,CAAC;YACH,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,MAAM,GAAG,EAAE,CAAC;YACd,CAAC;iBAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE,CAAC;gBACtC,4DAA4D;gBAC5D,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,YAAa,CAAC;YAC1D,CAAC;YACD,IAAI,MAAM,YAAY,YAAY,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC,CAAC,gBAAgB;gBAC5E,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;YAChC,CAAC;iBAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBACjC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,IAAI,IAAI,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;oBACxE,MAAM,EAAE,CAAC;gBACX,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,EAAE,CAAC;YACX,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CACb,kFAAkF,CAAC,CAAC;QACxF,CAAC;IACH,CAAC;IAED,SAAS,UAAU;QACjB,IAAI,MAAM,IAAI,MAAM,YAAY,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,CAAC;YACvD,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACjC,GAAG,CAAC,OAAO,CAAC,UAAU,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,wCAAwC;IACxC,SAAS,UAAU,CAAC,IAAY;QAC9B,IAAI,GAAG,GAAG,EAAqB,EAC7B,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAC1B,IAAI,GAAG,QAAQ,CAAC;QAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,IAAI,CAAC,GAAG,iBAAiB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7C,IAAI,GAAI,CAAS,CAAC,OAAO,CAAC;YAC1B,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QAED,OAAO,SAAS,MAAM,CAAC,QAAuB;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;gBACjD,IAAI,IAAI,GAAG,QAAQ,CAAC,MAAM,CAAC;gBAC3B,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;oBAAC,OAAO;gBAAC,CAAC,CAAC,0BAA0B;gBACtD,mDAAmD;gBACnD,IAAI,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;gBAChB,4CAA4C;gBAC5C,sFAAsF;gBACtF,wEAAwE;gBACxE,IAAI,OAAO,GAAG,EAAmB,CAAC;gBAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBAC9B,IAAI,IAAI,GAAG,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;wBACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE;4BAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;oBAC3E,CAAC;yBAAM,IAAI,IAAI,EAAE,CAAC;wBAChB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACrB,CAAC;gBACH,CAAC;gBACD,UAAU,CAAC,OAAO,CAAC,CAAC;gBACpB,IAAI,CAAC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;oBAAC,OAAO;gBAAC,CAAC,CAAC,wBAAwB;gBAEvD,yFAAyF;gBACzF,QAAQ,GAAG,EAAE,CAAC;gBACd,IAAI,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;gBAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC;oBACrD,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;oBACnB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;wBAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAAC,CAAC;gBACtD,CAAC;YACH,CAAC;QACH,CAAC,CAAC;IACJ,CAAC;IAED,mEAAmE;IACnE,uEAAuE;IACvE,SAAS,iBAAiB,CAAC,QAAoB,EAAE,OAAe;QAC9D,IAAI,YAAoB,EAAE,EAAE,GAAG,SAAS,EAAE,OAAO,CAAC;QAClD,IAAI,CAAC;YACH,YAAY,GAAG,QAAQ,CAAC,IAAI,CAAC;YAC7B,IAAI,GAAG,GAAG,QAAQ,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;YAClD,IAAI,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACpC,IAAI,CAAC,GAAG,EAAE,CAAC;gBACT,MAAM,IAAI,KAAK,CAAC,OAAO,GAAG,mCAAmC,GAAG,YAAY,CAAC,CAAC;YAChF,CAAC;YACD,OAAO,GAAG,GAAG,CAAC,UAAU,CAAC;YACzB,oBAAoB;YACpB,IAAI,QAAQ,GAAG,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC5C,IAAI,IAAI,GAAG,EAAwB,CAAC,CAAC,mCAAmC;YACxE,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC;gBAC1B,IAAI,GAAG,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBACrC,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACjB,CAAC;YACH,CAAC,CAAC,CAAC;YACH,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3B,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACnB,+BAA+B;gBAC/B,EAAE,GAAG,cAAc,OAAO,EAAmB,CAAC,CAAC,CAAC,CAAC;YACnD,CAAC;iBAAM,IAAI,MAAM,EAAE,CAAC;gBAClB,EAAE,GAAG,UAAU,MAAc;oBAC3B,IAAI,GAAG,GAAG,IAAI,CAAC;oBACf,IAAI,CAAC;wBACH,mFAAmF;wBACnF,IAAI,QAAQ,GAAG,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;wBAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;4BACrC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;4BACzC,GAAG,GAAG,EAAE,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;4BACtD,IAAI,GAAG,EAAE,CAAC;gCAAC,MAAM;4BAAC,CAAC;wBACrB,CAAC;oBACH,CAAC;oBAAC,OAAO,CAAC,EAAE,CAAC;wBAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAAC,CAAC;oBAC3B,OAAO,GAAG,CAAC;gBACb,CAAC,CAAC;YACJ,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,GAAG,CAAC,OAAO,CAAC,CAAC;oBACpB,GAAG,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;oBAChC,GAAG,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,MAAM,EAAE,CAAC;oBAAC,MAAM,IAAI,KAAK,CAAC,iBAAiB,CAAC,CAAC;gBAAC,CAAC;gBACpD,yFAAyF;gBACzF,yFAAyF;gBACzF,wFAAwF;gBACxF,yEAAyE;gBACzE,EAAE;gBACF,yFAAyF;gBACzF,yFAAyF;gBACzF,oFAAoF;gBACpF,IAAI,IAAyC,CAAC;gBAC9C,EAAE,GAAG,UAAU,MAAc;oBAC3B,IAAI,CAAC;wBACH,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;4BACvB,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;4BACjB,IAAI,CAAC,OAAO,CAAC,UAAU,GAAG;gCACxB,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,UAAU,EAAE;oCAChC,IAAI,CAAC,EAAE;wCAAE,OAAO;oCAChB,IAAI,OAAO,GAAG,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;oCACrC,IAAI,QAAQ,GAAG,IAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;oCAClC,IAAI,QAAQ,EAAE,CAAC;wCAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oCAAC,CAAC;yCAAM,CAAC;wCAAC,IAAK,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oCAAC,CAAC;gCACzE,CAAC,CAAC,CAAC;4BACL,CAAC,CAAC,CAAC;wBACL,CAAC;wBACD,IAAI,QAAQ,GAAG,MAAM,CAAC,YAAY,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBACtD,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAK,EAAoB,CAAC;oBACrD,CAAC;oBAAC,OAAO,CAAC,EAAE,CAAC;wBAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAAC,CAAC;oBAC3B,OAAO,EAAmB,CAAC;gBAC7B,CAAC,CAAC;YACJ,CAAC;YACA,EAAU,CAAC,OAAO,GAAG,OAAO,CAAC;YAC7B,EAAU,CAAC,IAAI,GAAG,OAAO,CAAC;QAE7B,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAAC,CAAC;QAC/B,iDAAiD;QACjD,OAAO,EAAG,CAAC;QAEX,SAAS,OAAO,CAAC,CAAQ;YACvB,IAAI,QAAQ,GAAG,YAAY,IAAI,QAAQ,CAAC;YACxC,IAAI,KAAK,GAAG,IAAI,KAAK,CAAC,iCAAiC,GAAG,OAAO,GAAG,QAAQ,GAAG,QAAQ,CAAC,CAAC;YACxF,KAAa,CAAC,UAAU,GAAG,CAAC,CAAC;YAC9B,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;AACH,CAAC","sourcesContent":["//#region Copyright, Version, and Description\r\n/*\r\n * Copyright 2015-2026 IdeaBlade, Inc.  All Rights Reserved.\r\n * Use, reproduction, distribution, and modification of this code is subject to the terms and\r\n * conditions of the IdeaBlade Breeze license, available at http://www.breezejs.com/license\r\n *\r\n * Author: Ward Bell\r\n * Version: 0.9.5 - Steve Schmitt - convert to TypeScript, migrate to breeze-client repo, add HasEntityGraph and mixinEntityGraph\r\n * Version: 0.9.4 - Marcel Good - fix UMD module name\r\n * --------------------------------------------------------------------------------\r\n * Adds getEntityGraph method to Breeze EntityManager prototype.\r\n * Call   mixinEntityGraph(EntityManager)   to apply the mixin in a tree-shaking-resistant way.\r\n * Then   (manager as any).getEntityGraph(entity, \"child\");\r\n *\r\n * Depends on Breeze which it patches\r\n *\r\n * For discussion, see:\r\n * http://www.breezejs.com/documentation/getentitygraph\r\n *\r\n * For example usage, see:\r\n * https://github.com/Breeze/breeze.js.samples/tree/master/net/DocCode/DocCode/tests/getEntityGraphTests.js\r\n */\r\n//#endregion\r\nimport { Entity, EntityManager, EntityQuery, EntityState, EntityType, ExpandClause } from '../breeze.js';\r\n\r\ninterface EntityGroup {\r\n  _entities: (Entity | null)[];\r\n  _indexMap: Map<string, number>;\r\n}\r\n\r\n/**\r\n * An {@link EntityManager} with `getEntityGraph`, which returns entities together with everything\r\n * an expand path reaches from them in the cache, including deleted entities. Importing\r\n * `breeze-client/mixin-get-entity-graph` adds the method to every manager, but changes the\r\n * prototype rather than the `EntityManager` type, so cast to this type to call it:\r\n *\r\n * ```ts\r\n * import 'breeze-client/mixin-get-entity-graph';\r\n * import type { HasEntityGraph } from 'breeze-client/mixin-get-entity-graph';\r\n *\r\n * const graph = (em as HasEntityGraph).getEntityGraph(customer, 'orders.orderDetails');\r\n * ```\r\n */\r\n// module augmentation failed to build with ng-packagr, so we have a separate interface\r\nexport interface HasEntityGraph extends EntityManager {\r\n  /**\r\n  Get related entities of root entity (or root entities) as specified by expand.\r\n  @example\r\n      const graph = (em as HasEntityGraph).getEntityGraph(customer, 'orders.orderDetails');\r\n      // the customer, all of its orders, and their details - including deleted ones\r\n  @param roots {Entity|Array of Entity} The root entity or root entities.\r\n  @param expand {String|Array of String|Object} an expand string, a query expand clause, or array of string paths\r\n  @returns {Array of Entity} root entities and their related entities, including deleted entities. Duplicates are removed and entity order is indeterminate.\r\n  */\r\n  getEntityGraph(roots: Entity | Array<Entity>, expand: string | Array<string> | ExpandClause): Array<Entity>;\r\n\r\n  /**\r\n  Execute query locally and return both the query results and their related entities as specified by the optional expand parameter or the query's expand clause.\r\n  @example\r\n      const query = EntityQuery.from(Customer)\r\n        .where('companyName', 'startsWith', 'Alfred')\r\n        .expand('orders.orderDetails');\r\n      const graph = (em as HasEntityGraph).getEntityGraph(query);\r\n      // the 'Alfred' customers, their orders, and their details - including deleted ones\r\n  @param query {EntityQuery} A query to be executed against the manager's local cache.\r\n  @param [expand] {String|Array of String|Object} an expand string, a query expand clause, or array of string paths\r\n  @returns {Array of Entity} local queried root entities and their related entities, including deleted entities. Duplicates are removed and entity order is indeterminate.\r\n  */\r\n  getEntityGraph(query: EntityQuery, expand?: string | Array<string> | ExpandClause): Array<Entity>;\r\n\r\n}\r\n\r\n/**\r\n * Adds `getEntityGraph` to `EntityManager.prototype`.\r\n *\r\n * Importing this module calls it, so an application only needs the import:\r\n *\r\n * ```ts\r\n * import 'breeze-client/mixin-get-entity-graph';\r\n * import type { HasEntityGraph } from 'breeze-client/mixin-get-entity-graph';\r\n *\r\n * const graph = (em as HasEntityGraph).getEntityGraph(customer, 'orders.orderDetails');\r\n * ```\r\n *\r\n * Calling it yourself is for a bundler aggressive enough to drop a module imported only for its\r\n * effect. This is the one module in the package that `sideEffects` in package.json names for\r\n * that reason.\r\n *\r\n * @param emclass - Accepted for backwards compatibility and not used: the method always goes on\r\n *   `EntityManager.prototype`. Adding it twice is a no-op.\r\n *\r\n * @see {@link HasEntityGraph} for the method it adds.\r\n */\r\nexport function mixinEntityGraph(emclass: { new(): EntityManager }) {\r\n  const proto = EntityManager.prototype;\r\n\r\n  if (!(proto as any).getEntityGraph) {\r\n    (proto as any).getEntityGraph = getEntityGraph;\r\n  }\r\n}\r\n\r\nmixinEntityGraph(EntityManager);\r\n\r\n\r\nfunction getEntityGraph(roots: Entity | Array<Entity> | EntityQuery, expand?: string | Array<string> | ExpandClause) {\r\n  if (roots instanceof EntityQuery) {\r\n    let newRoots = this.executeQueryLocally(roots);\r\n    return getEntityGraphCore(newRoots, expand || roots.expandClause);\r\n  } else {\r\n    return getEntityGraphCore(roots, expand);\r\n  }\r\n}\r\n\r\nfunction getEntityGraphCore(root: Entity | Array<Entity>, expand?: string | Array<string> | ExpandClause) {\r\n  let entityGroupMap: Map<string, EntityGroup>;\r\n  let graph = [] as Array<Entity>;\r\n  // Membership of `graph`, kept beside it. The graph stays an array because that is what is\r\n  // returned and its order is part of the result; the Set is only how \"is it already in there\"\r\n  // is answered, which `indexOf` made cost the size of the graph so far - quadratic over an\r\n  // expand that pulls in thousands of entities.\r\n  let inGraph = new Set<Entity>();\r\n  let rootType: EntityType;\r\n  let roots = Array.isArray(root) ? root : [root];\r\n  addToGraph(roots);     // removes dups & nulls\r\n  roots = graph.slice(); // copy of de-duped roots\r\n  if (roots.length) {\r\n    getRootInfo();\r\n    getExpand();\r\n    buildGraph();\r\n  }\r\n  return graph;\r\n\r\n  function addToGraph(entities: Array<Entity>) {\r\n    entities.forEach(function (entity) {\r\n      if (entity && !inGraph.has(entity)) {\r\n        inGraph.add(entity);\r\n        graph.push(entity);\r\n      }\r\n    });\r\n  }\r\n\r\n  function getRootInfo() {\r\n    let compatTypes: Array<EntityType> | null;\r\n\r\n    roots.forEach(function (root, ix) {\r\n      let aspect;\r\n      if (!root || !(aspect = root.entityAspect)) {\r\n        throw getRootErr(ix, 'is not an entity');\r\n      }\r\n      if (aspect.entityState === EntityState.Detached) {\r\n        throw getRootErr(ix, 'is a detached entity');\r\n      }\r\n\r\n      // roots are rejected above if Detached, so an attached root always has a manager\r\n      let em = aspect.entityManager!;\r\n      if (entityGroupMap) {\r\n        if (entityGroupMap !== em._entityGroupMap) {\r\n          throw getRootErr(ix, \"has a different 'EntityManager' than other roots\");\r\n        }\r\n      } else {\r\n        entityGroupMap = em._entityGroupMap;\r\n      }\r\n      getRootType(root, ix);\r\n\r\n    });\r\n\r\n    function getRootErr(ix: number, msg: string) {\r\n      return new Error(\"'getEntityGraph' root[\" + ix + \"] \" + msg);\r\n    }\r\n\r\n    function getRootType(root: Entity, ix: number) {\r\n      let thisType = root.entityType;\r\n      if (!rootType) {\r\n        rootType = thisType;\r\n        return;\r\n      } else if (rootType === thisType) {\r\n        return;\r\n      }\r\n      // Types differs. Look for closest common base type\r\n      // does thisType derive from current rootType?\r\n      let baseType = rootType;\r\n      do {\r\n        compatTypes = compatTypes || baseType.getSelfAndSubtypes();\r\n        if (compatTypes.indexOf(thisType) > -1) {\r\n          rootType = baseType;\r\n          return;\r\n        }\r\n        baseType = baseType.baseEntityType;\r\n        compatTypes = null;\r\n      } while (baseType);\r\n\r\n      // does current rootType derives from thisType?\r\n      baseType = thisType;\r\n      do {\r\n        compatTypes = baseType.getSelfAndSubtypes();\r\n        if (compatTypes.indexOf(rootType) > -1) {\r\n          rootType = baseType;\r\n          return;\r\n        }\r\n        baseType = baseType.baseEntityType;\r\n      } while (baseType);\r\n\r\n      throw getRootErr(ix, \"is not EntityType-compatible with other roots\");\r\n    }\r\n  }\r\n\r\n  function getExpand() {\r\n    try {\r\n      if (!expand) {\r\n        expand = [];\r\n      } else if (typeof expand === 'string') {\r\n        // tricky because Breeze expandClause not exposed publically\r\n        expand = new EntityQuery().expand(expand).expandClause!;\r\n      }\r\n      if (expand instanceof ExpandClause && expand.propertyPaths) { // expand clause\r\n        expand = expand.propertyPaths;\r\n      } else if (Array.isArray(expand)) {\r\n        if (!expand.every(function (elem) { return typeof elem === 'string'; })) {\r\n          throw '';\r\n        }\r\n      } else {\r\n        throw '';\r\n      }\r\n    } catch (_) {\r\n      throw new Error(\r\n        \"expand must be an expand string, array of string paths, or a query expand clause\");\r\n    }\r\n  }\r\n\r\n  function buildGraph() {\r\n    if (expand && expand instanceof Array && expand.length) {\r\n      let fns = expand.map(makePathFn);\r\n      fns.forEach(function (fn) { fn(roots); });\r\n    }\r\n  }\r\n\r\n  // Make function to get entities along a single expand path\r\n  // such as 'Orders.OrderDetails.Product'\r\n  function makePathFn(path: string) {\r\n    let fns = [] as Array<Function>,\r\n      segments = path.split('.'),\r\n      type = rootType;\r\n\r\n    for (let i = 0, slen = segments.length; i < slen; i++) {\r\n      let f = makePathSegmentFn(type, segments[i]);\r\n      type = (f as any).navType;\r\n      fns.push(f);\r\n    }\r\n\r\n    return function pathFn(entities: Array<Entity>) {\r\n      for (let j = 0, flen = fns.length; j < flen; j++) {\r\n        let elen = entities.length;\r\n        if (elen === 0) { return; } // nothing left to explore\r\n        // fn to get related entities for this path segment\r\n        let fn = fns[j];\r\n        // get entities related by this path segment\r\n        // `related = related.concat(...)` per source entity copied the whole array each time,\r\n        // which is quadratic in its own right; push into the one array instead.\r\n        let related = [] as Array<Entity>;\r\n        for (let k = 0; k < elen; k++) {\r\n          let next = fn(entities[k]);\r\n          if (Array.isArray(next)) {\r\n            for (let m = 0, nlen = next.length; m < nlen; m++) related.push(next[m]);\r\n          } else if (next) {\r\n            related.push(next);\r\n          }\r\n        }\r\n        addToGraph(related);\r\n        if (j >= flen - 1) { return; } // no more path segments\r\n\r\n        // reset entities to deduped related entities - by Set, for the same reason as addToGraph\r\n        entities = [];\r\n        let seen = new Set<Entity>();\r\n        for (let l = 0, rlen = related.length; l < rlen; l++) {\r\n          let r = related[l];\r\n          if (!seen.has(r)) { seen.add(r); entities.push(r); }\r\n        }\r\n      }\r\n    };\r\n  }\r\n\r\n  // Make function to get entities along a single expand path segment\r\n  // such as the 'OrderDetails' in the 'Orders.OrderDetails.Product' path\r\n  function makePathSegmentFn(baseType: EntityType, segment: string) {\r\n    let baseTypeName: string, fn = undefined, navType;\r\n    try {\r\n      baseTypeName = baseType.name;\r\n      let nav = baseType.getNavigationProperty(segment);\r\n      let fkName = nav.foreignKeyNames[0];\r\n      if (!nav) {\r\n        throw new Error(segment + \" is not a navigation property of \" + baseTypeName);\r\n      }\r\n      navType = nav.entityType;\r\n      // add derived types\r\n      let navTypes = navType.getSelfAndSubtypes();\r\n      let grps = [] as Array<EntityGroup>; // non-empty groups for these types\r\n      navTypes.forEach(function (t) {\r\n        let grp = entityGroupMap.get(t.name);\r\n        if (grp && grp._entities.length > 0) {\r\n          grps.push(grp);\r\n        }\r\n      });\r\n      let grpCount = grps.length;\r\n      if (grpCount === 0) {\r\n        // no related entities in cache\r\n        fn = function () { return [] as Array<Entity>; };\r\n      } else if (fkName) {\r\n        fn = function (entity: Entity) {\r\n          let val = null;\r\n          try {\r\n            // `_indexMap` is keyed by the key *string*; a foreign key value is often a number.\r\n            let keyValue = String(entity.getProperty(fkName));\r\n            for (let i = 0; i < grpCount; i += 1) {\r\n              let ix = grps[i]._indexMap.get(keyValue);\r\n              val = ix === undefined ? null : grps[i]._entities[ix];\r\n              if (val) { break; }\r\n            }\r\n          } catch (e) { rethrow(e); }\r\n          return val;\r\n        };\r\n      } else {\r\n        fkName = nav.inverse ?\r\n          nav.inverse.foreignKeyNames[0] :\r\n          nav.invForeignKeyNames[0];\r\n        if (!fkName) { throw new Error(\"No inverse keys\"); }\r\n        // The children of one parent, indexed by the foreign key that points at it. This used to\r\n        // filter every entity of the navigated type for every parent entity, so an expand over n\r\n        // parents and m children cost n*m: `getEntityGraph(customer, 'orders.orderDetails')` on\r\n        // 8,000 orders and 24,000 details took about 5 s, nearly all of it here.\r\n        //\r\n        // Built on first use, so a path segment with no parents to walk still costs nothing, and\r\n        // in the same order the filter produced: group by group, and index order within a group.\r\n        // The lookup is by the raw property value, which is what the `===` comparison used.\r\n        let byFk: Map<any, Array<Entity>> | undefined;\r\n        fn = function (entity: Entity) {\r\n          try {\r\n            if (byFk === undefined) {\r\n              byFk = new Map();\r\n              grps.forEach(function (grp) {\r\n                grp._entities.forEach(function (en) {\r\n                  if (!en) return;\r\n                  let fkValue = en.getProperty(fkName);\r\n                  let siblings = byFk!.get(fkValue);\r\n                  if (siblings) { siblings.push(en); } else { byFk!.set(fkValue, [en]); }\r\n                });\r\n              });\r\n            }\r\n            let keyValue = entity.entityAspect.getKey().values[0];\r\n            return byFk.get(keyValue) ?? ([] as Array<Entity>);\r\n          } catch (e) { rethrow(e); }\r\n          return [] as Array<Entity>;\r\n        };\r\n      }\r\n      (fn as any).navType = navType;\r\n      (fn as any).path = segment;\r\n\r\n    } catch (err) { rethrow(err); }\r\n    // every path above either assigns fn or rethrows\r\n    return fn!;\r\n\r\n    function rethrow(e: Error) {\r\n      let typeName = baseTypeName || baseType;\r\n      let error = new Error(\"'getEntityGraph' can't expand '\" + segment + \"' for \" + typeName);\r\n      (error as any).innerError = e;\r\n      throw error;\r\n    }\r\n  }\r\n}\r\n\r\n\r\n"]}