re

Regular expression matching, searching, and replacement using the Thompson NFA engine.

Import

import re

Functions

re.test(pattern: str, str: str) -> bool

True if pattern matches anywhere in str. Also available as re.is_match(pattern, str).

re.match(pattern: str, str: str) -> str | null

Return the first match as a string, or null if no match.

re.find_all(pattern: str, str: str) -> [str]

Return an array of all non-overlapping matches.

re.replace(pattern: str, str: str, repl: str) -> str

Replace the first match with repl.

re.replace_all(pattern: str, str: str, repl: str) -> str

Replace all matches with repl.

re.split(pattern: str, str: str) -> [str]

Split str by pattern, returning an array of parts.

re.groups(pattern: str, str: str) -> [str]

Return capture groups from the first match as an array.

XS uses a Thompson NFA engine (src/core/regex.c) which guarantees linear-time matching. Patterns follow POSIX ERE syntax. Backslash sequences like \d work as expected.

Examples

scratch.xs

import re

println(re.match("\d+", "abc 123 def"))       -- 123
println(re.find_all("\d+", "1 2 3"))          -- [1, 2, 3]
println(re.replace("\d+", "abc 123", "N"))    -- abc N
println(re.replace_all("\d+", "1 2 3", "N")) -- N N N
println(re.split("\s+", "a b c"))             -- [a, b, c]
println(re.test("^\d+$", "123"))              -- true
println(re.test("^\d+$", "abc"))              -- false

-- capture groups
let m = re.groups("(\w+)@(\w+)", "user@host")
println(m[0])  -- user
println(m[1])  -- host

Edit this page on GitHub ->