loro-crdt 1.16.0 → 1.16.2

package/CHANGELOG.md

@@ -1,5 +1,61 @@
 # Changelog
 
+## 1.16.2
+
+### Patch Changes
+
+- 5a80c15: Fix shallow snapshots that exported successfully but could not be imported into an empty document. The shallow root is now always a critical version of the retained history. Previously two shapes picked a root that other retained changes were concurrent with: a version with an odd number of independent heads, and a past version when a branch that forked below it was merged later.
+- c7bd1c3: Preserve deleted-container state required by the history retained in `forkAt`
+  and snapshot-at exports. Historical diffs and checkouts can traverse deleted
+  list and text descendants without a missing-state panic. Containers created
+  after the requested frontier remain excluded.
+
+  Restore the source frontier after snapshot-at validation errors and preserve
+  explicit detached mode when exporting a document at its head.
+
+- c3ffde6: Fix a panic followed by a deadlock when subscribing to an event source while
+  it is emitting, e.g. calling `subscribeLocalUpdates` or `subscribe` from inside
+  a callback, or subscribing on one thread while another thread commits or
+  imports. A subscriber added during an emit is now registered for later events;
+  it does not receive the event that is already being delivered.
+- e2e41a3: Fix `LoroText.getCursor` at UTF-16 boundaries around non-BMP characters.
+- be0e1ac: Accept tree snapshot state whose sibling nodes are not in fractional index
+  order, such as `snapshot`/`shallow-snapshot` exports from loro.js 0.1.0/0.2.0
+  after a tree `move()` (loro-dev/loro#1088). The decoder now sorts siblings by
+  their (fractional index, idlp) position instead of panicking with
+  `assertion failed: last.0 < pos` on the first read. Tree state with duplicate
+  node ids or duplicate sibling positions is rejected as a decode error.
+
+## 1.16.1
+
+### Patch Changes
+
+- d9ddfba: Make repeated concurrent imports fast: retreat the replay base to the latest
+  multi-head critical version instead of the single-head one (which is stuck at
+  the initial fork point on criss-cross sync DAGs), and let the text/list diff
+  calculators trust a certified-critical base instead of rebuilding their
+  trackers from the whole history on every concurrent import.
+- 80a0e88: Make imports that are concurrent with the current version only on map/counter
+  containers as fast as ordinary linear imports.
+
+  Previously any concurrency between the new ops and the current version
+  (for example a single unmerged head from another peer) forced every later
+  import to retreat to a critical version and replay the whole branch, and the
+  map diff scanned every key of every touched map. Per-import cost grew with
+  both the branch length and the map size: 400 small imports on a 2000-note doc
+  with one stale head took ~2.4s natively; they now take ~70ms, flat per import
+  (a linear import of the same chain takes ~50ms).
+
+  The oplog now proves, per container, whether the concurrent old history
+  touches anything that needs positional context. When it only touches registers
+  the import replays from the current version; the affected maps are still
+  resolved from history so persisted state that drops tombstones (deleted roots,
+  dead containers) cannot influence the result. Map diffs in the conservative
+  path are also restricted to the keys the update touched.
+
+- d9ddfba: Fix the richtext diff calculator's style table growing a duplicate entry for
+  every re-replayed style op (e.g. checkout walks after a retreat).
+
 ## 1.16.0
 
 ### Minor Changes