diff options
| author | Matthias Radestock <matthias@rabbitmq.com> | 2012-03-22 15:37:34 +0000 |
|---|---|---|
| committer | Matthias Radestock <matthias@rabbitmq.com> | 2012-03-22 15:37:34 +0000 |
| commit | d9c055ce65f2d6c2626d23de8cc2d0bceb5aceea (patch) | |
| tree | 2946bff06019d7cd40fd1ced7c1e1d85c9ff29ea | |
| parent | 49a805b13724c36f073ff223d357a964e416f2db (diff) | |
| download | rabbitmq-server-d9c055ce65f2d6c2626d23de8cc2d0bceb5aceea.tar.gz | |
get rid of rabbit_misc:gb_trees_set_insert/3
| -rw-r--r-- | src/rabbit_misc.erl | 13 |
1 files changed, 1 insertions, 12 deletions
diff --git a/src/rabbit_misc.erl b/src/rabbit_misc.erl index ddf7f574..5b4eed37 100644 --- a/src/rabbit_misc.erl +++ b/src/rabbit_misc.erl @@ -46,8 +46,7 @@ -export([sort_field_table/1]). -export([pid_to_string/1, string_to_pid/1]). -export([version_compare/2, version_compare/3]). --export([dict_cons/3, orddict_cons/3, gb_trees_cons/3, - gb_trees_set_insert/3]). +-export([dict_cons/3, orddict_cons/3, gb_trees_cons/3]). -export([gb_trees_fold/3, gb_trees_foreach/2]). -export([get_options/2]). -export([all_module_attributes/1, build_acyclic_graph/3]). @@ -176,7 +175,6 @@ -spec(dict_cons/3 :: (any(), any(), dict()) -> dict()). -spec(orddict_cons/3 :: (any(), any(), orddict:orddict()) -> orddict:orddict()). -spec(gb_trees_cons/3 :: (any(), any(), gb_tree()) -> gb_tree()). --spec(gb_trees_set_insert/3 :: (any(), any(), gb_tree()) -> gb_tree()). -spec(gb_trees_fold/3 :: (fun ((any(), any(), A) -> A), A, gb_tree()) -> A). -spec(gb_trees_foreach/2 :: (fun ((any(), any()) -> any()), gb_tree()) -> 'ok'). @@ -717,15 +715,6 @@ gb_trees_cons(Key, Value, Tree) -> none -> gb_trees:insert(Key, [Value], Tree) end. -gb_trees_set_insert(Key, Value, Tree) -> - case gb_trees:lookup(Key, Tree) of - {value, Values} -> - Values1 = gb_sets:insert(Value, Values), - gb_trees:update(Key, Values1, Tree); - none -> - gb_trees:insert(Key, gb_sets:singleton(Value), Tree) - end. - gb_trees_fold(Fun, Acc, Tree) -> gb_trees_fold1(Fun, Acc, gb_trees:next(gb_trees:iterator(Tree))). |