package forester

  1. Overview
  2. Docs
A tool for tending mathematical forests

Install

Dune Dependency

Authors

Maintainers

Sources

2.4.1.tar.gz
md5=6bdd20df3d77c5fdcf020a74f7964d95
sha512=a60fed82e04be2dc58ca77fd339d0d63e5bfa281f188ddda17c0035a2755c0c575d29d02dfd8742dda81ba02092226029e63b1acc1939f748a3bff3560b79b04

doc/src/forester.prelude/String_util.ml.html

Source file String_util.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
OCaml

Innovation. Community. Security.