|
21 | 21 |
|
22 | 22 | ### Values
|
23 | 23 |
|
24 |
| - (!!) :: forall a. [a] -> Prim.Number -> Maybe a |
| 24 | + (!!) :: forall a. [a] -> Number -> Maybe a |
25 | 25 |
|
26 | 26 | (\\) :: forall a. (Eq a) => [a] -> [a] -> [a]
|
27 | 27 |
|
|
35 | 35 |
|
36 | 36 | delete :: forall a. (Eq a) => a -> [a] -> [a]
|
37 | 37 |
|
38 |
| - deleteAt :: forall a. Prim.Number -> Prim.Number -> [a] -> [a] |
| 38 | + deleteAt :: forall a. Number -> Number -> [a] -> [a] |
39 | 39 |
|
40 |
| - deleteBy :: forall a. (a -> a -> Prim.Boolean) -> a -> [a] -> [a] |
| 40 | + deleteBy :: forall a. (a -> a -> Boolean) -> a -> [a] -> [a] |
41 | 41 |
|
42 |
| - drop :: forall a. Prim.Number -> [a] -> [a] |
| 42 | + drop :: forall a. Number -> [a] -> [a] |
43 | 43 |
|
44 |
| - elemIndex :: forall a. (Eq a) => a -> [a] -> Prim.Number |
| 44 | + elemIndex :: forall a. (Eq a) => a -> [a] -> Number |
45 | 45 |
|
46 |
| - elemLastIndex :: forall a. (Eq a) => a -> [a] -> Prim.Number |
| 46 | + elemLastIndex :: forall a. (Eq a) => a -> [a] -> Number |
47 | 47 |
|
48 |
| - filter :: forall a. (a -> Prim.Boolean) -> [a] -> [a] |
| 48 | + filter :: forall a. (a -> Boolean) -> [a] -> [a] |
49 | 49 |
|
50 |
| - findIndex :: forall a. (a -> Prim.Boolean) -> [a] -> Prim.Number |
| 50 | + findIndex :: forall a. (a -> Boolean) -> [a] -> Number |
51 | 51 |
|
52 |
| - findLastIndex :: forall a. (a -> Prim.Boolean) -> [a] -> Prim.Number |
| 52 | + findLastIndex :: forall a. (a -> Boolean) -> [a] -> Number |
53 | 53 |
|
54 | 54 | group :: forall a. (Eq a) => [a] -> [[a]]
|
55 | 55 |
|
56 | 56 | group' :: forall a. (Ord a) => [a] -> [[a]]
|
57 | 57 |
|
58 |
| - groupBy :: forall a. (a -> a -> Prim.Boolean) -> [a] -> [[a]] |
| 58 | + groupBy :: forall a. (a -> a -> Boolean) -> [a] -> [[a]] |
59 | 59 |
|
60 | 60 | head :: forall a. [a] -> Maybe a
|
61 | 61 |
|
62 | 62 | init :: forall a. [a] -> Maybe [a]
|
63 | 63 |
|
64 |
| - insertAt :: forall a. Prim.Number -> a -> [a] -> [a] |
| 64 | + insertAt :: forall a. Number -> a -> [a] -> [a] |
65 | 65 |
|
66 | 66 | intersect :: forall a. (Eq a) => [a] -> [a] -> [a]
|
67 | 67 |
|
68 |
| - intersectBy :: forall a. (a -> a -> Prim.Boolean) -> [a] -> [a] -> [a] |
| 68 | + intersectBy :: forall a. (a -> a -> Boolean) -> [a] -> [a] -> [a] |
69 | 69 |
|
70 | 70 | last :: forall a. [a] -> Maybe a
|
71 | 71 |
|
72 |
| - length :: forall a. [a] -> Prim.Number |
| 72 | + length :: forall a. [a] -> Number |
73 | 73 |
|
74 | 74 | map :: forall a b. (a -> b) -> [a] -> [b]
|
75 | 75 |
|
76 | 76 | mapMaybe :: forall a b. (a -> Maybe b) -> [a] -> [b]
|
77 | 77 |
|
78 | 78 | nub :: forall a. (Eq a) => [a] -> [a]
|
79 | 79 |
|
80 |
| - nubBy :: forall a. (a -> a -> Prim.Boolean) -> [a] -> [a] |
| 80 | + nubBy :: forall a. (a -> a -> Boolean) -> [a] -> [a] |
81 | 81 |
|
82 |
| - null :: forall a. [a] -> Prim.Boolean |
| 82 | + null :: forall a. [a] -> Boolean |
83 | 83 |
|
84 |
| - range :: Prim.Number -> Prim.Number -> [Prim.Number] |
| 84 | + range :: Number -> Number -> [Number] |
85 | 85 |
|
86 | 86 | reverse :: forall a. [a] -> [a]
|
87 | 87 |
|
|
93 | 93 |
|
94 | 94 | sortBy :: forall a. (a -> a -> Ordering) -> [a] -> [a]
|
95 | 95 |
|
96 |
| - span :: forall a. (a -> Prim.Boolean) -> [a] -> { rest :: [a], init :: [a] } |
| 96 | + span :: forall a. (a -> Boolean) -> [a] -> { rest :: [a], init :: [a] } |
97 | 97 |
|
98 | 98 | tail :: forall a. [a] -> Maybe [a]
|
99 | 99 |
|
100 |
| - take :: forall a. Prim.Number -> [a] -> [a] |
| 100 | + take :: forall a. Number -> [a] -> [a] |
101 | 101 |
|
102 |
| - updateAt :: forall a. Prim.Number -> a -> [a] -> [a] |
| 102 | + updateAt :: forall a. Number -> a -> [a] -> [a] |
103 | 103 |
|
104 | 104 | zipWith :: forall a b c. (a -> b -> c) -> [a] -> [b] -> [c]
|
105 | 105 |
|
|
0 commit comments