hologit 0.50.0 → 0.50.1

package/lib/TreeObject.js

@@ -294,6 +294,32 @@ class TreeObject {
         }
     }
 
+    /**
+     * Drop every child of this tree — both pending and base — in O(1).
+     *
+     * Semantically equivalent to calling `deleteChild` for each entry, but
+     * operates on the in-memory child maps directly so it doesn't pay for
+     * N tree mutations to produce a state that just says "this subtree is
+     * empty." The serialized result is the canonical empty-tree hash
+     * (`4b825dc642cb6eb9a060e54bf8d69288fbee4904`) — what `write()` already
+     * skips when emitting parent entries.
+     *
+     * Consumers that "clear then rewrite" — snapshot importers in
+     * particular — get a constant-time clear regardless of the prior size
+     * of the subtree.
+     */
+    clearChildren () {
+        // Replace _children with a fresh map AND set _baseChildren to an
+        // empty object so a subsequent getChildren() / write() doesn't
+        // lazy-load the previous git tree's entries through the prototype
+        // chain. Object.seal in the constructor permits value reassignment;
+        // it only blocks add/remove of properties.
+        this._baseChildren = {};
+        this._children = {};
+        Object.setPrototypeOf(this._children, this._baseChildren);
+        this.markDirty();
+    }
+
     async getSubtree (subtreePath, create = false) {
         const stack = await this.getSubtreeStack(...arguments);
         return stack && stack[stack.length - 1] || null;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "hologit",
-  "version": "0.50.0",
+  "version": "0.50.1",
   "description": "Hologit automates the projection of layered composite file trees based on flat, declarative plans",
   "repository": "https://github.com/JarvusInnovations/hologit",
   "main": "lib/index.js",