alinea 1.6.2 → 1.6.4

package/dist/.init/content/pages/welcome.json

@@ -1,5 +1,5 @@
 {
-  "_id": "38IS1tizQCRGMEB4x75OGoOLPLx",
+  "_id": "3ANouvCBk1JT7dZD7EYfYwIOceE",
   "_type": "Page",
   "_index": "a0",
   "_seeded": "welcome.json",

package/dist/LICENSES.md

@@ -2,11 +2,11 @@ This file contains the licenses of the bundled modules in this distribution.
 
 ===
 
-# react-query@3.39.3 (MIT)
+# rado@1.0.15 (MIT)
 
 MIT License
 
-Copyright (c) 2019 Tanner Linsley
+Copyright (c) 2024 Ben Merckx
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -26,14 +26,36 @@ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
 
+===
+
+# htmlparser2@9.1.0 (MIT)
+
+Copyright 2010, 2011, Chris Winberry <chris@winberry.net>. All rights reserved.
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to
+deal in the Software without restriction, including without limitation the
+rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
+sell copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+ 
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+ 
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+IN THE SOFTWARE.
 
 ===
 
-# rado@1.0.15 (MIT)
+# react-query@3.39.3 (MIT)
 
 MIT License
 
-Copyright (c) 2024 Ben Merckx
+Copyright (c) 2019 Tanner Linsley
 
 Permission is hereby granted, free of charge, to any person obtaining a copy
 of this software and associated documentation files (the "Software"), to deal
@@ -53,6 +75,7 @@ LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
 
+
 ===
 
 # @headlessui/react@2.2.0 (MIT)
@@ -108,30 +131,24 @@ SOFTWARE.
 
 ===
 
-# htmlparser2@9.1.0 (MIT)
+# domutils@3.1.0 (BSD-2-Clause)
+
+Copyright (c) Felix Böhm
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
+
+Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
+
+Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
+
+THIS IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS,
+EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
-Copyright 2010, 2011, Chris Winberry <chris@winberry.net>. All rights reserved.
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to
-deal in the Software without restriction, including without limitation the
-rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-sell copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
- 
-The above copyright notice and this permission notice shall be included in
-all copies or substantial portions of the Software.
- 
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
-IN THE SOFTWARE.
 
 ===
 
-# domutils@3.1.0 (BSD-2-Clause)
+# domhandler@5.0.3 (BSD-2-Clause)
 
 Copyright (c) Felix Böhm
 All rights reserved.
@@ -148,7 +165,7 @@ EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 ===
 
-# domhandler@5.0.3 (BSD-2-Clause)
+# entities@4.5.0 (BSD-2-Clause)
 
 Copyright (c) Felix Böhm
 All rights reserved.
@@ -163,6 +180,33 @@ THIS IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRE
 EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 
 
+===
+
+# @badgateway/oauth2-client@3.2.0 (MIT)
+
+MIT License
+
+Copyright (c) 2019-2023 Evert Pot
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+
 ===
 
 # @popperjs/core@2.11.8 (MIT)
@@ -189,23 +233,6 @@ IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
 CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 
-===
-
-# entities@4.5.0 (BSD-2-Clause)
-
-Copyright (c) Felix Böhm
-All rights reserved.
-
-Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
-
-Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
-
-Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
-
-THIS IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS,
-EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-
 ===
 
 # prop-types@15.8.1 (MIT)
@@ -442,29 +469,19 @@ SOFTWARE.
 
 ===
 
-# @badgateway/oauth2-client@3.2.0 (MIT)
+# dom-serializer@2.0.0 (MIT)
 
-MIT License
+License
 
-Copyright (c) 2019-2023 Evert Pot
+(The MIT License)
 
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
+Copyright (c) 2014 The cheeriojs contributors
 
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the 'Software'), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
 
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 
 
 ===
@@ -494,23 +511,6 @@ OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 SOFTWARE.
 
 
-===
-
-# dom-serializer@2.0.0 (MIT)
-
-License
-
-(The MIT License)
-
-Copyright (c) 2014 The cheeriojs contributors
-
-Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the 'Software'), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
-
 ===
 
 # @headless-tree/core@0.0.15 (MIT)
@@ -1612,6 +1612,33 @@ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 See the License for the specific language governing permissions and
 limitations under the License.
 
+===
+
+# @tanstack/virtual-core@3.10.6 (MIT)
+
+MIT License
+
+Copyright (c) 2021-present Tanner Linsley
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+
+
 ===
 
 # @react-stately/utils@3.10.5 (Apache-2.0)
@@ -1817,30 +1844,3 @@ limitations under the License.
    WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
    See the License for the specific language governing permissions and
    limitations under the License.
-
-
-===
-
-# @tanstack/virtual-core@3.10.6 (MIT)
-
-MIT License
-
-Copyright (c) 2021-present Tanner Linsley
-
-Permission is hereby granted, free of charge, to any person obtaining a copy
-of this software and associated documentation files (the "Software"), to deal
-in the Software without restriction, including without limitation the rights
-to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-copies of the Software, and to permit persons to whom the Software is
-furnished to do so, subject to the following conditions:
-
-The above copyright notice and this permission notice shall be included in all
-copies or substantial portions of the Software.
-
-THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-SOFTWARE.

package/dist/backend/api/OAuth2.js

@@ -141,7 +141,7 @@ async function getWebCrypto() {
   if (typeof self !== "undefined" && self.crypto) {
     return self.crypto;
   }
-  const crypto = await import("crypto");
+  const crypto = await import("../../chunks/crypto-HZTUU327.js");
   return crypto.webcrypto;
 }
 function stringToBuffer(input) {

package/dist/backend/resolver/ParsePreview.d.ts

@@ -1,5 +1,5 @@
-import type { PreviewRequest } from 'alinea/core/Preview';
 import type { LocalDB } from 'alinea/core/db/LocalDB';
+import type { PreviewRequest } from 'alinea/core/Preview';
 export declare function createPreviewParser(local: LocalDB): {
     parse(preview: PreviewRequest, sync: () => Promise<unknown>): Promise<PreviewRequest | undefined>;
 };

package/dist/backend/resolver/ParsePreview.js

@@ -1,41 +1,54 @@
-import {
-  Doc,
-  applyUpdate
-} from "../../chunks/chunk-QUIANN6B.js";
-import "../../chunks/chunk-AJJSW27C.js";
 import "../../chunks/chunk-NZLE2WMY.js";
 
 // src/backend/resolver/ParsePreview.ts
+import { JsonLoader } from "alinea/backend/loader/JsonLoader";
 import { Entry } from "alinea/core";
-import { DOC_KEY, parseYDoc } from "alinea/core/Doc";
-import { Type } from "alinea/core/Type";
+import { createRecord, parseRecord } from "alinea/core/EntryRecord";
+import { applyFilePatch } from "alinea/core/source/FilePatch";
+import { createEntryRow } from "alinea/core/util/EntryRows";
 import { decodePreviewPayload } from "alinea/preview/PreviewPayload";
+var decoder = new TextDecoder();
 function createPreviewParser(local) {
   return {
     async parse(preview, sync) {
       if (!(preview && "payload" in preview)) return preview;
-      const update = await decodePreviewPayload(preview.payload);
-      if (local.sha !== update.contentHash) {
+      const payload = await decodePreviewPayload(preview.payload);
+      if (local.sha !== payload.contentHash) {
         await sync();
-        if (local.sha !== update.contentHash) return;
+        if (local.sha !== payload.contentHash) return;
       }
       const entry = await local.first({
         select: Entry,
-        id: update.entryId,
-        locale: update.locale,
+        id: payload.entryId,
+        locale: payload.locale,
         status: "preferDraft"
       });
       if (!entry) return;
-      const type = local.config.schema[entry.type];
-      if (!type) return;
-      const doc = new Doc();
-      const clientID = doc.clientID;
-      doc.clientID = 1;
-      Type.shape(type).applyY(entry.data, doc, DOC_KEY);
-      doc.clientID = clientID;
-      applyUpdate(doc, update.update);
-      const entryData = parseYDoc(type, doc);
-      return { entry: { ...entry, ...entryData, path: entry.path } };
+      const baseText = decoder.decode(
+        JsonLoader.format(
+          local.config.schema,
+          createRecord(entry, entry.status)
+        )
+      );
+      let updatedText;
+      try {
+        updatedText = await applyFilePatch(baseText, payload.patch);
+      } catch {
+        return;
+      }
+      const { data } = parseRecord(JSON.parse(updatedText));
+      const { rowHash: _rowHash, fileHash: _fileHash, ...withoutHashes } = entry;
+      const patched = await createEntryRow(
+        local.config,
+        {
+          ...withoutHashes,
+          title: data.title,
+          data,
+          path: entry.path
+        },
+        entry.status
+      );
+      return { entry: patched };
     }
   };
 }

package/dist/bundled.d.ts

@@ -358,8 +358,8 @@ declare module 'alinea/backend/Previews' {
 
 declare module 'alinea/backend/resolver/ParsePreview' {
 
-  import type { PreviewRequest } from 'alinea/core/Preview';
   import type { LocalDB } from 'alinea/core/db/LocalDB';
+  import type { PreviewRequest } from 'alinea/core/Preview';
   export function createPreviewParser(local: LocalDB): {
       parse(preview: PreviewRequest, sync: () => Promise<unknown>): Promise<PreviewRequest | undefined>;
   };
@@ -1686,7 +1686,7 @@ declare module 'alinea/core/db/LinkResolver' {
       private locale;
       constructor(resolver: EntryResolver, ctx: ResolveContext, locale: string | null);
       includedAtBuild(filePath: string): boolean;
-      resolveLinks<P extends Projection>(projection: P, entryIds: ReadonlyArray<string>): Promise<Array<InferProjection<P> | undefined>>;
+      resolveLinks<P extends Projection>(projection: P, entryIds: ReadonlyArray<string>): Promise<Array<InferProjection<P>>>;
   }
   
 }
@@ -2997,7 +2997,7 @@ declare module 'alinea/core/Preview' {
       entryId: string;
       contentHash: string;
       status: string;
-      update: Uint8Array;
+      patch: Uint8Array;
   }
   export interface PreviewMetadata {
       title: string;
@@ -3534,6 +3534,29 @@ declare module 'alinea/core/source/CombinedSource.test' {
   
 }
 
+declare module 'alinea/core/source/FilePatch' {
+
+  /**
+   * Creates a Git-delta based patch for transforming `base` into `updated`.
+   * Format:
+   * - 20 bytes: SHA-1(base)
+   * - N bytes: Git delta payload
+   * - 20 bytes: SHA-1(updated)
+   */
+  export function createFilePatch(base: string, updated: string): Promise<Uint8Array>;
+  /**
+   * Applies a patch created by `createFilePatch` and returns the updated string.
+   */
+  export function applyFilePatch(base: string, patch: Uint8Array): Promise<string>;
+  
+}
+
+declare module 'alinea/core/source/FilePatch.test' {
+
+  export {};
+  
+}
+
 declare module 'alinea/core/source/FSSource' {
 
   import type { ChangesBatch } from 'alinea/core/source/Change';
@@ -3565,6 +3588,27 @@ declare module 'alinea/core/source/FSSource.test' {
   
 }
 
+declare module 'alinea/core/source/GitDelta' {
+
+  /**
+   * Creates Git-compatible delta data (the payload format used by OBJ_REF_DELTA
+   * and OBJ_OFS_DELTA entries in pack files).
+   */
+  export function createGitDelta(base: Uint8Array, target: Uint8Array): Uint8Array;
+  /**
+   * Applies Git delta data onto a base object and returns the reconstructed
+   * target object bytes.
+   */
+  export function applyGitDelta(base: Uint8Array, delta: Uint8Array): Uint8Array;
+  
+}
+
+declare module 'alinea/core/source/GitDelta.test' {
+
+  export {};
+  
+}
+
 declare module 'alinea/core/source/GithubSource' {
 
   import type { ChangesBatch } from 'alinea/core/source/Change';
@@ -3836,6 +3880,10 @@ declare module 'alinea/core/source/Tree.test' {
 
 declare module 'alinea/core/source/Utils' {
 
+  /**
+   * Computes the SHA-1 hash bytes of the input data.
+   */
+  export function sha1Bytes(data: Uint8Array): Promise<Uint8Array>;
   /**
    * Computes the SHA-1 hash of the input data.
    */
@@ -8233,6 +8281,12 @@ declare module 'alinea/preview/PreviewPayload' {
   
 }
 
+declare module 'alinea/preview/PreviewPayload.test' {
+
+  export {};
+  
+}
+
 declare module 'alinea/preview/react' {
 
   import { type PreviewApi } from 'alinea/preview/RegisterPreview';

package/dist/chunks/{chunk-APLOCHCC.js → chunk-3B5ZGDWF.js}

@@ -21,7 +21,7 @@ var package_default = {
     "cycles:browser": "CHECK_CYCLES=browser bun build.ts && bunx --bun madge --warning --circular dist/index.js dist/ui.js dist/dashboard/App.js",
     type: "tsc --diagnostics",
     "dev:check": "tsc -w",
-    "dev:run": "bun build.ts --watch -- node dev.js --dir apps/dev",
+    "dev:run": "bun build.ts --watch -- node dev.js --dir apps/dev -- bun run --cwd apps/dev dev",
     "web:run": "bun build.ts --watch -- node dev.js -- bun run --cwd apps/web dev",
     trace: "tsc --diagnostics --generateTrace private/trace && analyze-trace private/trace & speedscope private/trace/trace.json",
     prepublishOnly: "bun run build"

package/dist/chunks/{chunk-HELH3PKC.js → chunk-NWJMNYVI.js}

@@ -2,7 +2,7 @@
 var package_default = {
   bin: "./dist/cli.js",
   name: "alinea",
-  version: "1.6.2",
+  version: "1.6.4",
   description: "Headless git-based CMS",
   repository: {
     type: "git",
@@ -21,7 +21,7 @@ var package_default = {
     "cycles:browser": "CHECK_CYCLES=browser bun build.ts && bunx --bun madge --warning --circular dist/index.js dist/ui.js dist/dashboard/App.js",
     type: "tsc --diagnostics",
     "dev:check": "tsc -w",
-    "dev:run": "bun build.ts --watch -- node dev.js --dir apps/dev",
+    "dev:run": "bun build.ts --watch -- node dev.js --dir apps/dev -- bun run --cwd apps/dev dev",
     "web:run": "bun build.ts --watch -- node dev.js -- bun run --cwd apps/web dev",
     trace: "tsc --diagnostics --generateTrace private/trace && analyze-trace private/trace & speedscope private/trace/trace.json",
     prepublishOnly: "bun run build"

package/dist/chunks/crypto-HZTUU327.js

@@ -0,0 +1,11 @@
+import "./chunk-NZLE2WMY.js";
+
+// oauth-iso-crypto:crypto
+import { crypto } from "@alinea/iso";
+var webcrypto = crypto;
+var crypto_default = { webcrypto };
+export {
+  crypto,
+  crypto_default as default,
+  webcrypto
+};

package/dist/cli/Serve.js

@@ -1,6 +1,6 @@
 import {
   package_default
-} from "../chunks/chunk-HELH3PKC.js";
+} from "../chunks/chunk-NWJMNYVI.js";
 import "../chunks/chunk-NZLE2WMY.js";
 
 // src/cli/Serve.ts

package/dist/cli/bin.js

@@ -1,6 +1,6 @@
 import {
   package_default
-} from "../chunks/chunk-HELH3PKC.js";
+} from "../chunks/chunk-NWJMNYVI.js";
 import "../chunks/chunk-NZLE2WMY.js";
 
 // node_modules/mri/lib/index.mjs

package/dist/cloud/CloudRemote.js

@@ -1,6 +1,6 @@
 import {
   package_default
-} from "../chunks/chunk-HELH3PKC.js";
+} from "../chunks/chunk-NWJMNYVI.js";
 import "../chunks/chunk-NZLE2WMY.js";
 
 // src/cloud/CloudRemote.ts

package/dist/core/Preview.d.ts

@@ -14,7 +14,7 @@ export interface PreviewUpdate {
     entryId: string;
     contentHash: string;
     status: string;
-    update: Uint8Array;
+    patch: Uint8Array;
 }
 export interface PreviewMetadata {
     title: string;

package/dist/core/db/LinkResolver.d.ts

@@ -6,5 +6,5 @@ export declare class LinkResolver {
     private locale;
     constructor(resolver: EntryResolver, ctx: ResolveContext, locale: string | null);
     includedAtBuild(filePath: string): boolean;
-    resolveLinks<P extends Projection>(projection: P, entryIds: ReadonlyArray<string>): Promise<Array<InferProjection<P> | undefined>>;
+    resolveLinks<P extends Projection>(projection: P, entryIds: ReadonlyArray<string>): Promise<Array<InferProjection<P>>>;
 }

package/dist/core/shape/RichTextShape.js

@@ -11,6 +11,7 @@ import "../../chunks/chunk-NZLE2WMY.js";
 
 // src/core/shape/RichTextShape.ts
 import { Entry } from "../Entry.js";
+import { MediaFile } from "../media/MediaTypes.js";
 import {
   BlockNode,
   ElementNode,
@@ -19,7 +20,6 @@ import {
   Node,
   TextNode
 } from "../TextDoc.js";
-import { MediaFile } from "../media/MediaTypes.js";
 import { entries, fromEntries, keys } from "../util/Objects.js";
 import { RecordShape } from "./RecordShape.js";
 import { ScalarShape } from "./ScalarShape.js";
@@ -129,6 +129,7 @@ function unserialize(nodes) {
   return result;
 }
 var linkInfoFields = {
+  id: Entry.id,
   url: Entry.url,
   location: MediaFile.location
 };
@@ -375,7 +376,11 @@ var RichTextShape = class {
     async function loadLinks() {
       const linkIds = Array.from(new Set(links.values()));
       const entries2 = await loader.resolveLinks(linkInfoFields, linkIds);
-      const info = new Map(linkIds.map((id, i) => [id, entries2[i]]));
+      const info = new Map(
+        entries2.map((entry) => {
+          return [entry.id, entry];
+        })
+      );
       for (const [mark, entryId] of links) {
         const type = mark[LinkMark.link];
         const data = info.get(entryId);

package/dist/core/source/FilePatch.d.ts

@@ -0,0 +1,12 @@
+/**
+ * Creates a Git-delta based patch for transforming `base` into `updated`.
+ * Format:
+ * - 20 bytes: SHA-1(base)
+ * - N bytes: Git delta payload
+ * - 20 bytes: SHA-1(updated)
+ */
+export declare function createFilePatch(base: string, updated: string): Promise<Uint8Array>;
+/**
+ * Applies a patch created by `createFilePatch` and returns the updated string.
+ */
+export declare function applyFilePatch(base: string, patch: Uint8Array): Promise<string>;

package/dist/core/source/FilePatch.js

@@ -0,0 +1,47 @@
+import "../../chunks/chunk-NZLE2WMY.js";
+
+// src/core/source/FilePatch.ts
+import { assert } from "../util/Assert.js";
+import { applyGitDelta, createGitDelta } from "./GitDelta.js";
+import { sha1Bytes as computeSha1Bytes } from "./Utils.js";
+var encoder = new TextEncoder();
+var decoder = new TextDecoder();
+var HASH_BYTES = 20;
+async function createFilePatch(base, updated) {
+  const baseBytes = encoder.encode(base);
+  const updatedBytes = encoder.encode(updated);
+  const delta = createGitDelta(baseBytes, updatedBytes);
+  const [baseHash, updatedHash] = await Promise.all([
+    computeSha1Bytes(baseBytes),
+    computeSha1Bytes(updatedBytes)
+  ]);
+  const out = new Uint8Array(HASH_BYTES + delta.length + HASH_BYTES);
+  out.set(baseHash, 0);
+  out.set(delta, HASH_BYTES);
+  out.set(updatedHash, HASH_BYTES + delta.length);
+  return out;
+}
+async function applyFilePatch(base, patch) {
+  assert(patch.length >= HASH_BYTES * 2, "Invalid patch: too small");
+  const baseBytes = encoder.encode(base);
+  const expectedBaseHash = patch.subarray(0, HASH_BYTES);
+  const actualBaseHash = await computeSha1Bytes(baseBytes);
+  assert(bytesEqual(expectedBaseHash, actualBaseHash), "Patch does not match base");
+  const delta = patch.subarray(HASH_BYTES, patch.length - HASH_BYTES);
+  const result = applyGitDelta(baseBytes, delta);
+  const expectedHash = patch.subarray(patch.length - HASH_BYTES);
+  const actualHash = await computeSha1Bytes(result);
+  assert(bytesEqual(actualHash, expectedHash), "Patched content hash mismatch");
+  return decoder.decode(result);
+}
+function bytesEqual(a, b) {
+  if (a.length !== b.length) return false;
+  for (let i = 0; i < a.length; i++) {
+    if (a[i] !== b[i]) return false;
+  }
+  return true;
+}
+export {
+  applyFilePatch,
+  createFilePatch
+};

package/dist/core/source/FilePatch.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/core/source/GitDelta.d.ts

@@ -0,0 +1,10 @@
+/**
+ * Creates Git-compatible delta data (the payload format used by OBJ_REF_DELTA
+ * and OBJ_OFS_DELTA entries in pack files).
+ */
+export declare function createGitDelta(base: Uint8Array, target: Uint8Array): Uint8Array;
+/**
+ * Applies Git delta data onto a base object and returns the reconstructed
+ * target object bytes.
+ */
+export declare function applyGitDelta(base: Uint8Array, delta: Uint8Array): Uint8Array;

package/dist/core/source/GitDelta.js

@@ -0,0 +1,196 @@
+import "../../chunks/chunk-NZLE2WMY.js";
+
+// src/core/source/GitDelta.ts
+import { assert } from "../util/Assert.js";
+var MIN_MATCH = 4;
+var MAX_LITERAL = 127;
+var MAX_COPY_SIZE = 16777215;
+function createGitDelta(base, target) {
+  const out = [];
+  writeVarInt(base.length, out);
+  writeVarInt(target.length, out);
+  const index = buildBaseIndex(base);
+  const literals = [];
+  let i = 0;
+  while (i < target.length) {
+    const best = findBestMatch(base, target, i, index);
+    if (!best || best.length < MIN_MATCH) {
+      literals.push(target[i]);
+      i++;
+      if (literals.length === MAX_LITERAL) flushLiterals(literals, out);
+      continue;
+    }
+    flushLiterals(literals, out);
+    let remaining = best.length;
+    let copyOffset = best.offset;
+    while (remaining > 0) {
+      const chunkSize = Math.min(remaining, MAX_COPY_SIZE);
+      writeCopyInstruction(copyOffset, chunkSize, out);
+      copyOffset += chunkSize;
+      remaining -= chunkSize;
+    }
+    i += best.length;
+  }
+  flushLiterals(literals, out);
+  return Uint8Array.from(out);
+}
+function applyGitDelta(base, delta) {
+  let pos = 0;
+  const [baseSize, baseSizePos] = readVarInt(delta, pos);
+  pos = baseSizePos;
+  const [resultSize, resultSizePos] = readVarInt(delta, pos);
+  pos = resultSizePos;
+  assert(baseSize === base.length, "Git delta base size mismatch");
+  const result = new Uint8Array(resultSize);
+  let outPos = 0;
+  while (pos < delta.length) {
+    const opcode = delta[pos++];
+    if (opcode & 128) {
+      let offset = 0;
+      let size = 0;
+      if (opcode & 1) offset |= delta[pos++];
+      if (opcode & 2) offset |= delta[pos++] << 8;
+      if (opcode & 4) offset |= delta[pos++] << 16;
+      if (opcode & 8) offset |= delta[pos++] << 24;
+      if (opcode & 16) size |= delta[pos++];
+      if (opcode & 32) size |= delta[pos++] << 8;
+      if (opcode & 64) size |= delta[pos++] << 16;
+      if (size === 0) size = 65536;
+      assert(offset >= 0 && offset + size <= base.length, "Invalid delta copy");
+      assert(outPos + size <= result.length, "Delta expands beyond target size");
+      result.set(base.subarray(offset, offset + size), outPos);
+      outPos += size;
+      continue;
+    }
+    assert(opcode !== 0, "Invalid delta opcode 0");
+    assert(pos + opcode <= delta.length, "Invalid delta insert");
+    assert(outPos + opcode <= result.length, "Delta expands beyond target size");
+    result.set(delta.subarray(pos, pos + opcode), outPos);
+    pos += opcode;
+    outPos += opcode;
+  }
+  assert(outPos === result.length, "Delta result size mismatch");
+  return result;
+}
+function writeVarInt(value, out) {
+  let n = value >>> 0;
+  while (true) {
+    let byte = n & 127;
+    n >>>= 7;
+    if (n !== 0) byte |= 128;
+    out.push(byte);
+    if (n === 0) break;
+  }
+}
+function readVarInt(data, start) {
+  let shift = 0;
+  let value = 0;
+  let pos = start;
+  while (true) {
+    assert(pos < data.length, "Invalid varint");
+    const byte = data[pos++];
+    value |= (byte & 127) << shift;
+    if ((byte & 128) === 0) break;
+    shift += 7;
+    assert(shift <= 28, "Varint too large");
+  }
+  return [value >>> 0, pos];
+}
+function flushLiterals(literals, out) {
+  if (literals.length === 0) return;
+  let pos = 0;
+  while (pos < literals.length) {
+    const chunk = Math.min(MAX_LITERAL, literals.length - pos);
+    out.push(chunk);
+    for (let i = 0; i < chunk; i++) out.push(literals[pos + i]);
+    pos += chunk;
+  }
+  literals.length = 0;
+}
+function writeCopyInstruction(offset, size, out) {
+  assert(size > 0, "Invalid copy size");
+  let opcode = 128;
+  const params = [];
+  const offset0 = offset & 255;
+  const offset1 = offset >>> 8 & 255;
+  const offset2 = offset >>> 16 & 255;
+  const offset3 = offset >>> 24 & 255;
+  if (offset0 !== 0) {
+    opcode |= 1;
+    params.push(offset0);
+  }
+  if (offset1 !== 0) {
+    opcode |= 2;
+    params.push(offset1);
+  }
+  if (offset2 !== 0) {
+    opcode |= 4;
+    params.push(offset2);
+  }
+  if (offset3 !== 0) {
+    opcode |= 8;
+    params.push(offset3);
+  }
+  const size0 = size & 255;
+  const size1 = size >>> 8 & 255;
+  const size2 = size >>> 16 & 255;
+  if (size !== 65536) {
+    if (size0 !== 0) {
+      opcode |= 16;
+      params.push(size0);
+    }
+    if (size1 !== 0) {
+      opcode |= 32;
+      params.push(size1);
+    }
+    if (size2 !== 0) {
+      opcode |= 64;
+      params.push(size2);
+    }
+  }
+  out.push(opcode);
+  for (const byte of params) out.push(byte);
+}
+function buildBaseIndex(base) {
+  const index = /* @__PURE__ */ new Map();
+  for (let i = 0; i + MIN_MATCH <= base.length; i++) {
+    const key = key4(base, i);
+    const list = index.get(key);
+    if (list) {
+      if (list.length >= 64) list.shift();
+      list.push(i);
+    } else {
+      index.set(key, [i]);
+    }
+  }
+  return index;
+}
+function findBestMatch(base, target, targetPos, index) {
+  if (targetPos + MIN_MATCH > target.length) return void 0;
+  const key = key4(target, targetPos);
+  const candidates = index.get(key);
+  if (!candidates || candidates.length === 0) return void 0;
+  let bestOffset = 0;
+  let bestLength = 0;
+  for (let i = candidates.length - 1; i >= 0; i--) {
+    const basePos = candidates[i];
+    let length = 0;
+    while (basePos + length < base.length && targetPos + length < target.length && base[basePos + length] === target[targetPos + length]) {
+      length++;
+    }
+    if (length > bestLength) {
+      bestLength = length;
+      bestOffset = basePos;
+      if (bestLength >= MAX_COPY_SIZE) break;
+    }
+  }
+  if (bestLength < MIN_MATCH) return void 0;
+  return { offset: bestOffset, length: bestLength };
+}
+function key4(data, pos) {
+  return data[pos] << 24 | data[pos + 1] << 16 | data[pos + 2] << 8 | data[pos + 3];
+}
+export {
+  applyGitDelta,
+  createGitDelta
+};

package/dist/core/source/GitDelta.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/core/source/Utils.d.ts

@@ -1,3 +1,7 @@
+/**
+ * Computes the SHA-1 hash bytes of the input data.
+ */
+export declare function sha1Bytes(data: Uint8Array): Promise<Uint8Array>;
 /**
  * Computes the SHA-1 hash of the input data.
  */

package/dist/core/source/Utils.js

@@ -2,10 +2,12 @@ import "../../chunks/chunk-NZLE2WMY.js";
 
 // src/core/source/Utils.ts
 import { crypto } from "@alinea/iso";
-async function sha1Hash(data) {
+async function sha1Bytes(data) {
   const hashBuffer = await crypto.subtle.digest("SHA-1", data);
-  const hashArray = new Uint8Array(hashBuffer);
-  return bytesToHex(hashArray);
+  return new Uint8Array(hashBuffer);
+}
+async function sha1Hash(data) {
+  return bytesToHex(await sha1Bytes(data));
 }
 function concatUint8Arrays(arrays) {
   const totalLength = arrays.reduce((sum, arr) => sum + arr.length, 0);
@@ -49,6 +51,7 @@ export {
   compareStrings,
   concatUint8Arrays,
   hexToBytes,
+  sha1Bytes,
   sha1Hash,
   splitPath
 };

package/dist/dashboard/atoms/EntryEditorAtoms.js

@@ -10,9 +10,11 @@ import "../../chunks/chunk-NZLE2WMY.js";
 // src/dashboard/atoms/EntryEditorAtoms.ts
 import { createYDoc, DOC_KEY, parseYDoc } from "alinea/core/Doc";
 import { Entry } from "alinea/core/Entry";
+import { createRecord } from "alinea/core/EntryRecord";
 import { Field } from "alinea/core/Field";
 import { createId } from "alinea/core/Id";
 import { getType } from "alinea/core/Internal";
+import { createFilePatch } from "alinea/core/source/FilePatch";
 import { Root } from "alinea/core/Root";
 import { Type } from "alinea/core/Type";
 import {
@@ -25,6 +27,7 @@ import { createEntryRow } from "alinea/core/util/EntryRows";
 import { entries, fromEntries } from "alinea/core/util/Objects";
 import * as paths from "alinea/core/util/Paths";
 import { Workspace } from "alinea/core/Workspace";
+import { JsonLoader } from "alinea/backend/loader/JsonLoader";
 import { FormAtoms } from "alinea/dashboard/atoms/FormAtoms";
 import { keepPreviousData } from "alinea/dashboard/util/KeepPreviousData";
 import { encodePreviewPayload } from "alinea/preview/PreviewPayload";
@@ -35,6 +38,7 @@ import { entryEditsAtoms } from "./Edits.js";
 import { errorAtom } from "./ErrorAtoms.js";
 import { locationAtom } from "./LocationAtoms.js";
 import { yAtom } from "./YAtom.js";
+var decoder = new TextDecoder();
 var EditMode = /* @__PURE__ */ ((EditMode2) => {
   EditMode2["Editing"] = "editing";
   EditMode2["Diff"] = "diff";
@@ -542,14 +546,27 @@ function createEntryEditor(entryData) {
   const yUpdate = debounceAtom(edits.yUpdate, 250);
   const previewPayload = atom(async (get) => {
     const sha = await get(dbMetaAtom);
-    const update = get(yUpdate);
+    get(yUpdate);
     const status = get(selectedStatus);
+    const baseText = decoder.decode(
+      JsonLoader.format(
+        config.schema,
+        createRecord(activeVersion, activeVersion.status)
+      )
+    );
+    const updated = await getDraftEntry({ status });
+    const patch = await createFilePatch(
+      baseText,
+      decoder.decode(
+        JsonLoader.format(config.schema, createRecord(updated, status))
+      )
+    );
     return encodePreviewPayload({
       locale: activeVersion.locale,
       entryId: activeVersion.id,
       contentHash: sha,
       status,
-      update
+      patch
     });
   });
   const discardEdits = edits.resetChanges;

package/dist/preview/PreviewPayload.js

@@ -17,7 +17,7 @@ function encodePreviewPayload(update) {
   writeVarString(encoder, update.entryId);
   writeVarString(encoder, update.contentHash);
   writeVarString(encoder, update.status);
-  writeVarUint8Array(encoder, update.update);
+  writeVarUint8Array(encoder, update.patch);
   return encode(toUint8Array(encoder));
 }
 async function decodePreviewPayload(payload) {
@@ -27,7 +27,7 @@ async function decodePreviewPayload(payload) {
     entryId: readVarString(decoder),
     contentHash: readVarString(decoder),
     status: readVarString(decoder),
-    update: readVarUint8Array(decoder)
+    patch: readVarUint8Array(decoder)
   };
 }
 export {

package/dist/preview/PreviewPayload.test.d.ts

@@ -0,0 +1 @@
+export {};

package/package.json

@@ -1,7 +1,7 @@
 {
   "bin": "./dist/cli.js",
   "name": "alinea",
-  "version": "1.6.2",
+  "version": "1.6.4",
   "description": "Headless git-based CMS",
   "repository": {
     "type": "git",
@@ -20,7 +20,7 @@
     "cycles:browser": "CHECK_CYCLES=browser bun build.ts && bunx --bun madge --warning --circular dist/index.js dist/ui.js dist/dashboard/App.js",
     "type": "tsc --diagnostics",
     "dev:check": "tsc -w",
-    "dev:run": "bun build.ts --watch -- node dev.js --dir apps/dev",
+    "dev:run": "bun build.ts --watch -- node dev.js --dir apps/dev -- bun run --cwd apps/dev dev",
     "web:run": "bun build.ts --watch -- node dev.js -- bun run --cwd apps/web dev",
     "trace": "tsc --diagnostics --generateTrace private/trace && analyze-trace private/trace & speedscope private/trace/trace.json",
     "prepublishOnly": "bun run build"