package lambdapi
Proof assistant for the λΠ-calculus modulo rewriting
Install
Dune Dependency
Authors
Maintainers
Sources
lambdapi-2.5.1.tbz
sha256=2c251021b6fac40c05282ca183902da5b1008e69d9179d7a9543905c2c21a28a
sha512=69535f92766e6fedc2675fc214f0fb699bde2a06aa91d338c93c99756235a293cf16776f6328973dda07cf2ad402e58fe3104a08f1a896990c1778b42f7f9fcf
doc/src/lambdapi.lplib/string.ml.html
Source file string.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
module S = Stdlib.String include S let to_list : string -> char list = fun s -> let l = ref [] in S.iter (fun c -> l := c :: !l) s; List.rev !l let of_list : char list -> string = fun l -> let b = Buffer.create 37 in List.iter (Buffer.add_char b) l; Buffer.contents b let is_substring : string -> string -> bool = fun e s -> let len_e = S.length e in let len_s = S.length s in let rec is_sub i = if len_s - i < len_e then false else if S.sub s i len_e = e then true else is_sub (i + 1) in is_sub 0 let is_prefix : string -> string -> bool = fun p s -> let len_p = S.length p in let len_s = S.length s in len_p <= len_s && S.sub s 0 len_p = p let for_all : (char -> bool) -> string -> bool = fun p s -> let len_s = S.length s in let rec for_all i = i >= len_s || (p (S.get s i) && for_all (i + 1)) in for_all 0 (* Taken from string.ml in OCaml 4.14.1. *) module B = Bytes let bos = B.unsafe_of_string let get_utf_8_uchar s i = B.get_utf_8_uchar (bos s) i let is_valid_utf_8 s = B.is_valid_utf_8 (bos s)
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>