smsmslib 1.0.86 → 1.0.88

package/javascr/util/deepwalk.js

@@ -50,6 +50,12 @@ import
 }
 from "./tree.js";
 
+import
+{
+  sj_deep_get_own,
+}
+from "./deep.js";
+
 
 /** ---------------------------------------------------------------------------
  * Functions.
@@ -73,7 +79,7 @@ from "./tree.js";
  * The user-defined callback function called at each node.
  * Expected signature: `f_cb(ao_TreeStack, i_depth, user)`
  * - ao_TreeStack: The current traversal stack.
- * - i_depth: The maximum depth limit passed to `sj_deep_walk`.
+ * - i_depth: The maximum depth limit passed to `sj_deepwalk`.
  * - user: The user data provided.
  * Must return `true` to continue or `false` to abort.
  *
@@ -84,7 +90,7 @@ from "./tree.js";
  * Status code defined in `go_tree_walk_ret`. Same as `sj_tree_walk`.
  * @see sj_tree_walk
  */
-export function sj_deep_walk(value, i_depth, f_cb, user)
+export function sj_deepwalk(value, i_depth, f_cb, user)
 {
   let i_ret = go_tree_walk_ret.i_noncb;
 
@@ -96,11 +102,11 @@ export function sj_deep_walk(value, i_depth, f_cb, user)
 
     if (o_user)
     {
-      const o_root = deep_walk_node_t(value);
+      const o_root = deepwalk_node_t(value);
 
       if (o_root)
       {
-        i_ret = sj_tree_walk(deep_walk_cb, o_root, o_user);
+        i_ret = sj_tree_walk(deepwalk_cb, o_root, o_user);
       }
     }
   }
@@ -114,7 +120,7 @@ export function sj_deep_walk(value, i_depth, f_cb, user)
  *
  * This function serves two primary purposes:
  * 1. **Node Adaptation**: It wraps the next child value into a node object 
- * using `deep_walk_node_t` for the next step of traversal.
+ * using `deepwalk_node_t` for the next step of traversal.
  * 2. **User Callback Execution**: It triggers the user-provided callback 
  * (`o_user.f_cb`) in "leading order".
  *
@@ -133,7 +139,7 @@ export function sj_deep_walk(value, i_depth, f_cb, user)
  * @returns {boolean}
  * true to continue the traversal; otherwise false to abort.
  */
-function deep_walk_cb(ao_TreeStack, from_child, o_user)
+function deepwalk_cb(ao_TreeStack, from_child, o_user)
 {
   let   b_continue = true;
   const b_depth = (o_user.i_depth < 1) || (ao_TreeStack.length <= o_user.i_depth);
@@ -146,7 +152,7 @@ function deep_walk_cb(ao_TreeStack, from_child, o_user)
   {
     const s_key = o_node.as_key[o_TreeStack.i_child];
 
-    o_TreeStack.child = deep_walk_node_t(o_node.value[s_key]);
+    o_TreeStack.child = deepwalk_node_t(o_node.value[s_key]);
     b_continue &&= (!!o_TreeStack.child);
   }
 
@@ -165,7 +171,7 @@ function deep_walk_cb(ao_TreeStack, from_child, o_user)
  *
  * This function reconstructs the path by iterating through the tree stack 
  * from the root up to the parent of the current node. It is designed to be 
- * called within a callback of `sj_deep_walk`.
+ * called within a callback of `sj_deepwalk`.
  * 
  * Since the last element of `ao_TreeStack` represents the current node itself, 
  * this function collects keys from all elements except the last to form the
@@ -179,7 +185,7 @@ function deep_walk_cb(ao_TreeStack, from_child, o_user)
  * otherwise null if the stack is invalid or an internal error occurs.
  * Note: Returns an empty array if the current node is the root.
  */ 
-export function sj_deep_path(ao_TreeStack)
+export function sj_deepwalk_path(ao_TreeStack)
 {
   let   as_path = sj_array_new(0);
   const b_arr = Array.isArray(ao_TreeStack);
@@ -228,7 +234,7 @@ export function sj_deep_path(ao_TreeStack)
  *            otherwise null.
  * Returns null if the node object cannot be created.
  */
-function deep_walk_node_t(value)
+function deepwalk_node_t(value)
 {
   let   o_node = null;
   let   as_key = null;

package/javascr/util/matnew.js

@@ -40,11 +40,101 @@ import
 }
 from "./tree.js";
 
+import
+{
+  sj_deep_set_own,
+}
+from "./deep.js";
+
+import
+{
+  sj_deepwalk,
+  sj_deepwalk_path,
+}
+from "./deepwalk.js";
+
 
 /** ---------------------------------------------------------------------------
  * Functions.
  * --------------------------------------------------------------------------- */
 
+/**
+ * Creates a deep copy of a matrix.
+ *
+ * @param {any} a_src [in]
+ * The source matrix to be copied. This must be a matrix structure previously 
+ * created using `sj_mat_new`.
+ *
+ * @param {number[]} a_dim [in]
+ * An array of integers representing the dimensions of the matrix. 
+ * This must be identical to the dimensions used to create `a_src` (though the 
+ * actual instance may differ). For example, if `a_src` is a 2x3 matrix, 
+ * `a_dim` must be [2, 3].
+ *
+ * @returns {any|null}
+ * A new deep-copied matrix if successful; otherwise, null if allocation or 
+ * traversal fails.
+ */
+export function sj_mat_new_copy(a_src, a_dim)
+{
+  let i_ret = go_tree_walk_ret.i_fatal;
+  let a_dst = sj_mat_new(a_dim, 0);
+
+  if (a_dst)
+  {
+    i_ret = sj_deepwalk(a_src, a_dim.length + 1, mat_new_copy_cb, a_dst);
+  }
+
+  if (i_ret !== go_tree_walk_ret.i_ok)
+  {
+    a_dst = null;
+  }
+
+  return a_dst;
+}
+
+
+/**
+ * Callback function for deeply copying matrix elements during a deep walk.
+ * This function is intended to be used as a callback for `sj_deepwalk`. 
+ *
+ * @param {Object[]} ao_TreeStack [in]
+ * The current traversal stack from `sj_deepwalk`, containing node information. 
+ *
+ * @param {number} i_depth [in]
+ * The current depth of the traversal.
+ * - 1 indicates the root element.
+ * - In a 2D matrix (array of arrays), 3 represents a leaf node (the actual value).
+ *
+ * @param {any} a_dst [in,out]
+ * The destination matrix (object or array) where values will be copied. 
+ * The structure must be pre-allocated.
+ *
+ * @returns {boolean}
+ * true to continue the traversal; false if a path could not be resolved.
+ */
+function mat_new_copy_cb(ao_TreeStack, i_depth, a_dst)
+{
+  let b_continue = true;
+
+  if (i_depth === ao_TreeStack.length)
+  {
+    const o_TreeStack = ao_TreeStack.at(- 1); /* tail */
+    const src         = o_TreeStack.node.value;
+    const as_path     = sj_deepwalk_path(ao_TreeStack);
+
+    b_continue = !!as_path;
+
+    if (b_continue)
+    {
+      b_continue = sj_deep_set_own(a_dst, as_path, src);
+    }
+  }
+
+  return b_continue;
+}
+
+
 /**
  * Creates a multi-dimensional array (matrix) with specified dimensions.
  * This function constructs a nested array structure based on the provided 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "smsmslib",
-  "version": "1.0.86",
+  "version": "1.0.88",
   "description": "Reusable functions for me.",
   "files": [
     "javascr/**/*.js",
@@ -19,6 +19,6 @@
   "author": "",
   "license": "ISC",
   "dependencies": {
-    "smsmslib": "^1.0.86"
+    "smsmslib": "^1.0.88"
   }
 }