package melange
Toolchain to produce JS from Reason/OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
melange-5.1.0-53.tbz
sha256=f7aac30f3ba5feff8373e2164cdb5b38a59457cadfec74b564c2b62d035ca4a9
sha512=39a0b7430035b5355bad4f42fb07d719da56e457d78399fc34c38e5eeb6e5e5259f06a1209dc00325818e3dc1dd9a5988f6a25c106d2ee0ee2033ab9074791cd
doc/src/melange_ppx/ast_exp_apply.ml.html
Source file ast_exp_apply.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 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340
(* 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 open Ast_helper let rec no_need_bound exp = match exp.pexp_desc with | Pexp_ident { txt = Lident _; _ } -> true | Pexp_constraint (e, _) -> no_need_bound e | _ -> false let ocaml_obj_id = "__ocaml_internal_obj" let bound e (cb : expression -> _) = if no_need_bound e then cb e else let loc = e.pexp_loc in Exp.let_ ~loc Nonrecursive [ Vb.mk ~loc (Pat.var ~loc { txt = ocaml_obj_id; loc }) e ] (cb (Exp.ident ~loc { txt = Lident ocaml_obj_id; loc })) let check_and_discard (args : (arg_label * expression) list) = List.map ~f:(fun (label, x) -> Error.err_if_label ~loc:x.pexp_loc label; x) args type app_pattern = { op : string; loc : Location.t; (* locatoin is the location of whole expression #4451 *) args : expression list; } let sane_property_name_check loc s = if String.contains s '#' then Location.raise_errorf ~loc "property name (`%s') cannot contain special character `#'" s let view_as_app fn (s : string list) : app_pattern option = match fn.pexp_desc with | Pexp_apply ({ pexp_desc = Pexp_ident { txt = Lident op; _ }; _ }, args) when List.mem op ~set:s -> Some { op; loc = fn.pexp_loc; args = check_and_discard args } | _ -> None let inner_ops = [ "##"; "#@" ] let rec exclude_with_val = let rec exclude (xs : 'a list) (p : 'a -> bool) : 'a list = match xs with | [] -> [] | x :: xs -> if p x then exclude xs p else x :: exclude xs p in fun l p -> match l with | [] -> None | a0 :: xs -> ( if p a0 then Some (exclude xs p) else match xs with | [] -> None | a1 :: rest -> ( if p a1 then Some (a0 :: exclude rest p) else match exclude_with_val rest p with | None -> None | Some rest -> Some (a0 :: a1 :: rest))) let app_exp_mapper e ((self, super) : Ast_traverse.map * (expression -> expression)) fn args = (* - (f##paint) 1 2 - (f#@paint) 1 2 *) match view_as_app fn inner_ops with | Some { op; loc; args = [ obj; { pexp_desc = Pexp_ident { txt = Lident name; _ }; _ } ]; } -> { e with pexp_desc = (if op = "##" then Ast_uncurry_apply.method_apply loc self obj name args else Ast_uncurry_apply.property_apply loc self obj name args); } | Some { op; loc; _ } -> Location.raise_errorf ~loc "%s expect f%sproperty arg0 arg2 form" op op | None -> ( match view_as_app e Melange_ffi.External_ffi_types.Literals.infix_ops with | Some { op = "|."; args = [ a_; f_ ]; loc } -> ( (* a |. f a |. f b c [@u] --> f a b c [@u] a |. M.(f b c) --> M.f a M.b M.c a |. (g |. b) a |. M.Some a |. `Variant a |. (b |. f c [@u]) *) let a = self#expression a_ in let f = self#expression f_ in match f.pexp_desc with | Pexp_variant (label, None) -> { f with pexp_desc = Pexp_variant (label, Some a); pexp_loc = e.pexp_loc; } | Pexp_construct (ctor, None) -> { f with pexp_desc = Pexp_construct (ctor, Some a); pexp_loc = e.pexp_loc; } | Pexp_apply (fn1, args) -> Mel_ast_invariant.warn_discarded_unused_attributes fn1.pexp_attributes; { pexp_desc = Pexp_apply ( { fn1 with pexp_attributes = fn1.pexp_attributes }, (Nolabel, a) :: args ); pexp_loc = e.pexp_loc; pexp_loc_stack = e.pexp_loc_stack; pexp_attributes = e.pexp_attributes; } | _ -> ( match Ast_open_cxt.destruct f [] with | ( { pexp_desc = Pexp_tuple xs; pexp_attributes = tuple_attrs; _ }, wholes ) -> Ast_open_cxt.restore_exp (bound a (fun bounded_obj_arg -> { pexp_desc = Pexp_tuple (List.map ~f:(fun fn -> match fn.pexp_desc with | Pexp_construct (ctor, None) -> { fn with pexp_desc = Pexp_construct (ctor, Some bounded_obj_arg); } | Pexp_apply (fn, args) -> Mel_ast_invariant .warn_discarded_unused_attributes fn.pexp_attributes; { pexp_desc = Pexp_apply ( { fn with pexp_attributes = [] }, (Nolabel, bounded_obj_arg) :: args ); pexp_attributes = []; pexp_loc_stack = fn.pexp_loc_stack; pexp_loc = fn.pexp_loc; } | _ -> let loc = fn.pexp_loc in [%expr [%e fn] [%e bounded_obj_arg]]) xs); pexp_attributes = tuple_attrs; pexp_loc = f.pexp_loc; pexp_loc_stack = f.pexp_loc_stack; })) wholes | ( { pexp_desc = Pexp_apply (e, args); pexp_attributes; _ }, (_ :: _ as wholes) ) -> let fn = Ast_open_cxt.restore_exp e wholes in let args = List.map ~f:(fun (lab, exp) -> (lab, Ast_open_cxt.restore_exp exp wholes)) args in Mel_ast_invariant.warn_discarded_unused_attributes pexp_attributes; { pexp_desc = Pexp_apply (fn, (Nolabel, a) :: args); pexp_attributes; pexp_loc = loc; pexp_loc_stack = []; } | _ -> ( match ( exclude_with_val f_.pexp_attributes Ast_attributes.is_uncurried, f_.pexp_desc ) with | Some other_attributes, Pexp_apply (fn1, args) -> (* a |. f b c [@u] Cannot process uncurried application early as the arity is wip *) let fn1 = self#expression fn1 in let args = args |> List.map ~f:(fun (l, e) -> (l, self#expression e)) in Mel_ast_invariant.warn_discarded_unused_attributes fn1.pexp_attributes; { pexp_desc = Ast_uncurry_apply.uncurry_fn_apply e.pexp_loc self fn1 ((Nolabel, a) :: args); pexp_loc = e.pexp_loc; pexp_loc_stack = e.pexp_loc_stack; pexp_attributes = e.pexp_attributes @ other_attributes; } | _ -> Ast_helper.Exp.apply ~loc ~attrs:e.pexp_attributes f [ (Nolabel, a) ]))) | Some { op = "##"; loc; args = [ obj; rest ] } -> ( (* - obj##property - obj#(method a b ) we should warn when we discard attributes gpr#1063 foo##(bar##baz) we should rewrite (bar##baz) first before pattern match. currently the pattern match is written in a top down style. Another corner case: f##(g a b [@u]) *) match rest with | { pexp_desc = Pexp_apply ({ pexp_desc = Pexp_ident { txt = Lident name; _ }; _ }, args); pexp_attributes = attrs; _; } -> Mel_ast_invariant.warn_discarded_unused_attributes attrs; { e with pexp_desc = Ast_uncurry_apply.method_apply loc self obj name args; } | { pexp_desc = ( Pexp_ident { txt = Lident name; _ } | Pexp_constant (Pconst_string (name, _, None)) ); pexp_loc; _; } -> (* f##paint *) sane_property_name_check pexp_loc name; { e with pexp_desc = Ast_uncurry_apply.js_property loc (self#expression obj) name; } | _ -> [%expr [%ocaml.error [%e Exp.constant (Pconst_string ("invalid ## syntax", loc, None))]]]) (* we can not use [:=] for precedece cases like {[i @@ x##length := 3 ]} is parsed as {[ (i @@ x##length) := 3]} since we allow user to create Js objects in OCaml, it can be of ref type {[ let u = object (self) val x = ref 3 method setX x = self##x := 32 method getX () = !self##x end ]} *) | Some { op = "#="; loc; args = [ obj; arg ] } -> ( match view_as_app obj [ "##" ] with | Some { args = [ obj; { pexp_desc = ( Pexp_ident { txt = Lident name; _ } | Pexp_constant (Pconst_string (name, _, None)) ); pexp_loc; _; }; ]; _; } -> sane_property_name_check pexp_loc name; Exp.constraint_ ~loc { e with pexp_desc = Ast_uncurry_apply.method_apply loc self obj (name ^ Melange_ffi.External_ffi_types.Literals.setter_suffix) [ (Nolabel, arg) ]; } [%type: unit] | _ -> assert false) | Some { op = "|."; loc; _ } -> Location.raise_errorf ~loc "invalid |. syntax, it can only be used as binary operator" | Some { op = "##"; loc; _ } -> Location.raise_errorf ~loc "Js object ## expect syntax like obj##(paint (a,b)) " | Some { op; _ } -> Location.raise_errorf "invalid %s syntax" op | None -> ( match exclude_with_val e.pexp_attributes Ast_attributes.is_uncurried with | None -> super e | Some pexp_attributes -> { e with pexp_desc = Ast_uncurry_apply.uncurry_fn_apply e.pexp_loc self fn args; pexp_attributes; }))
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>