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
|
%%
%% %CopyrightBegin%
%%
%% Copyright Ericsson AB 2013. All Rights Reserved.
%%
%% The contents of this file are subject to the Erlang Public License,
%% Version 1.1, (the "License"); you may not use this file except in
%% compliance with the License. You should have received a copy of the
%% Erlang Public License along with this software. If not, it can be
%% retrieved online at http://www.erlang.org/.
%%
%% Software distributed under the License is distributed on an "AS IS"
%% basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
%% the License for the specific language governing rights and limitations
%% under the License.
%%
%% %CopyrightEnd%
%%
-module(maps_inline_test).
-export([?MODULE/0]).
?MODULE() ->
21 = mval(#{val => 1}) +
mval(#{val => 2}) +
mval(#{val => 3}) +
mval(#{val => 4}) +
mval(#{val => 5}) +
mval(#{val => 6}),
21 = gval(#{id => 1}) +
gval(#{id => 2}) +
gval(#{id => 3}) +
gval(#{id => 4}) +
gval(#{id => 5}) +
gval(#{id => 6}),
21 = sval(#{id => 1}) +
sval(#{id => 2}) +
sval(#{id => 3}) +
sval(#{id => 4}) +
sval(#{id => 5}) +
sval(#{id => 6}),
M = #{v => 1, m => #{v => 21, m => #{v => 7, m => 13}}},
42 = decompose(M).
% switch key orders
decompose(#{ m := M, v := V}) when is_map(M) ->
V + decompose(M);
decompose(#{ v := V, m := M}) -> V + M.
mval(#{val := V}) -> V.
sval(#{id := 1}) -> 6;
sval(#{id := 2}) -> 5;
sval(#{id := 3}) -> 4;
sval(#{id := 4}) -> 3;
sval(#{id := 5}) -> 2;
sval(#{id := 6}) -> 1.
gval(M) when is_map(M) andalso M =:= #{ id => 1} -> 1;
gval(M) when is_map(M) andalso M =:= #{ id => 2} -> 4;
gval(M) when is_map(M) andalso M =:= #{ id => 3} -> 2;
gval(M) when is_map(M) andalso M =:= #{ id => 4} -> 5;
gval(M) when is_map(M) andalso M =:= #{ id => 5} -> 3;
gval(M) when is_map(M) andalso M =:= #{ id => 6} -> 6.
|
