package irmin
Irmin, a distributed database that follows the same design principles as Git
Install
Dune Dependency
Authors
Maintainers
Sources
irmin-2.2.0.tbz
sha256=a44e018495336e0f632433fcae7b4e84699938a7110212da9e3818b35048fc3f
sha512=8dd9e9f09877a5541ee1be3387e041f63e6b522f9efac388d72199f965b0692f2502e93c1ddc2a5f959289fa2f75f06849582cffbcc201de19e9bd50413f6115
doc/src/irmin.type/type_pp.ml.html
Source file type_pp.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
(* * Copyright (c) 2016-2017 Thomas Gazagnaire <thomas@gazagnaire.org> * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. *) open Type_core let t t = let rec aux : type a. a t -> a pp = fun t ppf x -> match t with | Self s -> aux s.self_fix ppf x | Custom c -> c.pp ppf x | Map m -> map m ppf x | Prim p -> prim p ppf x | _ -> Type_json.pp t ppf x and map : type a b. (a, b) map -> b pp = fun l ppf x -> aux l.x ppf (l.g x) and prim : type a. a prim -> a pp = fun t ppf x -> match t with | Unit -> () | Bool -> Fmt.bool ppf x | Char -> Fmt.char ppf x | Int -> Fmt.int ppf x | Int32 -> Fmt.int32 ppf x | Int64 -> Fmt.int64 ppf x | Float -> Fmt.float ppf x | String _ -> Fmt.string ppf x | Bytes _ -> Fmt.string ppf (Bytes.unsafe_to_string x) in aux t (* Fresh type variables in sequence: ['a; 'b; ...; 'z; 'aa; 'ab; ...] *) let tvar_generator () = let count = ref 0 in let ident_of_count = let rec inner acc i = match i with | -1 -> acc | _ -> let c = String.make 1 (Char.chr ((i mod 26) + 97)) in inner (c ^ acc) ((i / 26) - 1) in inner "" in fun () -> let ident = ident_of_count !count in incr count; "'" ^ ident let ty : type a. a t Fmt.t = fun ppf typ -> let get_tvar = tvar_generator () in let rec ty : type a. a t Fmt.t = fun ppf -> function | Self { self_unroll; _ } -> ( match self_unroll (Var "") with (* If it's a recursive variant or record, don't print the [as 'a] alias since the type is already named. *) | Variant { vname; _ } -> ty ppf (self_unroll (Var vname)) | Record { rname; _ } -> ty ppf (self_unroll (Var rname)) | _ -> let var = Var (get_tvar ()) in Fmt.pf ppf "@[(%a as %a)@]" ty (self_unroll var) ty var ) | Custom c -> Fmt.pf ppf "@[Custom (%a)@]" custom c | Map m -> Fmt.pf ppf "@[Map (%a)@]" ty m.x | Prim p -> Fmt.pf ppf "@[%a@]" prim p | List l -> Fmt.pf ppf "@[%a list%a@]" ty l.v len l.len | Array a -> Fmt.pf ppf "@[%a array%a@]" ty a.v len a.len | Tuple (Pair (a, b)) -> Fmt.pf ppf "@[(%a * %a)@]" ty a ty b | Tuple (Triple (a, b, c)) -> Fmt.pf ppf "@[(%a * %a * %a)@]" ty a ty b ty c | Option t -> Fmt.pf ppf "@[%a option@]" ty t | Record { rname; rfields = Fields (fields, _); _ } -> Fmt.pf ppf "(@[<hv>%a>@] as %s)" pp_fields fields rname | Variant { vname; vcases; _ } -> ( match Array.length vcases with | 0 -> Fmt.pf ppf "({} as %s)" vname (* empty type *) | _ -> Fmt.pf ppf "(@[%a]@] as %s)" pp_cases vcases vname ) | Var v -> Fmt.string ppf v and pp_fields : type r b. (r, b) fields Fmt.t = fun ppf fields -> let rec inner : type b. first:bool -> (r, b) fields -> unit = fun ~first -> function | F0 -> () | F1 ({ fname; ftype; _ }, fs) -> let trailing_space = match fs with F0 -> 1 | F1 _ -> 0 in Format.pp_print_char ppf (if first then '<' else ';'); Format.fprintf ppf " %s : %a" fname ty ftype; Format.pp_print_break ppf trailing_space 0; (inner [@tailrec]) ~first:false fs in inner ~first:true fields and pp_case : type v. last:bool -> v a_case Fmt.t = fun ~last ppf case -> let pp_cname ppf name = Format.pp_print_string ppf (String.capitalize_ascii name) in let () = match case with | C0 { cname0; _ } -> Format.fprintf ppf " %a" pp_cname cname0 | C1 { cname1; ctype1; _ } -> Format.fprintf ppf " %a of %a" pp_cname cname1 ty ctype1 in Format.pp_print_break ppf 1 0; if not last then Format.pp_print_char ppf '|' and pp_cases : type v. v a_case array Fmt.t = fun ppf cases -> let last_i = Array.length cases - 1 in Format.pp_open_hvbox ppf 0; Format.pp_print_string ppf "["; cases |> Array.iteri (fun i -> pp_case ~last:(i = last_i) ppf); Format.pp_close_box ppf () and custom : type a. a custom Fmt.t = fun ppf c -> match c.cwit with `Type t -> ty ppf t | `Witness _ -> Fmt.string ppf "-" and prim : type a. a prim Fmt.t = fun ppf -> function | Unit -> Fmt.string ppf "unit" | Bool -> Fmt.string ppf "bool" | Char -> Fmt.string ppf "char" | Int -> Fmt.string ppf "int" | Int32 -> Fmt.string ppf "int32" | Int64 -> Fmt.string ppf "int64" | Float -> Fmt.string ppf "float" | String n -> Fmt.pf ppf "string%a" len n | Bytes n -> Fmt.pf ppf "bytes%a" len n and len : len Fmt.t = fun ppf -> function | `Int8 -> Fmt.string ppf ":8" | `Int64 -> Fmt.string ppf ":64" | `Int16 -> Fmt.string ppf ":16" | `Fixed n -> Fmt.pf ppf ":<%d>" n | `Int -> () | `Int32 -> Fmt.pf ppf ":32" in ty ppf typ let to_string ty = Fmt.to_to_string (t ty) let of_string t = let map_result f = function Ok x -> Ok (f x) | Error _ as e -> e in let v f x = try Ok (f x) with Invalid_argument e -> Error (`Msg e) in let rec aux : type a a. a t -> a of_string = fun t x -> match t with | Self s -> aux s.self_fix x | Custom c -> c.of_string x | Map m -> aux m.x x |> map_result m.f | Prim p -> prim p x | _ -> Type_json.of_string t x and prim : type a. a prim -> a of_string = fun t x -> match t with | Unit -> Ok () | Bool -> v bool_of_string x | Char -> v (fun x -> x.[1]) x | Int -> v int_of_string x | Int32 -> v Int32.of_string x | Int64 -> v Int64.of_string x | Float -> v float_of_string x | String _ -> Ok x | Bytes _ -> Ok (Bytes.unsafe_of_string x) in aux t
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>