Clean up re module a bit
This commit is contained in:
parent
a2d3dff690
commit
ce0c4a8b58
1 changed files with 45 additions and 45 deletions
|
|
@ -36,25 +36,25 @@ const
|
||||||
type
|
type
|
||||||
RegexFlag* = enum ## options for regular expressions
|
RegexFlag* = enum ## options for regular expressions
|
||||||
reIgnoreCase = 0, ## do caseless matching
|
reIgnoreCase = 0, ## do caseless matching
|
||||||
reMultiLine = 1, ## ``^`` and ``$`` match newlines within data
|
reMultiLine = 1, ## ``^`` and ``$`` match newlines within data
|
||||||
reDotAll = 2, ## ``.`` matches anything including NL
|
reDotAll = 2, ## ``.`` matches anything including NL
|
||||||
reExtended = 3, ## ignore whitespace and ``#`` comments
|
reExtended = 3, ## ignore whitespace and ``#`` comments
|
||||||
reStudy = 4 ## study the expression (may be omitted if the
|
reStudy = 4 ## study the expression (may be omitted if the
|
||||||
## expression will be used only once)
|
## expression will be used only once)
|
||||||
|
|
||||||
RegexDesc = object
|
RegexDesc = object
|
||||||
h: PPcre
|
h: PPcre
|
||||||
e: ptr TExtra
|
e: ptr TExtra
|
||||||
|
|
||||||
Regex* = ref RegexDesc ## a compiled regular expression
|
Regex* = ref RegexDesc ## a compiled regular expression
|
||||||
|
|
||||||
RegexError* = object of ValueError
|
RegexError* = object of ValueError
|
||||||
## is raised if the pattern is no valid regular expression.
|
## is raised if the pattern is no valid regular expression.
|
||||||
|
|
||||||
{.deprecated: [TRegexFlag: RegexFlag, TRegexDesc: RegexDesc, TRegex: Regex,
|
{.deprecated: [TRegexFlag: RegexFlag, TRegexDesc: RegexDesc, TRegex: Regex,
|
||||||
EInvalidRegEx: RegexError].}
|
EInvalidRegEx: RegexError].}
|
||||||
|
|
||||||
proc raiseInvalidRegex(msg: string) {.noinline, noreturn.} =
|
proc raiseInvalidRegex(msg: string) {.noinline, noreturn.} =
|
||||||
var e: ref RegexError
|
var e: ref RegexError
|
||||||
new(e)
|
new(e)
|
||||||
e.msg = msg
|
e.msg = msg
|
||||||
|
|
@ -68,10 +68,10 @@ proc rawCompile(pattern: string, flags: cint): PPcre =
|
||||||
if result == nil:
|
if result == nil:
|
||||||
raiseInvalidRegex($msg & "\n" & pattern & "\n" & spaces(offset) & "^\n")
|
raiseInvalidRegex($msg & "\n" & pattern & "\n" & spaces(offset) & "^\n")
|
||||||
|
|
||||||
proc finalizeRegEx(x: Regex) =
|
proc finalizeRegEx(x: Regex) =
|
||||||
# XXX This is a hack, but PCRE does not export its "free" function properly.
|
# XXX This is a hack, but PCRE does not export its "free" function properly.
|
||||||
# Sigh. The hack relies on PCRE's implementation (see ``pcre_get.c``).
|
# Sigh. The hack relies on PCRE's implementation (see ``pcre_get.c``).
|
||||||
# Fortunately the implementation is unlikely to change.
|
# Fortunately the implementation is unlikely to change.
|
||||||
pcre.free_substring(cast[cstring](x.h))
|
pcre.free_substring(cast[cstring](x.h))
|
||||||
if not isNil(x.e):
|
if not isNil(x.e):
|
||||||
pcre.free_substring(cast[cstring](x.e))
|
pcre.free_substring(cast[cstring](x.e))
|
||||||
|
|
@ -101,10 +101,10 @@ proc matchOrFind(s: string, pattern: Regex, matches: var openArray[string],
|
||||||
if a >= 0'i32: matches[i-1] = substr(s, int(a), int(b)-1)
|
if a >= 0'i32: matches[i-1] = substr(s, int(a), int(b)-1)
|
||||||
else: matches[i-1] = nil
|
else: matches[i-1] = nil
|
||||||
return rawMatches[1] - rawMatches[0]
|
return rawMatches[1] - rawMatches[0]
|
||||||
|
|
||||||
proc findBounds*(s: string, pattern: Regex, matches: var openArray[string],
|
proc findBounds*(s: string, pattern: Regex, matches: var openArray[string],
|
||||||
start = 0): tuple[first, last: int] =
|
start = 0): tuple[first, last: int] =
|
||||||
## returns the starting position and end position of `pattern` in `s`
|
## returns the starting position and end position of `pattern` in `s`
|
||||||
## and the captured
|
## and the captured
|
||||||
## substrings in the array `matches`. If it does not match, nothing
|
## substrings in the array `matches`. If it does not match, nothing
|
||||||
## is written into `matches` and ``(-1,0)`` is returned.
|
## is written into `matches` and ``(-1,0)`` is returned.
|
||||||
|
|
@ -120,12 +120,12 @@ proc findBounds*(s: string, pattern: Regex, matches: var openArray[string],
|
||||||
if a >= 0'i32: matches[i-1] = substr(s, int(a), int(b)-1)
|
if a >= 0'i32: matches[i-1] = substr(s, int(a), int(b)-1)
|
||||||
else: matches[i-1] = nil
|
else: matches[i-1] = nil
|
||||||
return (rawMatches[0].int, rawMatches[1].int - 1)
|
return (rawMatches[0].int, rawMatches[1].int - 1)
|
||||||
|
|
||||||
proc findBounds*(s: string, pattern: Regex,
|
proc findBounds*(s: string, pattern: Regex,
|
||||||
matches: var openArray[tuple[first, last: int]],
|
matches: var openArray[tuple[first, last: int]],
|
||||||
start = 0): tuple[first, last: int] =
|
start = 0): tuple[first, last: int] =
|
||||||
## returns the starting position and end position of ``pattern`` in ``s``
|
## returns the starting position and end position of ``pattern`` in ``s``
|
||||||
## and the captured substrings in the array `matches`.
|
## and the captured substrings in the array `matches`.
|
||||||
## If it does not match, nothing is written into `matches` and
|
## If it does not match, nothing is written into `matches` and
|
||||||
## ``(-1,0)`` is returned.
|
## ``(-1,0)`` is returned.
|
||||||
var
|
var
|
||||||
|
|
@ -141,7 +141,7 @@ proc findBounds*(s: string, pattern: Regex,
|
||||||
else: matches[i-1] = (-1,0)
|
else: matches[i-1] = (-1,0)
|
||||||
return (rawMatches[0].int, rawMatches[1].int - 1)
|
return (rawMatches[0].int, rawMatches[1].int - 1)
|
||||||
|
|
||||||
proc findBounds*(s: string, pattern: Regex,
|
proc findBounds*(s: string, pattern: Regex,
|
||||||
start = 0): tuple[first, last: int] =
|
start = 0): tuple[first, last: int] =
|
||||||
## returns the starting position of `pattern` in `s`. If it does not
|
## returns the starting position of `pattern` in `s`. If it does not
|
||||||
## match, ``(-1,0)`` is returned.
|
## match, ``(-1,0)`` is returned.
|
||||||
|
|
@ -152,7 +152,7 @@ proc findBounds*(s: string, pattern: Regex,
|
||||||
cast[ptr cint](rawMatches), 3)
|
cast[ptr cint](rawMatches), 3)
|
||||||
if res < 0'i32: return (int(res), 0)
|
if res < 0'i32: return (int(res), 0)
|
||||||
return (int(rawMatches[0]), int(rawMatches[1]-1))
|
return (int(rawMatches[0]), int(rawMatches[1]-1))
|
||||||
|
|
||||||
proc matchOrFind(s: string, pattern: Regex, start, flags: cint): cint =
|
proc matchOrFind(s: string, pattern: Regex, start, flags: cint): cint =
|
||||||
var
|
var
|
||||||
rtarray = initRtArray[cint](3)
|
rtarray = initRtArray[cint](3)
|
||||||
|
|
@ -172,7 +172,7 @@ proc matchLen*(s: string, pattern: Regex, matches: var openArray[string],
|
||||||
proc matchLen*(s: string, pattern: Regex, start = 0): int =
|
proc matchLen*(s: string, pattern: Regex, start = 0): int =
|
||||||
## the same as ``match``, but it returns the length of the match,
|
## the same as ``match``, but it returns the length of the match,
|
||||||
## if there is no match, -1 is returned. Note that a match length
|
## if there is no match, -1 is returned. Note that a match length
|
||||||
## of zero can happen.
|
## of zero can happen.
|
||||||
return matchOrFind(s, pattern, start.cint, pcre.ANCHORED)
|
return matchOrFind(s, pattern, start.cint, pcre.ANCHORED)
|
||||||
|
|
||||||
proc match*(s: string, pattern: Regex, start = 0): bool =
|
proc match*(s: string, pattern: Regex, start = 0): bool =
|
||||||
|
|
@ -216,7 +216,7 @@ proc find*(s: string, pattern: Regex, start = 0): int =
|
||||||
if res < 0'i32: return res
|
if res < 0'i32: return res
|
||||||
return rawMatches[0]
|
return rawMatches[0]
|
||||||
|
|
||||||
iterator findAll*(s: string, pattern: Regex, start = 0): string =
|
iterator findAll*(s: string, pattern: Regex, start = 0): string =
|
||||||
## Yields all matching *substrings* of `s` that match `pattern`.
|
## Yields all matching *substrings* of `s` that match `pattern`.
|
||||||
##
|
##
|
||||||
## Note that since this is an iterator you should not modify the string you
|
## Note that since this is an iterator you should not modify the string you
|
||||||
|
|
@ -234,7 +234,7 @@ iterator findAll*(s: string, pattern: Regex, start = 0): string =
|
||||||
yield substr(s, int(a), int(b)-1)
|
yield substr(s, int(a), int(b)-1)
|
||||||
i = b
|
i = b
|
||||||
|
|
||||||
proc findAll*(s: string, pattern: Regex, start = 0): seq[string] =
|
proc findAll*(s: string, pattern: Regex, start = 0): seq[string] =
|
||||||
## returns all matching *substrings* of `s` that match `pattern`.
|
## returns all matching *substrings* of `s` that match `pattern`.
|
||||||
## If it does not match, @[] is returned.
|
## If it does not match, @[] is returned.
|
||||||
accumulateResult(findAll(s, pattern, start))
|
accumulateResult(findAll(s, pattern, start))
|
||||||
|
|
@ -242,13 +242,13 @@ proc findAll*(s: string, pattern: Regex, start = 0): seq[string] =
|
||||||
when not defined(nimhygiene):
|
when not defined(nimhygiene):
|
||||||
{.pragma: inject.}
|
{.pragma: inject.}
|
||||||
|
|
||||||
template `=~` *(s: string, pattern: Regex): expr =
|
template `=~` *(s: string, pattern: Regex): expr =
|
||||||
## This calls ``match`` with an implicit declared ``matches`` array that
|
## This calls ``match`` with an implicit declared ``matches`` array that
|
||||||
## can be used in the scope of the ``=~`` call:
|
## can be used in the scope of the ``=~`` call:
|
||||||
##
|
##
|
||||||
## .. code-block:: nim
|
## .. code-block:: nim
|
||||||
##
|
##
|
||||||
## if line =~ re"\s*(\w+)\s*\=\s*(\w+)":
|
## if line =~ re"\s*(\w+)\s*\=\s*(\w+)":
|
||||||
## # matches a key=value pair:
|
## # matches a key=value pair:
|
||||||
## echo("Key: ", matches[0])
|
## echo("Key: ", matches[0])
|
||||||
## echo("Value: ", matches[1])
|
## echo("Value: ", matches[1])
|
||||||
|
|
@ -260,9 +260,9 @@ template `=~` *(s: string, pattern: Regex): expr =
|
||||||
## else:
|
## else:
|
||||||
## echo("syntax error")
|
## echo("syntax error")
|
||||||
##
|
##
|
||||||
bind MaxSubPatterns
|
bind MaxSubpatterns
|
||||||
when not declaredInScope(matches):
|
when not declaredInScope(matches):
|
||||||
var matches {.inject.}: array[0..MaxSubpatterns-1, string]
|
var matches {.inject.}: array[MaxSubpatterns, string]
|
||||||
match(s, pattern, matches)
|
match(s, pattern, matches)
|
||||||
|
|
||||||
# ------------------------- more string handling ------------------------------
|
# ------------------------- more string handling ------------------------------
|
||||||
|
|
@ -286,7 +286,7 @@ proc endsWith*(s: string, suffix: Regex): bool =
|
||||||
if matchLen(s, suffix, i) == s.len - i: return true
|
if matchLen(s, suffix, i) == s.len - i: return true
|
||||||
|
|
||||||
proc replace*(s: string, sub: Regex, by = ""): string =
|
proc replace*(s: string, sub: Regex, by = ""): string =
|
||||||
## Replaces `sub` in `s` by the string `by`. Captures cannot be
|
## Replaces `sub` in `s` by the string `by`. Captures cannot be
|
||||||
## accessed in `by`. Examples:
|
## accessed in `by`. Examples:
|
||||||
##
|
##
|
||||||
## .. code-block:: nim
|
## .. code-block:: nim
|
||||||
|
|
@ -306,7 +306,7 @@ proc replace*(s: string, sub: Regex, by = ""): string =
|
||||||
add(result, by)
|
add(result, by)
|
||||||
prev = match.last + 1
|
prev = match.last + 1
|
||||||
add(result, substr(s, prev))
|
add(result, substr(s, prev))
|
||||||
|
|
||||||
proc replacef*(s: string, sub: Regex, by: string): string =
|
proc replacef*(s: string, sub: Regex, by: string): string =
|
||||||
## Replaces `sub` in `s` by the string `by`. Captures can be accessed in `by`
|
## Replaces `sub` in `s` by the string `by`. Captures can be accessed in `by`
|
||||||
## with the notation ``$i`` and ``$#`` (see strutils.`%`). Examples:
|
## with the notation ``$i`` and ``$#`` (see strutils.`%`). Examples:
|
||||||
|
|
@ -320,7 +320,7 @@ proc replacef*(s: string, sub: Regex, by: string): string =
|
||||||
##
|
##
|
||||||
## "var1<-keykey; val2<-key2key2"
|
## "var1<-keykey; val2<-key2key2"
|
||||||
result = ""
|
result = ""
|
||||||
var caps: array[0..MaxSubpatterns-1, string]
|
var caps: array[MaxSubpatterns, string]
|
||||||
var prev = 0
|
var prev = 0
|
||||||
while true:
|
while true:
|
||||||
var match = findBounds(s, sub, caps, prev)
|
var match = findBounds(s, sub, caps, prev)
|
||||||
|
|
@ -338,7 +338,7 @@ proc parallelReplace*(s: string, subs: openArray[
|
||||||
## applied in parallel.
|
## applied in parallel.
|
||||||
result = ""
|
result = ""
|
||||||
var i = 0
|
var i = 0
|
||||||
var caps: array[0..MaxSubpatterns-1, string]
|
var caps: array[MaxSubpatterns, string]
|
||||||
while i < s.len:
|
while i < s.len:
|
||||||
block searchSubs:
|
block searchSubs:
|
||||||
for j in 0..high(subs):
|
for j in 0..high(subs):
|
||||||
|
|
@ -359,7 +359,7 @@ proc transformFile*(infile, outfile: string,
|
||||||
## error occurs. This is supposed to be used for quick scripting.
|
## error occurs. This is supposed to be used for quick scripting.
|
||||||
var x = readFile(infile).string
|
var x = readFile(infile).string
|
||||||
writeFile(outfile, x.parallelReplace(subs))
|
writeFile(outfile, x.parallelReplace(subs))
|
||||||
|
|
||||||
iterator split*(s: string, sep: Regex): string =
|
iterator split*(s: string, sep: Regex): string =
|
||||||
## Splits the string `s` into substrings.
|
## Splits the string `s` into substrings.
|
||||||
##
|
##
|
||||||
|
|
@ -395,19 +395,19 @@ iterator split*(s: string, sep: Regex): string =
|
||||||
proc split*(s: string, sep: Regex): seq[string] =
|
proc split*(s: string, sep: Regex): seq[string] =
|
||||||
## Splits the string `s` into substrings.
|
## Splits the string `s` into substrings.
|
||||||
accumulateResult(split(s, sep))
|
accumulateResult(split(s, sep))
|
||||||
|
|
||||||
proc escapeRe*(s: string): string =
|
proc escapeRe*(s: string): string =
|
||||||
## escapes `s` so that it is matched verbatim when used as a regular
|
## escapes `s` so that it is matched verbatim when used as a regular
|
||||||
## expression.
|
## expression.
|
||||||
result = ""
|
result = ""
|
||||||
for c in items(s):
|
for c in items(s):
|
||||||
case c
|
case c
|
||||||
of 'a'..'z', 'A'..'Z', '0'..'9', '_':
|
of 'a'..'z', 'A'..'Z', '0'..'9', '_':
|
||||||
result.add(c)
|
result.add(c)
|
||||||
else:
|
else:
|
||||||
result.add("\\x")
|
result.add("\\x")
|
||||||
result.add(toHex(ord(c), 2))
|
result.add(toHex(ord(c), 2))
|
||||||
|
|
||||||
const ## common regular expressions
|
const ## common regular expressions
|
||||||
reIdentifier* = r"\b[a-zA-Z_]+[a-zA-Z_0-9]*\b" ## describes an identifier
|
reIdentifier* = r"\b[a-zA-Z_]+[a-zA-Z_0-9]*\b" ## describes an identifier
|
||||||
reNatural* = r"\b\d+\b" ## describes a natural number
|
reNatural* = r"\b\d+\b" ## describes a natural number
|
||||||
|
|
@ -430,7 +430,7 @@ const ## common regular expressions
|
||||||
when isMainModule:
|
when isMainModule:
|
||||||
assert match("(a b c)", re"\( .* \)")
|
assert match("(a b c)", re"\( .* \)")
|
||||||
assert match("WHiLe", re("while", {reIgnoreCase}))
|
assert match("WHiLe", re("while", {reIgnoreCase}))
|
||||||
|
|
||||||
assert "0158787".match(re"\d+")
|
assert "0158787".match(re"\d+")
|
||||||
assert "ABC 0232".match(re"\w+\s+\d+")
|
assert "ABC 0232".match(re"\w+\s+\d+")
|
||||||
assert "ABC".match(re"\d+ | \w+")
|
assert "ABC".match(re"\d+ | \w+")
|
||||||
|
|
@ -439,21 +439,21 @@ when isMainModule:
|
||||||
|
|
||||||
var pattern = re"[a-z0-9]+\s*=\s*[a-z0-9]+"
|
var pattern = re"[a-z0-9]+\s*=\s*[a-z0-9]+"
|
||||||
assert matchLen("key1= cal9", pattern) == 11
|
assert matchLen("key1= cal9", pattern) == 11
|
||||||
|
|
||||||
assert find("_____abc_______", re"abc") == 5
|
assert find("_____abc_______", re"abc") == 5
|
||||||
|
|
||||||
var matches: array[0..5, string]
|
var matches: array[6, string]
|
||||||
if match("abcdefg", re"c(d)ef(g)", matches, 2):
|
if match("abcdefg", re"c(d)ef(g)", matches, 2):
|
||||||
assert matches[0] == "d"
|
assert matches[0] == "d"
|
||||||
assert matches[1] == "g"
|
assert matches[1] == "g"
|
||||||
else:
|
else:
|
||||||
assert false
|
assert false
|
||||||
|
|
||||||
if "abc" =~ re"(a)bcxyz|(\w+)":
|
if "abc" =~ re"(a)bcxyz|(\w+)":
|
||||||
assert matches[1] == "abc"
|
assert matches[1] == "abc"
|
||||||
else:
|
else:
|
||||||
assert false
|
assert false
|
||||||
|
|
||||||
if "abc" =~ re"(cba)?.*":
|
if "abc" =~ re"(cba)?.*":
|
||||||
assert matches[0] == nil
|
assert matches[0] == nil
|
||||||
else: assert false
|
else: assert false
|
||||||
|
|
@ -461,7 +461,7 @@ when isMainModule:
|
||||||
if "abc" =~ re"().*":
|
if "abc" =~ re"().*":
|
||||||
assert matches[0] == ""
|
assert matches[0] == ""
|
||||||
else: assert false
|
else: assert false
|
||||||
|
|
||||||
assert "var1=key; var2=key2".endsWith(re"\w+=\w+")
|
assert "var1=key; var2=key2".endsWith(re"\w+=\w+")
|
||||||
assert("var1=key; var2=key2".replacef(re"(\w+)=(\w+)", "$1<-$2$2") ==
|
assert("var1=key; var2=key2".replacef(re"(\w+)=(\w+)", "$1<-$2$2") ==
|
||||||
"var1<-keykey; var2<-key2key2")
|
"var1<-keykey; var2<-key2key2")
|
||||||
|
|
@ -484,7 +484,7 @@ when isMainModule:
|
||||||
assert("XYZ".match(re"^\d*") == true)
|
assert("XYZ".match(re"^\d*") == true)
|
||||||
|
|
||||||
block:
|
block:
|
||||||
var matches: array[0..15, string]
|
var matches: array[16, string]
|
||||||
if match("abcdefghijklmnop", re"(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)(m)(n)(o)(p)", matches):
|
if match("abcdefghijklmnop", re"(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)(k)(l)(m)(n)(o)(p)", matches):
|
||||||
for i in 0..matches.high:
|
for i in 0..matches.high:
|
||||||
assert matches[i] == $chr(i + 'a'.ord)
|
assert matches[i] == $chr(i + 'a'.ord)
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue