@datafn/server 0.1.1 → 0.1.3

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
package/README.md CHANGED
@@ -807,3 +807,23 @@ export {
807
807
  ## License
808
808
 
809
809
  MIT
810
+
811
+ ## Repairing inherited inactivity
812
+
813
+ `recomputeAncestorInactive` scans a bounded batch in one namespace; resume with
814
+ `nextCursor`. `recomputeAncestorInactiveAll` repeats scans until a verification
815
+ sweep finds no changes or skipped compare-and-set writes. Check `converged`;
816
+ `updated: 0` alone is not proof of completion. `skipped` counts concurrent-write
817
+ conflicts. Dry runs count mismatches without writing.
818
+
819
+ Repair derives values from ancestor archive/trash state and relation links,
820
+ never from stored `isAncestorInactive` flags. Cycles, missing/malformed parents,
821
+ and traversal-limit violations throw explicit errors. `batchSize`, `maxSweeps`
822
+ and `maxGraphNodes` must be positive safe integers; `maxGraphNodes` defaults to
823
+ 10,000 visited nodes per repaired row. A failed batch can be replayed safely;
824
+ earlier completed writes are idempotent.
825
+
826
+ Run repair with ancestor/link mutations quiesced. The compare-and-set protects
827
+ each derived field from a concurrent propagation write; it does not provide an
828
+ atomic snapshot across all ancestor records. Resume and verify after concurrent
829
+ activity settles before relying on repaired values for a consumer migration.