refactor!: Remove unused helper functions

Author: jan-ferdinand

tasm-lib/src/lib.rs

@@ -169,8 +169,7 @@ pub fn execute_bench_deprecated(
 
 /// Execute a Triton-VM program and test correct behavior indicators.
 /// Modify stack and memory. Panic if anything goes wrong.
-#[allow(clippy::too_many_arguments)]
-pub fn execute_test(
+pub(crate) fn execute_test(
     code: &[LabelledInstruction],
     stack: &mut Vec<BFieldElement>,
     expected_stack_diff: isize,
@@ -254,7 +253,7 @@ pub fn maybe_write_debuggable_vm_state_to_disk(vm_state: &VMState) {
 }
 
 /// Prepare state and run Triton VM
-pub fn execute_with_terminal_state(
+pub(crate) fn execute_with_terminal_state(
     program: Program,
     std_in: &[BFieldElement],
     stack: &[BFieldElement],

tasm-lib/src/rust_shadowing_helper_functions.rs

@@ -1,31 +1,4 @@
 pub mod array;
 pub mod claim;
 pub mod dyn_malloc;
-pub mod input;
 pub mod list;
-
-/// Count the number of non-leaf nodes that were inserted *prior* to
-/// the insertion of this leaf.
-pub fn non_leaf_nodes_left(leaf_index: u64) -> u64 {
-    // This formula is derived as follows:
-    // To get the heights of peaks before this leaf index was inserted, bit-decompose
-    // the number of leaves before it was inserted.
-    // Number of leaves in tree of height h = 2^h
-    // Number of nodes in tree of height h = 2^(h + 1) - 1
-    // Number of non-leaves is `#(nodes) - #(leaves)`.
-    // Thus: f(x) = sum_{h}(2^h - 1)
-
-    // An upper limit for the loop iterator is the log_2_floor(leaf_index)
-    let log_2_floor_plus_one = u64::BITS - leaf_index.leading_zeros();
-    let mut h = 0;
-    let mut ret = 0;
-    while h != log_2_floor_plus_one {
-        let pow = (1 << h) & leaf_index;
-        if pow != 0 {
-            ret += pow - 1;
-        }
-        h += 1;
-    }
-
-    ret
-}