package caqti
Unified interface to relational database libraries
Install
Dune Dependency
Authors
Maintainers
Sources
caqti-v2.2.4.tbz
sha256=b8ea432820154ec095132c4f7b244b06cd8553e0b2035185b844d9c4f30af8bb
sha512=b7e3ad8e6a9b587db2d517e15cd42df2945148f9223b2fa6f4bc2bcdd2709d53549cca4b65e54511d22466e4c9aa7f0b9c17305a07505519d8bf81d95de629b8
doc/src/caqti.template/row_type.ml.html
Source file row_type.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 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382(* Copyright (C) 2017--2025 Petter A. Urkedal <paurkedal@gmail.com> * * This library 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, with the LGPL-3.0 Linking Exception. * * This library 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 * and the LGPL-3.0 Linking Exception along with this library. If not, see * <http://www.gnu.org/licenses/> and <https://spdx.org>, respectively. *) open Shims exception Reject of string module Private = struct type _ record_serial = .. type 'a product_id = { serial: 'a record_serial; is_serial: 'b. 'b record_serial -> ('a, 'b) Type.eq option; } let make_id (type a) () : a product_id = let module M = struct type _ record_serial += Serial : a record_serial end in let is_serial : type b. b record_serial -> (a, b) Type.eq option = function | M.Serial -> Some Equal | _ -> None in {serial = M.Serial; is_serial} let unify_id {is_serial; _} {serial; _} = is_serial serial type _ t = | Field : 'a Field_type.t -> 'a t | Option : 'a t -> 'a option t | Product : 'a product_id * 'i * ('a, 'i) product -> 'a t | Annot : [`Redacted] * 'a t -> 'a t and (_, _) product = | Proj_end : ('a, 'a) product | Proj : 'b t * ('a -> 'b) * ('a, 'i) product -> ('a, 'b -> 'i) product end open Private type 'a t = 'a Private.t type ('a, 'b) product = ('a, 'b) Private.product type any = Any : 'a t -> any let rec unify : type a b. a t -> b t -> (a, b) Type.eq option = fun t1 t2 -> (match t1, t2 with | Field ft1, Field ft2 -> Field_type.unify ft1 ft2 | Field _, _ | _, Field _ -> None | Option t1, Option t2 -> (match unify t1 t2 with None -> None | Some Equal -> Some Equal) | Option _, _ | _, Option _ -> None | Product (id1, _, _), Product (id2, _, _) -> unify_id id1 id2 | Product _, _ | _, Product _ -> None | Annot (`Redacted, t1), Annot (`Redacted, t2) -> unify t1 t2) let equal_option f x y = (match x, y with | None, None -> true | Some x, Some y -> f x y | None, Some _ | Some _, None -> false) let rec equal_value : type a. a t -> a -> a -> bool = (function | Field ft -> Field_type.equal_value ft | Option t -> equal_option (equal_value t) | Product (_, _, prod) -> equal_value_prod prod | Annot (_, t) -> equal_value t) and equal_value_prod : type a i. (a, i) product -> a -> a -> bool = (function | Proj_end -> fun _ _ -> true | Proj (t, p, prod) -> let eq_first = equal_value t in let eq_rest = equal_value_prod prod in fun x y -> eq_first (p x) (p y) && eq_rest x y) let rec length : type a. a t -> int = function | Field _ -> 1 | Option t -> length t | Product (_, _, prod) -> let rec loop : type a i. (a, i) product -> _ -> _ = function | Proj_end -> Fun.id | Proj (t, _, prod) -> fun n -> loop prod (n + length t) in loop prod 0 | Annot (_, t) -> length t let rec pp_at : type a. int -> Format.formatter -> a t -> unit = fun prec ppf -> function | Field ft -> Format.pp_print_string ppf (Field_type.to_string ft) | Option t -> pp_at 1 ppf t; Format.pp_print_string ppf " option" | Product (_, _, Proj_end) -> Format.pp_print_string ppf "unit" | Product (_, _, Proj (t0, _, prod)) -> if prec > 0 then Format.pp_print_char ppf '('; let rec loop : type a i. (a, i) product -> _ = function | Proj_end -> () | Proj (t, _, prod) -> Format.pp_print_string ppf " × "; pp_at 1 ppf t; loop prod in pp_at 1 ppf t0; loop prod; if prec > 0 then Format.pp_print_char ppf ')' | Annot (`Redacted, t) -> pp_at 1 ppf t; Format.pp_print_string ppf " redacted" let pp ppf = pp_at 0 ppf let pp_any ppf (Any t) = pp_at 0 ppf t let rec pp_value : type a. _ -> a t * a -> unit = fun ppf -> function | Field ft, fv -> Field_type.pp_value ppf (ft, fv) | Option _, None -> Format.pp_print_string ppf "None" | Option t, Some x -> Format.pp_print_string ppf "Some "; pp_value ppf (t, x) | Product (_, _, prod), x -> let rec loop : type i. int -> (a, i) product -> _ = fun i -> function | Proj_end -> () | Proj (t, p, prod) -> if i > 0 then Format.pp_print_string ppf ", "; pp_value ppf (t, p x); loop (i + 1) prod in loop 0 prod | Annot (`Redacted, _), _ -> Format.pp_print_string ppf "#redacted#" let show t = let buf = Buffer.create 64 in let ppf = Format.formatter_of_buffer buf in pp ppf t; Format.pp_print_flush ppf (); Buffer.contents buf let field ft = Field ft module type STD = sig val bool : bool t val int : int t val int16 : int t val int32 : int32 t val int64 : int64 t val float : float t val string : string t val octets : string t val pdate : Ptime.t t val ptime : Ptime.t t val ptime_span : Ptime.span t val option : 'a t -> 'a option t val redacted : 'a t -> 'a t val unit : unit t val t2 : 'a1 t -> 'a2 t -> ('a1 * 'a2) t val t3 : 'a1 t -> 'a2 t -> 'a3 t -> ('a1 * 'a2 * 'a3) t val t4 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> ('a1 * 'a2 * 'a3 * 'a4) t val t5 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> 'a5 t -> ('a1 * 'a2 * 'a3 * 'a4 * 'a5) t val t6 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> 'a5 t -> 'a6 t -> ('a1 * 'a2 * 'a3 * 'a4 * 'a5 * 'a6) t val t7 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> 'a5 t -> 'a6 t -> 'a7 t -> ('a1 * 'a2 * 'a3 * 'a4 * 'a5 * 'a6 * 'a7) t val t8 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> 'a5 t -> 'a6 t -> 'a7 t -> 'a8 t -> ('a1 * 'a2 * 'a3 * 'a4 * 'a5 * 'a6 * 'a7 * 'a8) t val t9 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> 'a5 t -> 'a6 t -> 'a7 t -> 'a8 t -> 'a9 t -> ('a1 * 'a2 * 'a3 * 'a4 * 'a5 * 'a6 * 'a7 * 'a8 * 'a9) t val t10 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> 'a5 t -> 'a6 t -> 'a7 t -> 'a8 t -> 'a9 t -> 'a10 t -> ('a1 * 'a2 * 'a3 * 'a4 * 'a5 * 'a6 * 'a7 * 'a8 * 'a9 * 'a10) t val t11 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> 'a5 t -> 'a6 t -> 'a7 t -> 'a8 t -> 'a9 t -> 'a10 t -> 'a11 t -> ('a1 * 'a2 * 'a3 * 'a4 * 'a5 * 'a6 * 'a7 * 'a8 * 'a9 * 'a10 * 'a11) t val t12 : 'a1 t -> 'a2 t -> 'a3 t -> 'a4 t -> 'a5 t -> 'a6 t -> 'a7 t -> 'a8 t -> 'a9 t -> 'a10 t -> 'a11 t -> 'a12 t -> ('a1 * 'a2 * 'a3 * 'a4 * 'a5 * 'a6 * 'a7 * 'a8 * 'a9 * 'a10 * 'a11 * 'a12) t end let option t = Option t let product intro prod = Product (make_id (), intro, prod) let proj t p prod = Proj (t, p, prod) let proj_end = Proj_end let enum ~encode ~decode name = let decode' y = (match decode y with | Ok x -> x | Error msg -> raise (Reject msg)) in product decode' @@ proj (Field (Enum name)) encode @@ proj_end let unit = product () proj_end let t2 t1 t2 = let intro x1 x2 = (x1, x2) in product intro @@ proj t1 fst @@ proj t2 snd @@ proj_end let t3 t1 t2 t3 = let intro x1 x2 x3 = (x1, x2, x3) in product intro @@ proj t1 (fun (x, _, _) -> x) @@ proj t2 (fun (_, x, _) -> x) @@ proj t3 (fun (_, _, x) -> x) @@ proj_end let t4 t1 t2 t3 t4 = let intro x1 x2 x3 x4 = (x1, x2, x3, x4) in product intro @@ proj t1 (fun (x, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _) -> x) @@ proj t3 (fun (_, _, x, _) -> x) @@ proj t4 (fun (_, _, _, x) -> x) @@ proj_end let t5 t1 t2 t3 t4 t5 = let intro x1 x2 x3 x4 x5 = (x1, x2, x3, x4, x5) in product intro @@ proj t1 (fun (x, _, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _, _) -> x) @@ proj t3 (fun (_, _, x, _, _) -> x) @@ proj t4 (fun (_, _, _, x, _) -> x) @@ proj t5 (fun (_, _, _, _, x) -> x) @@ proj_end let t6 t1 t2 t3 t4 t5 t6 = let intro x1 x2 x3 x4 x5 x6 = (x1, x2, x3, x4, x5, x6) in product intro @@ proj t1 (fun (x, _, _, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _, _, _) -> x) @@ proj t3 (fun (_, _, x, _, _, _) -> x) @@ proj t4 (fun (_, _, _, x, _, _) -> x) @@ proj t5 (fun (_, _, _, _, x, _) -> x) @@ proj t6 (fun (_, _, _, _, _, x) -> x) @@ proj_end let t7 t1 t2 t3 t4 t5 t6 t7 = let intro x1 x2 x3 x4 x5 x6 x7 = (x1, x2, x3, x4, x5, x6, x7) in product intro @@ proj t1 (fun (x, _, _, _, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _, _, _, _) -> x) @@ proj t3 (fun (_, _, x, _, _, _, _) -> x) @@ proj t4 (fun (_, _, _, x, _, _, _) -> x) @@ proj t5 (fun (_, _, _, _, x, _, _) -> x) @@ proj t6 (fun (_, _, _, _, _, x, _) -> x) @@ proj t7 (fun (_, _, _, _, _, _, x) -> x) @@ proj_end let t8 t1 t2 t3 t4 t5 t6 t7 t8 = let intro x1 x2 x3 x4 x5 x6 x7 x8 = (x1, x2, x3, x4, x5, x6, x7, x8) in product intro @@ proj t1 (fun (x, _, _, _, _, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _, _, _, _, _) -> x) @@ proj t3 (fun (_, _, x, _, _, _, _, _) -> x) @@ proj t4 (fun (_, _, _, x, _, _, _, _) -> x) @@ proj t5 (fun (_, _, _, _, x, _, _, _) -> x) @@ proj t6 (fun (_, _, _, _, _, x, _, _) -> x) @@ proj t7 (fun (_, _, _, _, _, _, x, _) -> x) @@ proj t8 (fun (_, _, _, _, _, _, _, x) -> x) @@ proj_end let t9 t1 t2 t3 t4 t5 t6 t7 t8 t9 = let intro x1 x2 x3 x4 x5 x6 x7 x8 x9 = (x1, x2, x3, x4, x5, x6, x7, x8, x9) in product intro @@ proj t1 (fun (x, _, _, _, _, _, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _, _, _, _, _, _) -> x) @@ proj t3 (fun (_, _, x, _, _, _, _, _, _) -> x) @@ proj t4 (fun (_, _, _, x, _, _, _, _, _) -> x) @@ proj t5 (fun (_, _, _, _, x, _, _, _, _) -> x) @@ proj t6 (fun (_, _, _, _, _, x, _, _, _) -> x) @@ proj t7 (fun (_, _, _, _, _, _, x, _, _) -> x) @@ proj t8 (fun (_, _, _, _, _, _, _, x, _) -> x) @@ proj t9 (fun (_, _, _, _, _, _, _, _, x) -> x) @@ proj_end let t10 t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 = let intro x1 x2 x3 x4 x5 x6 x7 x8 x9 x10 = (x1, x2, x3, x4, x5, x6, x7, x8, x9, x10) in product intro @@ proj t1 (fun (x, _, _, _, _, _, _, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _, _, _, _, _, _, _) -> x) @@ proj t3 (fun (_, _, x, _, _, _, _, _, _, _) -> x) @@ proj t4 (fun (_, _, _, x, _, _, _, _, _, _) -> x) @@ proj t5 (fun (_, _, _, _, x, _, _, _, _, _) -> x) @@ proj t6 (fun (_, _, _, _, _, x, _, _, _, _) -> x) @@ proj t7 (fun (_, _, _, _, _, _, x, _, _, _) -> x) @@ proj t8 (fun (_, _, _, _, _, _, _, x, _, _) -> x) @@ proj t9 (fun (_, _, _, _, _, _, _, _, x, _) -> x) @@ proj t10 (fun (_, _, _, _, _, _, _, _, _, x) -> x) @@ proj_end let t11 t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 t11 = let intro x1 x2 x3 x4 x5 x6 x7 x8 x9 x10 x11 = (x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11) in product intro @@ proj t1 (fun (x, _, _, _, _, _, _, _, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _, _, _, _, _, _, _, _) -> x) @@ proj t3 (fun (_, _, x, _, _, _, _, _, _, _, _) -> x) @@ proj t4 (fun (_, _, _, x, _, _, _, _, _, _, _) -> x) @@ proj t5 (fun (_, _, _, _, x, _, _, _, _, _, _) -> x) @@ proj t6 (fun (_, _, _, _, _, x, _, _, _, _, _) -> x) @@ proj t7 (fun (_, _, _, _, _, _, x, _, _, _, _) -> x) @@ proj t8 (fun (_, _, _, _, _, _, _, x, _, _, _) -> x) @@ proj t9 (fun (_, _, _, _, _, _, _, _, x, _, _) -> x) @@ proj t10 (fun (_, _, _, _, _, _, _, _, _, x, _) -> x) @@ proj t11 (fun (_, _, _, _, _, _, _, _, _, _, x) -> x) @@ proj_end let t12 t1 t2 t3 t4 t5 t6 t7 t8 t9 t10 t11 t12 = let intro x1 x2 x3 x4 x5 x6 x7 x8 x9 x10 x11 x12 = (x1, x2, x3, x4, x5, x6, x7, x8, x9, x10, x11, x12) in product intro @@ proj t1 (fun (x, _, _, _, _, _, _, _, _, _, _, _) -> x) @@ proj t2 (fun (_, x, _, _, _, _, _, _, _, _, _, _) -> x) @@ proj t3 (fun (_, _, x, _, _, _, _, _, _, _, _, _) -> x) @@ proj t4 (fun (_, _, _, x, _, _, _, _, _, _, _, _) -> x) @@ proj t5 (fun (_, _, _, _, x, _, _, _, _, _, _, _) -> x) @@ proj t6 (fun (_, _, _, _, _, x, _, _, _, _, _, _) -> x) @@ proj t7 (fun (_, _, _, _, _, _, x, _, _, _, _, _) -> x) @@ proj t8 (fun (_, _, _, _, _, _, _, x, _, _, _, _) -> x) @@ proj t9 (fun (_, _, _, _, _, _, _, _, x, _, _, _) -> x) @@ proj t10 (fun (_, _, _, _, _, _, _, _, _, x, _, _) -> x) @@ proj t11 (fun (_, _, _, _, _, _, _, _, _, _, x, _) -> x) @@ proj t12 (fun (_, _, _, _, _, _, _, _, _, _, _, x) -> x) @@ proj_end let custom ~encode ~decode rep = let encode' x = (match encode x with | Ok y -> y | Error msg -> raise (Reject msg)) in let decode' y = (match decode y with | Ok x -> x | Error msg -> raise (Reject msg)) in product decode' @@ proj rep encode' @@ proj_end let redacted t = Annot (`Redacted, t) let bool = Field Bool let int = Field Int let int16 = Field Int16 let int32 = Field Int32 let int64 = Field Int64 let float = Field Float let string = Field String let octets = Field Octets let pdate = Field Pdate let ptime = Field Ptime let ptime_span = Field Ptime_span