@@ -101,54 +101,45 @@ test_keydelete() ->
101
101
? ASSERT_MATCH (lists :keydelete (a , 1 , []), []),
102
102
? ASSERT_MATCH (lists :keydelete (a , 1 , [{a , x }, b , []]), [b , []]),
103
103
? ASSERT_MATCH (lists :keydelete (a , 1 , [b , {a , x }, []]), [b , []]),
104
- ? ASSERT_MATCH (lists :keydelete (a , 1 , [b , {a , x }, {a , x }, {a , x }, []]), [b , {a , x }, {a , x }, []]),
104
+ ? ASSERT_MATCH (
105
+ lists :keydelete (a , 1 , [b , {a , x }, {a , x }, {a , x }, []]),
106
+ [b , {a , x }, {a , x }, []]
107
+ ),
105
108
ok .
106
109
107
110
test_keyreplace () ->
108
111
? ASSERT_MATCH (lists :keyreplace (a , 1 , [], {foo , bar }), []),
109
112
? ASSERT_MATCH (lists :keyreplace (a , 1 , [{a , x }, b , []], {1 , 2 }), [{1 , 2 }, b , []]),
110
113
? ASSERT_MATCH (lists :keyreplace (x , 2 , [b , {a , x }, []], {1 , 2 }), [b , {1 , 2 }, []]),
111
- ? ASSERT_MATCH (lists :keyreplace (a , 1 , [b , {a , x }, {a , x }, {a , x }, []], {1 , 2 }), [
112
- b ,
113
- {1 , 2 },
114
- {a , x },
115
- {a , x },
116
- []
117
- ]),
118
- ? ASSERT_MATCH (lists :keyreplace (a , 3 , [b , {a , x }, {a , x }, {a , x }, []], {1 , 2 }), [
119
- b ,
120
- {a , x },
121
- {a , x },
122
- {a , x },
123
- []
124
- ]),
114
+ ? ASSERT_MATCH (
115
+ lists :keyreplace (a , 1 , [b , {a , x }, {a , x }, {a , x }, []], {1 , 2 }),
116
+ [b , {1 , 2 }, {a , x }, {a , x }, []]
117
+ ),
118
+ ? ASSERT_MATCH (
119
+ lists :keyreplace (a , 3 , [b , {a , x }, {a , x }, {a , x }, []], {1 , 2 }),
120
+ [b , {a , x }, {a , x }, {a , x }, []]
121
+ ),
125
122
ok .
126
123
127
124
test_keystore () ->
128
125
? ASSERT_MATCH (lists :keystore (a , 1 , [], {foo , bar }), [{foo , bar }]),
129
126
? ASSERT_MATCH (lists :keystore (a , 1 , [{a , x }, b , []], {1 , 2 }), [{1 , 2 }, b , []]),
130
127
? ASSERT_MATCH (lists :keystore (x , 2 , [b , {a , x }, []], {1 , 2 }), [b , {1 , 2 }, []]),
131
- ? ASSERT_MATCH (lists :keystore (a , 1 , [b , {a , x }, {a , x }, {a , x }, []], {1 , 2 }), [
132
- b ,
133
- {1 , 2 },
134
- {a , x },
135
- {a , x },
136
- []
137
- ]),
138
- ? ASSERT_MATCH (lists :keystore (a , 3 , [b , {a , x }, {a , x }, {a , x }, []], {1 , 2 }), [
139
- b ,
140
- {a , x },
141
- {a , x },
142
- {a , x },
143
- [],
144
- {1 , 2 }
145
- ]),
128
+ ? ASSERT_MATCH (
129
+ lists :keystore (a , 1 , [b , {a , x }, {a , x }, {a , x }, []], {1 , 2 }),
130
+ [b , {1 , 2 }, {a , x }, {a , x }, []]
131
+ ),
132
+ ? ASSERT_MATCH (
133
+ lists :keystore (a , 3 , [b , {a , x }, {a , x }, {a , x }, []], {1 , 2 }),
134
+ [b , {a , x }, {a , x }, {a , x }, [], {1 , 2 }]
135
+ ),
146
136
ok .
147
137
148
138
test_keytake () ->
149
139
List1 = [{name , " Joe" }, {name , " Robert" }, {name , " Mike" }],
150
140
? ASSERT_MATCH (
151
- lists :keytake (" Joe" , 2 , List1 ), {value , {name , " Joe" }, [{name , " Robert" }, {name , " Mike" }]}
141
+ lists :keytake (" Joe" , 2 , List1 ),
142
+ {value , {name , " Joe" }, [{name , " Robert" }, {name , " Mike" }]}
152
143
),
153
144
? ASSERT_MATCH (
154
145
lists :keytake (" Robert" , 2 , List1 ),
@@ -210,7 +201,10 @@ test_flatten() ->
210
201
? ASSERT_MATCH (lists :flatten ([[a ], [b ]]), [a , b ]),
211
202
? ASSERT_MATCH (lists :flatten ([[a ], [b , [c ]]]), [a , b , c ]),
212
203
? ASSERT_MATCH (lists :flatten ([[a ], [b , {c , [d , [e , [f ]]]}]]), [a , b , {c , [d , [e , [f ]]]}]),
213
- ? ASSERT_MATCH (lists :flatten ([[a , b , c ], [d , e , f ], [g , h , i ]]), [a , b , c , d , e , f , g , h , i ]),
204
+ ? ASSERT_MATCH (
205
+ lists :flatten ([[a , b , c ], [d , e , f ], [g , h , i ]]),
206
+ [a , b , c , d , e , f , g , h , i ]
207
+ ),
214
208
ok .
215
209
216
210
test_filter () ->
@@ -245,7 +239,6 @@ test_seq() ->
245
239
? ASSERT_ERROR (lists :seq (- 1 , 1 , - 1 )),
246
240
? ASSERT_ERROR (lists :seq (1 , - 1 , 1 )),
247
241
? ASSERT_ERROR (lists :seq (1 , 2 , 0 )),
248
-
249
242
ok .
250
243
251
244
test_sort () ->
@@ -288,15 +281,17 @@ test_usort() ->
288
281
? ASSERT_MATCH (lists :usort ([1 , 3 , 5 , 2 , 1 , 4 ]), [1 , 2 , 3 , 4 , 5 ]),
289
282
? ASSERT_MATCH (lists :usort ([1 , 3 , 5 , 2 , 5 , 4 ]), [1 , 2 , 3 , 4 , 5 ]),
290
283
291
- ? ASSERT_MATCH (lists :usort (fun (A , B ) -> A > B end , [1 , 2 , 3 , 4 , 3 , 5 ]), [5 , 4 , 3 , 3 , 2 , 1 ]),
284
+ ? ASSERT_MATCH (
285
+ lists :usort (fun (A , B ) -> A > B end , [1 , 2 , 3 , 4 , 3 , 5 ]),
286
+ [5 , 4 , 3 , 3 , 2 , 1 ]
287
+ ),
292
288
? ASSERT_MATCH (lists :usort (fun (A , B ) -> A >= B end , [1 , 2 , 3 , 4 , 3 , 5 ]), [5 , 4 , 3 , 2 , 1 ]),
293
289
294
290
? ASSERT_ERROR (lists :usort (1 ), function_clause ),
295
291
? ASSERT_ERROR (lists :usort (fun (A , B ) -> A > B end , 1 ), function_clause ),
296
292
? ASSERT_ERROR (lists :usort (1 , [1 ]), function_clause ),
297
-
298
293
ok .
299
-
294
+
300
295
test_dropwhile () ->
301
296
? ASSERT_MATCH (lists :dropwhile (fun (_X ) -> true end , []), []),
302
297
? ASSERT_MATCH (lists :dropwhile (fun (_X ) -> false end , []), []),
@@ -338,7 +333,10 @@ test_last() ->
338
333
339
334
test_mapfoldl () ->
340
335
? ASSERT_MATCH ({[], 1 }, lists :mapfoldl (fun (X , A ) -> {X * A , A + 1 } end , 1 , [])),
341
- ? ASSERT_MATCH ({[1 , 4 , 9 ], 4 }, lists :mapfoldl (fun (X , A ) -> {X * A , A + 1 } end , 1 , [1 , 2 , 3 ])),
336
+ ? ASSERT_MATCH (
337
+ {[1 , 4 , 9 ], 4 },
338
+ lists :mapfoldl (fun (X , A ) -> {X * A , A + 1 } end , 1 , [1 , 2 , 3 ])
339
+ ),
342
340
? ASSERT_ERROR (lists :mapfoldl (fun (X , A ) -> {X * A , A + 1 } end , 1 , foo ), function_clause ),
343
341
ok .
344
342
@@ -354,4 +352,5 @@ test_append() ->
354
352
? ASSERT_ERROR (lists :append (1 , 3 ), badarg ),
355
353
ok .
356
354
357
- id (X ) -> X .
355
+ id (X ) ->
356
+ X .
0 commit comments