package yocaml
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
Core engine of the YOCaml Static Site Generator
Install
dune-project
Dependency
Authors
Maintainers
Sources
yocaml-2.0.0.tbz
sha256=fddf61500e828ac88d86ba982084cc817299302082a6e797b36787ff18235ec2
sha512=8b71a8cecd3e101df55eef0bba7a24d4dde9d66b5ecedd9f6d55834fcdc8d33fd875092ca73a398e1715664caee06cdc1bdb1b4da85bff0a687faac5c0445023
doc/src/yocaml/data.ml.html
Source file data.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(* YOCaml a static blog generator. Copyright (C) 2024 The Funkyworkers and The YOCaml's developers This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 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 General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see <https://www.gnu.org/licenses/>. *) type t = | Null | Bool of bool | Int of int | Float of float | String of string | List of t list | Record of (string * t) list type ezjsonm = [ `Null | `Bool of bool | `Float of float | `String of string | `A of ezjsonm list | `O of (string * ezjsonm) list ] let null = Null let bool b = Bool b let int i = Int i let float f = Float f let string s = String s let list v = List v let list_of f l = list @@ List.map f l let record fields = Record fields let option some = Option.fold ~none:null ~some let sum f value = let k, v = f value in record [ ("constr", string k); ("value", v) ] let pair fst snd (a, b) = record [ ("fst", fst a); ("snd", snd b) ] let triple f g h (a, b, c) = pair f (pair g h) (a, (b, c)) let quad f g h i (w, x, y, z) = pair f (triple g h i) (w, (x, y, z)) let either left right = sum (function | Either.Left x -> ("left", left x) | Either.Right x -> ("right", right x)) let rec equal a b = match (a, b) with | Null, Null -> true | Bool a, Bool b -> Bool.equal a b | Int a, Int b -> Int.equal a b | Float a, Float b -> Float.equal a b | String a, String b -> String.equal a b | List a, List b -> List.equal equal a b | Record a, Record b -> List.equal (fun (ka, va) (kb, vb) -> String.equal ka kb && equal va vb) a b | _, _ -> false let pp_delim ppf () = Format.fprintf ppf ", @," let rec pp ppf = function | Null -> Format.fprintf ppf "null" | Bool x -> Format.fprintf ppf "%b" x | Int x -> Format.fprintf ppf "%d" x | Float x -> Format.fprintf ppf "%f" x | String x -> Format.fprintf ppf {|"%s"|} x | List x -> Format.fprintf ppf "@[[%a]@]" (Format.pp_print_list ~pp_sep:pp_delim pp) x | Record x -> Format.fprintf ppf "@[{%a}@]" (Format.pp_print_list ~pp_sep:pp_delim (fun ppf (key, value) -> Format.fprintf ppf {|"%s":@, %a|} key pp value)) x let rec to_ezjsonm = function | Null -> `Null | Bool b -> `Bool b | Int x -> `Float (float_of_int x) | Float x -> `Float x | String x -> `String x | List x -> `A (List.map to_ezjsonm x) | Record x -> `O (List.map (fun (k, v) -> (k, to_ezjsonm v)) x) let rec from_ezjsonm = function | `Null -> Null | `Bool x -> Bool x | `Float x -> Float x | `String x -> String x | `A x -> List (List.map from_ezjsonm x) | `O x -> Record (List.map (fun (k, v) -> (k, from_ezjsonm v)) x) module Validation = struct let find_assoc given_key list = List.find_map (fun (k, value) -> if String.equal given_key k then Some value else None) list type custom_error = .. type value_error = | Invalid_shape of { expected : string; given : t } | Invalid_list of { errors : (int * value_error) Nel.t; given : t list } | Invalid_record of { errors : record_error Nel.t ; given : (string * t) list } | With_message of { given : string; message : string } | Custom of custom_error and record_error = | Missing_field of { field : string } | Invalid_field of { given : t; field : string; error : value_error } type 'a validated_value = ('a, value_error) result type 'a validated_record = ('a, record_error Nel.t) result let invalid_shape expected given = Error (Invalid_shape { expected; given }) let fail_with ~given message = Error (With_message { given; message }) let fail_with_custom err = Error (Custom err) let null = function | Null -> Ok () | invalid_value -> invalid_shape "null" invalid_value let bool = function | Bool b -> Ok b | invalid_value -> invalid_shape "bool" invalid_value let int = function | Int i -> Ok i | Float f -> (* Mandatory case since Ezjsonm does not support integer (because of JavaScript). *) Ok (int_of_float f) | invalid_value -> invalid_shape "int" invalid_value let float = function | Float f -> Ok f | Int i -> (* Mandatory case since Ezjsonm does not support integer (because of JavaScript). *) Ok (float_of_int i) | invalid_value -> invalid_shape "float" invalid_value let string ?(strict = true) = function | String s -> Ok s | other -> ( if strict then invalid_shape "strict-string" other else match other with | Bool b -> Ok (string_of_bool b) | Int i -> Ok (string_of_int i) | Float f -> Ok (string_of_float f) | invalid_value -> invalid_shape "non-strict-string" invalid_value) let const x _ = Ok x let positive x = if x < 0 then fail_with ~given:(string_of_int x) "should be positive" else Ok x let positive' x = if x < 0.0 then fail_with ~given:(string_of_float x) "should be positive" else Ok x let bounded ~min ~max x = let min = Stdlib.min min max and max = Stdlib.max min max in if x < min || x > max then fail_with ~given:(string_of_int x) @@ Format.asprintf "not included into [%d; %d]" min max else Ok x let bounded' ~min ~max x = let min = Stdlib.min min max and max = Stdlib.max min max in if x < min || x > max then fail_with ~given:(string_of_float x) @@ Format.asprintf "not included into [%f; %f]" min max else Ok x let non_empty = function | [] -> fail_with ~given:"[]" "list should not be empty" | x -> Ok x let mk_pp = function | None -> fun ppf _ -> Format.fprintf ppf "*" | Some pp -> fun ppf x -> Format.fprintf ppf "%a" pp x let equal ?pp ?(equal = ( = )) x y = if not (equal x y) then let pp = mk_pp pp in fail_with ~given:(Format.asprintf "%a" pp y) @@ Format.asprintf "should be equal to %a" pp x else Ok y let not_equal ?pp ?(equal = ( = )) x y = if equal x y then let pp = mk_pp pp in fail_with ~given:(Format.asprintf "%a" pp y) @@ Format.asprintf "should not be equal to %a" pp x else Ok y let gt ?pp ?(compare = Stdlib.compare) x y = if compare y x <= 0 then let pp = mk_pp pp in fail_with ~given:(Format.asprintf "%a" pp y) @@ Format.asprintf "should be greater than %a" pp x else Ok y let ge ?pp ?(compare = Stdlib.compare) x y = if compare y x < 0 then let pp = mk_pp pp in fail_with ~given:(Format.asprintf "%a" pp y) @@ Format.asprintf "should be greater or equal to %a" pp x else Ok y let lt ?pp ?(compare = Stdlib.compare) x y = if compare y x >= 0 then let pp = mk_pp pp in fail_with ~given:(Format.asprintf "%a" pp y) @@ Format.asprintf "should be lesser than %a" pp x else Ok y let le ?pp ?(compare = Stdlib.compare) x y = if compare y x > 0 then let pp = mk_pp pp in fail_with ~given:(Format.asprintf "%a" pp y) @@ Format.asprintf "should be lesser or equal to %a" pp x else Ok y let one_of ?pp ?(equal = ( = )) li value = match List.find_opt (equal value) li with | None -> let pp = mk_pp pp in fail_with ~given:(Format.asprintf "%a" pp value) @@ Format.asprintf "not included in [%a]" (Format.pp_print_list ~pp_sep:(fun ppf () -> Format.fprintf ppf "; ") pp) li | Some x -> Ok x let where ?pp ?message predicate x = if not (predicate x) then let pp = mk_pp pp in let f = Option.value ~default:(fun _ -> "unsatisfied predicate") message in fail_with ~given:(Format.asprintf "%a" pp x) (f x) else Ok x let sum branch x = let str_expectation () = branch |> List.map (fun (k, _) -> String.capitalize_ascii k ^ " <abstr>") |> String.concat " | " in match x with | Record [ ("constr", String k); ("value", v) ] as repr -> let pval = find_assoc k branch in Option.fold ~none:(invalid_shape (str_expectation ()) repr) ~some:(fun validator -> validator v) pval | repr -> invalid_shape (str_expectation ()) repr let either left right = sum [ ("left", fun x -> x |> left |> Result.map Either.left) ; ("right", fun x -> x |> right |> Result.map Either.right) ] let option v = function Null -> Ok None | x -> v x |> Result.map Option.some let merge_list_values i acc value = (* yes, I know, coupled with fold_left... which is done on [list_of] it is a kind of traverse *) match (acc, value) with | Ok xs, Ok x -> Ok (x :: xs) | Error a, Error b -> Error (Nel.cons (i, b) a) | Error a, Ok _ -> Error a | Ok _, Error a -> Error (Nel.singleton (i, a)) let list_of validator = function | List li -> List.fold_left (fun (i, acc) x -> let acc = merge_list_values i acc @@ validator x in (succ i, acc)) (0, Ok []) li |> snd |> Result.map List.rev |> Result.map_error (fun errors -> Invalid_list { errors; given = li }) | invalid_value -> invalid_shape "list" invalid_value let record validator = function | Record li -> validator li |> Result.map_error (fun errors -> Invalid_record { errors; given = li }) | invalid_value -> invalid_shape "record" invalid_value let optional assoc field validator = match find_assoc field assoc with | None | Some Null -> Ok None | Some x -> x |> validator |> Result.map Option.some |> Result.map_error (fun error -> Nel.singleton @@ Invalid_field { given = x; error; field }) let required assoc field validator = let opt = optional assoc field validator in Result.bind opt (function | Some x -> Ok x | None -> (* In case or the validator is an optional one. *) Null |> validator |> Result.map_error (fun _ -> Nel.singleton @@ Missing_field { field })) let optional_or assoc field ~default validator = let opt = optional assoc field validator in Result.bind opt (function Some x -> Ok x | None -> Ok default) module Infix = struct let ( & ) l r x = Result.bind (l x) r let ( / ) l r x = Result.fold ~ok:Result.ok ~error:(fun _ -> r x) (l x) let ( $ ) l f x = Result.map f (l x) end module Syntax = struct let ( let+ ) v f = Result.map f v let ( let* ) v f = Result.bind v f let ( and+ ) a b = match (a, b) with | Ok x, Ok y -> Ok (x, y) | Error a, Error b -> Error (Nel.append a b) | Error a, _ | _, Error a -> Error a end include Infix include Syntax let pair f g = function | Record [ _; _ ] as r -> record (fun assoc -> let+ x = required assoc "fst" f and+ y = required assoc "snd" g in (x, y)) r | r -> invalid_shape "pair" r let triple f g h x = x |> pair f (pair g h) |> Result.map (fun (x, (y, z)) -> (x, y, z)) let quad f g h i x = x |> pair f (triple g h i) |> Result.map (fun (w, (x, y, z)) -> (w, x, y, z)) end
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>