Longest Common Prefix Given a vector of string slices, calculate the string slice that is the longest common prefix of the strings. ``` let words =

Creating a list with the argument registers static Eterm

mostly identical to matches/3

The actual compiling of the match expression and the guards.

very similar to split: extract helpers

Move cursor to the start of the line.

Find the nearest catch handler TODO: return is instr pointer

Parses a full file path pointing to a module.

Loops twice, once to parse annotations, once to remap the args.

Preload all the bootstrap modules

TODO: return a Module

we're in receive(), but ran out of internal messages, process external queue An Err signals that we're now exiting.

awkward result, but it works

Replaces the content between [`start`..`end`] with `text` and positions the cursor to the end of text.

Quick-saving the stack trace in an internal form on the heap. Note that c_p->ftrace will point to a cons cell which holds the given args and the saved

_continue is for when the main function traps, let's just use generators

TODO: remove

TODO: split on "" is invalid

Starts the main process

Terminating the process when an exception is not caught

Check and extract components from a tuple on form: {{Y,M,D},{H,M,S}}

conversion funs

Set line content (`buf`) and cursor position (`pos`).