package melange
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Toolchain to produce JS from Reason/OCaml
Install
dune-project
Dependency
Authors
Maintainers
Sources
melange-6.0.1-414.tbz
sha256=c1cce011864740dc43ee0f4e8130f70725f5e7042942cce653be5b6a8b439fb5
sha512=04fc82d97d5b9632c4ee041414d9fe104556a8c329e7444ffd71017baa00612da103fda91c309fc29a16e143c29d8748e1b1035a74681b61ff65fcfdf7f4e59c
doc/src/melange_ppx/ast_uncurry_gen.ml.html
Source file ast_uncurry_gen.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(* Copyright (C) 2020- 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 process_args ~loc self args ~init = List.fold_left ~init args ~f:(fun acc param -> match param with | { pparam_desc = Pparam_newtype _; _ } -> acc | { pparam_desc = Pparam_val (arg_label, _, arg); _ } -> Error.optional_err ~loc arg_label; (arg_label, self#pattern arg) :: acc) let rec aux ~loc self acc (body : expression) = match Ast_attributes.process_attributes_rev body.pexp_attributes with | Nothing, _ -> ( match body.pexp_desc with | Pexp_function (args, _, Pfunction_body body) -> aux ~loc self (process_args ~loc self args ~init:acc) body | _ -> (self#expression body, acc)) | _, _ -> (self#expression body, acc) (* Handling `fun [@this]` used in `object [@u] end` *) let to_method_callback = let first_arg args = match List.find ~f:(function | { pparam_desc = Pparam_val _; _ } -> true | { pparam_desc = Pparam_newtype _; _ } -> false) args with | { pparam_desc = Pparam_val (_, _, pat); _ } -> pat | { pparam_desc = Pparam_newtype _; _ } | (exception Not_found) -> assert false in let rec is_single_variable_pattern_conservative p = match p.ppat_desc with | Ppat_any | Ppat_var _ -> true | Ppat_alias (p, _) | Ppat_constraint (p, _) -> is_single_variable_pattern_conservative p | _ -> false in fun ~loc (self : Ast_traverse.map) args body -> let first_arg = self#pattern (first_arg args) in if not (is_single_variable_pattern_conservative first_arg) then Error.err ~loc:first_arg.ppat_loc Mel_this_simple_pattern; let body, rev_extra_args = let result, rev_extra_args = let rev_args = process_args ~loc self args ~init:[] in aux ~loc self rev_args body in let body = Ast_builder.Default.pexp_function ~loc (List.rev_map ~f:(fun (label, p) -> { pparam_desc = Pparam_val (label, None, p); pparam_loc = loc }) rev_extra_args) None (Pfunction_body result) in (body, rev_extra_args) in let arity_s = string_of_int (List.length rev_extra_args) in Pexp_apply ( Exp.ident ~loc { loc; txt = Ast_literal.unsafe_to_method }, [ ( Nolabel, Exp.constraint_ ~loc (Exp.record ~loc [ ({ loc; txt = Ast_literal.hidden_field arity_s }, body) ] None) (Typ.constr ~loc { loc; txt = Ldot ( Ast_literal.js_meth_callback, Format.sprintf "arity%s" arity_s ); } [ Typ.any ~loc () ]) ); ] ) let to_uncurry_fn ~loc (self : Ast_traverse.map) args body : expression_desc = let result, rev_extra_args = let rev_args = process_args ~loc self args ~init:[] in aux ~loc self rev_args body in let arity = match rev_extra_args with | [ (_, { ppat_desc = Ppat_construct ({ txt = Lident "()"; _ }, None); _ }); ] -> 0 | _ -> List.length rev_extra_args in Error.err_large_arity ~loc arity; let body = Ast_builder.Default.pexp_function ~loc (List.rev_map ~f:(fun (label, p) -> { pparam_desc = Pparam_val (label, None, p); pparam_loc = loc }) rev_extra_args) None (Pfunction_body result) in Pexp_record ( [ ( { txt = Ldot (Ast_literal.js_fn, "I" ^ string_of_int arity); loc }, body ); ], None )
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>