package dolmen
Sub-module used for namespacing for the regular language part of the theory requirements.
val empty : t
The empty regular language.
val all : t
The language that contains all strings
val allchar : t
The language that contains all strings of length 1
range s1 s2
is the language containing all singleton strings (i.e. string of length 1) that are lexicographically beetween s1
and s2
, **assuming s1
and s2
are singleton strings**. Else it is the empty language.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>