private static CacheDict<PatternKey, RE_Pattern> _cachedPatterns = new CacheDict<PatternKey, RE_Pattern>(100);

[SpecialName]

public static void PerformModuleReload(PythonContext/*!*/ context, PythonDictionary/*!*/ dict) {

context.EnsureModuleException("reerror", dict, "error", "re");

PythonCopyReg.GetDispatchTable(context.SharedContext)[DynamicHelpers.GetPythonTypeFromType(typeof(RE_Pattern))] = dict["_pickle"];

}

private static readonly Random r = new Random(DateTime.Now.Millisecond);

#region CONSTANTS

// short forms

public const int I = 0x02;

public const int L = 0x04;

public const int M = 0x08;

public const int S = 0x10;

public const int U = 0x20;

public const int X = 0x40;

// long forms

public const int IGNORECASE = 0x02;

public const int LOCALE = 0x04;

public const int MULTILINE = 0x08;

public const int DOTALL = 0x10;

public const int UNICODE = 0x20;

public const int VERBOSE = 0x40;

#endregion

#region Public API Surface

public static RE_Pattern compile(CodeContext/*!*/ context, object pattern) {

try {

return GetPattern(context, pattern, 0, true);

} catch (ArgumentException e) {

throw PythonExceptions.CreateThrowable(error(context), e.Message);

}

}

public static RE_Pattern compile(CodeContext/*!*/ context, object pattern, object flags) {

try {

return GetPattern(context, pattern, PythonContext.GetContext(context).ConvertToInt32(flags), true);

} catch (ArgumentException e) {

throw PythonExceptions.CreateThrowable(error(context), e.Message);

}

}

public const string engine = "cli reg ex";

public static string escape(string text) {

if (text == null) throw PythonOps.TypeError("text must not be None");

for (int i = 0; i < text.Length; i++) {

if (!Char.IsLetterOrDigit(text[i])) {

StringBuilder sb = new StringBuilder(text, 0, i, text.Length);

char ch = text[i];

do {

sb.Append('\\');

sb.Append(ch);

i++;

int last = i;

while (i < text.Length) {

ch = text[i];

if (!Char.IsLetterOrDigit(ch)) {

break;

}

i++;

}

sb.Append(text, last, i - last);

} while (i < text.Length);

return sb.ToString();

}

}

return text;

}

public static List findall(CodeContext/*!*/ context, object pattern, string @string) {

return findall(context, pattern, @string, 0);

}

public static List findall(CodeContext/*!*/ context, object pattern, string @string, int flags) {

RE_Pattern pat = GetPattern(context, ValidatePattern(pattern), flags);

ValidateString(@string, "string");

MatchCollection mc = pat.FindAllWorker(context, @string, 0, @string.Length);

return FixFindAllMatch(pat, mc, null);

}

public static List findall(CodeContext/*!*/ context, object pattern, IList<byte> @string) {

return findall(context, pattern, @string, 0);

}

public static List findall(CodeContext/*!*/ context, object pattern, IList<byte> @string, int flags) {

RE_Pattern pat = GetPattern(context, ValidatePattern (pattern), flags);

ValidateString (@string, "string");

MatchCollection mc = pat.FindAllWorker(context, @string, 0, @string.Count);

return FixFindAllMatch (pat, mc, FindMaker(@string));

}

private static Func<string, object> FindMaker (object input) {

Func<string, object> maker = null;

if (input is ByteArray) {

maker = delegate (string x) { return new ByteArray (x.MakeByteArray ()); };

}

return maker;

}

private static List FixFindAllMatch(RE_Pattern pat, MatchCollection mc, Func<string, object> maker) {

object[] matches = new object[mc.Count];

int numgrps = pat._re.GetGroupNumbers().Length;

for (int i = 0; i < mc.Count; i++) {

if (numgrps > 2) { // CLR gives us a "bonus" group of 0 - the entire expression

// at this point we have more than one group in the pattern;

// need to return a list of tuples in this case

// for each match item in the matchcollection, create a tuple representing what was matched

// e.g. findall("(\d+)|(\w+)", "x = 99y") == [('', 'x'), ('99', ''), ('', 'y')]

// in the example above, ('', 'x') did not match (\d+) as indicated by '' but did

// match (\w+) as indicated by 'x' and so on...

int k = 0;

List<object> tpl = new List<object>();

foreach (Group g in mc[i].Groups) {

// here also the CLR gives us a "bonus" match as the first item which is the

// group that was actually matched in the tuple e.g. we get 'x', '', 'x' for

// the first match object...so we'll skip the first item when creating the

// tuple

if (k++ != 0) {

tpl.Add(maker != null ? maker(g.Value) : g.Value);

}

}

matches[i] = PythonTuple.Make(tpl);

} else if (numgrps == 2) {

// at this point we have exactly one group in the pattern (including the "bonus" one given

// by the CLR

// skip the first match since that contains the entire match and not the group match

// e.g. re.findall(r"(\w+)\s+fish\b", "green fish") will have "green fish" in the 0

// index and "green" as the (\w+) group match

matches[i] = maker != null ? maker(mc[i].Groups[1].Value) : mc[i].Groups[1].Value;

} else {

matches[i] = maker != null ? maker (mc[i].Value) : mc[i].Value;

}

}

return List.FromArrayNoCopy(matches);

}

public static object finditer(CodeContext/*!*/ context, object pattern, object @string) {

return finditer(context, pattern, @string, 0);

}

public static object finditer(CodeContext/*!*/ context, object pattern, object @string, int flags) {

RE_Pattern pat = GetPattern(context, ValidatePattern(pattern), flags);

string str = ValidateString(@string, "string");

return MatchIterator(pat.FindAllWorker(context, str, 0, str.Length), pat, str);

}

public static RE_Match match(CodeContext/*!*/ context, object pattern, object @string) {

return match(context, pattern, @string, 0);

}

public static RE_Match match(CodeContext/*!*/ context, object pattern, object @string, int flags) {

return GetPattern(context, ValidatePattern(pattern), flags).match(ValidateString(@string, "string"));

}

public static RE_Match search(CodeContext/*!*/ context, object pattern, object @string) {

return search(context, pattern, @string, 0);

}

public static RE_Match search(CodeContext/*!*/ context, object pattern, object @string, int flags) {

return GetPattern(context, ValidatePattern(pattern), flags).search(ValidateString(@string, "string"));

}

[return: SequenceTypeInfo(typeof(string))]

public static List split(CodeContext/*!*/ context, object pattern, object @string) {

return split(context, ValidatePattern(pattern), ValidateString(@string, "string"), 0);

}

[return: SequenceTypeInfo(typeof(string))]

public static List split(CodeContext/*!*/ context, object pattern, object @string, int maxsplit) {

return GetPattern(context, ValidatePattern(pattern), 0).split(ValidateString(@string, "string"),

maxsplit);

}

public static string sub(CodeContext/*!*/ context, object pattern, object repl, object @string) {

return sub(context, pattern, repl, @string, Int32.MaxValue);

}

public static string sub(CodeContext/*!*/ context, object pattern, object repl, object @string, int count) {

return GetPattern(context, ValidatePattern(pattern), 0).sub(context, repl, ValidateString(@string, "string"), count);

}

public static object subn(CodeContext/*!*/ context, object pattern, object repl, object @string) {

return subn(context, pattern, repl, @string, Int32.MaxValue);

}

public static object subn(CodeContext/*!*/ context, object pattern, object repl, object @string, int count) {

return GetPattern(context, ValidatePattern(pattern), 0).subn(context, repl, ValidateString(@string, "string"), count);

}

public static void purge() {

_cachedPatterns = new CacheDict<PatternKey, RE_Pattern>(100);

}

#endregion

#region Public classes

/// <summary>

/// Compiled reg-ex pattern

/// </summary>

[PythonType]

public class RE_Pattern : IWeakReferenceable {

internal Regex _re;

private PythonDictionary _groups;

private int _compileFlags;

private WeakRefTracker _weakRefTracker;

internal ParsedRegex _pre;

internal RE_Pattern(CodeContext/*!*/ context, object pattern)

: this(context, pattern, 0) {

}

internal RE_Pattern(CodeContext/*!*/ context, object pattern, int flags) :

this(context, pattern, flags, false) {

}

internal RE_Pattern(CodeContext/*!*/ context, object pattern, int flags, bool compiled) {

_pre = PreParseRegex(context, ValidatePatternAsString(pattern));

try {

flags |= OptionToFlags(_pre.Options);

RegexOptions opts = FlagsToOption(flags);

#if SILVERLIGHT

this._re = new Regex(_pre.Pattern, opts);

#else

this._re = new Regex(_pre.Pattern, opts | (compiled ? RegexOptions.Compiled : RegexOptions.None));

#endif

} catch (ArgumentException e) {

throw PythonExceptions.CreateThrowable(error(context), e.Message);

}

this._compileFlags = flags;

}

public RE_Match match(object text) {

string input = ValidateString(text, "text");

return RE_Match.makeMatch(_re.Match(input), this, input, 0, input.Length);

}

private static int FixPosition(string text, int position) {

if (position < 0) return 0;

if (position > text.Length) return text.Length;

return position;

}

public RE_Match match(object text, int pos) {

string input = ValidateString(text, "text");

pos = FixPosition(input, pos);

return RE_Match.makeMatch(_re.Match(input, pos), this, input, pos, input.Length);

}

public RE_Match match(object text, [DefaultParameterValue(0)]int pos, int endpos) {

string input = ValidateString(text, "text");

pos = FixPosition(input, pos);

endpos = FixPosition(input, endpos);

return RE_Match.makeMatch(

_re.Match(input.Substring(0, endpos), pos),

this,

input,

pos,

endpos);

}

public RE_Match search(object text) {

string input = ValidateString(text, "text");

return RE_Match.make(_re.Match(input), this, input);

}

public RE_Match search(object text, int pos) {

string input = ValidateString(text, "text");

return RE_Match.make(_re.Match(input, pos, input.Length - pos), this, input);

}

public RE_Match search(object text, int pos, int endpos) {

string input = ValidateString(text, "text");

return RE_Match.make(_re.Match(input, pos, Math.Min(Math.Max(endpos - pos, 0), input.Length - pos)), this, input);

}

public object findall(CodeContext/*!*/ context, string @string) {

return findall(context, @string, 0, null);

}

public object findall(CodeContext/*!*/ context, string @string, int pos) {

return findall(context, @string, pos, null);

}

public object findall(CodeContext/*!*/ context, object @string, int pos, object endpos) {

MatchCollection mc = FindAllWorker(context, ValidateString(@string, "text"), pos, endpos);

return FixFindAllMatch(this, mc, FindMaker(@string));

}

internal MatchCollection FindAllWorker(CodeContext/*!*/ context, string str, int pos, object endpos) {

string against = str;

if (endpos != null) {

int end = PythonContext.GetContext(context).ConvertToInt32(endpos);

against = against.Substring(0, Math.Max(end, 0));

}

return _re.Matches(against, pos);

}

internal MatchCollection FindAllWorker(CodeContext/*!*/ context, IList<byte> str, int pos, object endpos) {

string against = str.MakeString();

if (endpos != null) {

int end = PythonContext.GetContext(context).ConvertToInt32(endpos);

against = against.Substring(0, Math.Max(end, 0));

}

return _re.Matches(against, pos);

}

public object finditer(CodeContext/*!*/ context, object @string) {

string input = ValidateString(@string, "string");

return MatchIterator(FindAllWorker(context, input, 0, input.Length), this, input);

}

public object finditer(CodeContext/*!*/ context, object @string, int pos) {

string input = ValidateString(@string, "string");

return MatchIterator(FindAllWorker(context, input, pos, input.Length), this, input);

}

public object finditer(CodeContext/*!*/ context, object @string, int pos, int endpos) {

string input = ValidateString(@string, "string");

return MatchIterator(FindAllWorker(context, input, pos, endpos), this, input);

}

[return: SequenceTypeInfo(typeof(string))]

public List split(string @string) {

return split(@string, 0);

}

[return: SequenceTypeInfo(typeof(string))]

public List split(object @string, int maxsplit) {

List result = new List();

// fast path for negative maxSplit ( == "make no splits")

if (maxsplit < 0) {

result.AddNoLock(ValidateString(@string, "string"));

} else {

// iterate over all matches

string theStr = ValidateString(@string, "string");

MatchCollection matches = _re.Matches(theStr);

int lastPos = 0; // is either start of the string, or first position *after* the last match

int nSplits = 0; // how many splits have occurred?

foreach (Match m in matches) {

if (m.Length > 0) {

// add substring from lastPos to beginning of current match

result.AddNoLock(theStr.Substring(lastPos, m.Index - lastPos));

// if there are subgroups of the match, add their match or None

if (m.Groups.Count > 1)

for (int i = 1; i < m.Groups.Count; i++)

if (m.Groups[i].Success)

result.AddNoLock(m.Groups[i].Value);

else

result.AddNoLock(null);

// update lastPos, nSplits

lastPos = m.Index + m.Length;

nSplits++;

if (nSplits == maxsplit)

break;

}

}

// add tail following last match

result.AddNoLock(theStr.Substring(lastPos));

}

return result;

}

public string sub(CodeContext/*!*/ context, object repl, object @string) {

return sub(context, repl, ValidateString(@string, "string"), Int32.MaxValue);

}

public string sub(CodeContext/*!*/ context, object repl, object @string, int count) {

if (repl == null) throw PythonOps.TypeError("NoneType is not valid repl");

// if 'count' is omitted or 0, all occurrences are replaced

if (count == 0) count = Int32.MaxValue;

string replacement = repl as string;

if (replacement == null) {

if (repl is ExtensibleString) {

replacement = ((ExtensibleString)repl).Value;

} else if (repl is Bytes) {

replacement = ((Bytes)repl).ToString();

}

}

Match prev = null;

string input = ValidateString(@string, "string");

return _re.Replace(

input,

delegate(Match match) {

// from the docs: Empty matches for the pattern are replaced

// only when not adjacent to a previous match

if (String.IsNullOrEmpty(match.Value) && prev != null &&

(prev.Index + prev.Length) == match.Index) {

return "";

};

prev = match;

if (replacement != null) return UnescapeGroups(match, replacement);

return PythonCalls.Call(context, repl, RE_Match.make(match, this, input)) as string;

},

count);

}

public object subn(CodeContext/*!*/ context, object repl, string @string) {

return subn(context, repl, @string, Int32.MaxValue);

}

public object subn(CodeContext/*!*/ context, object repl, object @string, int count) {

if (repl == null) throw PythonOps.TypeError("NoneType is not valid repl");

// if 'count' is omitted or 0, all occurrences are replaced

if (count == 0) count = Int32.MaxValue;

int totalCount = 0;

string res;

string replacement = repl as string;

if (replacement == null) {

if (repl is ExtensibleString) {

replacement = ((ExtensibleString)repl).Value;

} else if (repl is Bytes) {

replacement = ((Bytes)repl).ToString();

}

}

Match prev = null;

string input = ValidateString(@string, "string");

res = _re.Replace(

input,

delegate(Match match) {

// from the docs: Empty matches for the pattern are replaced

// only when not adjacent to a previous match

if (String.IsNullOrEmpty(match.Value) && prev != null &&

(prev.Index + prev.Length) == match.Index) {

return "";

};

prev = match;

totalCount++;

if (replacement != null) return UnescapeGroups(match, replacement);

return PythonCalls.Call(context, repl, RE_Match.make(match, this, input)) as string;

},

count);

return PythonTuple.MakeTuple(res, totalCount);

}

public int flags {

get {

return _compileFlags;

}

}

public PythonDictionary groupindex {

get {

if (_groups == null) {

PythonDictionary d = new PythonDictionary();

string[] names = _re.GetGroupNames();

int[] nums = _re.GetGroupNumbers();

for (int i = 1; i < names.Length; i++) {

if (Char.IsDigit(names[i][0]) || names[i].StartsWith(_mangledNamedGroup)) {

// skip numeric names and our mangling for unnamed groups mixed w/ named groups.

continue;

}

d[names[i]] = nums[i];

}

_groups = d;

}

return _groups;

}

}

public int groups {

get {

return _re.GetGroupNumbers().Length - 1;

}

}

public string pattern {

get {

return _pre.UserPattern;

}

}

public override bool Equals(object obj) {

RE_Pattern other = obj as RE_Pattern;

if (other == null) {

return false;

}

return other.pattern == pattern && other.flags == flags;

}

public override int GetHashCode() {

return pattern.GetHashCode() ^ flags;

}

#region IWeakReferenceable Members

WeakRefTracker IWeakReferenceable.GetWeakRef() {

return _weakRefTracker;

}

bool IWeakReferenceable.SetWeakRef(WeakRefTracker value) {

_weakRefTracker = value;

return true;

}

void IWeakReferenceable.SetFinalizer(WeakRefTracker value) {

((IWeakReferenceable)this).SetWeakRef(value);

}

#endregion

}

public static PythonTuple _pickle(CodeContext/*!*/ context, RE_Pattern pattern) {

object scope = Importer.ImportModule(context, new PythonDictionary(), "re", false, 0);

object compile;

if (scope is PythonModule && ((PythonModule)scope).__dict__.TryGetValue("compile", out compile)) {

return PythonTuple.MakeTuple(compile, PythonTuple.MakeTuple(pattern.pattern, pattern.flags));

}

throw new InvalidOperationException("couldn't find compile method");

}

[PythonType]

public class RE_Match {

RE_Pattern _pattern;

private Match _m;

private string _text;

private int _lastindex = -1;

private int _pos, _endPos;

#region Internal makers

internal static RE_Match make(Match m, RE_Pattern pattern, string input) {

if (m.Success) return new RE_Match(m, pattern, input, 0, input.Length);

return null;

}

internal static RE_Match make(Match m, RE_Pattern pattern, string input, int offset, int endpos) {

if (m.Success) return new RE_Match(m, pattern, input, offset, endpos);

return null;

}

internal static RE_Match makeMatch(Match m, RE_Pattern pattern, string input, int offset, int endpos) {

if (m.Success && m.Index == offset) return new RE_Match(m, pattern, input, offset, endpos);

return null;

}

#endregion

#region Public ctors

public RE_Match(Match m, RE_Pattern pattern, string text) {

_m = m;

_pattern = pattern;

_text = text;

}

public RE_Match(Match m, RE_Pattern pattern, string text, int pos, int endpos) {

_m = m;

_pattern = pattern;

_text = text;

_pos = pos;

_endPos = endpos;

}

#endregion

// public override bool __nonzero__() {

// return m.Success;

// }

#region Public API Surface

public int end() {

return _m.Index + _m.Length;

}

public int start() {

return _m.Index;

}

public int start(object group) {

int grpIndex = GetGroupIndex(group);

if (!_m.Groups[grpIndex].Success) {

return -1;

}

return _m.Groups[grpIndex].Index;

}

public int end(object group) {

int grpIndex = GetGroupIndex(group);

if (!_m.Groups[grpIndex].Success) {

return -1;

}

return _m.Groups[grpIndex].Index + _m.Groups[grpIndex].Length;

}

public object group(object index, params object[] additional) {

if (additional.Length == 0) {

return group(index);

}

object[] res = new object[additional.Length + 1];

res[0] = _m.Groups[GetGroupIndex(index)].Success ? _m.Groups[GetGroupIndex(index)].Value : null;

for (int i = 1; i < res.Length; i++) {

int grpIndex = GetGroupIndex(additional[i - 1]);

res[i] = _m.Groups[grpIndex].Success ? _m.Groups[grpIndex].Value : null;

}

return PythonTuple.MakeTuple(res);

}

public string group(object index) {

int pos = GetGroupIndex(index);

Group g = _m.Groups[pos];

return g.Success ? g.Value : null;

}

public string group() {

return group(0);

}

[return: SequenceTypeInfo(typeof(string))]

public PythonTuple groups() {

return groups(null);

}

public PythonTuple groups(object @default) {

object[] ret = new object[_m.Groups.Count - 1];

for (int i = 1; i < _m.Groups.Count; i++) {

if (!_m.Groups[i].Success) {

ret[i - 1] = @default;

} else {

ret[i - 1] = _m.Groups[i].Value;

}

}

return PythonTuple.MakeTuple(ret);

}