diff options
| author | Patrik Nyblom <[email protected]> | 2010-06-02 15:22:19 +0200 |
|---|---|---|
| committer | Patrik Nyblom <[email protected]> | 2010-06-02 16:47:29 +0200 |
| commit | 1b8f86d8314389bf6033d23d3e6d707514ba7612 (patch) | |
| tree | ad57aabe4d838b11355de712c29d7599a0a05193 /lib/syntax_tools/src/erl_recomment.erl | |
| parent | 656e4790551b2211ff51c3ca24adbd07b135327e (diff) | |
| download | otp-1b8f86d8314389bf6033d23d3e6d707514ba7612.tar.gz otp-1b8f86d8314389bf6033d23d3e6d707514ba7612.tar.bz2 otp-1b8f86d8314389bf6033d23d3e6d707514ba7612.zip | |
Remove (harmless) warnings about min/max in core applications
Diffstat (limited to 'lib/syntax_tools/src/erl_recomment.erl')
| -rw-r--r-- | lib/syntax_tools/src/erl_recomment.erl | 9 |
1 files changed, 3 insertions, 6 deletions
diff --git a/lib/syntax_tools/src/erl_recomment.erl b/lib/syntax_tools/src/erl_recomment.erl index 145bbc6f37..94e760dad7 100644 --- a/lib/syntax_tools/src/erl_recomment.erl +++ b/lib/syntax_tools/src/erl_recomment.erl @@ -486,7 +486,7 @@ build_tree(Node) -> %% Include L, while preserving Min =< Max. tree_node(minpos(L, Min), - max(L, Max), + erlang:max(L, Max), erl_syntax:type(Node), erl_syntax:get_attrs(Node), Subtrees) @@ -507,7 +507,7 @@ build_list(Ts) -> build_list([T | Ts], Min, Max, Ack) -> Node = build_tree(T), Min1 = minpos(node_min(Node), Min), - Max1 = max(node_max(Node), Max), + Max1 = erlang:max(node_max(Node), Max), build_list(Ts, Min1, Max1, [Node | Ack]); build_list([], Min, Max, Ack) -> list_node(Min, Max, lists:reverse(Ack)). @@ -518,7 +518,7 @@ build_list_list(Ls) -> build_list_list([L | Ls], Min, Max, Ack) -> Node = build_list(L), Min1 = minpos(node_min(Node), Min), - Max1 = max(node_max(Node), Max), + Max1 = erlang:max(node_max(Node), Max), build_list_list(Ls, Min1, Max1, [Node | Ack]); build_list_list([], Min, Max, Ack) -> {lists:reverse(Ack), Min, Max}. @@ -723,9 +723,6 @@ tree_node_attrs(#tree{attrs = Attrs}) -> %% Just the generic "maximum" function -max(X, Y) when X > Y -> X; -max(_, Y) -> Y. - %% Return the least positive integer of X and Y, or zero if none of them %% are positive. (This is necessary for computing minimum source line %% numbers, since zero (or negative) numbers may occur, but they |