This lexer will always return slices of the original input; thus, it does not
allocate memory and calls to start don't invalidate the outputs of previous
calls to get.
This is the fastest of all lexers, as it only performs very quick searches and
slicing operations. It has the downside of requiring the entire input to be loaded
in memory at the same time; as such, it is optimal for small file but not suitable
for very big ones.
A lexer that takes a sliceable input.
This lexer will always return slices of the original input; thus, it does not allocate memory and calls to start don't invalidate the outputs of previous calls to get.
This is the fastest of all lexers, as it only performs very quick searches and slicing operations. It has the downside of requiring the entire input to be loaded in memory at the same time; as such, it is optimal for small file but not suitable for very big ones.