Curry testcases

curry-testcases/RBT.curry

@@ -42,4 +42,5 @@ isRBT t = (blackBalanced t) && (redNodesHaveBlackChildren t)
 
 valuesWithin :: Tree -> Int -> Bool
 valuesWithin Empty _ = True
-valuesWithin (Node _ v l r) bound = 0 <= v && v <= bound && (valuesWithin l bound) && (valuesWithin r bound)
+valuesWithin (Node _ v l r) bound =
+  0 <= v && v <= bound && (valuesWithin l bound) && (valuesWithin r bound)

curry-testcases/SortedList.curry

+module SortedList
+  (isSorted, size
+  )   where
+
+isSorted :: [Int] -> Bool
+isSorted [] = True
+isSorted [_] = True
+isSorted (x:y:ys) = x <= y && (isSorted (y:ys))
+
+size :: [Int] -> Int
+size [] = 0
+size (_:xs) = 1 + (size xs)
+
+contains :: [Int] -> Int -> Bool
+contains [] _ = False
+contains (x:xs) e = (x == e) || (contains xs e)