@isograph/react 0.4.3 → 0.5.0

package/dist/core/optimisticProxy.js

@@ -0,0 +1,399 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getOrInsertRecord = getOrInsertRecord;
+exports.getStoreRecordProxy = getStoreRecordProxy;
+exports.getMutableStoreRecordProxy = getMutableStoreRecordProxy;
+exports.addNetworkResponseStoreLayer = addNetworkResponseStoreLayer;
+exports.addStartUpdateStoreLayer = addStartUpdateStoreLayer;
+exports.addOptimisticUpdaterStoreLayer = addOptimisticUpdaterStoreLayer;
+exports.addOptimisticNetworkResponseStoreLayer = addOptimisticNetworkResponseStoreLayer;
+exports.revertOptimisticStoreLayerAndMaybeReplace = revertOptimisticStoreLayerAndMaybeReplace;
+const cache_1 = require("./cache");
+function getOrInsertRecord(dataLayer, link) {
+    var _a, _b;
+    var _c, _d;
+    const recordsById = ((_a = dataLayer[_c = link.__typename]) !== null && _a !== void 0 ? _a : (dataLayer[_c] = {}));
+    return ((_b = recordsById[_d = link.__link]) !== null && _b !== void 0 ? _b : (recordsById[_d] = {}));
+}
+/**
+ * Given the child-most store layer (i.e. environment.store) and a link (identifying a
+ * store record), create a proxy object that attempts to read through each successive
+ * store layer until a value (i.e. field name) is found. If found, return that value.
+ */
+function getStoreRecordProxy(storeLayer, link) {
+    var _a;
+    let startNode = storeLayer;
+    while (startNode !== null) {
+        const storeRecord = (_a = startNode.data[link.__typename]) === null || _a === void 0 ? void 0 : _a[link.__link];
+        if (storeRecord === null) {
+            return null;
+        }
+        if (storeRecord != null) {
+            return getMutableStoreRecordProxy(startNode, link);
+        }
+        startNode = startNode.parentStoreLayer;
+    }
+    return undefined;
+}
+function getMutableStoreRecordProxy(childMostStoreLayer, link) {
+    return new Proxy({}, {
+        get(_, propertyName) {
+            var _a;
+            let currentStoreLayer = childMostStoreLayer;
+            while (currentStoreLayer !== null) {
+                const storeRecord = (_a = currentStoreLayer.data[link.__typename]) === null || _a === void 0 ? void 0 : _a[link.__link];
+                if (storeRecord === null) {
+                    return undefined;
+                }
+                if (storeRecord != null) {
+                    const value = Reflect.get(storeRecord, propertyName);
+                    if (value !== undefined) {
+                        return value;
+                    }
+                }
+                currentStoreLayer = currentStoreLayer.parentStoreLayer;
+            }
+        },
+        has(_, propertyName) {
+            var _a;
+            let currentStoreLayer = childMostStoreLayer;
+            while (currentStoreLayer !== null) {
+                const storeRecord = (_a = currentStoreLayer.data[link.__typename]) === null || _a === void 0 ? void 0 : _a[link.__link];
+                if (storeRecord === null) {
+                    return false;
+                }
+                if (storeRecord != null) {
+                    const value = Reflect.has(storeRecord, propertyName);
+                    if (value !== undefined) {
+                        return true;
+                    }
+                }
+                currentStoreLayer = currentStoreLayer.parentStoreLayer;
+            }
+            return false;
+        },
+        set(_, p, newValue) {
+            return Reflect.set(getOrInsertRecord(childMostStoreLayer.data, link), p, newValue);
+        },
+    });
+}
+function addNetworkResponseStoreLayer(parent) {
+    switch (parent.kind) {
+        case 'NetworkResponseStoreLayer':
+        case 'BaseStoreLayer': {
+            return parent;
+        }
+        case 'StartUpdateStoreLayer':
+        case 'OptimisticNetworkResponseStoreLayer':
+        case 'OptimisticUpdaterStoreLayer': {
+            const node = {
+                kind: 'NetworkResponseStoreLayer',
+                parentStoreLayer: parent,
+                childStoreLayer: null,
+                data: {},
+            };
+            parent.childStoreLayer = node;
+            return node;
+        }
+        default: {
+            parent;
+            throw new Error('Unreachable. This is a bug in Isograph.');
+        }
+    }
+}
+function mergeDataLayer(target, source) {
+    var _a, _b;
+    for (const [typeName, sourceById] of Object.entries(source)) {
+        if (sourceById == null) {
+            target[typeName] = sourceById;
+            continue;
+        }
+        const targetRecordById = ((_a = target[typeName]) !== null && _a !== void 0 ? _a : (target[typeName] = {}));
+        for (const [id, sourceRecord] of Object.entries(sourceById)) {
+            if (sourceRecord === null) {
+                targetRecordById[id] = null;
+                continue;
+            }
+            const targetRecord = ((_b = targetRecordById[id]) !== null && _b !== void 0 ? _b : (targetRecordById[id] = {}));
+            Object.assign(targetRecord, sourceRecord);
+        }
+    }
+}
+function addStartUpdateStoreLayer(parent, startUpdate) {
+    switch (parent.kind) {
+        case 'BaseStoreLayer': {
+            startUpdate(parent);
+            return parent;
+        }
+        case 'StartUpdateStoreLayer': {
+            const node = parent;
+            const prevStartUpdate = node.startUpdate;
+            node.startUpdate = () => {
+                prevStartUpdate(node);
+                startUpdate(node);
+            };
+            startUpdate(node);
+            return node;
+        }
+        case 'NetworkResponseStoreLayer':
+        case 'OptimisticNetworkResponseStoreLayer':
+        case 'OptimisticUpdaterStoreLayer': {
+            const node = {
+                kind: 'StartUpdateStoreLayer',
+                parentStoreLayer: parent,
+                childStoreLayer: null,
+                data: {},
+                startUpdate: startUpdate,
+            };
+            parent.childStoreLayer = node;
+            startUpdate(node);
+            return node;
+        }
+        default: {
+            parent;
+            throw new Error('Unreachable. This is a bug in Isograph.');
+        }
+    }
+}
+function addOptimisticUpdaterStoreLayer(parent, startUpdate) {
+    switch (parent.kind) {
+        case 'BaseStoreLayer':
+        case 'StartUpdateStoreLayer':
+        case 'NetworkResponseStoreLayer':
+        case 'OptimisticNetworkResponseStoreLayer':
+        case 'OptimisticUpdaterStoreLayer': {
+            const node = {
+                kind: 'OptimisticUpdaterStoreLayer',
+                parentStoreLayer: parent,
+                childStoreLayer: null,
+                data: {},
+                startUpdate: startUpdate,
+            };
+            startUpdate(node);
+            parent.childStoreLayer = node;
+            return node;
+        }
+        default: {
+            parent;
+            throw new Error('Unreachable. This is a bug in Isograph.');
+        }
+    }
+}
+function addOptimisticNetworkResponseStoreLayer(parent) {
+    switch (parent.kind) {
+        case 'BaseStoreLayer':
+        case 'StartUpdateStoreLayer':
+        case 'NetworkResponseStoreLayer':
+        case 'OptimisticNetworkResponseStoreLayer':
+        case 'OptimisticUpdaterStoreLayer': {
+            const node = {
+                kind: 'OptimisticNetworkResponseStoreLayer',
+                parentStoreLayer: parent,
+                childStoreLayer: null,
+                data: {},
+            };
+            parent.childStoreLayer = node;
+            return node;
+        }
+        default: {
+            parent;
+            throw new Error('Unreachable. This is a bug in Isograph.');
+        }
+    }
+}
+/**
+ * Merge storeLayerToMerge, and its children, into baseStoreLayer.
+ * We can merge until we reach a revertible layer (i.e. an optimistic layer).
+ * All other layers cannot be reverted, so for housekeeping + perf, we merge
+ * them into a single layer.
+ *
+ * Note that BaseStoreLayer.childStoreLayer has type OptimisticStoreLayer | null.
+ * So, the state of the stack is never e.g. base <- network response. Instead,
+ * we have a base + a child that we would like to attach to the base. So, we merge
+ * (flatten) until we reach an optimistic layer or null, at which point, we can
+ * set baseStoreLayer.childStoreLayer = storeLayerToMerge (via setChildOfNode).
+ */
+function mergeLayersWithDataIntoBaseLayer(environment, storeLayerToMerge, baseStoreLayer) {
+    while (storeLayerToMerge &&
+        storeLayerToMerge.kind !== 'OptimisticUpdaterStoreLayer') {
+        mergeDataLayer(baseStoreLayer.data, storeLayerToMerge.data);
+        storeLayerToMerge = storeLayerToMerge.childStoreLayer;
+    }
+    setChildOfNode(environment, baseStoreLayer, storeLayerToMerge);
+}
+/**
+ * Now that we have replaced the optimistic layer with a network response layer, we need
+ * to
+ * - re-execute startUpdate and optimistic nodes, in light of the replaced data, and
+ * - create two objects containing the old merged data (from the optimistic update layer
+ *   onward) and the new merged data (from the network response layer onward).
+ * - we will compare the new and old merged data in order to determine the changed records
+ *   and trigger subscriptions.
+ *
+ * Here, "merged data" means all of the records + fields that were modified, starting at
+ * storeLayer, e.g. in BaseLayer <- OptimisticLayer <- StartUpdateLayer, if we
+ * are replacing Optimistic, then oldData will contain the records + fields modified by
+ * OptimisticLayer + StartUpdateLayer.
+ */
+function reexecuteUpdatesAndMergeData(storeLayer, 
+// reflects the (now reverted) optimistic layer
+oldMergedData, 
+// reflects whatever replaced the optimistic layer
+newMergedData) {
+    while (storeLayer !== null) {
+        mergeDataLayer(oldMergedData, storeLayer.data);
+        switch (storeLayer.kind) {
+            case 'OptimisticNetworkResponseStoreLayer':
+            case 'NetworkResponseStoreLayer':
+                break;
+            case 'StartUpdateStoreLayer': {
+                storeLayer.data = {};
+                storeLayer.startUpdate(storeLayer);
+                break;
+            }
+            case 'OptimisticUpdaterStoreLayer': {
+                storeLayer.data = {};
+                storeLayer.startUpdate(storeLayer);
+                break;
+            }
+            default: {
+                storeLayer;
+                throw new Error('Unreachable. This is a bug in Isograph.');
+            }
+        }
+        mergeDataLayer(newMergedData, storeLayer.data);
+        storeLayer = storeLayer.childStoreLayer;
+    }
+}
+/**
+ * Set storeLayerToModify's child to a given layer. This may be null!
+ * If it is null, set the environment.store to storeLayerToModify.
+ * If it is not null, then the existing environment.store value remains
+ * valid.
+ */
+function setChildOfNode(environment, storeLayerToModify, newChildStoreLayer) {
+    storeLayerToModify.childStoreLayer = newChildStoreLayer;
+    if (newChildStoreLayer !== null) {
+        newChildStoreLayer.parentStoreLayer = storeLayerToModify;
+    }
+    else {
+        environment.store = storeLayerToModify;
+    }
+}
+/**
+ * Remove an optimistic store layer from the stack, potentially replacing it
+ * with a network response.
+ *
+ * After we do this, we must re-execute all child startUpdate and optimistic
+ * layers (since their data may have changed.) We also keep track of changed
+ * records, in order to call affected subscriptions.
+ */
+function revertOptimisticStoreLayerAndMaybeReplace(environment, optimisticNode, normalizeData) {
+    var _a;
+    // We cannot just replace the optimistic node with the network response node,
+    // because (e.g.) the types allow Base <- Opt, but not Base <- NetworkResponse.
+    // We also may be removing the optimistic layer without replacing it with
+    // anything, which would also be disallowed if the original stack was
+    // Base <- Opt <- NetworkResponse.
+    //
+    // Thus, instead, we will (1) replace the optimistic node's data with an empty object
+    // and attach the network response as a child.
+    const oldMergedData = optimisticNode.data;
+    optimisticNode.data = {};
+    let newMergedData = {};
+    let childNode = optimisticNode.childStoreLayer;
+    if (normalizeData !== null) {
+        const networkResponseStoreLayer = {
+            kind: 'NetworkResponseStoreLayer',
+            data: {},
+            parentStoreLayer: optimisticNode,
+            childStoreLayer: null,
+        };
+        normalizeData(networkResponseStoreLayer);
+        if ((childNode === null || childNode === void 0 ? void 0 : childNode.kind) === 'NetworkResponseStoreLayer') {
+            // (2) if the optimistic layer's child was a network response, and we are
+            // replacing it with a network response, we must merge the replacement
+            // and the child.
+            mergeDataLayer(networkResponseStoreLayer.data, childNode.data);
+            mergeDataLayer(oldMergedData, childNode.data);
+            childNode = childNode.childStoreLayer;
+        }
+        newMergedData = structuredClone(networkResponseStoreLayer.data);
+        setChildOfNode(environment, networkResponseStoreLayer, childNode);
+        optimisticNode.childStoreLayer = networkResponseStoreLayer;
+    }
+    // (3) Re-execute all updates, accumulating all changed values into newMergedData.
+    // Since we have already written the network response into newMergedData, we
+    // can proceed from the child of the (potentially merged) network response layer.
+    //
+    // Note that it is important that reexecuteUpdatesAndMergeData is called here!
+    // That is because we created newMergedData from the network response layer's data,
+    // and later, we may merge that network response into the parent layer (if it is
+    // a base layer). That merged layer will contain many extraneous records (unless the
+    // base layer is empty).
+    //
+    // This would cause us to re-execute subscriptions unnecessarily, as these records
+    // do not represent changes between the optimistic and network response layers.
+    reexecuteUpdatesAndMergeData(childNode, oldMergedData, newMergedData);
+    // (4) Now, we can finally remove the optimistic layer, i.e. do
+    // optimistic.parent.child = optimistic.child.
+    // But the types don't line up, so we handle the cases differently, based on the
+    // parent layer type.
+    if (optimisticNode.parentStoreLayer.kind === 'BaseStoreLayer') {
+        // (4a) If the optimistic parent is the base layer, then we have a problem: base.child
+        // must be an optimistic layer or null. So, we merge the optimistic children into the
+        // base layer until we reach an optimistic layer.
+        mergeLayersWithDataIntoBaseLayer(environment, optimisticNode.childStoreLayer, optimisticNode.parentStoreLayer);
+    }
+    else if (optimisticNode.parentStoreLayer.kind === 'NetworkResponseStoreLayer' &&
+        ((_a = optimisticNode.childStoreLayer) === null || _a === void 0 ? void 0 : _a.kind) === 'NetworkResponseStoreLayer') {
+        // (4b) if the parent is a network response layer, simply merge those. (We do not
+        // attempt to merge other layers, e.g. startUpdate layers, because there is some
+        // optimistic layer between this layer and the base, and the startUpdate will need
+        // to be recalculated if the optimistic layer is reverted.)
+        mergeDataLayer(optimisticNode.parentStoreLayer.data, optimisticNode.childStoreLayer.data);
+        setChildOfNode(environment, optimisticNode.parentStoreLayer, optimisticNode.childStoreLayer.childStoreLayer);
+    }
+    else {
+        // (4c) Otherwise, the parent is an optimistic or start update layer, and we can
+        // set optimistic.parent.child = optimistic.child.
+        setChildOfNode(environment, optimisticNode.parentStoreLayer, optimisticNode.childStoreLayer);
+    }
+    // (5) finally, compare the oldMergedData and newMergedData objects, in order to extract
+    // the modified IDs, and re-execute subscriptions.
+    let encounteredIds = new Map();
+    compareData(oldMergedData, newMergedData, encounteredIds);
+    (0, cache_1.callSubscriptions)(environment, encounteredIds);
+}
+function compareData(oldData, newData, encounteredIds) {
+    var _a;
+    const oldDataTypeNames = new Set(Object.keys(oldData));
+    const newDataTypeNames = new Set(Object.keys(newData));
+    for (const oldTypeName of oldDataTypeNames.difference(newDataTypeNames)) {
+        const set = (0, cache_1.insertEmptySetIfMissing)(encounteredIds, oldTypeName);
+        for (const id in oldData[oldTypeName]) {
+            set.add(id);
+        }
+    }
+    for (const [typeName, newRecords] of Object.entries(newData)) {
+        if (newRecords == null) {
+            continue;
+        }
+        const oldRecords = oldData[typeName];
+        outer: for (const [id, newRecord] of Object.entries(newRecords)) {
+            if (newRecord == null) {
+                continue;
+            }
+            const oldRecord = oldRecords === null || oldRecords === void 0 ? void 0 : oldRecords[id];
+            for (const [recordKey, newRecordValue] of Object.entries(newRecord)) {
+                // TODO: compare links, compare arrays
+                if (newRecordValue !== (oldRecord === null || oldRecord === void 0 ? void 0 : oldRecord[recordKey])) {
+                    const set = (0, cache_1.insertEmptySetIfMissing)(encounteredIds, typeName);
+                    set.add(id);
+                    continue outer;
+                }
+            }
+            (_a = encounteredIds.get(typeName)) === null || _a === void 0 ? void 0 : _a.delete(id);
+        }
+    }
+}

package/dist/core/read.d.ts

@@ -3,7 +3,7 @@ import { RefetchQueryNormalizationArtifactWrapper } from './entrypoint';
 import { ExtractData, FragmentReference, Variables, type UnknownTReadFromStore } from './FragmentReference';
 import { IsographEnvironment, type DataTypeValue, type StoreLink, type StoreRecord } from './IsographEnvironment';
 import { PromiseWrapper } from './PromiseWrapper';
-import { ReaderAst, type LoadablySelectedField, type ReaderImperativelyLoadedField, type ReaderLinkedField, type ReaderNonLoadableResolverField, type ReaderScalarField } from './reader';
+import { ReaderAst, type LoadablySelectedField, type ReaderClientPointer, type ReaderImperativelyLoadedField, type ReaderLinkedField, type ReaderNonLoadableResolverField, type ReaderScalarField } from './reader';
 export type WithEncounteredRecords<T> = {
     readonly encounteredRecords: EncounteredIds;
     readonly item: ExtractData<T>;
@@ -21,8 +21,9 @@ export type ReadDataResult<Data> = ReadDataResultSuccess<Data> | {
 };
 export declare function readLoadablySelectedFieldData(environment: IsographEnvironment, field: LoadablySelectedField, root: StoreLink, variables: Variables, networkRequest: PromiseWrapper<void, any>, networkRequestOptions: NetworkRequestReaderOptions, mutableEncounteredRecords: EncounteredIds): ReadDataResult<unknown>;
 export declare function readResolverFieldData(environment: IsographEnvironment, field: ReaderNonLoadableResolverField, root: StoreLink, variables: Variables, nestedRefetchQueries: RefetchQueryNormalizationArtifactWrapper[], networkRequest: PromiseWrapper<void, any>, networkRequestOptions: NetworkRequestReaderOptions, mutableEncounteredRecords: EncounteredIds): ReadDataResult<unknown>;
-export declare function readScalarFieldData(field: ReaderScalarField, storeRecord: StoreRecord, root: StoreLink, variables: Variables): ReadDataResult<string | number | boolean | StoreLink | DataTypeValue[] | null>;
+export declare function readScalarFieldData(field: ReaderScalarField, storeRecord: StoreRecord, root: StoreLink, variables: Variables): ReadDataResult<string | number | boolean | StoreLink | readonly DataTypeValue[] | null>;
 export declare function readLinkedFieldData(environment: IsographEnvironment, field: ReaderLinkedField, storeRecord: StoreRecord, root: StoreLink, variables: Variables, nestedRefetchQueries: RefetchQueryNormalizationArtifactWrapper[], networkRequest: PromiseWrapper<void, any>, networkRequestOptions: NetworkRequestReaderOptions, readData: <TReadFromStore>(ast: ReaderAst<TReadFromStore>, root: StoreLink) => ReadDataResult<object>): ReadDataResult<unknown>;
+export declare function readClientPointerData(environment: IsographEnvironment, field: ReaderClientPointer, root: StoreLink, variables: Variables, nestedRefetchQueries: RefetchQueryNormalizationArtifactWrapper[], readData: <TReadFromStore>(ast: ReaderAst<TReadFromStore>, root: StoreLink) => ReadDataResult<object>): ReadDataResult<unknown>;
 export type NetworkRequestReaderOptions = {
     suspendIfInFlight: boolean;
     throwOnNetworkError: boolean;

package/dist/core/read.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"read.d.ts","sourceRoot":"","sources":["../../src/core/read.ts"],"names":[],"mappings":"AACA,OAAO,EAIL,KAAK,cAAc,EACpB,MAAM,SAAS,CAAC;AAGjB,OAAO,EAEL,wCAAwC,EAEzC,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,WAAW,EACX,iBAAiB,EACjB,SAAS,EACT,KAAK,qBAAqB,EAC3B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAGL,mBAAmB,EACnB,KAAK,aAAa,EAClB,KAAK,SAAS,EACd,KAAK,WAAW,EACjB,MAAM,uBAAuB,CAAC;AAG/B,OAAO,EAGL,cAAc,EAIf,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,SAAS,EACT,KAAK,qBAAqB,EAC1B,KAAK,6BAA6B,EAClC,KAAK,iBAAiB,EACtB,KAAK,8BAA8B,EACnC,KAAK,iBAAiB,EACvB,MAAM,UAAU,CAAC;AAIlB,MAAM,MAAM,sBAAsB,CAAC,CAAC,IAAI;IACtC,QAAQ,CAAC,kBAAkB,EAAE,cAAc,CAAC;IAC5C,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;CAC/B,CAAC;AAEF,wBAAgB,oBAAoB,CAClC,cAAc,SAAS,qBAAqB,EAE5C,WAAW,EAAE,mBAAmB,EAChC,iBAAiB,EAAE,iBAAiB,CAAC,cAAc,EAAE,OAAO,CAAC,EAC7D,qBAAqB,EAAE,2BAA2B,GACjD,sBAAsB,CAAC,cAAc,CAAC,CA+DxC;AAED,MAAM,MAAM,qBAAqB,CAAC,IAAI,IAAI;IACxC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;CACrB,CAAC;AAEF,MAAM,MAAM,cAAc,CAAC,IAAI,IAC3B,qBAAqB,CAAC,IAAI,CAAC,GAC3B;IACE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,YAAY,CAAC,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC;IAChD,QAAQ,CAAC,UAAU,EAAE,SAAS,CAAC;CAChC,CAAC;AA+IN,wBAAgB,6BAA6B,CAC3C,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,qBAAqB,EAC5B,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,EACzC,qBAAqB,EAAE,2BAA2B,EAClD,yBAAyB,EAAE,cAAc,GACxC,cAAc,CAAC,OAAO,CAAC,CAiKzB;AAoFD,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,8BAA8B,EACrC,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,oBAAoB,EAAE,wCAAwC,EAAE,EAChE,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,EACzC,qBAAqB,EAAE,2BAA2B,EAClD,yBAAyB,EAAE,cAAc,GACxC,cAAc,CAAC,OAAO,CAAC,CAgFzB;AAED,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,iBAAiB,EACxB,WAAW,EAAE,WAAW,EACxB,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,GACnB,cAAc,CACf,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS,GAAG,aAAa,EAAE,GAAG,IAAI,CAC/D,CAaA;AAED,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,iBAAiB,EACxB,WAAW,EAAE,WAAW,EACxB,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,oBAAoB,EAAE,wCAAwC,EAAE,EAChE,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,EACzC,qBAAqB,EAAE,2BAA2B,EAClD,QAAQ,EAAE,CAAC,cAAc,EACvB,GAAG,EAAE,SAAS,CAAC,cAAc,CAAC,EAC9B,IAAI,EAAE,SAAS,KACZ,cAAc,CAAC,MAAM,CAAC,GAC1B,cAAc,CAAC,OAAO,CAAC,CA+PzB;AAED,MAAM,MAAM,2BAA2B,GAAG;IACxC,iBAAiB,EAAE,OAAO,CAAC;IAC3B,mBAAmB,EAAE,OAAO,CAAC;CAC9B,CAAC;AAEF,wBAAgB,oCAAoC,CAClD,qBAAqB,CAAC,EAAE,OAAO,CAAC,2BAA2B,CAAC,GAAG,IAAI,GAClE,2BAA2B,CAK7B;AAiBD,wBAAgB,2BAA2B,CACzC,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,6BAA6B,EACpC,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,oBAAoB,EAAE,wCAAwC,EAAE,EAChE,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,EACzC,qBAAqB,EAAE,2BAA2B,EAClD,yBAAyB,EAAE,cAAc,GACxC,cAAc,CAAC,OAAO,CAAC,CAuDzB"}
+{"version":3,"file":"read.d.ts","sourceRoot":"","sources":["../../src/core/read.ts"],"names":[],"mappings":"AACA,OAAO,EAIL,KAAK,cAAc,EACpB,MAAM,SAAS,CAAC;AAGjB,OAAO,EAEL,wCAAwC,EAEzC,MAAM,cAAc,CAAC;AACtB,OAAO,EACL,WAAW,EACX,iBAAiB,EACjB,SAAS,EACT,KAAK,qBAAqB,EAC3B,MAAM,qBAAqB,CAAC;AAC7B,OAAO,EAIL,mBAAmB,EACnB,KAAK,aAAa,EAClB,KAAK,SAAS,EACd,KAAK,WAAW,EACjB,MAAM,uBAAuB,CAAC;AAI/B,OAAO,EAGL,cAAc,EAIf,MAAM,kBAAkB,CAAC;AAC1B,OAAO,EACL,SAAS,EACT,KAAK,qBAAqB,EAC1B,KAAK,mBAAmB,EACxB,KAAK,6BAA6B,EAClC,KAAK,iBAAiB,EACtB,KAAK,8BAA8B,EACnC,KAAK,iBAAiB,EACvB,MAAM,UAAU,CAAC;AAIlB,MAAM,MAAM,sBAAsB,CAAC,CAAC,IAAI;IACtC,QAAQ,CAAC,kBAAkB,EAAE,cAAc,CAAC;IAC5C,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC,CAAC;CAC/B,CAAC;AAEF,wBAAgB,oBAAoB,CAClC,cAAc,SAAS,qBAAqB,EAE5C,WAAW,EAAE,mBAAmB,EAChC,iBAAiB,EAAE,iBAAiB,CAAC,cAAc,EAAE,OAAO,CAAC,EAC7D,qBAAqB,EAAE,2BAA2B,GACjD,sBAAsB,CAAC,cAAc,CAAC,CA+DxC;AAED,MAAM,MAAM,qBAAqB,CAAC,IAAI,IAAI;IACxC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC;CACrB,CAAC;AAEF,MAAM,MAAM,cAAc,CAAC,IAAI,IAC3B,qBAAqB,CAAC,IAAI,CAAC,GAC3B;IACE,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAC;IAC7B,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,YAAY,CAAC,EAAE,cAAc,CAAC,OAAO,CAAC,CAAC;IAChD,QAAQ,CAAC,UAAU,EAAE,SAAS,CAAC;CAChC,CAAC;AA+IN,wBAAgB,6BAA6B,CAC3C,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,qBAAqB,EAC5B,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,EACzC,qBAAqB,EAAE,2BAA2B,EAClD,yBAAyB,EAAE,cAAc,GACxC,cAAc,CAAC,OAAO,CAAC,CAoKzB;AAoFD,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,8BAA8B,EACrC,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,oBAAoB,EAAE,wCAAwC,EAAE,EAChE,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,EACzC,qBAAqB,EAAE,2BAA2B,EAClD,yBAAyB,EAAE,cAAc,GACxC,cAAc,CAAC,OAAO,CAAC,CAgFzB;AAED,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,iBAAiB,EACxB,WAAW,EAAE,WAAW,EACxB,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,GACnB,cAAc,CACf,MAAM,GAAG,MAAM,GAAG,OAAO,GAAG,SAAS,GAAG,SAAS,aAAa,EAAE,GAAG,IAAI,CACxE,CAaA;AAED,wBAAgB,mBAAmB,CACjC,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,iBAAiB,EACxB,WAAW,EAAE,WAAW,EACxB,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,oBAAoB,EAAE,wCAAwC,EAAE,EAChE,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,EACzC,qBAAqB,EAAE,2BAA2B,EAClD,QAAQ,EAAE,CAAC,cAAc,EACvB,GAAG,EAAE,SAAS,CAAC,cAAc,CAAC,EAC9B,IAAI,EAAE,SAAS,KACZ,cAAc,CAAC,MAAM,CAAC,GAC1B,cAAc,CAAC,OAAO,CAAC,CAyMzB;AAQD,wBAAgB,qBAAqB,CACnC,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,mBAAmB,EAC1B,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,oBAAoB,EAAE,wCAAwC,EAAE,EAChE,QAAQ,EAAE,CAAC,cAAc,EACvB,GAAG,EAAE,SAAS,CAAC,cAAc,CAAC,EAC9B,IAAI,EAAE,SAAS,KACZ,cAAc,CAAC,MAAM,CAAC,GAC1B,cAAc,CAAC,OAAO,CAAC,CAoGzB;AAED,MAAM,MAAM,2BAA2B,GAAG;IACxC,iBAAiB,EAAE,OAAO,CAAC;IAC3B,mBAAmB,EAAE,OAAO,CAAC;CAC9B,CAAC;AAEF,wBAAgB,oCAAoC,CAClD,qBAAqB,CAAC,EAAE,OAAO,CAAC,2BAA2B,CAAC,GAAG,IAAI,GAClE,2BAA2B,CAK7B;AAiBD,wBAAgB,2BAA2B,CACzC,WAAW,EAAE,mBAAmB,EAChC,KAAK,EAAE,6BAA6B,EACpC,IAAI,EAAE,SAAS,EACf,SAAS,EAAE,SAAS,EACpB,oBAAoB,EAAE,wCAAwC,EAAE,EAChE,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,EACzC,qBAAqB,EAAE,2BAA2B,EAClD,yBAAyB,EAAE,cAAc,GACxC,cAAc,CAAC,OAAO,CAAC,CAuDzB"}