| // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file | |
| // for details. All rights reserved. Use of this source code is governed by a | |
| // BSD-style license that can be found in the LICENSE file. | |
| import "dart:collection" show LinkedList, LinkedListEntry; | |
| patch class RegExp { | |
| /* patch */ factory RegExp(String source, | |
| {bool multiLine: false, | |
| bool caseSensitive: true}) { | |
| _RegExpHashKey key = new _RegExpHashKey( | |
| source, multiLine, caseSensitive); | |
| _RegExpHashValue value = _cache[key]; | |
| if (value == null) { | |
| if (_cache.length > _MAX_CACHE_SIZE) { | |
| _RegExpHashKey lastKey = _recentlyUsed.last; | |
| lastKey.unlink(); | |
| _cache.remove(lastKey); | |
| } | |
| value = new _RegExpHashValue( | |
| new _RegExp(source, | |
| multiLine: multiLine, | |
| caseSensitive: caseSensitive), | |
| key); | |
| _cache[key] = value; | |
| } else { | |
| value.key.unlink(); | |
| } | |
| assert(value != null); | |
| _recentlyUsed.addFirst(value.key); | |
| assert(_recentlyUsed.length == _cache.length); | |
| // TODO(zerny): We might not want to canonicalize regexp objects. | |
| return value.regexp; | |
| } | |
| // Regular expression objects are stored in a cache of up to _MAX_CACHE_SIZE | |
| // elements using an LRU eviction strategy. | |
| // TODO(zerny): Do not impose a fixed limit on the number of cached objects. | |
| // Other possibilities could be limiting by the size of the regexp objects, | |
| // or imposing a lower time bound for the most recent use under which a regexp | |
| // may not be removed from the cache. | |
| // TODO(zerny): Use self-sizing cache similar to _AccessorCache in | |
| // mirrors_impl.dart. | |
| static const int _MAX_CACHE_SIZE = 256; | |
| static final Map<_RegExpHashKey, _RegExpHashValue> _cache = | |
| new HashMap<_RegExpHashKey, _RegExpHashValue>(); | |
| static final LinkedList<_RegExpHashKey> _recentlyUsed = | |
| new LinkedList<_RegExpHashKey>(); | |
| } | |
| // Represents both a key in the regular expression cache as well as its | |
| // corresponding entry in the LRU list. | |
| class _RegExpHashKey extends LinkedListEntry<_RegExpHashKey> { | |
| final String pattern; | |
| final bool multiLine; | |
| final bool caseSensitive; | |
| _RegExpHashKey(this.pattern, this.multiLine, this.caseSensitive); | |
| int get hashCode => pattern.hashCode; | |
| bool operator==(_RegExpHashKey that) { | |
| return (this.pattern == that.pattern) && | |
| (this.multiLine == that.multiLine) && | |
| (this.caseSensitive == that.caseSensitive); | |
| } | |
| } | |
| // Represents a value in the regular expression cache. Contains a pointer | |
| // back to the key in order to access the corresponding LRU entry. | |
| class _RegExpHashValue { | |
| final _RegExp regexp; | |
| final _RegExpHashKey key; | |
| _RegExpHashValue(this.regexp, this.key); | |
| } | |
| class _RegExpMatch implements Match { | |
| _RegExpMatch(this._regexp, this.input, this._match); | |
| int get start => _start(0); | |
| int get end => _end(0); | |
| int _start(int groupIdx) { | |
| return _match[(groupIdx * _MATCH_PAIR)]; | |
| } | |
| int _end(int groupIdx) { | |
| return _match[(groupIdx * _MATCH_PAIR) + 1]; | |
| } | |
| String group(int groupIdx) { | |
| if (groupIdx < 0 || groupIdx > _regexp._groupCount) { | |
| throw new RangeError.value(groupIdx); | |
| } | |
| int startIndex = _start(groupIdx); | |
| int endIndex = _end(groupIdx); | |
| if (startIndex == -1) { | |
| assert(endIndex == -1); | |
| return null; | |
| } | |
| return input._substringUnchecked(startIndex, endIndex); | |
| } | |
| String operator [](int groupIdx) { | |
| return this.group(groupIdx); | |
| } | |
| List<String> groups(List<int> groupsSpec) { | |
| var groupsList = new List<String>(groupsSpec.length); | |
| for (int i = 0; i < groupsSpec.length; i++) { | |
| groupsList[i] = group(groupsSpec[i]); | |
| } | |
| return groupsList; | |
| } | |
| int get groupCount => _regexp._groupCount; | |
| Pattern get pattern => _regexp; | |
| final RegExp _regexp; | |
| final String input; | |
| final List<int> _match; | |
| static const int _MATCH_PAIR = 2; | |
| } | |
| class _RegExp implements RegExp { | |
| factory _RegExp( | |
| String pattern, | |
| {bool multiLine: false, | |
| bool caseSensitive: true}) native "RegExp_factory"; | |
| Match firstMatch(String str) { | |
| if (str is! String) throw new ArgumentError(str); | |
| List match = _ExecuteMatch(str, 0); | |
| if (match == null) { | |
| return null; | |
| } | |
| return new _RegExpMatch(this, str, match); | |
| } | |
| Iterable<Match> allMatches(String string, [int start = 0]) { | |
| if (string is! String) throw new ArgumentError(string); | |
| if (start is! int) throw new ArgumentError(start); | |
| if (0 > start || start > string.length) { | |
| throw new RangeError.range(start, 0, string.length); | |
| } | |
| return new _AllMatchesIterable(this, string, start); | |
| } | |
| Match matchAsPrefix(String string, [int start = 0]) { | |
| if (string is! String) throw new ArgumentError(string); | |
| if (start is! int) throw new ArgumentError(start); | |
| if (start < 0 || start > string.length) { | |
| throw new RangeError.range(start, 0, string.length); | |
| } | |
| // Inefficient check that searches for a later match too. | |
| // Change this when possible. | |
| List<int> list = _ExecuteMatch(string, start); | |
| if (list == null) return null; | |
| if (list[0] != start) return null; | |
| return new _RegExpMatch(this, string, list); | |
| } | |
| bool hasMatch(String str) { | |
| if (str is! String) throw new ArgumentError(str); | |
| List match = _ExecuteMatch(str, 0); | |
| return (match == null) ? false : true; | |
| } | |
| String stringMatch(String str) { | |
| if (str is! String) throw new ArgumentError(str); | |
| List match = _ExecuteMatch(str, 0); | |
| if (match == null) { | |
| return null; | |
| } | |
| return str._substringUnchecked(match[0], match[1]); | |
| } | |
| String get pattern native "RegExp_getPattern"; | |
| bool get isMultiLine native "RegExp_getIsMultiLine"; | |
| bool get isCaseSensitive native "RegExp_getIsCaseSensitive"; | |
| int get _groupCount native "RegExp_getGroupCount"; | |
| // Byte map of one byte characters with a 0xff if the character is a word | |
| // character (digit, letter or underscore) and 0x00 otherwise. | |
| // Used by generated RegExp code. | |
| static const List<int> _wordCharacterMap = const <int>[ | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, // '0' - '7' | |
| 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, // '8' - '9' | |
| 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, // 'A' - 'G' | |
| 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, // 'H' - 'O' | |
| 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, // 'P' - 'W' | |
| 0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0xff, // 'X' - 'Z', '_' | |
| 0x00, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, // 'a' - 'g' | |
| 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, // 'h' - 'o' | |
| 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, // 'p' - 'w' | |
| 0xff, 0xff, 0xff, 0x00, 0x00, 0x00, 0x00, 0x00, // 'x' - 'z' | |
| // Latin-1 range | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, | |
| ]; | |
| List _ExecuteMatch(String str, int start_index) | |
| native "RegExp_ExecuteMatch"; | |
| } | |
| class _AllMatchesIterable extends IterableBase<Match> { | |
| final _RegExp _re; | |
| final String _str; | |
| final int _start; | |
| _AllMatchesIterable(this._re, this._str, this._start); | |
| Iterator<Match> get iterator => new _AllMatchesIterator(_re, _str, _start); | |
| } | |
| class _AllMatchesIterator implements Iterator<Match> { | |
| final String _str; | |
| int _nextIndex; | |
| _RegExp _re; | |
| Match _current; | |
| _AllMatchesIterator(this._re, this._str, this._nextIndex); | |
| Match get current => _current; | |
| bool moveNext() { | |
| if (_re == null) return false; // Cleared after a failed match. | |
| if (_nextIndex <= _str.length) { | |
| var match = _re._ExecuteMatch(_str, _nextIndex); | |
| if (match != null) { | |
| _current = new _RegExpMatch(_re, _str, match); | |
| _nextIndex = _current.end; | |
| if (_nextIndex == _current.start) { | |
| // Zero-width match. Advance by one more. | |
| _nextIndex++; | |
| } | |
| return true; | |
| } | |
| } | |
| _current = null; | |
| _re = null; | |
| return false; | |
| } | |
| } |