package dolmen
A parser library
Install
Dune Dependency
Authors
Maintainers
Sources
dolmen-0.4.1.tar.gz
md5=55a97ff61dd8398e38570272ae7e3964
sha512=83f71037eb568d5449ff2d968cb50a0b105c9712e0bd29497d1f95683698f394860a11d4dee2a2a41163504e395ef068c3974901fca11894d671684fe438fc51
doc/src/dolmen.std/parseLocation.ml.html
Source file parseLocation.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
(* Copyright (c) 2013, Simon Cruanes Copyright (c) 2016, Guillaume Bury All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. *) (** {1 Location in a file} *) module type S = Dolmen_intf.Location.S type t = { file : string; start_line : int; start_column : int; stop_line : int; stop_column : int; } exception Uncaught of t * exn exception Lexing_error of t * string exception Syntax_error of t * string (* Hash and equality *) let eq a b = a = b let hash a = Hashtbl.hash a (* Constructor functions *) let mk file start_line start_column stop_line stop_column = { file; start_line; start_column; stop_line; stop_column; } let mk_pair file (a,b)(c,d) = mk file a b c d let mk_pos start stop = let open Lexing in mk start.pos_fname start.pos_lnum (start.pos_cnum - start.pos_bol) stop.pos_lnum (stop.pos_cnum - stop.pos_bol) (* Combining positions *) let _min_pos (l1,c1) (l2,c2) = if l1 = l2 then l1, min c1 c2 else if l1 < l2 then l1, c1 else l2, c2 let _max_pos (l1,c1) (l2,c2) = if l1 = l2 then l1, max c1 c2 else if l1 < l2 then l2, c2 else l1, c1 let combine p1 p2 = let start_line, start_column = _min_pos (p1.start_line, p1.start_column) (p2.start_line, p2.start_column) in let stop_line, stop_column = _max_pos (p1.stop_line, p1.stop_column) (p2.stop_line, p2.stop_column) in { file=p1.file; start_line; start_column; stop_line; stop_column; } let rec combine_list l = match l with | [] -> raise (Invalid_argument "location.combine_list: empty list") | [p] -> p | p1::((_ ::_) as l') -> let p' = combine_list l' in combine p1 p' let smaller p1 p2 = (p1.start_line > p2.start_line || (p1.start_line = p2.start_line && p1.start_column >= p2.start_column)) && (p1.stop_line < p2.stop_line || (p1.stop_line = p2.stop_line && p1.stop_column <= p2.stop_column)) (* Printing of positions *) let pp buf pos = if pos.start_line = pos.stop_line then Printf.bprintf buf "File '%s', line %d, character %d-%d" pos.file pos.start_line pos.start_column pos.stop_column else Printf.bprintf buf "File '%s', line %d, character %d to line %d, character %d" pos.file pos.start_line pos.start_column pos.stop_line pos.stop_column let to_string pos = let buf = Buffer.create 25 in pp buf pos; Buffer.contents buf let fmt fmt pos = Format.pp_print_string fmt (to_string pos) let fmt_hint fmt pos = if pos.start_line = pos.stop_line then Format.fprintf fmt "%s%s" (String.make (pos.start_column) ' ') (String.make (pos.stop_column - pos.start_column) '^') (* Operations on Lexing.lexbuf *) let set_file buf filename = let open Lexing in buf.lex_curr_p <- {buf.lex_curr_p with pos_fname=filename;}; () let mk_lexbuf i = let s, ch, cl = match i with | `Stdin -> "<stdin>", stdin, (fun () -> ()) | `File s -> let ch = open_in s in s, ch, (fun () -> close_in ch) in let buf = Lexing.from_channel ch in set_file buf s; buf, cl let of_lexbuf lexbuf = let start = Lexing.lexeme_start_p lexbuf in let end_ = Lexing.lexeme_end_p lexbuf in let s_l = start.Lexing.pos_lnum in let s_c = start.Lexing.pos_cnum - start.Lexing.pos_bol in let e_l = end_.Lexing.pos_lnum in let e_c = end_.Lexing.pos_cnum - end_.Lexing.pos_bol in let file = start.Lexing.pos_fname in mk file s_l s_c e_l e_c
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>