Packages
otpbp
7.19.2
7.19.2
7.18.0
7.16.1
7.15.0
7.14.0
7.13.0
7.12.0
7.11.0
7.10.2
7.9.3
7.9.2
7.9.1
7.8.7
7.8.6
7.8.5
7.8.4
7.7.1
7.7.0
7.6.3
7.6.2
7.6.1
7.6.0
7.5.1
7.5.0
7.4.0
7.3.4
7.3.3
7.3.2
7.3.1
7.3.0
7.2.0
7.1.1
7.1.0
7.0.4
7.0.3
7.0.2
7.0.1
6.27.0
6.26.2
6.26.1
6.26.0
6.25.0
6.24.0
6.23.0
6.22.2
6.21.3
6.21.2
6.21.1
6.20.2
6.19.1
6.19.0
6.18.3
6.18.2
6.18.1
6.18.0
6.17.1
6.17.0
6.16.0
6.15.4
6.15.3
6.15.2
6.15.1
6.15.0
6.14.0
6.13.5
6.13.4
6.13.3
6.13.2
6.13.1
6.13.0
6.12.0
6.11.2
6.11.1
6.10.0
6.9.2
6.9.1
6.9.0
6.8.0
6.7.1
6.7.0
6.6.4
6.6.3
6.6.2
6.6.1
6.6.0
6.5.0
6.4.0
6.3.3
6.3.2
6.3.1
6.3.0
6.2.1
6.2.0
6.1.0
6.0.0
5.40.0
5.39.1
5.39.0
5.38.0
5.37.0
5.36.0
5.35.2
5.34.3
5.34.2
5.34.1
5.33.1
5.32.1
5.32.0
5.31.3
5.31.2
5.31.1
5.31.0
5.30.1
5.30.0
5.29.0
5.28.4
5.28.3
5.28.2
5.28.1
5.28.0
5.27.0
5.26.5
5.26.4
5.26.3
5.26.2
5.26.1
5.26.0
5.25.0
5.24.2
5.24.1
5.23.0
5.22.2
5.22.1
5.22.0
5.21.0
5.20.1
5.20.0
5.19.4
5.19.3
5.19.2
5.19.1
5.19.0
5.18.0
5.17.0
5.16.3
5.16.1
5.16.0
5.15.1
5.15.0
5.14.0
5.13.1
5.13.0
5.12.1
5.12.0
5.11.2
5.11.1
5.10.1
5.10.0
5.9.0
5.8.0
5.7.0
5.6.1
5.6.0
5.5.0
5.4.2
5.4.1
5.4.0
5.3.0
5.2.2
5.2.1
5.2.0
5.1.2
5.1.1
4.80.0
4.79.1
4.79.0
4.78.0
4.77.0
4.76.2
4.75.3
4.75.2
4.75.1
4.74.0
4.73.1
4.73.0
4.72.3
4.72.2
4.72.1
4.72.0
4.71.1
4.71.0
4.70.0
4.69.4
4.69.3
4.69.2
4.69.1
4.69.0
4.68.0
4.67.5
4.67.4
4.67.3
4.67.2
4.67.0
4.66.0
4.65.2
4.65.1
4.64.0
4.63.2
4.63.1
4.63.0
4.62.0
4.61.1
4.61.0
4.60.4
4.60.3
4.60.2
4.60.1
4.60.0
4.59.0
4.58.0
4.57.2
4.57.1
4.57.0
4.56.2
4.56.1
4.56.0
4.55.0
4.54.0
4.53.0
4.52.1
4.52.0
4.51.3
4.51.2
4.51.0
4.50.0
4.49.3
4.49.2
OTP backports
Current section
Files
Jump to
Current section
Files
src/otpbp_gb_sets.erl
-module(otpbp_gb_sets).
-ifndef(HAVE_gb_sets__map_2).
% OTP 27.0
-export([map/2]).
-endif.
-ifndef(HAVE_gb_sets__filtermap_2).
% OTP 27.0
-export([filtermap/2]).
-endif.
-ifndef(HAVE_gb_sets__is_equal_2).
% OTP 27.0
-export([is_equal/2]).
-endif.
-ifndef(HAVE_gb_sets__iterator_2).
% OTP 27.0
-export([iterator/2]).
-endif.
-ifndef(HAVE_gb_sets__iterator_from_3).
% OTP 27.0
-export([iterator_from/3]).
-endif.
-ifndef(HAVE_gb_sets__larger_2).
% OTP 27.0
-export([larger/2]).
-endif.
-ifndef(HAVE_gb_sets__smaller_2).
% OTP 27.0
-export([smaller/2]).
-endif.
-ifndef(HAVE_gb_sets__foreach_2).
-export([foreach/2]).
-endif.
-ifndef(HAVE_gb_sets__map_2).
map(F, {_, T}) when is_function(F, 1) -> gb_sets:from_list(map(T, F, [])).
map({K, S, B}, F, L) -> map(S, F, [F(K)|map(B, F, L)]);
map(nil, _F, L) -> L.
-endif.
-ifndef(HAVE_gb_sets__filtermap_2).
filtermap(F, {_, T}) when is_function(F, 1) -> gb_sets:from_list(filtermap(T, F, [])).
filtermap({K, S, B}, F, L) ->
N = filtermap(B, F, L),
filtermap(S, F,
case F(K) of
true -> [K|N];
{true, V} -> [V|N];
false -> N
end);
filtermap(nil, _F, L) -> L.
-endif.
-ifndef(HAVE_gb_sets__is_equal_2).
is_equal(S1, S2) ->
gb_sets:is_set(S1) andalso gb_sets:is_set(S2) orelse error(function_clause, [S1, S2]),
S1 == S2 orelse gb_sets:size(S1) =:= gb_sets:size(S2) andalso gb_sets:is_subset(S1, S2).
-endif.
-ifndef(HAVE_gb_sets__iterator_2).
iterator(S, ordered) -> gb_sets:iterator(S);
iterator({_, T}, reversed) -> {reversed, iterator_r(T, [])}.
iterator_r({_, _, nil} = T, L) -> [T|L];
iterator_r({_, _, R} = T, L) -> iterator_r(R, [T|L]);
iterator_r(nil, L) -> L.
-endif.
-ifndef(HAVE_gb_sets__iterator_from_3).
iterator_from(E, S, ordered) -> gb_sets:iterator_from(E, S);
iterator_from(E, {_, T}, reversed) -> {reversed, iterator_from_r(E, T, [])}.
iterator_from_r(E, {K, T, _}, L) when K > E -> iterator_from_r(E, T, L);
iterator_from_r(_, {_, _, nil} = T, L) -> [T|L];
iterator_from_r(E, {_, _, R} = T, L) -> iterator_from_r(E, R, [T|L]);
iterator_from_r(_, nil, L) -> L.
-endif.
-ifndef(HAVE_gb_sets__larger_2).
larger(K, {_, T}) -> larger_(K, T).
larger_(_K, nil) -> none;
larger_(K, {K1, S, _L}) when K < K1 ->
case larger_(K, S) of
none -> {found, K1};
F -> F
end;
larger_(K, {_K, _S, L}) -> larger_(K, L).
-endif.
-ifndef(HAVE_gb_sets__smaller_2).
smaller(K, {_, T}) -> smaller_(K, T).
smaller_(_K, nil) -> none;
smaller_(K, {K1, _S, L}) when K > K1 ->
case smaller_(K, L) of
none -> {found, K1};
F -> F
end;
smaller_(K, {_K, S, _L}) -> smaller_(K, S).
-endif.
-ifndef(HAVE_sets__foreach_2).
foreach(F, S) when is_function(F, 1) ->
gb_sets:fold(fun(E, _) ->
F(E),
ok
end,
ok, S).
-endif.