chore: rename list:permutations_with_replacement to list:permutationsWithReplacement for uniformity

Author: SuperFola

List.ark

@@ -450,7 +450,7 @@
 # (let a [1 2 3])
 # (print (list:partition a (fun (c i) (= 0 (mod c 2)))))  # [[2] [1 3]]
 # =end
-# @author https://github.com/rakista112
+# @author https://github.com/SuperFola
 (let partition (fun ((ref _L) _f) {
   (mut _index 0)
   (mut _pass [])
@@ -506,7 +506,7 @@
     (set _index (+ 1 _index)) })
   _c }))
 
-# @brief Zip two lists into one, using a filler is one list is shorter: [1 2 3] and [5 6 7 8] will give [[1 5] [2 6] [3 7] [0 8]]
+# @brief Zip two lists into one, using a filler if one list is shorter: [1 2 3] and [5 6 7 8] will return [[1 5] [2 6] [3 7] [0 8]]
 # @param _a the first list to work on
 # @param _b the second list to work on
 # @param _filler value to use if there is not enough items in one of the lists
@@ -851,7 +851,7 @@
 # @param _f function to call on each permutation. It can return list:stopIteration to stop iteration early
 # =begin
 # (let data [0 1 2])
-# (list:permutations_with_replacement data 2 (fun (perm) (print perm)))
+# (list:permutationsWithReplacement data 2 (fun (perm) (print perm)))
 # # [0 0]
 # # [0 1]
 # # [0 2]
@@ -860,7 +860,7 @@
 # # [2 2]
 # =end
 # @author https://github.com/SuperFola
-(let permutations_with_replacement (fun ((ref _L) _r _f) {
+(let permutationsWithReplacement (fun ((ref _L) _r _f) {
   (let _len (len _L))
   (if (and (!= 0 _len) (> _r 0))
     {

tests/list-tests.ark

@@ -241,15 +241,15 @@
     (list:permutations [] 0 (fun (data) (append! perms data)))
     (test:eq perms []) })
 
-  (test:case "permutations_with_replacement" {
+  (test:case "permutationsWithReplacement" {
     (mut perms [])
-    (list:permutations_with_replacement "ABC" 2 (fun (data) (append! perms data)))
+    (list:permutationsWithReplacement "ABC" 2 (fun (data) (append! perms data)))
     (test:eq perms [["A" "A"] ["A" "B"] ["A" "C"] ["B" "B"] ["B" "C"] ["C" "C"]])
 
     (set perms [])
-    (list:permutations_with_replacement "ABC" 0 (fun (data) (append! perms data)))
+    (list:permutationsWithReplacement "ABC" 0 (fun (data) (append! perms data)))
     (test:eq perms [])
 
     (set perms [])
-    (list:permutations_with_replacement "" 2 (fun (data) (append! perms data)))
+    (list:permutationsWithReplacement "" 2 (fun (data) (append! perms data)))
     (test:eq perms []) }) })