package melange
Toolchain to produce JS from Reason/OCaml
Install
Dune Dependency
Authors
Maintainers
Sources
melange-2.0.0.tbz
sha256=0e213624b1626428a181fa0fbb262eadffb24431e530ad06dca885c6f0cf1e55
sha512=a7517da8aaa5c9bb8690826af3f8ca6dbbf1bccaa3f76d8c522963f0f9d46dc5e280cc4739879fdb09674f178f5664b1ba42c774b533bc51e90332d8bf6722ae
doc/src/melange_ppx/ast_comb.ml.html
Source file ast_comb.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
(* Copyright (C) 2015-2016 Bloomberg Finance L.P. * * 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 Ppxlib open Ast_helper (* let fun_no_label ?loc ?attrs pat body = Ast_compatible.fun_ ?loc ?attrs pat body *) (* let discard_exp_as_unit loc e = Ast_compatible.apply_simple ~loc (Exp.ident ~loc {txt = Ast_literal.Lid.ignore_id; loc}) [Exp.constraint_ ~loc e (Ast_literal.type_unit ~loc ())] *) let tuple_type_pair ?loc kind arity = let prefix = "a" in if arity = 0 then let ty = Typ.var ?loc (prefix ^ "0") in match kind with | `Run -> (ty, [], ty) | `Make -> let loc = Option.value ~default:Location.none loc in ([%type: unit -> [%t ty]], [], ty) else let number = arity + 1 in let tys = List.init number (fun i -> Typ.var ?loc (prefix ^ string_of_int (number - i - 1))) in match tys with | result :: rest -> ( List.fold_left (fun r arg -> let loc = Option.value ~default:Location.none loc in [%type: [%t arg] -> [%t r]]) result rest, List.rev rest, result ) | [] -> assert false let to_js_type ~loc x = Typ.constr ~loc { txt = Ast_literal.js_obj; loc } [ x ] let to_js_re_type ~loc = Typ.constr ~loc { txt = Ast_literal.js_re_id; loc } [] let to_undefined_type ~loc x = Typ.constr ~loc { txt = Ast_literal.js_undefined; loc } [ x ] let single_non_rec_value name exp = Str.value Nonrecursive [ Vb.mk (Pat.var name) exp ] let single_non_rec_val name ty = Sig.value (Val.mk name ty)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>