diff options
Diffstat (limited to 'lib')
| -rw-r--r-- | lib/dialyzer/src/dialyzer_dataflow.erl | 22 | ||||
| -rw-r--r-- | lib/dialyzer/src/dialyzer_typesig.erl | 25 |
2 files changed, 0 insertions, 47 deletions
diff --git a/lib/dialyzer/src/dialyzer_dataflow.erl b/lib/dialyzer/src/dialyzer_dataflow.erl index 239df1b8bd..33fa107019 100644 --- a/lib/dialyzer/src/dialyzer_dataflow.erl +++ b/lib/dialyzer/src/dialyzer_dataflow.erl @@ -1453,28 +1453,6 @@ bind_pat_vars([Pat|PatLeft], [Type|TypeLeft], Acc, Map, State, Rev) -> end; map -> {Map, t_map([])}; -% Pairs = [ cerl:map_pair_es(Pair) || Pair <- cerl:map_es(Pat) ], -% MapType = t_inf(t_map([]), Type), -% case t_is_none(MapType) of -% true -> -% bind_opaque_pats(MapType, Type, Pat, Map, State, Rev); -% false -> -% MapJ = join_maps_begin(Map), -% Results = case Rev of -% true -> -% [bind_pat_vars_reverse(Pair, [t_any(),t_any()], [], MapJ, State) || Pair <- Pairs]; -% false -> -% [bind_pat_vars(Pair, [t_any(),t_any()], [], MapJ, State) || Pair <- Pairs] -% end, -% case [M || {M, _} <- Results, M =/= error] of -% [] -> bind_error([Pat], MapType, t_none(), bind); -% Maps -> -% Map1 = join_maps_end(Maps, MapJ), -% _PairTypes = [{Ktype,Vtype} || {M, [Ktype,Vtype]} <- Results, M =/= error], -% % add t_sup -% {Map1, t_map([])} -% end -% end; tuple -> Es = cerl:tuple_es(Pat), {TypedRecord, Prototype} = diff --git a/lib/dialyzer/src/dialyzer_typesig.erl b/lib/dialyzer/src/dialyzer_typesig.erl index 4e18e9c7d2..b4b3d5a092 100644 --- a/lib/dialyzer/src/dialyzer_typesig.erl +++ b/lib/dialyzer/src/dialyzer_typesig.erl @@ -474,31 +474,6 @@ traverse(Tree, DefinedVars, State) -> end; map -> {State, t_map([])}; -% Pairs = cerl:map_es(Tree), -% {State1, EVars} = traverse_list(Pairs, DefinedVars, State), -% case cerl:is_literal(cerl:fold_literal(Tree)) of -% true -> -% %% We do not need to do anything more here. -% {State, t_map([])}; -% false -> -% Fun = fun(Var, AccState) -> -% case t_has_var(Var) of -% true -> -% {AccState1, NewVar} = state__mk_var(AccState), -% {NewVar, -% state__store_conj(Var, eq, NewVar, AccState1)}; -% false -> -% {Var, AccState} -% end -% end, -% {_NewEvars, State2} = lists:mapfoldl(Fun, State1, EVars), -% {State2, t_map([])} -% end; -% map_pair_assoc -> -% [K,V] = cerl:map_pair_assoc_es(Tree), -% {State1,_} = traverse(K,DefinedVars,State), -% {State2,_} = traverse(V,DefinedVars,State), -% {_,State2}; values -> %% We can get into trouble when unifying products that have the %% same element appearing several times. Handle these cases by |