Source file ast_tuple_pattern_flatten.ml

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
(* Copyright (C) 2018 Hongbo Zhang, Authors of ReScript
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * In addition to the permissions granted to you by the LGPL, you may combine
 * or link a "work that uses the Library" with a publicly distributed version
 * of this file to produce a combined library or application, then distribute
 * that combined work under the terms of your choosing, with no requirement
 * to comply with the obligations normally placed on you by section 4 of the
 * LGPL version 3 (or the corresponding section of a later version of the LGPL
 * should you choose to use a later version).
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. *)

open Import

(*
  [let (a,b) = M.N.(c,d) ]
  =>
  [ let a = M.N.c
    and b = M.N.d ]
*)
let flatten_tuple_pattern_vb =
  let rec is_simple_pattern p =
    match p.ppat_desc with
    | Ppat_any | Ppat_var _ -> true
    | Ppat_constraint (p, _) -> is_simple_pattern p
    | _ -> false
  in
  fun (self : Ast_traverse.map)
    (vb : value_binding)
    (acc : value_binding list)
    :
    value_binding list
  ->
    let pvb_pat = self#pattern vb.pvb_pat in
    let pvb_expr = self#expression vb.pvb_expr in
    let pvb_attributes = self#attributes vb.pvb_attributes in
    let pvb_constraint =
      Option.map ~f:self#value_constraint vb.pvb_constraint
    in
    match (pvb_pat.ppat_desc, pvb_expr.pexp_desc) with
    | Ppat_tuple xs, _ when List.for_all ~f:is_simple_pattern xs -> (
        match Ast_open_cxt.destruct_open_tuple pvb_expr with
        | Some (wholes, es, tuple_attributes) when List.same_length es xs ->
            Mel_ast_invariant.warn_discarded_unused_attributes tuple_attributes;
            (* will be dropped*)
            List.fold_right2
              ~f:(fun pat exp acc ->
                {
                  pvb_pat = pat;
                  pvb_expr = Ast_open_cxt.restore_exp exp wholes;
                  pvb_attributes;
                  pvb_loc = vb.pvb_loc;
                  pvb_constraint;
                }
                :: acc)
              xs es ~init:acc
        | _ ->
            {
              pvb_pat;
              pvb_expr;
              pvb_loc = vb.pvb_loc;
              pvb_attributes;
              pvb_constraint;
            }
            :: acc)
    | Ppat_record (lid_pats, _), Pexp_pack { pmod_desc = Pmod_ident id; _ } ->
        List.map
          ~f:(fun (lid, pat) ->
            match lid.txt with
            | Lident s ->
                {
                  pvb_pat = pat;
                  pvb_expr =
                    Ast_helper.Exp.ident ~loc:lid.loc
                      { lid with txt = Ldot (id.txt, s) };
                  pvb_attributes = [];
                  pvb_loc = pat.ppat_loc;
                  pvb_constraint;
                }
            | _ ->
                Location.raise_errorf ~loc:lid.loc
                  "Pattern matching on modules requires simple labels")
          lid_pats
        @ acc
    | _ ->
        {
          pvb_pat;
          pvb_expr;
          pvb_loc = vb.pvb_loc;
          pvb_attributes;
          pvb_constraint;
        }
        :: acc

(* XXX(anmonteiro): this one is a little brittle. Because it might introduce
   new value bindings, it must be called at every AST node that has a
   value_binding list. This means that we're one step behind if a new node is
   introduced upstream. *)
let value_bindings_mapper (self : Ast_traverse.map) (vbs : value_binding list) =
  List.fold_right ~f:(flatten_tuple_pattern_vb self) vbs ~init:[]