length :: [Int] -> Int -- testing 360 combinations of argument values -- pruning with 4/8 rules -- looking through 2 candidates of size 1 -- looking through 2 candidates of size 2 -- looking through 0 candidates of size 3 -- looking through 2 candidates of size 4 -- looking through 2 candidates of size 5 -- tested 8 candidates length [] = 0 length (x:xs) = length xs + 1 reverse :: [Int] -> [Int] -- testing 360 combinations of argument values -- pruning with 4/4 rules -- looking through 2 candidates of size 1 -- looking through 1 candidates of size 2 -- looking through 1 candidates of size 3 -- looking through 3 candidates of size 4 -- looking through 4 candidates of size 5 -- looking through 7 candidates of size 6 -- looking through 10 candidates of size 7 -- tested 26 candidates reverse [] = [] reverse (x:xs) = reverse xs ++ [x] (++) :: [Int] -> [Int] -> [Int] -- testing 360 combinations of argument values -- pruning with 0/0 rules -- looking through 3 candidates of size 1 -- looking through 8 candidates of size 2 -- looking through 11 candidates of size 3 -- looking through 23 candidates of size 4 -- looking through 86 candidates of size 5 -- looking through 72 candidates of size 6 -- tested 149 candidates [] ++ xs = xs (x:xs) ++ ys = x:(xs ++ ys) (++) :: [Int] -> [Int] -> [Int] -- testing 360 combinations of argument values -- pruning with 2/2 rules -- looking through 3 candidates of size 1 -- looking through 8 candidates of size 2 -- looking through 11 candidates of size 3 -- looking through 27 candidates of size 4 -- tested 35 candidates xs ++ ys = foldr (:) ys xs last :: [Int] -> Int -- testing 360 combinations of argument values -- pruning with 5/5 rules -- looking through 1 candidates of size 1 -- looking through 1 candidates of size 2 -- looking through 0 candidates of size 3 -- looking through 0 candidates of size 4 -- looking through 0 candidates of size 5 -- looking through 2 candidates of size 6 -- looking through 4 candidates of size 7 -- tested 5 candidates last [] = undefined last (x:xs) = if null xs then x else last xs zip :: [Int] -> [Int] -> [(Int,Int)] -- testing 360 combinations of argument values -- pruning with 0/0 rules -- looking through 1 candidates of size 1 -- looking through 0 candidates of size 2 -- looking through 0 candidates of size 3 -- looking through 0 candidates of size 4 -- looking through 0 candidates of size 5 -- looking through 2 candidates of size 6 -- looking through 6 candidates of size 7 -- looking through 6 candidates of size 8 -- looking through 30 candidates of size 9 -- tested 25 candidates zip [] xs = [] zip (x:xs) [] = [] zip (x:xs) (y:ys) = (x,y):zip xs ys (\/) :: [Int] -> [Int] -> [Int] -- testing 360 combinations of argument values -- pruning with 0/0 rules -- looking through 3 candidates of size 1 -- looking through 8 candidates of size 2 -- looking through 11 candidates of size 3 -- looking through 23 candidates of size 4 -- looking through 86 candidates of size 5 -- looking through 72 candidates of size 6 -- tested 151 candidates [] \/ xs = xs (x:xs) \/ ys = x:ys \/ xs ordered :: [Int] -> Bool -- testing 360 combinations of argument values -- pruning with 29/39 rules -- looking through 2 candidates of size 1 -- looking through 2 candidates of size 2 -- looking through 2 candidates of size 3 -- looking through 2 candidates of size 4 -- looking through 4 candidates of size 5 -- looking through 12 candidates of size 6 -- looking through 20 candidates of size 7 -- looking through 30 candidates of size 8 -- looking through 56 candidates of size 9 -- looking through 114 candidates of size 10 -- looking through 216 candidates of size 11 -- tested 331 candidates ordered [] = True ordered (x:xs) = ordered xs && (null xs || x <= head xs) merge :: [Int] -> [Int] -> [Int] -- testing 360 combinations of argument values -- pruning with 1/2 rules -- looking through 2 candidates of size 1 -- looking through 2 candidates of size 2 -- looking through 3 candidates of size 3 -- looking through 10 candidates of size 4 -- looking through 21 candidates of size 5 -- looking through 26 candidates of size 6 -- looking through 61 candidates of size 7 -- looking through 92 candidates of size 8 -- looking through 203 candidates of size 9 -- looking through 430 candidates of size 10 -- looking through 1086 candidates of size 11 -- looking through 2068 candidates of size 12 -- tested 4004 candidates cannot conjure