Pārlūkot izejas kodu

remove insert_at

Tamo 1 gadu atpakaļ
vecāks
revīzija
cb3686cdde
2 mainītis faili ar 0 papildinājumiem un 10 dzēšanām
  1. 0 4
      examples/tests/lists.nbt
  2. 0 6
      numbat/modules/core/lists.nbt

+ 0 - 4
examples/tests/lists.nbt

@@ -38,10 +38,6 @@ assert_eq(drop(0, []), [])
 assert_eq(range(0, 0), [0])
 assert_eq(range(0, 5), [0, 1, 2, 3, 4, 5])
 
-assert_eq(insert_at(12, 0, range(0, 5)), [12, 0, 1, 2, 3, 4, 5])
-assert_eq(insert_at(12, 1, range(0, 5)), [0, 12, 1, 2, 3, 4, 5])
-assert_eq(insert_at(12, len(range(0, 5)), range(0, 5)), [0, 1, 2, 3, 4, 5, 12])
-
 assert_eq(reverse([]), [])
 assert_eq(reverse(xs), [3, 2, 1])
 

+ 0 - 6
numbat/modules/core/lists.nbt

@@ -44,12 +44,6 @@ fn element_at<A>(i: Scalar, xs: List<A>) -> A =
     then head(xs)
     else element_at(i - 1, tail(xs))
 
-@description("Insert the element at index `i` in a list")
-fn insert_at<A>(el: A, i: Scalar, xs: List<A>) -> List<A> =
-  if i == 0
-    then cons(el, xs)
-    else cons(head(xs), insert_at(el, i - 1, tail(xs)))
-
 @description("Generate a range of integer numbers from `start` to `end` (inclusive)")
 fn range(start: Scalar, end: Scalar) -> List<Scalar> =
   if start > end