@ja-platform/db 0.0.0-dev-20261028223022 → 0.0.0-stage

package/dist/query/Query.js

@@ -1,414 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Query = void 0;
-const getPreloadRelationships_1 = require("./getPreloadRelationships");
-const queryOperations_1 = require("./queryOperations");
-const DatabaseObject_1 = require("../database/DatabaseObject");
-const Batch_1 = require("../database/Batch");
-const parser_schema_1 = require("@ja-platform/parser-schema");
-const cloneDeep = require('lodash/cloneDeep');
-class Query {
-    static isQuery(value) {
-        if (value == null) {
-            return false;
-        }
-        if (value instanceof Query) {
-            return true;
-        }
-        if (typeof value == 'object') {
-            // This covers other implementations of the Query class
-            return typeof value.where == 'function' && typeof value.toArray == 'function';
-        }
-        return false;
-    }
-    constructor(adapter, type, expression, ordering) {
-        // type is the object type, not the query type
-        if (adapter == null || type == null) {
-            throw new Error('not enough arguments');
-        }
-        if (ordering == null) {
-            ordering = [];
-        }
-        if (expression == null) {
-            expression = new queryOperations_1.TrueExpression();
-        }
-        this.ordering = ordering;
-        this.expression = expression;
-        this.adapter = adapter;
-        this.type = type;
-        this.limitNumber = null;
-        this.skipNumber = 0;
-        // Relationship structure to preload.
-        this._include = {};
-        // Watch this variable for changes to determine when the query should be reloaded.
-        this._freshness = nextFreshness();
-        // We throw an exception when old API methods are being used, instead of just failing silently.
-        Object.defineProperty(this, 'length', {
-            get: function () {
-                throw new Error('Use .count() instead of .length on a query.');
-            }
-        });
-        // We cannot check access to all indices, but we can check for [0], which is the most commonly used case.
-        Object.defineProperty(this, '0', {
-            get: function () {
-                throw new Error('Queries are not arrays. Use .fetch() on a query to get an array.');
-            }
-        });
-    }
-    /** @internal */
-    _clone(newType) {
-        if (newType == null) {
-            newType = this.type;
-        }
-        let clonedQuery = new Query(this.adapter, newType, this.expression, this.ordering);
-        clonedQuery.limitNumber = this.limitNumber;
-        clonedQuery.skipNumber = this.skipNumber;
-        clonedQuery._include = cloneDeep(this._include);
-        return clonedQuery;
-    }
-    /** @internal */
-    _filter(objects) {
-        var result = [];
-        for (var i = 0; i < objects.length; i++) {
-            var object = objects[i];
-            if (this.expression == null || this.expression.evaluate(object)) {
-                result.push(object);
-            }
-        }
-        return result;
-    }
-    // Since we don't store any query results, this doesn't actually reload anything.
-    // However, it changes the value of _freshness, so that users of this query know to reload it.
-    _reload() {
-        this._freshness = nextFreshness();
-    }
-    /** @internal */
-    _sort(objects) {
-        const ordering = this.ordering;
-        if (ordering.length > 0) {
-            objects.sort(function (a, b) {
-                for (let i = 0; i < ordering.length; i++) {
-                    let attribute = ordering[i];
-                    let ascending = 1;
-                    if (attribute[0] == '-') {
-                        ascending = -1;
-                        attribute = attribute.substring(1);
-                    }
-                    const valueA = a.attributes[attribute];
-                    const valueB = b.attributes[attribute];
-                    const diff = compare(valueA, valueB);
-                    if (diff !== 0) {
-                        return diff * ascending;
-                    }
-                }
-                const idDiff = compare(a.id, b.id);
-                // Do final sorting by ID to make it deterministic.
-                return idDiff;
-            });
-        }
-        return objects;
-    }
-    /** @internal */
-    async _fetch() {
-        const data = await this.adapter.executeQuery(this);
-        var result = [];
-        for (let i = 0; i < data.length; i++) {
-            const objdata = data[i];
-            const object = DatabaseObject_1.DatabaseObject.build(this.adapter, this.type, objdata.id, objdata);
-            result.push(object);
-        }
-        if (Object.keys(this._include).length > 0) {
-            return preload(this.adapter, this.type, result, this._include);
-        }
-        else {
-            return result;
-        }
-    }
-    _explain() {
-        return this.adapter.explain(this);
-    }
-    // This version pre-loads relationships in the display format. It is purely an optimization.
-    // If columns (Array of FormatStringExpression) is specified, it is used to determine
-    // the relationship structure. Otherwise, the displayFormat is used.
-    _fetchWithDisplay(columns) {
-        const relationships = (0, getPreloadRelationships_1.getPreloadRelationships)(this.type, columns);
-        return this._includeInternal(relationships)._fetch();
-    }
-    /** @internal */
-    async _get() {
-        if (arguments.length > 0) {
-            // e.g. .get({make: 'Nokia'})
-            return this.where.apply(this, arguments)._get();
-        }
-        const results = await this.adapter.executeQuery(this.limit(1));
-        let data;
-        if (results.length > 0) {
-            data = results[0]; // skip is already applied by the executeQuery
-        }
-        else {
-            data = null;
-        }
-        if (data) {
-            return DatabaseObject_1.DatabaseObject.build(this.adapter, this.type, data.id, data);
-        }
-        else {
-            return null;
-        }
-    }
-    where(filters, ...args) {
-        const cloned = this._clone();
-        if (arguments.length > 0) {
-            let e;
-            if (typeof filters == 'object') {
-                // example: where({make: 'Nokia', model: '5800})
-                e = (0, queryOperations_1.expressionFromHash)(this.type, filters);
-            }
-            else {
-                // example: where('make = ? and model = ?', 'Nokia', '5800')
-                e = (0, queryOperations_1.parse)(this.type, filters, args);
-            }
-            const combined = new queryOperations_1.AndExpression([this.expression, e]);
-            cloned.expression = combined;
-        }
-        return cloned;
-    }
-    order_by(...fields) {
-        const attributes = Array.prototype.slice.call(fields);
-        let q = this._clone();
-        q.ordering = attributes;
-        return q;
-    }
-    /**
-     * Limit the maximum number of results returned by the query.
-     *
-     * A new query is returned - the original one is not modified.
-     *
-     * @param n maximum number of results
-     */
-    limit(n) {
-        let q = this._clone();
-        q.limitNumber = n;
-        return q;
-    }
-    /**
-     * Skip the first n results in the query. Typically used together with limit() for pagination.
-     *
-     * A new query is returned - the original one is not modified.
-     *
-     * @param n number of results to skip.
-     */
-    skip(n) {
-        let q = this._clone();
-        q.skipNumber = n;
-        return q;
-    }
-    /**
-     * Pre-load belongs-to relationships when executing the query.
-     *
-     * This allows the implementation to batch the lookups, which is faster than loading each related
-     * object individually.
-     *
-     * Nested belongs-to relationships are supported by using dots, e.g. `.include('owner.region')`.
-     *
-     * A new query is returned - the original one is not modified.
-     *
-     * @param relationships belongs-to names
-     */
-    include(...relationships) {
-        let q = this._clone();
-        for (let rel of relationships) {
-            normalizeInclude(q._include, rel);
-        }
-        return q;
-    }
-    _destroy_all() {
-        return this._fetch().then((objects) => {
-            let batch = new Batch_1.Batch(this.adapter);
-            objects.forEach(function (object) {
-                batch.destroy(object);
-            });
-            return batch._execute();
-        });
-    }
-    _count() {
-        return this.adapter.count(this);
-    }
-    // Aliases
-    /**
-     * Execute the query and return the results.
-     */
-    toArray() {
-        return this._toArray();
-    }
-    first() {
-        return this._first.apply(this, arguments);
-    }
-    /**
-     * Return the number of results matched by the query.
-     *
-     * If .limit() was used, it would be respected for the count.
-     */
-    count() {
-        return this._count.apply(this, arguments);
-    }
-    /**
-     * Return executions stats for the query.
-     *
-     * The format of the results is not fixed, and may change across versions.
-     * For debugging use only.
-     */
-    explain() {
-        return this._explain.apply(this, arguments);
-    }
-    /**
-     * Destroy all objects matched by this query.
-     *
-     * skip() and limit() is respected for this.
-     */
-    destroyAll() {
-        return this._destroyAll.apply(this, arguments);
-    }
-    _toArray() {
-        return this._fetch.apply(this, arguments);
-    }
-    _first() {
-        return this._get.apply(this, arguments);
-    }
-    _destroyAll() {
-        return this._destroy_all.apply(this, arguments);
-    }
-    /**
-     * Order by one or more attributes.
-     *
-     * A new query is returned - the original one is not modified.
-     *
-     * @param fields an array of field names to order by. Prefix with - for descending, e.g. `-updated_at`.
-     */
-    orderBy(...fields) {
-        return this.order_by.apply(this, fields);
-    }
-    /**
-     * For debugging purposes only.
-     *
-     * The format of the result is not defined.
-     */
-    toJSON() {
-        return {
-            type: this.type.name,
-            expression: this.expression,
-            ordering: this.ordering,
-            limit: this.limitNumber,
-            skip: this.skipNumber,
-            include: this._include
-        };
-    }
-    _includeInternal(relationshipHash) {
-        let q = this._clone();
-        deepMerge(q._include, relationshipHash);
-        return q;
-    }
-}
-exports.Query = Query;
-function compare(a, b) {
-    if (typeof a == 'string' && typeof b == 'string') {
-        // Case insensitive comparison
-        a = a.toLowerCase();
-        b = b.toLowerCase();
-    }
-    // We can't > or < with `null` or `undefined` - do this manually.
-    // null, undefined < anything else
-    // Note that `== null` also matches `undefined`.
-    if (a == null && b == null) {
-        return 0;
-    }
-    else if (a == null) {
-        return -1;
-    }
-    else if (b == null) {
-        return 1;
-    }
-    else if (a > b) {
-        return 1;
-    }
-    else if (a < b) {
-        return -1;
-    }
-    else {
-        return 0;
-    }
-}
-var globalFreshness = 0;
-function nextFreshness() {
-    globalFreshness += 1;
-    return globalFreshness;
-}
-// Merge hashes of hashes (no non-hash values)
-function deepMerge(a, b) {
-    Object.keys(b).forEach(function (key) {
-        if (!(key in a)) {
-            a[key] = {};
-        }
-        deepMerge(a[key], b[key]);
-    });
-    return a;
-}
-function normalizeInclude(into, expression) {
-    const dot = expression.indexOf('.');
-    if (dot < 0) {
-        if (!(expression in into)) {
-            into[expression] = {};
-        }
-        return into;
-    }
-    const head = expression.substring(0, dot); // The first part of the expression
-    const tail = expression.substring(dot + 1); // The rest of the expression
-    if (!(head in into)) {
-        into[head] = {};
-    }
-    normalizeInclude(into[head], tail);
-    return into;
-}
-// Recursively preload a relationship structure
-// objects: Array of DatabaseObject
-// relationships example: {'room' => {'building' => {}}, 'otherrel' => {}}
-async function preload(adapter, type, objects, relationships) {
-    let outerPromises = [];
-    for (let key in relationships) {
-        const relatedType = type.getAttribute(key).type;
-        if (!(relatedType instanceof parser_schema_1.SchemaModelType)) {
-            throw new Error(`${type.name}.${key} is not a belongs-to relationship`);
-        }
-        const nestedRelationships = relationships[key];
-        // Get ids of all the belongsTo objects in the relationship
-        let ids = [];
-        for (let object of objects) {
-            const id = object[key + '_id'];
-            ids.push(id);
-        }
-        let nestedObjects = [];
-        const promise = adapter.getAll(relatedType.name, ids).then(async (data) => {
-            for (let i = 0; i < objects.length; i++) {
-                const object = objects[i];
-                const relatedData = data[i];
-                if (relatedData != null) {
-                    const related = DatabaseObject_1.DatabaseObject.build(adapter, relatedType, relatedData.id, relatedData);
-                    object._cache(key, related);
-                    nestedObjects.push(related);
-                }
-                else {
-                    // We need to record the fact that we couldn't find the object, so that other
-                    // code doesn't need to try again.
-                    object._cache(key, null);
-                }
-            }
-            if (Object.keys(nestedRelationships).length > 0) {
-                // Recursively load nested relationships
-                await preload(adapter, relatedType, nestedObjects, nestedRelationships);
-            }
-        });
-        outerPromises.push(promise);
-    }
-    await Promise.all(outerPromises);
-    return objects;
-}
-//# sourceMappingURL=Query.js.map

package/dist/query/Query.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"Query.js","sourceRoot":"","sources":["../../src/query/Query.ts"],"names":[],"mappings":";;;AAAA,uEAAsF;AAEtF,uDAAuH;AACvH,+DAA4D;AAC5D,6CAA0C;AAI1C,8DAA6D;AAE7D,MAAM,SAAS,GAAG,OAAO,CAAC,kBAAkB,CAAC,CAAC;AAE9C;IAqBE,MAAM,CAAC,OAAO,CAAC,KAAU;QACvB,IAAI,KAAK,IAAI,IAAI,EAAE,CAAC;YAClB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,OAAO,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,uDAAuD;YACvD,OAAO,OAAO,KAAK,CAAC,KAAK,IAAI,UAAU,IAAI,OAAO,KAAK,CAAC,OAAO,IAAI,UAAU,CAAC;QAChF,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED,YAAY,OAAwB,EAAE,IAAqB,EAAE,UAAuB,EAAE,QAAgB;QACpG,8CAA8C;QAC9C,IAAI,OAAO,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,EAAE,CAAC;YACpC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,QAAQ,IAAI,IAAI,EAAE,CAAC;YACrB,QAAQ,GAAG,EAAE,CAAC;QAChB,CAAC;QAED,IAAI,UAAU,IAAI,IAAI,EAAE,CAAC;YACvB,UAAU,GAAG,IAAI,gCAAc,EAAE,CAAC;QACpC,CAAC;QAED,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAC7B,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;QACpB,qCAAqC;QACrC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QAEnB,kFAAkF;QAClF,IAAI,CAAC,UAAU,GAAG,aAAa,EAAE,CAAC;QAElC,+FAA+F;QAC/F,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,QAAQ,EAAE;YACpC,GAAG,EAAE;gBACH,MAAM,IAAI,KAAK,CAAC,6CAA6C,CAAC,CAAC;YACjE,CAAC;SACF,CAAC,CAAC;QAEH,yGAAyG;QACzG,MAAM,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,EAAE;YAC/B,GAAG,EAAE;gBACH,MAAM,IAAI,KAAK,CAAC,kEAAkE,CAAC,CAAC;YACtF,CAAC;SACF,CAAC,CAAC;IACL,CAAC;IAED,gBAAgB;IAChB,MAAM,CAAC,OAAyB;QAC9B,IAAI,OAAO,IAAI,IAAI,EAAE,CAAC;YACpB,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,CAAC;QACD,IAAI,WAAW,GAAG,IAAI,KAAK,CAAI,IAAI,CAAC,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtF,WAAW,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3C,WAAW,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACzC,WAAW,CAAC,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAChD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,gBAAgB;IAChB,OAAO,CAAC,OAAqB;QAC3B,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,IAAI,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,IAAI,IAAI,CAAC,UAAU,IAAI,IAAI,IAAI,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;gBAChE,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,iFAAiF;IACjF,8FAA8F;IACtF,OAAO;QACb,IAAI,CAAC,UAAU,GAAG,aAAa,EAAE,CAAC;IACpC,CAAC;IAED,gBAAgB;IAChB,KAAK,CAAC,OAAqB;QACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAC/B,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;oBACzC,IAAI,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;oBAC5B,IAAI,SAAS,GAAG,CAAC,CAAC;oBAClB,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;wBACxB,SAAS,GAAG,CAAC,CAAC,CAAC;wBACf,SAAS,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;oBACrC,CAAC;oBACD,MAAM,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;oBACvC,MAAM,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;oBAEvC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;oBACrC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;wBACf,OAAO,IAAI,GAAG,SAAS,CAAC;oBAC1B,CAAC;gBACH,CAAC;gBACD,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;gBAEnC,mDAAmD;gBACnD,OAAO,MAAM,CAAC;YAChB,CAAC,CAAC,CAAC;QACL,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,gBAAgB;IAChB,KAAK,CAAC,MAAM;QACV,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,MAAM,GAAG,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,MAAM,GAAG,+BAAc,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,EAAE,OAAO,CAAM,CAAC;YACvF,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;QAED,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1C,OAAO,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjE,CAAC;aAAM,CAAC;YACN,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IAEO,QAAQ;QACd,OAAO,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IAED,4FAA4F;IAC5F,qFAAqF;IACrF,oEAAoE;IACpE,iBAAiB,CAAC,OAA2E;QAC3F,MAAM,aAAa,GAAG,IAAA,iDAAuB,EAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC,MAAM,EAAE,CAAC;IACvD,CAAC;IAED,gBAAgB;IAChB,KAAK,CAAC,IAAI;QACR,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,6BAA6B;YAC7B,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC,IAAI,EAAE,CAAC;QAClD,CAAC;QAED,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/D,IAAI,IAAS,CAAC;QACd,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,8CAA8C;QACnE,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;QAED,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,+BAAc,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAM,CAAC;QAC3E,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAqBD,KAAK,CAAC,OAAa,EAAE,GAAG,IAAW;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAa,CAAC;YAClB,IAAI,OAAO,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,gDAAgD;gBAChD,CAAC,GAAG,IAAA,oCAAkB,EAAC,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAC7C,CAAC;iBAAM,CAAC;gBACN,4DAA4D;gBAC5D,CAAC,GAAG,IAAA,uBAAU,EAAC,IAAI,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;YAC3C,CAAC;YACD,MAAM,QAAQ,GAAG,IAAI,+BAAa,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;YACzD,MAAM,CAAC,UAAU,GAAG,QAAQ,CAAC;QAC/B,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,QAAQ,CAAC,GAAG,MAAgB;QAClC,MAAM,UAAU,GAAG,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACtB,CAAC,CAAC,QAAQ,GAAG,UAAU,CAAC;QACxB,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,CAAS;QACb,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACtB,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC;QAClB,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;;;OAMG;IACH,IAAI,CAAC,CAAS;QACZ,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACtB,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,GAAG,aAAuB;QAChC,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACtB,KAAK,IAAI,GAAG,IAAI,aAAa,EAAE,CAAC;YAC9B,gBAAgB,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAEO,YAAY;QAClB,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,CAAC,OAAyB,EAAE,EAAE;YACtD,IAAI,KAAK,GAAG,IAAI,aAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEpC,OAAO,CAAC,OAAO,CAAC,UAAU,MAAM;gBAC9B,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACxB,CAAC,CAAC,CAAC;YAEH,OAAO,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC1B,CAAC,CAAC,CAAC;IACL,CAAC;IAEO,MAAM;QACZ,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,UAAU;IAEV;;OAEG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC;IACzB,CAAC;IAwBD,KAAK;QACH,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;;;OAIG;IACH,KAAK;QACH,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC;IAED;;;;;OAKG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC9C,CAAC;IAED;;;;OAIG;IACH,UAAU;QACR,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IACjD,CAAC;IAEO,QAAQ;QACd,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC5C,CAAC;IAEO,MAAM;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAC1C,CAAC;IAEO,WAAW;QACjB,OAAO,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;IAClD,CAAC;IAED;;;;;;OAMG;IACH,OAAO,CAAC,GAAG,MAAgB;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACH,MAAM;QACJ,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI;YACpB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,KAAK,EAAE,IAAI,CAAC,WAAW;YACvB,IAAI,EAAE,IAAI,CAAC,UAAU;YACrB,OAAO,EAAE,IAAI,CAAC,QAAQ;SACvB,CAAC;IACJ,CAAC;IAEO,gBAAgB,CAAC,gBAAkC;QACzD,IAAI,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACtB,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,gBAAgB,CAAC,CAAC;QACxC,OAAO,CAAC,CAAC;IACX,CAAC;CACF;;AAED,SAAS,OAAO,CAAC,CAAM,EAAE,CAAM;IAC7B,IAAI,OAAO,CAAC,IAAI,QAAQ,IAAI,OAAO,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjD,8BAA8B;QAC9B,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;QACpB,CAAC,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;IACtB,CAAC;IAED,iEAAiE;IACjE,kCAAkC;IAClC,gDAAgD;IAChD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QAC3B,OAAO,CAAC,CAAC;IACX,CAAC;SAAM,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;SAAM,IAAI,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,OAAO,CAAC,CAAC;IACX,CAAC;SAAM,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACjB,OAAO,CAAC,CAAC;IACX,CAAC;SAAM,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACjB,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;SAAM,CAAC;QACN,OAAO,CAAC,CAAC;IACX,CAAC;AACH,CAAC;AAED,IAAI,eAAe,GAAG,CAAC,CAAC;AAExB,SAAS,aAAa;IACpB,eAAe,IAAI,CAAC,CAAC;IACrB,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,8CAA8C;AAC9C,SAAS,SAAS,CAAC,CAAmB,EAAE,CAAmB;IACzD,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,GAAG;QAClC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC;YAChB,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;QACD,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC,CAAC,CAAC;IACH,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAsB,EAAE,UAAkB;IAClE,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACpC,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,IAAI,CAAC,CAAC,UAAU,IAAI,IAAI,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;QACxB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,mCAAmC;IAC9E,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,6BAA6B;IAEzE,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;IAClB,CAAC;IACD,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;IACnC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,+CAA+C;AAC/C,mCAAmC;AACnC,0EAA0E;AAC1E,KAAK,UAAU,OAAO,CACpB,OAAwB,EACxB,IAAqB,EACrB,OAAY,EACZ,aAA+B;IAE/B,IAAI,aAAa,GAAoB,EAAE,CAAC;IAExC,KAAK,IAAI,GAAG,IAAI,aAAa,EAAE,CAAC;QAC9B,MAAM,WAAW,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QAChD,IAAI,CAAC,CAAC,WAAW,YAAY,+BAAe,CAAC,EAAE,CAAC;YAC9C,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,IAAI,GAAG,mCAAmC,CAAC,CAAC;QAC1E,CAAC;QACD,MAAM,mBAAmB,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;QAE/C,2DAA2D;QAC3D,IAAI,GAAG,GAAG,EAAE,CAAC;QACb,KAAK,IAAI,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAI,MAA8B,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;YACxD,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;QAED,IAAI,aAAa,GAAqB,EAAE,CAAC;QAEzC,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE;YACxE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBAC1B,MAAM,WAAW,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,WAAW,IAAI,IAAI,EAAE,CAAC;oBACxB,MAAM,OAAO,GAAG,+BAAc,CAAC,KAAK,CAAC,OAAO,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,EAAE,WAAW,CAAC,CAAC;oBACxF,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;oBAC5B,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAC9B,CAAC;qBAAM,CAAC;oBACN,6EAA6E;oBAC7E,kCAAkC;oBAClC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;YAED,IAAI,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChD,wCAAwC;gBACxC,MAAM,OAAO,CAAC,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,mBAAmB,CAAC,CAAC;YAC1E,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IACjC,OAAO,OAAO,CAAC;AACjB,CAAC","sourcesContent":["import { getPreloadRelationships, RelationshipHash } from './getPreloadRelationships';\nimport { DatabaseAdapter } from '../database/adapters/DatabaseAdapter';\nimport { Expression, TrueExpression, expressionFromHash, parse as parseQuery, AndExpression } from './queryOperations';\nimport { DatabaseObject } from '../database/DatabaseObject';\nimport { Batch } from '../database/Batch';\nimport { ObjectData } from '../types/ObjectData';\nimport { FormatStringExpression } from '@ja-platform/parser-expressions';\nimport * as j from '../utils/JourneyPromise';\nimport { SchemaModelType } from '@ja-platform/parser-schema';\n\nconst cloneDeep = require('lodash/cloneDeep');\n\nexport class Query<T extends DatabaseObject = DatabaseObject> {\n  /** @internal */\n  readonly adapter: DatabaseAdapter;\n  readonly type: SchemaModelType;\n\n  /** @internal */\n  expression: Expression;\n\n  /** @internal */\n  ordering: any[];\n  /** @internal */\n  limitNumber: number;\n  /** @internal */\n  skipNumber: number;\n\n  /** @internal */\n  private _freshness: number;\n\n  /** @internal */\n  private _include: RelationshipHash;\n\n  static isQuery(value: any): boolean {\n    if (value == null) {\n      return false;\n    }\n    if (value instanceof Query) {\n      return true;\n    }\n    if (typeof value == 'object') {\n      // This covers other implementations of the Query class\n      return typeof value.where == 'function' && typeof value.toArray == 'function';\n    }\n    return false;\n  }\n\n  constructor(adapter: DatabaseAdapter, type: SchemaModelType, expression?: Expression, ordering?: any[]) {\n    // type is the object type, not the query type\n    if (adapter == null || type == null) {\n      throw new Error('not enough arguments');\n    }\n\n    if (ordering == null) {\n      ordering = [];\n    }\n\n    if (expression == null) {\n      expression = new TrueExpression();\n    }\n\n    this.ordering = ordering;\n    this.expression = expression;\n    this.adapter = adapter;\n    this.type = type;\n    this.limitNumber = null;\n    this.skipNumber = 0;\n    // Relationship structure to preload.\n    this._include = {};\n\n    // Watch this variable for changes to determine when the query should be reloaded.\n    this._freshness = nextFreshness();\n\n    // We throw an exception when old API methods are being used, instead of just failing silently.\n    Object.defineProperty(this, 'length', {\n      get: function () {\n        throw new Error('Use .count() instead of .length on a query.');\n      }\n    });\n\n    // We cannot check access to all indices, but we can check for [0], which is the most commonly used case.\n    Object.defineProperty(this, '0', {\n      get: function () {\n        throw new Error('Queries are not arrays. Use .fetch() on a query to get an array.');\n      }\n    });\n  }\n\n  /** @internal */\n  _clone(newType?: SchemaModelType): Query<T> {\n    if (newType == null) {\n      newType = this.type;\n    }\n    let clonedQuery = new Query<T>(this.adapter, newType, this.expression, this.ordering);\n    clonedQuery.limitNumber = this.limitNumber;\n    clonedQuery.skipNumber = this.skipNumber;\n    clonedQuery._include = cloneDeep(this._include);\n    return clonedQuery;\n  }\n\n  /** @internal */\n  _filter(objects: ObjectData[]): ObjectData[] {\n    var result = [];\n    for (var i = 0; i < objects.length; i++) {\n      var object = objects[i];\n      if (this.expression == null || this.expression.evaluate(object)) {\n        result.push(object);\n      }\n    }\n    return result;\n  }\n\n  // Since we don't store any query results, this doesn't actually reload anything.\n  // However, it changes the value of _freshness, so that users of this query know to reload it.\n  private _reload() {\n    this._freshness = nextFreshness();\n  }\n\n  /** @internal */\n  _sort(objects: ObjectData[]): ObjectData[] {\n    const ordering = this.ordering;\n    if (ordering.length > 0) {\n      objects.sort(function (a, b) {\n        for (let i = 0; i < ordering.length; i++) {\n          let attribute = ordering[i];\n          let ascending = 1;\n          if (attribute[0] == '-') {\n            ascending = -1;\n            attribute = attribute.substring(1);\n          }\n          const valueA = a.attributes[attribute];\n          const valueB = b.attributes[attribute];\n\n          const diff = compare(valueA, valueB);\n          if (diff !== 0) {\n            return diff * ascending;\n          }\n        }\n        const idDiff = compare(a.id, b.id);\n\n        // Do final sorting by ID to make it deterministic.\n        return idDiff;\n      });\n    }\n    return objects;\n  }\n\n  /** @internal */\n  async _fetch(): Promise<T[]> {\n    const data = await this.adapter.executeQuery(this);\n    var result = [];\n\n    for (let i = 0; i < data.length; i++) {\n      const objdata = data[i];\n      const object = DatabaseObject.build(this.adapter, this.type, objdata.id, objdata) as T;\n      result.push(object);\n    }\n\n    if (Object.keys(this._include).length > 0) {\n      return preload(this.adapter, this.type, result, this._include);\n    } else {\n      return result;\n    }\n  }\n\n  private _explain() {\n    return this.adapter.explain(this);\n  }\n\n  // This version pre-loads relationships in the display format. It is purely an optimization.\n  // If columns (Array of FormatStringExpression) is specified, it is used to determine\n  // the relationship structure. Otherwise, the displayFormat is used.\n  _fetchWithDisplay(columns?: FormatStringExpression[] | Record<string, FormatStringExpression>) {\n    const relationships = getPreloadRelationships(this.type, columns);\n    return this._includeInternal(relationships)._fetch();\n  }\n\n  /** @internal */\n  async _get(): Promise<T> {\n    if (arguments.length > 0) {\n      // e.g. .get({make: 'Nokia'})\n      return this.where.apply(this, arguments)._get();\n    }\n\n    const results = await this.adapter.executeQuery(this.limit(1));\n    let data: any;\n    if (results.length > 0) {\n      data = results[0]; // skip is already applied by the executeQuery\n    } else {\n      data = null;\n    }\n\n    if (data) {\n      return DatabaseObject.build(this.adapter, this.type, data.id, data) as T;\n    } else {\n      return null;\n    }\n  }\n  /**\n   * Apply additional query filters, as a new query.\n   *\n   * @param query the query string\n   * @param args query arguments\n   */\n  where(query: string, ...args: any[]): Query<T>;\n\n  /**\n   * Apply additional filters, as a new query.\n   *\n   * @param filters an object of {field: value}\n   */\n  where(filters?: any): Query<T>;\n\n  /**\n   * Return a copy of this query.\n   */\n  where(): Query<T>;\n\n  where(filters?: any, ...args: any[]): Query<T> {\n    const cloned = this._clone();\n    if (arguments.length > 0) {\n      let e: Expression;\n      if (typeof filters == 'object') {\n        // example: where({make: 'Nokia', model: '5800})\n        e = expressionFromHash(this.type, filters);\n      } else {\n        // example: where('make = ? and model = ?', 'Nokia', '5800')\n        e = parseQuery(this.type, filters, args);\n      }\n      const combined = new AndExpression([this.expression, e]);\n      cloned.expression = combined;\n    }\n    return cloned;\n  }\n\n  private order_by(...fields: string[]) {\n    const attributes = Array.prototype.slice.call(fields);\n    let q = this._clone();\n    q.ordering = attributes;\n    return q;\n  }\n\n  /**\n   * Limit the maximum number of results returned by the query.\n   *\n   * A new query is returned - the original one is not modified.\n   *\n   * @param n maximum number of results\n   */\n  limit(n: number) {\n    let q = this._clone();\n    q.limitNumber = n;\n    return q;\n  }\n\n  /**\n   * Skip the first n results in the query. Typically used together with limit() for pagination.\n   *\n   * A new query is returned - the original one is not modified.\n   *\n   * @param n number of results to skip.\n   */\n  skip(n: number) {\n    let q = this._clone();\n    q.skipNumber = n;\n    return q;\n  }\n\n  /**\n   * Pre-load belongs-to relationships when executing the query.\n   *\n   * This allows the implementation to batch the lookups, which is faster than loading each related\n   * object individually.\n   *\n   * Nested belongs-to relationships are supported by using dots, e.g. `.include('owner.region')`.\n   *\n   * A new query is returned - the original one is not modified.\n   *\n   * @param relationships belongs-to names\n   */\n  include(...relationships: string[]) {\n    let q = this._clone();\n    for (let rel of relationships) {\n      normalizeInclude(q._include, rel);\n    }\n    return q;\n  }\n\n  private _destroy_all() {\n    return this._fetch().then((objects: DatabaseObject[]) => {\n      let batch = new Batch(this.adapter);\n\n      objects.forEach(function (object) {\n        batch.destroy(object);\n      });\n\n      return batch._execute();\n    });\n  }\n\n  private _count() {\n    return this.adapter.count(this);\n  }\n\n  // Aliases\n\n  /**\n   * Execute the query and return the results.\n   */\n  toArray(): j.Promise<T[]> {\n    return this._toArray();\n  }\n\n  /**\n   * Apply additional filters, then return the first result.\n   *\n   * @param filters an object of {attribute: value}\n   */\n  first(filters?: { [key: string]: any }): j.Promise<T | null>;\n\n  /**\n   * Apply additional query filters, then return the first result.\n   *\n   * Same as .where(...).first().\n   *\n   * @param query the query string\n   * @param args query arguments\n   */\n  first(query: string, ...args: any[]): j.Promise<T | null>;\n\n  /**\n   * Return the first result matched by this query.\n   */\n  first(): j.Promise<T | null>;\n\n  first(): j.Promise<T | null> {\n    return this._first.apply(this, arguments);\n  }\n\n  /**\n   * Return the number of results matched by the query.\n   *\n   * If .limit() was used, it would be respected for the count.\n   */\n  count(): j.Promise<number> {\n    return this._count.apply(this, arguments);\n  }\n\n  /**\n   * Return executions stats for the query.\n   *\n   * The format of the results is not fixed, and may change across versions.\n   * For debugging use only.\n   */\n  explain(): j.Promise<any> {\n    return this._explain.apply(this, arguments);\n  }\n\n  /**\n   * Destroy all objects matched by this query.\n   *\n   * skip() and limit() is respected for this.\n   */\n  destroyAll(): j.Promise<void> {\n    return this._destroyAll.apply(this, arguments);\n  }\n\n  private _toArray(): Promise<T[]> {\n    return this._fetch.apply(this, arguments);\n  }\n\n  private _first(): Promise<T | null> {\n    return this._get.apply(this, arguments);\n  }\n\n  private _destroyAll(): Promise<void> {\n    return this._destroy_all.apply(this, arguments);\n  }\n\n  /**\n   * Order by one or more attributes.\n   *\n   * A new query is returned - the original one is not modified.\n   *\n   * @param fields an array of field names to order by. Prefix with - for descending, e.g. `-updated_at`.\n   */\n  orderBy(...fields: string[]): Query<T> {\n    return this.order_by.apply(this, fields);\n  }\n\n  /**\n   * For debugging purposes only.\n   *\n   * The format of the result is not defined.\n   */\n  toJSON() {\n    return {\n      type: this.type.name,\n      expression: this.expression,\n      ordering: this.ordering,\n      limit: this.limitNumber,\n      skip: this.skipNumber,\n      include: this._include\n    };\n  }\n\n  private _includeInternal(relationshipHash: RelationshipHash) {\n    let q = this._clone();\n    deepMerge(q._include, relationshipHash);\n    return q;\n  }\n}\n\nfunction compare(a: any, b: any) {\n  if (typeof a == 'string' && typeof b == 'string') {\n    // Case insensitive comparison\n    a = a.toLowerCase();\n    b = b.toLowerCase();\n  }\n\n  // We can't > or < with `null` or `undefined` - do this manually.\n  // null, undefined < anything else\n  // Note that `== null` also matches `undefined`.\n  if (a == null && b == null) {\n    return 0;\n  } else if (a == null) {\n    return -1;\n  } else if (b == null) {\n    return 1;\n  } else if (a > b) {\n    return 1;\n  } else if (a < b) {\n    return -1;\n  } else {\n    return 0;\n  }\n}\n\nvar globalFreshness = 0;\n\nfunction nextFreshness() {\n  globalFreshness += 1;\n  return globalFreshness;\n}\n\n// Merge hashes of hashes (no non-hash values)\nfunction deepMerge(a: RelationshipHash, b: RelationshipHash): RelationshipHash {\n  Object.keys(b).forEach(function (key) {\n    if (!(key in a)) {\n      a[key] = {};\n    }\n    deepMerge(a[key], b[key]);\n  });\n  return a;\n}\n\nfunction normalizeInclude(into: RelationshipHash, expression: string) {\n  const dot = expression.indexOf('.');\n  if (dot < 0) {\n    if (!(expression in into)) {\n      into[expression] = {};\n    }\n    return into;\n  }\n\n  const head = expression.substring(0, dot); // The first part of the expression\n  const tail = expression.substring(dot + 1); // The rest of the expression\n\n  if (!(head in into)) {\n    into[head] = {};\n  }\n  normalizeInclude(into[head], tail);\n  return into;\n}\n\n// Recursively preload a relationship structure\n// objects: Array of DatabaseObject\n// relationships example: {'room' => {'building' => {}}, 'otherrel' => {}}\nasync function preload<T extends DatabaseObject>(\n  adapter: DatabaseAdapter,\n  type: SchemaModelType,\n  objects: T[],\n  relationships: RelationshipHash\n): Promise<T[]> {\n  let outerPromises: Promise<void>[] = [];\n\n  for (let key in relationships) {\n    const relatedType = type.getAttribute(key).type;\n    if (!(relatedType instanceof SchemaModelType)) {\n      throw new Error(`${type.name}.${key} is not a belongs-to relationship`);\n    }\n    const nestedRelationships = relationships[key];\n\n    // Get ids of all the belongsTo objects in the relationship\n    let ids = [];\n    for (let object of objects) {\n      const id = (object as Record<string, any>)[key + '_id'];\n      ids.push(id);\n    }\n\n    let nestedObjects: DatabaseObject[] = [];\n\n    const promise = adapter.getAll(relatedType.name, ids).then(async (data) => {\n      for (let i = 0; i < objects.length; i++) {\n        const object = objects[i];\n        const relatedData = data[i];\n        if (relatedData != null) {\n          const related = DatabaseObject.build(adapter, relatedType, relatedData.id, relatedData);\n          object._cache(key, related);\n          nestedObjects.push(related);\n        } else {\n          // We need to record the fact that we couldn't find the object, so that other\n          // code doesn't need to try again.\n          object._cache(key, null);\n        }\n      }\n\n      if (Object.keys(nestedRelationships).length > 0) {\n        // Recursively load nested relationships\n        await preload(adapter, relatedType, nestedObjects, nestedRelationships);\n      }\n    });\n\n    outerPromises.push(promise);\n  }\n\n  await Promise.all(outerPromises);\n  return objects;\n}\n"]}

package/dist/query/getPreloadRelationships.js

@@ -1,45 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.getPreloadRelationships = getPreloadRelationships;
-const parser_expressions_1 = require("@ja-platform/parser-expressions");
-const parser_schema_1 = require("@ja-platform/parser-schema");
-/**
- * Collect relationships needed by query displays, including related models' displays.
- */
-function getPreloadRelationships(type, columns) {
-    var _a;
-    const relationships = {};
-    const displays = columns == null ? [type.displayFormat] : Array.isArray(columns) ? columns : Object.values(columns);
-    for (const display of displays) {
-        for (const parameter of (_a = display === null || display === void 0 ? void 0 : display.parameters) !== null && _a !== void 0 ? _a : []) {
-            if (parameter instanceof parser_expressions_1.ShorthandExpression) {
-                extractRelationshipStructure(type, parameter, relationships, 0);
-            }
-        }
-    }
-    return relationships;
-}
-/**
- * Follow a shorthand path and expand its terminal model's display within the depth limit.
- */
-function extractRelationshipStructure(type, expression, into, depth) {
-    var _a;
-    var _b, _c;
-    var _d;
-    for (const field of expression.path) {
-        const child = type.getField(String(field));
-        if (!(child instanceof parser_schema_1.SchemaModelType))
-            return;
-        into = (_b = into[_d = String(field)]) !== null && _b !== void 0 ? _b : (into[_d] = {});
-        type = child;
-        depth++;
-    }
-    if (depth > 5)
-        return;
-    for (const parameter of (_c = (_a = type.displayFormat) === null || _a === void 0 ? void 0 : _a.parameters) !== null && _c !== void 0 ? _c : []) {
-        if (parameter instanceof parser_expressions_1.ShorthandExpression) {
-            extractRelationshipStructure(type, parameter, into, depth);
-        }
-    }
-}
-//# sourceMappingURL=getPreloadRelationships.js.map

package/dist/query/getPreloadRelationships.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"getPreloadRelationships.js","sourceRoot":"","sources":["../../src/query/getPreloadRelationships.ts"],"names":[],"mappings":";;;AAAA,wEAAgG;AAChG,8DAA6D;AAM7D;;GAEG;AACH,iCACE,IAAqB,EACrB,OAAyF;;IAEzF,MAAM,aAAa,GAAqB,EAAE,CAAC;IAC3C,MAAM,QAAQ,GAAG,OAAO,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACpH,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,KAAK,MAAM,SAAS,UAAI,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,UAAU,mCAAI,EAAE,EAAE,CAAC;YAClD,IAAI,SAAS,YAAY,wCAAmB,EAAE,CAAC;gBAC7C,4BAA4B,CAAC,IAAI,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,aAAa,CAAC;AACvB,CAAC;AAED;;GAEG;AACH,SAAS,4BAA4B,CACnC,IAAqB,EACrB,UAA+B,EAC/B,IAAsB,EACtB,KAAa;;;;IAEb,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,IAAI,EAAE,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3C,IAAI,CAAC,CAAC,KAAK,YAAY,+BAAe,CAAC;YAAE,OAAO;QAChD,IAAI,SAAG,IAAI,MAAC,MAAM,CAAC,KAAK,CAAC,qCAAlB,IAAI,OAAoB,EAAE,CAAA,CAAC;QAClC,IAAI,GAAG,KAAK,CAAC;QACb,KAAK,EAAE,CAAC;IACV,CAAC;IACD,IAAI,KAAK,GAAG,CAAC;QAAE,OAAO;IACtB,KAAK,MAAM,SAAS,UAAI,MAAA,IAAI,CAAC,aAAa,0CAAE,UAAU,mCAAI,EAAE,EAAE,CAAC;QAC7D,IAAI,SAAS,YAAY,wCAAmB,EAAE,CAAC;YAC7C,4BAA4B,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QAC7D,CAAC;IACH,CAAC;AACH,CAAC","sourcesContent":["import { AbstractFormatExpression, ShorthandExpression } from '@ja-platform/parser-expressions';\nimport { SchemaModelType } from '@ja-platform/parser-schema';\n\nexport interface RelationshipHash {\n  [key: string]: RelationshipHash;\n}\n\n/**\n * Collect relationships needed by query displays, including related models' displays.\n */\nexport function getPreloadRelationships(\n  type: SchemaModelType,\n  columns?: AbstractFormatExpression<any>[] | Record<string, AbstractFormatExpression<any>>\n): RelationshipHash {\n  const relationships: RelationshipHash = {};\n  const displays = columns == null ? [type.displayFormat] : Array.isArray(columns) ? columns : Object.values(columns);\n  for (const display of displays) {\n    for (const parameter of display?.parameters ?? []) {\n      if (parameter instanceof ShorthandExpression) {\n        extractRelationshipStructure(type, parameter, relationships, 0);\n      }\n    }\n  }\n  return relationships;\n}\n\n/**\n * Follow a shorthand path and expand its terminal model's display within the depth limit.\n */\nfunction extractRelationshipStructure(\n  type: SchemaModelType,\n  expression: ShorthandExpression,\n  into: RelationshipHash,\n  depth: number\n): void {\n  for (const field of expression.path) {\n    const child = type.getField(String(field));\n    if (!(child instanceof SchemaModelType)) return;\n    into = into[String(field)] ??= {};\n    type = child;\n    depth++;\n  }\n  if (depth > 5) return;\n  for (const parameter of type.displayFormat?.parameters ?? []) {\n    if (parameter instanceof ShorthandExpression) {\n      extractRelationshipStructure(type, parameter, into, depth);\n    }\n  }\n}\n"]}