Erlang 对dict、maps、array的部分性能测试

竖轴：时间（微秒）横轴（数据量）
备注（maps与dict的key是{name,整数}与整数在速度上差别不大，array的key是正整数）

结论

数据量在32-10000用maps的各种操作速度更快（但内存稍多，引用官方描述，此处没测）
数据量1万以上，如果键是正整数，array与maps性能相当（官方推荐用array）
数据量接近32个的时候是maps速度最差的时候

数据

环境

代码

dmt(Size, N) ->
    {TD, D} = timer:tc(dict, from_list, [[{{dict, I}, I} || I <- lists:seq(1, Size)]]),
    {TM, M} = timer:tc(maps, from_list, [[{{maps, I}, I} || I <- lists:seq(1, Size)]]),
    {TA, _A} = timer:tc(array, from_list, [lists:seq(1, Size)]),
    {TA2, A2} = timer:tc(?MODULE, array_store, [N, Size, array:new()]),
    {TD1, _} = timer:tc(?MODULE, dict_get, [N, Size, D]),
    {TM1, _} = timer:tc(?MODULE, maps_get, [N, Size, M]),
    {TA1, _} = timer:tc(?MODULE, array_get, [N, Size, A2]),
    {TD2, _} = timer:tc(?MODULE, dict_store, [N, Size, dict:new()]),
    {TM2, _} = timer:tc(?MODULE, maps_store, [N, Size, maps:new()]),
    io:format("Size-~p N-~p:init[~p:~p:~p] store[~p:~p:~p] get[~p:~p:~p]", [Size, N, TD, TM, TA, TD2, TM2, TA2, TD1, TM1, TA1]).

dict_get(N, Size, Dict) ->
    dict:find({dict, (N rem Size) bor (2001 bsl 23)}, Dict),
    if  
        N > 0 ->
            dict_get(N - 1, Size, Dict);
        true ->
            ok
    end.


maps_get(N, Size, Map) ->
    maps:find({maps, (N rem Size) bor (2001 bsl 23)}, Map),
    if  
        N > 0 ->
            maps_get(N - 1, Size, Map);
        true ->
            ok
    end.

dict_store(N, Size, Dict) ->
    K = (N rem Size) bor (2001 bsl 23),
    Dict1 = dict:store({dict, K}, K, Dict),
    if  
        N > 0 ->
            dict_store(N - 1, Size, Dict1);
        true ->
            Dict1
    end.


maps_store(N, Size, Map) ->
    K = (N rem Size) bor (2001 bsl 23),
    Map1 = maps:put({maps, K}, K, Map),
    if  
        N > 0 ->
            maps_store(N - 1, Size, Map1);
        true ->
            Map1
    end.

array_get(N, Size, Array) ->
    catch array:get((N rem Size) bor (2001 bsl 23), Array),
    if 
        N > 0 ->
            array_get(N - 1, Size, Array);
        true ->
            ok
    end.

array_store(N, Size, Array) ->
    K = (N rem Size) bor (2001 bsl 23),
    Array1 = array:set(K, N, Array),
    if 
        N > 0 ->
            array_store(N - 1, Size, Array1);
        true ->
            Array1
    end.