Lines Matching refs:regex
4 on strings, with $(I regex) being a catchy word for a pattern in this domain
46 import std.regex;
51 auto r = regex(r"\b[0-9][0-9]?/[0-9][0-9]?/[0-9][0-9](?:[0-9][0-9])?\b");
72 auto multi = regex([`\d+,\d+`,`(a-z]+):(\d+)`]);
88 The general usage guideline is to keep regex complexity on the side of simplicity,
95 For an introduction to $(D std.regex) see a
112 $(I std.regex operates on codepoint level,
174 $(REG_ROW (regex), Matches subexpression regex,
177 $(REG_ROW (?:regex), Matches subexpression regex,
180 $(REG_ROW (?P$(LT)name$(GT)regex), Matches named subexpression
181 regex labeling it with name 'name'.
190 $(REG_ROW (?=regex), Zero-width lookahead assertion.
192 regex could be matched starting from the current position.
194 $(REG_ROW (?!regex), Zero-width negative lookahead assertion.
196 regex could $(U not) be matched starting from the current position.
198 $(REG_ROW (?<=regex), Zero-width lookbehind assertion. Matches at a point
199 where the subexpression regex could be matched ending
202 $(REG_ROW (?<!regex), Zero-width negative lookbehind assertion.
203 Matches at a point where the subexpression regex could $(U not)
222 $(REG_ROW g, Global regex, repeat over the whole input. )
284 API and utility constructs are modeled after the original $(D std.regex)
297 module std.regex;
300 import std.regex.internal.ir;
301 import std.regex.internal.thompson; //TODO: get rid of this dependency
307 Instances of this object are constructed via calls to $(D regex).
771 import std.regex; in foreach()
772 auto m = matchAll("Hello, world!", regex(`\w+`)); in foreach()
847 auto re = regex("abc");
925 Start matching $(D input) to regex pattern $(D re),
943 import std.regex.internal.thompson : ThompsonMatcher;
951 import std.regex.internal.thompson : ThompsonMatcher;
952 return RegexMatch!(Unqual!(typeof(input)),ThompsonMatcher)(input, regex(re));
958 import std.regex.internal.backtracking : BacktrackingMatcher;
1034 import std.regex.internal.thompson : ThompsonMatcher;
1042 import std.regex.internal.thompson : ThompsonMatcher;
1043 return matchMany!ThompsonMatcher(input, regex(re));
1050 import std.regex.internal.thompson : ThompsonMatcher;
1051 return matchMany!ThompsonMatcher(input, regex(re));
1057 import std.regex.internal.backtracking : BacktrackingMatcher;
1079 auto pat2 = regex([r"(\d+)/(\d+)/(\d+)".to!String(), "abc".to!String]);
1104 Start matching of $(D input) to regex pattern $(D re),
1124 import std.regex.internal.backtracking : BacktrackingMatcher;
1132 import std.regex.internal.backtracking : BacktrackingMatcher;
1133 return RegexMatch!(Unqual!(typeof(input)), BacktrackingMatcher!false)(input, regex(re));
1139 import std.regex.internal.backtracking : BacktrackingMatcher;
1242 assert(replaceFirst("noon", regex("n"), "[$&]") == "[n]oon");
1272 (list, regex(`[0-9]+`));
1309 replaceFirstInto(result, m1, regex(`([a-z]+) message`), "$1");
1311 replaceFirstInto!(cap=>cap[1])(result, m2, regex(`([a-z]+) message`));
1321 (list, regex(`[0-9]+`));
1327 replaceFirstInto(result, m1, regex(`([a-z]+) message`), "$1");
1329 replaceFirstInto!(cap=>cap[1])(result, m2, regex(`([a-z]+) message`));
1361 auto re = regex(r"(?<=\d)(?=(\d\d\d)+\b)","g");
1401 regex("[ar]"));
1435 static re = regex(`(?<=\d)(?=(\d\d\d)+\b)`, "g");
1461 auto re1 = regex("curt".to!S());
1462 auto re2 = regex("[dr]o".to!S());
1641 assert(equal(splitter(s1, regex(", *")),
1651 auto pattern = regex(`([\.,])`);
1674 public alias RegexException = std.regex.internal.ir.RegexException;
1719 import std.regex;
1720 string s = `This is {unfriendly} to *regex*`;
1721 assert(s.escaper.equal(`This is \{unfriendly\} to \*regex\*`));