Regex Matcher¶

1

import "std/text/regex-matcher";

Thread struct¶

Pike's-VM matcher: runs a compiled RegexProgram (see "std/text/regex/regex-program") over an input string without backtracking, which bounds matching to O(input length * program size) - no pattern can trigger catastrophic backtracking.

runProgram only tries to match starting exactly at startIndex (i.e. as if the pattern were anchored there); "std/text/regex/regex" implements unanchored search by trying successive start positions.

Fields¶

Constructors¶

ctor¶

1

public p Thread.ctor(long pc, const Vector<long>& saved)

Parameters

ctor¶

1

public p Thread.ctor(const Thread& original)

Parameters

dtor¶

1

public p Thread.dtor()

ThreadList struct¶

Fields¶

Constructors¶

ctor¶

1

public p ThreadList.ctor(long numInstrs)

Parameters

Methods¶

reset¶

1

public p ThreadList.reset()

Functions¶

runProgram¶

1

public f<Optional<Vector<long>>> runProgram(const RegexProgram& prog, const String& input, unsigned long startIndex)

Try to match prog against input, starting exactly at startIndex (as if the pattern were anchored there - "std/text/regex/regex" tries successive positions to implement unanchored search). On success, returns the capture-slot array (slot 0/1 = whole-match start/end, slot 2g/2g+1 = group g start/end, -1 where a group did not participate).

Parameters

Returns: Optional<Vector<long>> — The capture-slot array of the match with the greatest extent under Perl/PCRE-style leftmost-first priority, or an empty Optional if no match starts at startIndex