Repository navigation
Expand file tree
/
Copy pathmaps.erl
More file actions
581 lines (482 loc) · 16.3 KB
/
Copy pathmaps.erl
File metadata and controls
581 lines (482 loc) · 16.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2013-2022. All Rights Reserved.
%%
%% Licensed under the Apache License, Version 2.0 (the "License");
%% you may not use this file except in compliance with the License.
%% You may obtain a copy of the License at
%%
%% http://www.apache.org/licenses/LICENSE-2.0
%%
%% Unless required by applicable law or agreed to in writing, software
%% distributed under the License is distributed on an "AS IS" BASIS,
%% WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
%% See the License for the specific language governing permissions and
%% limitations under the License.
%%
%% %CopyrightEnd%
%%
-module(maps).
-export([get/3, filter/2, filtermap/2, fold/3, foreach/2,
map/2, size/1, new/0,
update_with/3, update_with/4,
without/2, with/2,
iterator/1, next/1,
intersect/2, intersect_with/3,
merge_with/3,
groups_from_list/2, groups_from_list/3]).
%% BIFs
-export([get/2, find/2, from_list/1, from_keys/2,
is_key/2, keys/1, merge/2,
put/3, remove/2, take/2,
to_list/1, update/3, values/1]).
-opaque iterator(Key, Value) :: {Key, Value, iterator(Key, Value)} | none
| nonempty_improper_list(integer(), #{Key => Value}).
-type iterator() :: iterator(term(), term()).
-export_type([iterator/2, iterator/0]).
-dialyzer({no_improper_lists, iterator/1}).
%% We must inline these functions so that the stacktrace points to
%% the correct function.
-compile({inline, [badarg_with_info/1,
error_with_info/2]}).
%% Shadowed by erl_bif_types: maps:get/2
-spec get(Key,Map) -> Value when
Key :: term(),
Map :: map(),
Value :: term().
get(_,_) -> erlang:nif_error(undef).
-spec find(Key,Map) -> {ok, Value} | error when
Map :: #{Key => Value, _ => _}.
find(_,_) -> erlang:nif_error(undef).
%% Shadowed by erl_bif_types: maps:from_list/1
-spec from_list(List) -> Map when
List :: [{Key,Value}],
Key :: term(),
Value :: term(),
Map :: map().
from_list(_) -> erlang:nif_error(undef).
%% Shadowed by erl_bif_types: maps:from_keys/2
-spec from_keys(Keys, Value) -> Map when
Keys :: list(),
Value :: term(),
Map :: map().
from_keys(_, _) -> erlang:nif_error(undef).
-spec intersect(Map1,Map2) -> Map3 when
Map1 :: #{Key => term()},
Map2 :: #{term() => Value2},
Map3 :: #{Key => Value2}.
intersect(Map1, Map2) when is_map(Map1), is_map(Map2) ->
case map_size(Map1) =< map_size(Map2) of
true ->
intersect_with_small_map_first(fun intersect_combiner_v2/3, Map1, Map2);
false ->
intersect_with_small_map_first(fun intersect_combiner_v1/3, Map2, Map1)
end;
intersect(Map1, Map2) ->
error_with_info(error_type_two_maps(Map1, Map2), [Map1,Map2]).
intersect_combiner_v1(_K, V1, _V2) -> V1.
intersect_combiner_v2(_K, _V1, V2) -> V2.
-spec intersect_with(Combiner, Map1, Map2) -> Map3 when
Map1 :: #{Key => Value1},
Map2 :: #{term() => Value2},
Combiner :: fun((Key, Value1, Value2) -> CombineResult),
Map3 :: #{Key => CombineResult}.
intersect_with(Combiner, Map1, Map2) when is_map(Map1),
is_map(Map2),
is_function(Combiner, 3) ->
%% Use =< because we want to avoid reversing the combiner if we can
case map_size(Map1) =< map_size(Map2) of
true ->
intersect_with_small_map_first(Combiner, Map1, Map2);
false ->
RCombiner = fun(K, V1, V2) -> Combiner(K, V2, V1) end,
intersect_with_small_map_first(RCombiner, Map2, Map1)
end;
intersect_with(Combiner, Map1, Map2) ->
error_with_info(error_type_merge_intersect(Map1, Map2, Combiner),
[Combiner, Map1, Map2]).
intersect_with_small_map_first(Combiner, SmallMap, BigMap) ->
Next = maps:next(maps:iterator(SmallMap)),
intersect_with_iterate(Next, [], BigMap, Combiner).
intersect_with_iterate({K, V1, Iterator}, Keep, BigMap, Combiner) ->
Next = maps:next(Iterator),
case BigMap of
#{ K := V2 } ->
V = Combiner(K, V1, V2),
intersect_with_iterate(Next, [{K,V}|Keep], BigMap, Combiner);
_ ->
intersect_with_iterate(Next, Keep, BigMap, Combiner)
end;
intersect_with_iterate(none, Keep, _BigMap2, _Combiner) ->
maps:from_list(Keep).
%% Shadowed by erl_bif_types: maps:is_key/2
-spec is_key(Key,Map) -> boolean() when
Key :: term(),
Map :: map().
is_key(_,_) -> erlang:nif_error(undef).
-spec keys(Map) -> Keys when
Map :: #{Key => _},
Keys :: [Key].
keys(_) -> erlang:nif_error(undef).
%% Shadowed by erl_bif_types: maps:merge/2
-spec merge(Map1,Map2) -> Map3 when
Map1 :: map(),
Map2 :: map(),
Map3 :: map().
merge(_,_) -> erlang:nif_error(undef).
-spec merge_with(Combiner, Map1, Map2) -> Map3 when
Map1 :: #{Key1 => Value1},
Map2 :: #{Key2 => Value2},
Combiner :: fun((Key1, Value1, Value2) -> CombineResult),
Map3 :: #{Key1 => CombineResult, Key1 => Value1, Key2 => Value2}.
merge_with(Combiner, Map1, Map2) when is_map(Map1),
is_map(Map2),
is_function(Combiner, 3) ->
case map_size(Map1) > map_size(Map2) of
true ->
Iterator = maps:iterator(Map2),
merge_with_1(maps:next(Iterator),
Map1,
Map2,
Combiner);
false ->
Iterator = maps:iterator(Map1),
merge_with_1(maps:next(Iterator),
Map2,
Map1,
fun(K, V1, V2) -> Combiner(K, V2, V1) end)
end;
merge_with(Combiner, Map1, Map2) ->
error_with_info(error_type_merge_intersect(Map1, Map2, Combiner),
[Combiner, Map1, Map2]).
merge_with_1({K, V2, Iterator}, Map1, Map2, Combiner) ->
case Map1 of
#{ K := V1 } ->
NewMap1 = Map1#{ K := Combiner(K, V1, V2) },
merge_with_1(maps:next(Iterator), NewMap1, Map2, Combiner);
#{ } ->
merge_with_1(maps:next(Iterator), maps:put(K, V2, Map1), Map2, Combiner)
end;
merge_with_1(none, Result, _, _) ->
Result.
%% Shadowed by erl_bif_types: maps:put/3
-spec put(Key,Value,Map1) -> Map2 when
Key :: term(),
Value :: term(),
Map1 :: map(),
Map2 :: map().
put(_,_,_) -> erlang:nif_error(undef).
%% Shadowed by erl_bif_types: maps:remove/2
-spec remove(Key,Map1) -> Map2 when
Key :: term(),
Map1 :: map(),
Map2 :: map().
remove(_,_) -> erlang:nif_error(undef).
-spec take(Key,Map1) -> {Value,Map2} | error when
Map1 :: #{Key => Value, _ => _},
Map2 :: #{_ => _}.
take(_,_) -> erlang:nif_error(undef).
-spec to_list(Map) -> [{Key,Value}] when
Map :: #{Key => Value}.
to_list(Map) when is_map(Map) ->
to_list_internal(erts_internal:map_next(0, Map, []));
to_list(Map) ->
error_with_info({badmap,Map}, [Map]).
to_list_internal([Iter, Map | Acc]) when is_integer(Iter) ->
to_list_internal(erts_internal:map_next(Iter, Map, Acc));
to_list_internal(Acc) ->
Acc.
%% Shadowed by erl_bif_types: maps:update/3
-spec update(Key,Value,Map1) -> Map2 when
Map1 :: #{Key := _, _ => _},
Map2 :: #{Key := Value, _ => _}.
update(_,_,_) -> erlang:nif_error(undef).
-spec values(Map) -> Values when
Map :: #{_ => Value},
Values :: [Value].
values(_) -> erlang:nif_error(undef).
%% End of BIFs
-spec new() -> Map when
Map :: #{}.
new() -> #{}.
-spec update_with(Key,Fun,Map1) -> Map2 when
Map1 :: #{Key := Value1, _ => _},
Map2 :: #{Key := Value2, _ => _},
Fun :: fun((Value1) -> Value2).
update_with(Key,Fun,Map) when is_function(Fun,1), is_map(Map) ->
case Map of
#{Key := Value} -> Map#{Key := Fun(Value)};
#{} -> erlang:error({badkey,Key},[Key,Fun,Map])
end;
update_with(Key,Fun,Map) ->
error_with_info(error_type(Map), [Key,Fun,Map]).
-spec update_with(Key,Fun,Init,Map1) -> Map2 when
Map1 :: #{Key => Value1, _ => _},
Map2 :: #{Key := Value2 | Init, _ => _},
Fun :: fun((Value1) -> Value2).
update_with(Key,Fun,Init,Map) when is_function(Fun,1), is_map(Map) ->
case Map of
#{Key := Value} -> Map#{Key := Fun(Value)};
#{} -> Map#{Key => Init}
end;
update_with(Key,Fun,Init,Map) ->
error_with_info(error_type(Map), [Key,Fun,Init,Map]).
-spec get(Key, Map, Default) -> Value | Default when
Map :: #{Key => Value, _ => _}.
get(Key,Map,Default) when is_map(Map) ->
case Map of
#{Key := Value} -> Value;
#{} -> Default
end;
get(Key,Map,Default) ->
error_with_info({badmap,Map}, [Key,Map,Default]).
-spec filter(Pred, MapOrIter) -> Map when
Pred :: fun((Key, Value) -> boolean()),
MapOrIter :: #{Key => Value} | iterator(Key, Value),
Map :: #{Key => Value}.
filter(Pred, MapOrIter) when is_function(Pred, 2) ->
Iter = if
is_map(MapOrIter) ->
iterator(MapOrIter);
true ->
MapOrIter
end,
try next(Iter) of
Next ->
maps:from_list(filter_1(Pred, Next))
catch
error:_ ->
error_with_info({badmap,MapOrIter}, [Pred, MapOrIter])
end;
filter(Pred, Map) ->
badarg_with_info([Pred, Map]).
filter_1(Pred, {K, V, Iter}) ->
case Pred(K, V) of
true ->
[{K,V} | filter_1(Pred, next(Iter))];
false ->
filter_1(Pred, next(Iter))
end;
filter_1(_Pred, none) ->
[].
-spec filtermap(Fun, MapOrIter) -> Map when
Fun :: fun((Key, Value1) -> boolean() | {true, Value2}),
MapOrIter :: #{Key => Value1} | iterator(Key, Value1),
Map :: #{Key => Value1 | Value2}.
filtermap(Fun, MapOrIter) when is_function(Fun, 2) ->
Iter = if
is_map(MapOrIter) ->
iterator(MapOrIter);
true ->
MapOrIter
end,
try next(Iter) of
Next ->
maps:from_list(filtermap_1(Fun, Next))
catch
error:_ ->
error_with_info({badmap,MapOrIter}, [Fun, MapOrIter])
end;
filtermap(Fun, Map) ->
badarg_with_info([Fun, Map]).
filtermap_1(Pred, {K, V, Iter}) ->
case Pred(K, V) of
true ->
[{K, V} | filtermap_1(Pred, next(Iter))];
{true, NewV} ->
[{K, NewV} | filtermap_1(Pred, next(Iter))];
false ->
filtermap_1(Pred, next(Iter))
end;
filtermap_1(_Pred, none) ->
[].
-spec foreach(Fun,MapOrIter) -> ok when
Fun :: fun((Key, Value) -> term()),
MapOrIter :: #{Key => Value} | iterator(Key, Value).
foreach(Fun, MapOrIter) when is_function(Fun, 2) ->
Iter = if is_map(MapOrIter) -> iterator(MapOrIter);
true -> MapOrIter
end,
try next(Iter) of
Next ->
foreach_1(Fun, Next)
catch
error:_ ->
error_with_info({badmap, MapOrIter}, [Fun, MapOrIter])
end;
foreach(Pred, Map) ->
badarg_with_info([Pred, Map]).
foreach_1(Fun, {K, V, Iter}) ->
Fun(K,V),
foreach_1(Fun, next(Iter));
foreach_1(_Fun, none) ->
ok.
-spec fold(Fun,Init,MapOrIter) -> Acc when
Fun :: fun((Key, Value, AccIn) -> AccOut),
Init :: term(),
Acc :: AccOut,
AccIn :: Init | AccOut,
MapOrIter :: #{Key => Value} | iterator(Key, Value).
fold(Fun, Init, MapOrIter) when is_function(Fun, 3) ->
Iter = if
is_map(MapOrIter) ->
iterator(MapOrIter);
true ->
MapOrIter
end,
try next(Iter) of
Next ->
fold_1(Fun, Init, Next)
catch
error:_ ->
error_with_info({badmap,MapOrIter}, [Fun, Init, MapOrIter])
end;
fold(Fun, Init, Map) ->
badarg_with_info([Fun, Init, Map]).
fold_1(Fun, Acc, {K, V, Iter}) ->
fold_1(Fun, Fun(K,V,Acc), next(Iter));
fold_1(_Fun, Acc, none) ->
Acc.
-spec map(Fun,MapOrIter) -> Map when
Fun :: fun((Key, Value1) -> Value2),
MapOrIter :: #{Key => Value1} | iterator(Key, Value1),
Map :: #{Key => Value2}.
map(Fun, MapOrIter) when is_function(Fun, 2) ->
Iter = if
is_map(MapOrIter) ->
iterator(MapOrIter);
true ->
MapOrIter
end,
try next(Iter) of
Next ->
maps:from_list(map_1(Fun, Next))
catch
error:_ ->
error_with_info({badmap,MapOrIter}, [Fun, MapOrIter])
end;
map(Fun, Map) ->
badarg_with_info([Fun, Map]).
map_1(Fun, {K, V, Iter}) ->
[{K, Fun(K, V)} | map_1(Fun, next(Iter))];
map_1(_Fun, none) ->
[].
-spec size(Map) -> non_neg_integer() when
Map :: map().
size(Map) ->
try
map_size(Map)
catch
_:_ ->
error_with_info({badmap,Map}, [Map])
end.
-spec iterator(Map) -> Iterator when
Map :: #{Key => Value},
Iterator :: iterator(Key, Value).
iterator(M) when is_map(M) -> [0 | M];
iterator(M) -> error_with_info({badmap, M}, [M]).
-spec next(Iterator) -> {Key, Value, NextIterator} | 'none' when
Iterator :: iterator(Key, Value),
NextIterator :: iterator(Key, Value).
next({K, V, I}) ->
{K, V, I};
next([Path | Map]) when is_integer(Path), is_map(Map) ->
erts_internal:map_next(Path, Map, iterator);
next(none) ->
none;
next(Iter) ->
badarg_with_info([Iter]).
-spec without(Ks,Map1) -> Map2 when
Ks :: [K],
Map1 :: map(),
Map2 :: map(),
K :: term().
without(Ks,M) when is_list(Ks), is_map(M) ->
lists:foldl(fun maps:remove/2, M, Ks);
without(Ks,M) ->
error_with_info(error_type(M), [Ks,M]).
-spec with(Ks, Map1) -> Map2 when
Ks :: [K],
Map1 :: #{K => V, _ => _},
Map2 :: #{K => V}.
with(Ks,Map1) when is_list(Ks), is_map(Map1) ->
maps:from_list(with_1(Ks, Map1));
with(Ks,M) ->
error_with_info(error_type(M), [Ks,M]).
with_1([K|Ks], Map) ->
case Map of
#{K := V} -> [{K,V}|with_1(Ks, Map)];
#{} -> with_1(Ks, Map)
end;
with_1([], _Map) -> [].
%% groups_from_list/2 & groups_from_list/3
-spec groups_from_list(Fun, List) -> MapOut when
Fun :: fun((Elem :: T) -> Selected),
MapOut :: #{Selected => List},
Selected :: term(),
List :: [T],
T :: term().
groups_from_list(Fun, List0) when is_function(Fun, 1) ->
try lists:reverse(List0) of
List ->
groups_from_list_1(Fun, List, #{})
catch
error:_ ->
badarg_with_info([Fun, List0])
end;
groups_from_list(Fun, List) ->
badarg_with_info([Fun, List]).
groups_from_list_1(Fun, [H | Tail], Acc) ->
K = Fun(H),
NewAcc = case Acc of
#{K := Vs} -> Acc#{K := [H | Vs]};
#{} -> Acc#{K => [H]}
end,
groups_from_list_1(Fun, Tail, NewAcc);
groups_from_list_1(_Fun, [], Acc) ->
Acc.
-spec groups_from_list(Fun, ValueFun, List) -> MapOut when
Fun :: fun((Elem :: T) -> Key),
ValueFun :: fun((Elem :: T) -> ValOut),
MapOut :: #{Key := ListOut},
Key :: term(),
ValOut :: term(),
List :: [T],
ListOut :: [ValOut],
T :: term().
groups_from_list(Fun, ValueFun, List0) when is_function(Fun, 1),
is_function(ValueFun, 1) ->
try lists:reverse(List0) of
List ->
groups_from_list_2(Fun, ValueFun, List, #{})
catch
error:_ ->
badarg_with_info([Fun, ValueFun, List0])
end;
groups_from_list(Fun, ValueFun, List) ->
badarg_with_info([Fun, ValueFun, List]).
groups_from_list_2(Fun, ValueFun, [H | Tail], Acc) ->
K = Fun(H),
V = ValueFun(H),
NewAcc = case Acc of
#{K := Vs} -> Acc#{K := [V | Vs]};
#{} -> Acc#{K => [V]}
end,
groups_from_list_2(Fun, ValueFun, Tail, NewAcc);
groups_from_list_2(_Fun, _ValueFun, [], Acc) ->
Acc.
error_type(M) when is_map(M) -> badarg;
error_type(V) -> {badmap, V}.
error_type_two_maps(M1, M2) when is_map(M1) ->
{badmap, M2};
error_type_two_maps(M1, _M2) ->
{badmap, M1}.
error_type_merge_intersect(M1, M2, Combiner) when is_function(Combiner, 3) ->
error_type_two_maps(M1, M2);
error_type_merge_intersect(_M1, _M2, _Combiner) ->
badarg.
badarg_with_info(Args) ->
erlang:error(badarg, Args, [{error_info, #{module => erl_stdlib_errors}}]).
error_with_info(Reason, Args) ->
erlang:error(Reason, Args, [{error_info, #{module => erl_stdlib_errors}}]).