rename

Author: jialinli98

src/lib.nr

@@ -1,7 +1,7 @@
 mod mut_sparse_array;
 use dep::sort::sort_advanced;
 
-unconstrained fn __sort_field_as_u32(lhs: u32, rhs: u32) -> bool {
+unconstrained fn __sort(lhs: u32, rhs: u32) -> bool {
     //  lhs.lt(rhs)
     lhs < rhs
 }
@@ -67,7 +67,7 @@ where
         // for any valid index, we want to ensure the following is satified:
         // self.keys[X] <= index <= self.keys[X+1]
         // this requires us to sort hte keys, and insert a startpoint and endpoint
-        let sorted_keys = sort_advanced(_keys, __sort_field_as_u32, assert_sorted);
+        let sorted_keys = sort_advanced(_keys, __sort, assert_sorted);
 
         // insert start and endpoints
         r.keys[0] = 0;

src/mut_sparse_array.nr

@@ -1,6 +1,6 @@
 use crate::{MutSparseArray, MutSparseArrayBase, U32RangeTraits};
 use dep::sort::sort_advanced;
-unconstrained fn __sort_field_as_u32(lhs: u32, rhs: u32) -> bool {
+unconstrained fn __sort(lhs: u32, rhs: u32) -> bool {
     lhs < rhs
 }
 
@@ -76,7 +76,7 @@ where
         // for any valid index, we want to ensure the following is satified:
         // self.keys[X] <= index <= self.keys[X+1]
         // this requires us to sort hte keys, and insert a startpoint and endpoint
-        let sorted_keys = sort_advanced(_keys, __sort_field_as_u32, assert_sorted);
+        let sorted_keys = sort_advanced(_keys, __sort, assert_sorted);
 
         // insert start and endpoints
         r.keys[0] = 0;
@@ -222,8 +222,8 @@ impl<let N: u32, T> MutSparseArray<N, T>
 where
     T: std::default::Default,
 {
-    pub(crate) fn create<let M: u32>(_keys: [u32; M], _values: [T; M], size: u32) -> Self {
-        Self { inner: MutSparseArrayBase::create(_keys, _values, size) }
+    pub(crate) fn create<let M: u32>(keys: [u32; M], values: [T; M], size: u32) -> Self {
+        Self { inner: MutSparseArrayBase::create(keys, values, size) }
     }
 
     fn get(self, idx: u32) -> T {