package forester
A tool for tending mathematical forests
Install
Dune Dependency
Authors
Maintainers
Sources
2.1.tar.gz
md5=31749867afa21e73376e229a8f664890
sha512=297e088801dcd263cb636a9526ad31f96e1090fea8eac7a8887c115d604bafe8aa3b44a18efb8027666f0f50b53c920269e79a1cf06abcb58918643a4e18bba1
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)"
>