package js_of_ocaml-compiler
Compiler from OCaml bytecode to JavaScript
Install
Dune Dependency
Authors
Maintainers
Sources
js_of_ocaml-6.0.1.tbz
sha256=813dbee2b62e1541049ea23a20e405cf244e27ebfa9859785cfa53e286d2c614
sha512=194ae5d1122171fa8253b6a41438a2fc330caf4ab6dd008fcce1253fd51fbe4b1149813da6075c5deb52ea136143def57c83c3f4e32421803d7699648fdc563b
doc/src/js_of_ocaml-compiler/pretty_print.ml.html
Source file pretty_print.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
(* Js_of_ocaml compiler * http://www.ocsigen.org/js_of_ocaml/ * Copyright (C) 2010 Jérôme Vouillon * Laboratoire PPS - CNRS Université Paris Diderot * * 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, with linking exception; * either version 2.1 of the License, or (at your option) any 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! Stdlib type pos = { mutable p_line : int ; mutable p_col : int } type elt = | Text of string | Break of string * int | Start_group of int | End_group | Set_pos of pos type t = { mutable indent : int ; mutable box_indent : int ; mutable prev_indents : (int * int) list ; mutable limit : int ; mutable cur : int ; mutable l : elt list ; mutable n : int ; mutable w : int ; mutable compact : bool ; mutable needed_space : (char -> char -> bool) option ; mutable adjust_indentation : (int -> int) option ; mutable pending_space : string option ; mutable last_char : char option ; mutable line : int ; mutable col : int ; mutable total : int ; output : string -> int -> int -> unit } let spaces = String.make 80 ' ' let output st (s : string) l = (try let last = String.rindex_from s (l - 1) '\n' + 1 in let line = ref 0 in for i = 0 to l - 1 do if Char.equal s.[i] '\n' then incr line done; st.line <- st.line + !line; st.col <- l - last with Not_found -> st.col <- l + st.col); st.total <- st.total + String.length s; st.output s 0 l let rec output_spaces st n = let n = match st.adjust_indentation with | Some f -> f n | None -> n in output st spaces (min n 80); if n > 80 then output_spaces st (n - 80) let output_newline st = output st "\n" 1 let rec flat_render st l = match l with | Text s :: r | Break (s, _) :: r -> output st s (String.length s); flat_render st r | Set_pos p :: r -> p.p_line <- st.line; p.p_col <- st.col; flat_render st r | (Start_group _ | End_group) :: r -> flat_render st r | [] -> () let rec push st e = if st.n = 0 then ( (* Vertical rendering *) match e with | Text s -> output st s (String.length s); st.cur <- st.cur + String.length s | Set_pos p -> p.p_line <- st.line; p.p_col <- st.col | Break (_, offs) -> output_newline st; let indent = st.box_indent + offs in st.indent <- indent; output_spaces st indent; st.limit <- max (indent + 60) 78; st.cur <- st.indent | Start_group n -> st.n <- 1; st.w <- st.limit - st.cur; st.prev_indents <- (st.box_indent, st.indent) :: st.prev_indents; st.indent <- st.indent + n; st.box_indent <- st.indent | End_group -> st.box_indent <- fst (List.hd st.prev_indents); st.indent <- snd (List.hd st.prev_indents); st.prev_indents <- List.tl st.prev_indents) else ( (* Fits? *) st.l <- e :: st.l; match e with | Text s | Break (s, _) -> let w = st.w - String.length s in st.w <- w; if w < 0 then ( let l = List.rev st.l in st.l <- []; st.n <- 0; List.iter ~f:(fun e -> push st e) l) | Set_pos _ -> () | Start_group _ -> st.n <- st.n + 1 | End_group -> st.n <- st.n - 1; if st.n = 0 then ( flat_render st (List.rev st.l); st.box_indent <- fst (List.hd st.prev_indents); st.indent <- snd (List.hd st.prev_indents); st.prev_indents <- List.tl st.prev_indents; st.cur <- st.cur + st.w; st.l <- [])) let check st = assert (List.is_empty st.prev_indents) (****) let string st (s : string) = if st.compact then ( let len = String.length s in if len <> 0 then ( (match st.pending_space with | None -> () | Some sp -> ( st.pending_space <- None; match st.last_char, st.needed_space with | Some last, Some f -> if f last s.[0] then output st sp 1 | _, None -> output st sp 1 | _ -> ())); output st s len; st.last_char <- Some s.[len - 1])) else push st (Text s) let genbreak st s n = if not st.compact then push st (Break (s, n)) let break_token = Break ("", 0) let break st = if not st.compact then push st break_token let break1 st = if not st.compact then push st (Break ("", 1)) let non_breaking_space_token = Text " " let non_breaking_space st = if st.compact then st.pending_space <- Some " " else push st non_breaking_space_token let space ?(indent = 0) st = if st.compact then st.pending_space <- Some "\n" else push st (Break (" ", indent)) let start_group st n = if not st.compact then push st (Start_group n) let end_group st = if not st.compact then push st End_group (* let render l = let st = { indent = 0; box_indent = 0; prev_indents = []; limit = 78; cur = 0; l = []; n = 0; w = 0; output = fun s i l -> output stdout s i l } in push st (Start_group 0); List.iter (fun e -> push st e) l; push st End_group; output_newline st let rec tree n = if n = 0 then [Text "Leaf"] else [Start_group 10; Text "Node.... ("] @ tree (n - 1) @ [Text ","; Break (" ", 0)] @ tree (n - 1) @ [Text ")"; End_group] let _ = for i = 1 to 10 do render (tree i) done *) let total t = t.total let pos t = if t.compact then { p_line = t.line; p_col = t.col } else let p = { p_line = -1; p_col = -1 } in push t (Set_pos p); p let newline st = output_newline st; st.indent <- 0; st.box_indent <- 0; st.prev_indents <- []; st.cur <- 0; st.l <- []; st.n <- 0; st.w <- 0 let to_out_channel ch = { indent = 0 ; box_indent = 0 ; prev_indents = [] ; limit = 78 ; cur = 0 ; l = [] ; n = 0 ; w = 0 ; col = 0 ; line = 0 ; total = 0 ; compact = false ; pending_space = None ; last_char = None ; needed_space = None ; adjust_indentation = None ; output = output_substring ch } let to_buffer b = { indent = 0 ; box_indent = 0 ; prev_indents = [] ; limit = 78 ; cur = 0 ; l = [] ; n = 0 ; w = 0 ; col = 0 ; line = 0 ; total = 0 ; compact = false ; pending_space = None ; last_char = None ; needed_space = None ; adjust_indentation = None ; output = (fun s i l -> Buffer.add_substring b s i l) } let set_compact st v = st.compact <- v let compact st = st.compact let set_needed_space_function st f = st.needed_space <- Some f let set_adjust_indentation_function st f = st.adjust_indentation <- Some f
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>