package melange
Toolchain to produce JS from Reason/OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
melange-1.0.0.tbz
sha256=01ff3a2711b3812889313288f9e0c8bfe2e17464b6b85282c5113cfc3b740968
sha512=db9ac4554d0c9a8deabbdcd2ae05653964184916982c746ca794df6e2061444adaa6a0367bc1840825a007be3941643abd824aaff737a431b0e5347f7c558378
doc/src/melange.ppxlib/ast_open_cxt.ml.html
Source file ast_open_cxt.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
(* Copyright (C) 2019 - Present 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. *) type loc = Location.t type whole = | Let_open of (Asttypes.override_flag * Longident.t Asttypes.loc * loc * Parsetree.attributes) type t = whole list type exp = Parsetree.expression type destruct_output = exp list (** destruct such pattern {[ A.B.let open C in (a,b)]} *) let rec destruct_open_tuple (e : Parsetree.expression) (acc : t) : (t * destruct_output * _) option = match e.pexp_desc with | Pexp_open ( { popen_override = flag; popen_expr = { pmod_desc = Pmod_ident lid; _ } }, cont ) -> destruct_open_tuple cont (Let_open (flag, lid, e.pexp_loc, e.pexp_attributes) :: acc) | Pexp_tuple es -> Some (acc, es, e.pexp_attributes) | _ -> None let rec destruct (e : Parsetree.expression) (acc : t) = match e.pexp_desc with | Pexp_open ( { popen_override = flag; popen_expr = { pmod_desc = Pmod_ident lid; _ } }, cont ) -> destruct cont (Let_open (flag, lid, e.pexp_loc, e.pexp_attributes) :: acc) | _ -> (e, acc) (* ?loc:Warnings.loc -> *) (* ?attrs:Ast_helper.attrs -> *) (* ?docs:Docstrings.docs -> *) (* ?override:Asttypes.override_flag -> 'a -> 'a Parsetree.open_infos *) let restore_exp (xs : Parsetree.expression) (qualifiers : t) : Parsetree.expression = Ext_list.fold_left qualifiers xs (fun x hole -> match hole with | Let_open (flag, lid, loc, attrs) -> ({ pexp_desc = Pexp_open (Ast_helper.Opn.mk ~override:flag (Ast_helper.Mod.ident lid), x); pexp_attributes = attrs; pexp_loc = loc; pexp_loc_stack = [ loc ]; } : Parsetree.expression))
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>