@anzusystems/common-admin 1.47.0-beta.dev-1782072299 → 1.47.0-beta.dev-1782072499

package/dist/labs.d.ts

@@ -1852,6 +1852,22 @@ export declare const sortByPosition: <TItem extends {
     position: number;
 }>(items: TItem[]) => TItem[];
 
+/**
+ * Non-mutating deep `sortByPosition`. Sorts the top-level array, then for every
+ * item carrying one of `childKeys` as an array, recursively sorts that nested
+ * array too. The same `childKeys` apply at every depth and keys absent on a node
+ * are skipped — so pass the UNION of nested position-bearing array fields across
+ * the whole shape (e.g. `['contentItems', 'boxPositionIncludes']`).
+ *
+ * Same non-mutating contract as `sortByPosition`: only nodes that actually have a
+ * nested array are shallow-cloned; leaf nodes and untouched branches keep their
+ * reference. Use it to normalize an API response's ordering before it becomes
+ * store state, in one call, for nested collections.
+ */
+export declare const sortByPositionDeep: <TItem extends {
+    position: number;
+}>(items: TItem[], childKeys?: string[]) => TItem[];
+
 declare const SortOrder: {
     readonly Asc: "asc";
     readonly Desc: "desc";