package forester
A tool for tending mathematical forests
Install
Dune Dependency
Authors
Maintainers
Sources
2.2.1.tar.gz
md5=6f013c1c3c492725dfc153c79038b6d7
sha512=2d6eeb865a8939ff5ef9031e969a41c81480cf5ef814f83a68d98aebe84c67657587231d8ef0ae820becbe429064de70772ed5b7db60828dc5657f250df7fdfc
doc/src/forester.prelude/StringUtil.ml.html
Source file StringUtil.ml
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
let index_of_first_ascii_char word = let rx = Str.regexp "\\([A-za-z]\\)" in try Option.some @@ Str.search_forward rx word 0 with _ -> None let title_case_word ix word = if ix == 0 then begin match index_of_first_ascii_char word with | None -> word | Some i -> word |> String.mapi @@ fun j c -> if i = j then Char.uppercase_ascii c else c end else word let sentence_case str = let words = String.split_on_char ' ' str in String.concat " " @@ List.mapi title_case_word words
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>