module re
import text
-intrude import text::flat
+import text::flat
import gc
import error
new malloc `{ return malloc(sizeof(regex_t)); `}
# Compile the regular expression `regex` into a form that is suitable for subsequent `regexec` searches
- fun regcomp(regex: NativeString, cflags: Int): Int `{
+ fun regcomp(regex: CString, cflags: Int): Int `{
return regcomp(self, regex, cflags);
`}
#
# `nmatch` and `pmatch` are used to provide information regarding the location of any matches.
# `eflags` may be the bitwise-or of one or both of `flag_notbol` and `flag_noteol`.
- fun regexec(string: NativeString, nmatch: Int, pmatch: NativeMatchArray, eflags: Int): Int `{
+ fun regexec(string: CString, nmatch: Int, pmatch: NativeMatchArray, eflags: Int): Int `{
return regexec(self, string, nmatch, pmatch, eflags);
`}
# Match `string` against the precompiled pattern buffer of `self`, do not locate matches
#
# `eflags` may be the bitwise-or of one or both of `flag_notbol` and `flag_noteol`.
- fun regexec_match_only(string: NativeString, eflags: Int): Int `{
+ fun regexec_match_only(string: CString, eflags: Int): Int `{
return regexec(self, string, 0, NULL, eflags);
`}
fun regfree `{ regfree(self); `}
# Turn the error codes that can be returned by both `regcomp` and `regexec` into error message strings
- fun regerror(errcode: Int): NativeString `{
+ fun regerror(errcode: Int): CString `{
size_t len = regerror(errcode, self, NULL, 0);
char *message = malloc(len);
regerror(errcode, self, message, len);
fun [](index: Int): NativeMatchArray `{ return self + index; `}
end
-redef extern class NativeString
- private fun substring_from(index: Int): NativeString `{ return self + index; `}
+redef extern class CString
+ private fun substring_from(index: Int): CString `{ return self + index; `}
end
redef class Text
# Cache of a single `regmatch_t` to prevent many calls to `malloc`
private var native_match: NativeMatchArray is lazy do
native_match_is_init = true
- return new NativeMatchArray.malloc(native.re_nsub+1)
+ return new NativeMatchArray.malloc(native.as(not null).re_nsub+1)
end
private var native_match_is_init = false
# assert "l+".to_re.search_in("hello world", 3).from == 3
# assert "z".to_re.search_in("hello world", 0) == null
# assert "cd(e)".to_re.search_in("abcdef", 2)[1].to_s == "e"
- redef fun search_in(text, from)
+ redef fun search_in(text, charfrom)
do
assert not optimize_has
assert native != null
# Actually execute
- text = text.to_s
- var sub = text.substring_from(from)
- var cstr = sub.to_cstring
- var bstr = new FlatString.full(cstr, sub.bytelen, 0, sub.bytelen - 1, text.length - from)
+ var cstr = text.to_cstring
+ var rets = cstr.to_s_with_length(text.byte_length)
+ var bytefrom = cstr.char_to_byte_index_cached(charfrom, 0, 0)
+ var subcstr = cstr.fast_cstring(bytefrom)
var eflags = gather_eflags
var native_match = self.native_match
var nsub = native.re_nsub
- var res = native.regexec(cstr, nsub+1, native_match, eflags)
+ var res = native.regexec(subcstr, nsub + 1, native_match, eflags)
# Found one?
if res == 0 then
- var first_char = bstr.byte_to_char_index(native_match.rm_so)
- var last_char = bstr.byte_to_char_index(native_match.rm_eo - native_match.rm_so - 1)
- var match = new Match(text,
- from + first_char,
- last_char + 1)
+ var bfrom = native_match.rm_so + bytefrom
+ var bto = native_match.rm_eo - 1 + bytefrom
+ var cpos = cstr.byte_to_char_index_cached(bfrom, charfrom, bytefrom)
+ var len = cstr.utf8_length(bfrom, bto - bfrom + 1)
+ var match = new Match(rets, cpos, len)
+ var subs = match.subs
# Add sub expressions
for i in [1 .. nsub] do
- first_char = bstr.byte_to_char_index(native_match[i].rm_so)
- last_char = bstr.byte_to_char_index(native_match[i].rm_eo - native_match[i].rm_so - 1)
- match.subs.add new Match( text,
- from + first_char,
- last_char + 1)
+ if native_match[i].rm_so < 0 then
+ subs.add null
+ continue
+ end
+ var sub_bfrom = native_match[i].rm_so + bytefrom
+ var sub_bto = native_match[i].rm_eo - 1 + bytefrom
+ var sub_cpos = cstr.byte_to_char_index_cached(sub_bfrom, cpos, bfrom)
+ var sub_len = cstr.utf8_length(sub_bfrom, sub_bto - sub_bfrom + 1)
+ subs.add(new Match(rets, sub_cpos, sub_len))
end
return match
assert native != null
# Actually execute
- text = text.to_s
var cstr = text.to_cstring
+ var subcstr = cstr
+ var rets = cstr.to_s_with_length(text.byte_length)
var eflags = gather_eflags
var eflags_or_notbol = eflags | flag_notbol
var native_match = self.native_match
var matches = new Array[Match]
var nsub = native.re_nsub
- var res = native.regexec(cstr, nsub+1, native_match, eflags)
- var d = 0
+ var res = native.regexec(subcstr, nsub + 1, native_match, eflags)
+ var bytesub = 0
+ var charsub = 0
while res == 0 do
- var match = new Match(text,
- d + native_match.rm_so,
- native_match.rm_eo - native_match.rm_so)
+ var bfrom = native_match.rm_so + bytesub
+ var bto = native_match.rm_eo - 1 + bytesub
+ var cstart = cstr.byte_to_char_index_cached(bfrom, charsub, bytesub)
+ var len = cstr.utf8_length(bfrom, bto - bfrom + 1)
+ var match = new Match(rets, cstart, len)
matches.add match
+ var subs = match.subs
# Add sub expressions
- for i in [1..nsub] do
- match.subs.add new Match( text,
- d + native_match[i].rm_so,
- native_match[i].rm_eo - native_match[i].rm_so)
+ for i in [1 .. nsub] do
+ if native_match[i].rm_so < 0 then
+ subs.add null
+ continue
+ end
+ var sub_bfrom = native_match[i].rm_so + bytesub
+ var sub_bto = native_match[i].rm_eo - 1 + bytesub
+ var sub_cstart = cstr.byte_to_char_index_cached(sub_bfrom, cstart, bfrom)
+ var sub_len = cstr.utf8_length(sub_bfrom, sub_bto - sub_bfrom + 1)
+ subs.add(new Match(rets, sub_cstart, sub_len))
end
- if d == native_match.rm_eo then
- d += 1
- else d = d + native_match.rm_eo
- cstr = cstr.substring_from(native_match.rm_eo)
- res = native.regexec(cstr, nsub+1, native_match, eflags_or_notbol)
+ bytesub = bto + 1
+ charsub = cstart + len
+ subcstr = cstr.fast_cstring(bytesub)
+ res = native.regexec(subcstr, nsub + 1, native_match, eflags_or_notbol)
end
# No more match?
# assert match.subs.length == 1
# assert match.subs.first.to_s == "d eee"
# ~~~
- var subs = new Array[Match] is lazy
+ var subs = new Array[nullable Match] is lazy
# Get the `n`th expression in this match
#
# assert match[0].to_s == "c d eee f"
# assert match[1].to_s == "d eee"
# ~~~
- fun [](n: Int): Match do
+ fun [](n: Int): nullable Match do
if n == 0 then return self
assert n > 0 and n <= subs.length
return subs[n-1]
nitlanguage / nit.git / blobdiff