lrn@google.com
ca66944f5a
Slower for strings with trailing, but no leading, whitespace, but significantly faster for strings with no whitespace, which is presumed to be the most common case. R=floitsch@google.com, srdjan@google.com Review URL: https://codereview.chromium.org//398813002 git-svn-id: https://dart.googlecode.com/svn/branches/bleeding_edge/dart@38848 260f80e4-7a28-3924-810f-c04153c831b5
1011 lines
32 KiB
Dart
1011 lines
32 KiB
Dart
// 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.
|
|
|
|
patch class String {
|
|
/* patch */ factory String.fromCharCodes(Iterable<int> charCodes) {
|
|
return _StringBase.createFromCharCodes(charCodes);
|
|
}
|
|
|
|
/* patch */ factory String.fromCharCode(int charCode) {
|
|
if (charCode >= 0) {
|
|
if (charCode <= 0xff) {
|
|
return _OneByteString._allocate(1).._setAt(0, charCode);
|
|
}
|
|
if (charCode <= 0xffff) {
|
|
return _StringBase._createFromCodePoints(new _List(1)..[0] = charCode);
|
|
}
|
|
if (charCode <= 0x10ffff) {
|
|
var low = 0xDC00 | (charCode & 0x3ff);
|
|
int bits = charCode - 0x10000;
|
|
var high = 0xD800 | (bits >> 10);
|
|
return _StringBase._createFromCodePoints(new _List(2)..[0] = high
|
|
..[1] = low);
|
|
}
|
|
}
|
|
throw new RangeError.range(charCode, 0, 0x10ffff);
|
|
}
|
|
|
|
/* patch */ const factory String.fromEnvironment(String name,
|
|
{String defaultValue})
|
|
native "String_fromEnvironment";
|
|
}
|
|
|
|
|
|
/**
|
|
* [_StringBase] contains common methods used by concrete String
|
|
* implementations, e.g., _OneByteString.
|
|
*/
|
|
class _StringBase {
|
|
|
|
factory _StringBase._uninstantiable() {
|
|
throw new UnsupportedError(
|
|
"_StringBase can't be instaniated");
|
|
}
|
|
|
|
Type get runtimeType => String;
|
|
|
|
int get hashCode native "String_getHashCode";
|
|
|
|
/**
|
|
* Create the most efficient string representation for specified
|
|
* [codePoints].
|
|
*/
|
|
static String createFromCharCodes(Iterable<int> charCodes) {
|
|
if (charCodes != null) {
|
|
// TODO(srdjan): Also skip copying of wide typed arrays.
|
|
final ccid = ClassID.getID(charCodes);
|
|
bool isOneByteString = false;
|
|
if ((ccid != ClassID.cidArray) &&
|
|
(ccid != ClassID.cidGrowableObjectArray) &&
|
|
(ccid != ClassID.cidImmutableArray)) {
|
|
if ((charCodes is Uint8List) || (charCodes is Int8List)) {
|
|
isOneByteString = true;
|
|
} else {
|
|
charCodes = new List<int>.from(charCodes, growable: false);
|
|
}
|
|
}
|
|
final len = charCodes.length;
|
|
if (!isOneByteString) {
|
|
for (int i = 0; i < len; i++) {
|
|
int e = charCodes[i];
|
|
if (e is! _Smi) throw new ArgumentError(e);
|
|
// Is e Latin1?
|
|
if ((e < 0) || (e > 0xFF)) {
|
|
return _createFromCodePoints(charCodes);
|
|
}
|
|
}
|
|
}
|
|
// Allocate a one byte string. When the list is 128 entries or longer,
|
|
// it's faster to perform a runtime-call.
|
|
if (len >= 128) {
|
|
return _OneByteString._allocateFromOneByteList(charCodes);
|
|
}
|
|
var s = _OneByteString._allocate(len);
|
|
for (int i = 0; i < len; i++) {
|
|
s._setAt(i, charCodes[i]);
|
|
}
|
|
return s;
|
|
}
|
|
return _createFromCodePoints(charCodes);
|
|
}
|
|
|
|
static String _createFromCodePoints(List<int> codePoints)
|
|
native "StringBase_createFromCodePoints";
|
|
|
|
String operator [](int index) native "String_charAt";
|
|
|
|
int codeUnitAt(int index) native "String_codeUnitAt";
|
|
|
|
int get length native "String_getLength";
|
|
|
|
bool get isEmpty {
|
|
return this.length == 0;
|
|
}
|
|
|
|
bool get isNotEmpty => !isEmpty;
|
|
|
|
String operator +(String other) native "String_concat";
|
|
|
|
String toString() {
|
|
return this;
|
|
}
|
|
|
|
bool operator ==(Object other) {
|
|
if (identical(this, other)) {
|
|
return true;
|
|
}
|
|
if ((other is! String) ||
|
|
(this.length != other.length)) {
|
|
return false;
|
|
}
|
|
final len = this.length;
|
|
for (int i = 0; i < len; i++) {
|
|
if (this.codeUnitAt(i) != other.codeUnitAt(i)) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
int compareTo(String other) {
|
|
int thisLength = this.length;
|
|
int otherLength = other.length;
|
|
int len = (thisLength < otherLength) ? thisLength : otherLength;
|
|
for (int i = 0; i < len; i++) {
|
|
int thisCodeUnit = this.codeUnitAt(i);
|
|
int otherCodeUnit = other.codeUnitAt(i);
|
|
if (thisCodeUnit < otherCodeUnit) {
|
|
return -1;
|
|
}
|
|
if (thisCodeUnit > otherCodeUnit) {
|
|
return 1;
|
|
}
|
|
}
|
|
if (thisLength < otherLength) return -1;
|
|
if (thisLength > otherLength) return 1;
|
|
return 0;
|
|
}
|
|
|
|
bool _substringMatches(int start, String other) {
|
|
if (other.isEmpty) return true;
|
|
final len = other.length;
|
|
if ((start < 0) || (start + len > this.length)) {
|
|
return false;
|
|
}
|
|
for (int i = 0; i < len; i++) {
|
|
if (this.codeUnitAt(i + start) != other.codeUnitAt(i)) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
bool endsWith(String other) {
|
|
return _substringMatches(this.length - other.length, other);
|
|
}
|
|
|
|
bool startsWith(Pattern pattern, [int index = 0]) {
|
|
if ((index < 0) || (index > this.length)) {
|
|
throw new RangeError.range(index, 0, this.length);
|
|
}
|
|
if (pattern is String) {
|
|
return _substringMatches(index, pattern);
|
|
}
|
|
return pattern.matchAsPrefix(this, index) != null;
|
|
}
|
|
|
|
int indexOf(Pattern pattern, [int start = 0]) {
|
|
if ((start < 0) || (start > this.length)) {
|
|
throw new RangeError.range(start, 0, this.length);
|
|
}
|
|
if (pattern is String) {
|
|
String other = pattern;
|
|
int maxIndex = this.length - other.length;
|
|
// TODO: Use an efficient string search (e.g. BMH).
|
|
for (int index = start; index <= maxIndex; index++) {
|
|
if (_substringMatches(index, other)) {
|
|
return index;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
for (int i = start; i <= this.length; i++) {
|
|
// TODO(11276); This has quadratic behavior because matchAsPrefix tries
|
|
// to find a later match too. Optimize matchAsPrefix to avoid this.
|
|
if (pattern.matchAsPrefix(this, i) != null) return i;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
int lastIndexOf(Pattern pattern, [int start = null]) {
|
|
if (start == null) {
|
|
start = this.length;
|
|
} else if (start < 0 || start > this.length) {
|
|
throw new RangeError.range(start, 0, this.length);
|
|
}
|
|
if (pattern is String) {
|
|
String other = pattern;
|
|
int maxIndex = this.length - other.length;
|
|
if (maxIndex < start) start = maxIndex;
|
|
for (int index = start; index >= 0; index--) {
|
|
if (_substringMatches(index, other)) {
|
|
return index;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
for (int i = start; i >= 0; i--) {
|
|
// TODO(11276); This has quadratic behavior because matchAsPrefix tries
|
|
// to find a later match too. Optimize matchAsPrefix to avoid this.
|
|
if (pattern.matchAsPrefix(this, i) != null) return i;
|
|
}
|
|
return -1;
|
|
}
|
|
|
|
String substring(int startIndex, [int endIndex]) {
|
|
if (endIndex == null) endIndex = this.length;
|
|
|
|
if ((startIndex < 0) || (startIndex > this.length)) {
|
|
throw new RangeError.value(startIndex);
|
|
}
|
|
if ((endIndex < 0) || (endIndex > this.length)) {
|
|
throw new RangeError.value(endIndex);
|
|
}
|
|
if (startIndex > endIndex) {
|
|
throw new RangeError.value(startIndex);
|
|
}
|
|
return _substringUnchecked(startIndex, endIndex);
|
|
}
|
|
|
|
String _substringUnchecked(int startIndex, int endIndex) {
|
|
assert(endIndex != null);
|
|
assert((startIndex >= 0) && (startIndex <= this.length));
|
|
assert((endIndex >= 0) && (endIndex <= this.length));
|
|
assert(startIndex <= endIndex);
|
|
|
|
if (startIndex == endIndex) {
|
|
return "";
|
|
}
|
|
if ((startIndex + 1) == endIndex) {
|
|
return this[startIndex];
|
|
}
|
|
return _substringUncheckedNative(startIndex, endIndex);
|
|
}
|
|
|
|
String _substringUncheckedNative(int startIndex, int endIndex)
|
|
native "StringBase_substringUnchecked";
|
|
|
|
// Checks for one-byte whitespaces only.
|
|
static bool _isOneByteWhitespace(int codePoint) {
|
|
return
|
|
(codePoint == 32) || // Space.
|
|
((codePoint <= 13) ? (9 <= codePoint) // CR, LF, TAB, etc.
|
|
: ((codePoint == 0x85) || // NEL
|
|
(codePoint == 0xA0))); // NBSP
|
|
}
|
|
|
|
// Characters with Whitespace property (Unicode 6.2).
|
|
// 0009..000D ; White_Space # Cc <control-0009>..<control-000D>
|
|
// 0020 ; White_Space # Zs SPACE
|
|
// 0085 ; White_Space # Cc <control-0085>
|
|
// 00A0 ; White_Space # Zs NO-BREAK SPACE
|
|
// 1680 ; White_Space # Zs OGHAM SPACE MARK
|
|
// 180E ; White_Space # Zs MONGOLIAN VOWEL SEPARATOR
|
|
// 2000..200A ; White_Space # Zs EN QUAD..HAIR SPACE
|
|
// 2028 ; White_Space # Zl LINE SEPARATOR
|
|
// 2029 ; White_Space # Zp PARAGRAPH SEPARATOR
|
|
// 202F ; White_Space # Zs NARROW NO-BREAK SPACE
|
|
// 205F ; White_Space # Zs MEDIUM MATHEMATICAL SPACE
|
|
// 3000 ; White_Space # Zs IDEOGRAPHIC SPACE
|
|
//
|
|
// BOM: 0xFEFF
|
|
static bool _isTwoByteWhitespace(int codeUnit) {
|
|
if (codeUnit <= 0xA0) return _isOneByteWhitespace(codeUnit);
|
|
return (codeUnit <= 0x200A)
|
|
? ((codeUnit == 0x1680) ||
|
|
(codeUnit == 0x180E) ||
|
|
(0x2000 <= codeUnit))
|
|
: ((codeUnit == 0x2028) ||
|
|
(codeUnit == 0x2029) ||
|
|
(codeUnit == 0x202F) ||
|
|
(codeUnit == 0x205F) ||
|
|
(codeUnit == 0x3000) ||
|
|
(codeUnit == 0xFEFF));
|
|
}
|
|
|
|
int _firstNonWhitespace() {
|
|
final len = this.length;
|
|
int first = 0;
|
|
for (; first < len; first++) {
|
|
if (!_isWhitespace(this.codeUnitAt(first))) {
|
|
break;
|
|
}
|
|
}
|
|
return first;
|
|
}
|
|
|
|
int _lastNonWhitespace() {
|
|
int last = this.length - 1;
|
|
for (; last >= 0; last--) {
|
|
if (!_isWhitespace(this.codeUnitAt(last))) {
|
|
break;
|
|
}
|
|
}
|
|
return last;
|
|
}
|
|
|
|
String trim() {
|
|
final len = this.length;
|
|
int first = _firstNonWhitespace();
|
|
if (len == first) {
|
|
// String contains only whitespaces.
|
|
return "";
|
|
}
|
|
int last = _lastNonWhitespace() + 1;
|
|
if ((first == 0) && (last == len)) {
|
|
// Returns this string since it does not have leading or trailing
|
|
// whitespaces.
|
|
return this;
|
|
}
|
|
return _substringUnchecked(first, last);
|
|
}
|
|
|
|
String trimLeft() {
|
|
final len = this.length;
|
|
int first = 0;
|
|
for (; first < len; first++) {
|
|
if (!_isWhitespace(this.codeUnitAt(first))) {
|
|
break;
|
|
}
|
|
}
|
|
if (len == first) {
|
|
// String contains only whitespaces.
|
|
return "";
|
|
}
|
|
if (first == 0) {
|
|
// Returns this string since it does not have leading or trailing
|
|
// whitespaces.
|
|
return this;
|
|
}
|
|
return _substringUnchecked(first, len);
|
|
}
|
|
|
|
String trimRight() {
|
|
final len = this.length;
|
|
int last = len - 1;
|
|
for (; last >= 0; last--) {
|
|
if (!_isWhitespace(this.codeUnitAt(last))) {
|
|
break;
|
|
}
|
|
}
|
|
if (last == -1) {
|
|
// String contains only whitespaces.
|
|
return "";
|
|
}
|
|
if (last == (len - 1)) {
|
|
// Returns this string since it does not have trailing whitespaces.
|
|
return this;
|
|
}
|
|
return _substringUnchecked(0, last + 1);
|
|
}
|
|
|
|
String operator*(int times) {
|
|
if (times <= 0) return "";
|
|
if (times == 1) return this;
|
|
StringBuffer buffer = new StringBuffer(this);
|
|
for (int i = 1; i < times; i++) {
|
|
buffer.write(this);
|
|
}
|
|
return buffer.toString();
|
|
}
|
|
|
|
String padLeft(int width, [String padding = ' ']) {
|
|
int delta = width - this.length;
|
|
if (delta <= 0) return this;
|
|
StringBuffer buffer = new StringBuffer();
|
|
for (int i = 0; i < delta; i++) {
|
|
buffer.write(padding);
|
|
}
|
|
buffer.write(this);
|
|
return buffer.toString();
|
|
}
|
|
|
|
String padRight(int width, [String padding = ' ']) {
|
|
int delta = width - this.length;
|
|
if (delta <= 0) return this;
|
|
StringBuffer buffer = new StringBuffer(this);
|
|
for (int i = 0; i < delta; i++) {
|
|
buffer.write(padding);
|
|
}
|
|
return buffer.toString();
|
|
}
|
|
|
|
bool contains(Pattern pattern, [int startIndex = 0]) {
|
|
if (pattern is String) {
|
|
if (startIndex < 0 || startIndex > this.length) {
|
|
throw new RangeError.range(startIndex, 0, this.length);
|
|
}
|
|
return indexOf(pattern, startIndex) >= 0;
|
|
}
|
|
return pattern.allMatches(this.substring(startIndex)).isNotEmpty;
|
|
}
|
|
|
|
String replaceFirst(Pattern pattern, String replacement) {
|
|
if (pattern is! Pattern) {
|
|
throw new ArgumentError("${pattern} is not a Pattern");
|
|
}
|
|
if (replacement is! String) {
|
|
throw new ArgumentError("${replacement} is not a String");
|
|
}
|
|
StringBuffer buffer = new StringBuffer();
|
|
int startIndex = 0;
|
|
Iterator iterator = pattern.allMatches(this).iterator;
|
|
if (iterator.moveNext()) {
|
|
Match match = iterator.current;
|
|
buffer..write(this.substring(startIndex, match.start))
|
|
..write(replacement);
|
|
startIndex = match.end;
|
|
}
|
|
return (buffer..write(this.substring(startIndex))).toString();
|
|
}
|
|
|
|
String replaceAll(Pattern pattern, String replacement) {
|
|
if (pattern is! Pattern) {
|
|
throw new ArgumentError("${pattern} is not a Pattern");
|
|
}
|
|
if (replacement is! String) {
|
|
throw new ArgumentError(
|
|
"${replacement} is not a String or Match->String function");
|
|
}
|
|
StringBuffer buffer = new StringBuffer();
|
|
int startIndex = 0;
|
|
for (Match match in pattern.allMatches(this)) {
|
|
buffer..write(this.substring(startIndex, match.start))
|
|
..write(replacement);
|
|
startIndex = match.end;
|
|
}
|
|
return (buffer..write(this.substring(startIndex))).toString();
|
|
}
|
|
|
|
String replaceAllMapped(Pattern pattern, String replace(Match match)) {
|
|
return splitMapJoin(pattern, onMatch: replace);
|
|
}
|
|
|
|
static String _matchString(Match match) => match[0];
|
|
static String _stringIdentity(String string) => string;
|
|
|
|
String _splitMapJoinEmptyString(String onMatch(Match match),
|
|
String onNonMatch(String nonMatch)) {
|
|
// Pattern is the empty string.
|
|
StringBuffer buffer = new StringBuffer();
|
|
int length = this.length;
|
|
int i = 0;
|
|
buffer.write(onNonMatch(""));
|
|
while (i < length) {
|
|
buffer.write(onMatch(new _StringMatch(i, this, "")));
|
|
// Special case to avoid splitting a surrogate pair.
|
|
int code = this.codeUnitAt(i);
|
|
if ((code & ~0x3FF) == 0xD800 && length > i + 1) {
|
|
// Leading surrogate;
|
|
code = this.codeUnitAt(i + 1);
|
|
if ((code & ~0x3FF) == 0xDC00) {
|
|
// Matching trailing surrogate.
|
|
buffer.write(onNonMatch(this.substring(i, i + 2)));
|
|
i += 2;
|
|
continue;
|
|
}
|
|
}
|
|
buffer.write(onNonMatch(this[i]));
|
|
i++;
|
|
}
|
|
buffer.write(onMatch(new _StringMatch(i, this, "")));
|
|
buffer.write(onNonMatch(""));
|
|
return buffer.toString();
|
|
}
|
|
|
|
String splitMapJoin(Pattern pattern,
|
|
{String onMatch(Match match),
|
|
String onNonMatch(String nonMatch)}) {
|
|
if (pattern is! Pattern) {
|
|
throw new ArgumentError("${pattern} is not a Pattern");
|
|
}
|
|
if (onMatch == null) onMatch = _matchString;
|
|
if (onNonMatch == null) onNonMatch = _stringIdentity;
|
|
if (pattern is String) {
|
|
String stringPattern = pattern;
|
|
if (stringPattern.isEmpty) {
|
|
return _splitMapJoinEmptyString(onMatch, onNonMatch);
|
|
}
|
|
}
|
|
StringBuffer buffer = new StringBuffer();
|
|
int startIndex = 0;
|
|
for (Match match in pattern.allMatches(this)) {
|
|
buffer.write(onNonMatch(this.substring(startIndex, match.start)));
|
|
buffer.write(onMatch(match).toString());
|
|
startIndex = match.end;
|
|
}
|
|
buffer.write(onNonMatch(this.substring(startIndex)));
|
|
return buffer.toString();
|
|
}
|
|
|
|
|
|
/**
|
|
* Convert all objects in [values] to strings and concat them
|
|
* into a result string.
|
|
*/
|
|
static String _interpolate(List<String> values) {
|
|
final numValues = values.length;
|
|
_List stringList = new List<String>(numValues);
|
|
bool isOneByteString = true;
|
|
int totalLength = 0;
|
|
for (int i = 0; i < numValues; i++) {
|
|
var s = values[i].toString();
|
|
if (isOneByteString && (ClassID.getID(s) == ClassID.cidOneByteString)) {
|
|
totalLength += s.length;
|
|
} else {
|
|
isOneByteString = false;
|
|
if (s is! String) {
|
|
throw new ArgumentError(s);
|
|
}
|
|
}
|
|
stringList[i] = s;
|
|
}
|
|
if (isOneByteString) {
|
|
return _OneByteString._concatAll(stringList, totalLength);
|
|
}
|
|
return _concatRangeNative(stringList, 0, stringList.length);
|
|
}
|
|
|
|
Iterable<Match> allMatches(String str) {
|
|
List<Match> result = new List<Match>();
|
|
int length = str.length;
|
|
int patternLength = this.length;
|
|
int startIndex = 0;
|
|
while (true) {
|
|
int position = str.indexOf(this, startIndex);
|
|
if (position == -1) {
|
|
break;
|
|
}
|
|
result.add(new _StringMatch(position, str, this));
|
|
int endIndex = position + patternLength;
|
|
if (endIndex == length) {
|
|
break;
|
|
} else if (position == endIndex) {
|
|
++startIndex; // empty match, advance and restart
|
|
} else {
|
|
startIndex = endIndex;
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
Match matchAsPrefix(String string, [int start = 0]) {
|
|
if (start < 0 || start > string.length) {
|
|
throw new RangeError.range(start, 0, string.length);
|
|
}
|
|
if (start + this.length > string.length) return null;
|
|
for (int i = 0; i < this.length; i++) {
|
|
if (string.codeUnitAt(start + i) != this.codeUnitAt(i)) {
|
|
return null;
|
|
}
|
|
}
|
|
return new _StringMatch(start, string, this);
|
|
}
|
|
|
|
List<String> split(Pattern pattern) {
|
|
if ((pattern is String) && pattern.isEmpty) {
|
|
List<String> result = new List<String>(this.length);
|
|
for (int i = 0; i < this.length; i++) {
|
|
result[i] = this[i];
|
|
}
|
|
return result;
|
|
}
|
|
int length = this.length;
|
|
Iterator iterator = pattern.allMatches(this).iterator;
|
|
if (length == 0 && iterator.moveNext()) {
|
|
// A matched empty string input returns the empty list.
|
|
return <String>[];
|
|
}
|
|
List<String> result = new List<String>();
|
|
int startIndex = 0;
|
|
int previousIndex = 0;
|
|
while (true) {
|
|
if (startIndex == length || !iterator.moveNext()) {
|
|
result.add(this._substringUnchecked(previousIndex, length));
|
|
break;
|
|
}
|
|
Match match = iterator.current;
|
|
if (match.start == length) {
|
|
result.add(this._substringUnchecked(previousIndex, length));
|
|
break;
|
|
}
|
|
int endIndex = match.end;
|
|
if (startIndex == endIndex && endIndex == previousIndex) {
|
|
++startIndex; // empty match, advance and restart
|
|
continue;
|
|
}
|
|
result.add(this._substringUnchecked(previousIndex, match.start));
|
|
startIndex = previousIndex = endIndex;
|
|
}
|
|
return result;
|
|
}
|
|
|
|
List<int> get codeUnits => new _CodeUnits(this);
|
|
|
|
Runes get runes => new Runes(this);
|
|
|
|
String toUpperCase() native "String_toUpperCase";
|
|
|
|
String toLowerCase() native "String_toLowerCase";
|
|
|
|
// Concatenate ['start', 'end'[ elements of 'strings'. 'strings' must contain
|
|
// String elements. TODO(srdjan): optimize it.
|
|
static String _concatRange(List<String> strings, int start, int end) {
|
|
if ((end - start) == 1) {
|
|
return strings[start];
|
|
}
|
|
return _concatRangeNative(strings, start, end);
|
|
}
|
|
|
|
// Call this method if not all list elements are known to be OneByteString(s).
|
|
// 'strings' must be an _List or _GrowableList.
|
|
static String _concatRangeNative(List<String> strings, int start, int end)
|
|
native "String_concatRange";
|
|
}
|
|
|
|
|
|
class _OneByteString extends _StringBase implements String {
|
|
|
|
factory _OneByteString._uninstantiable() {
|
|
throw new UnsupportedError(
|
|
"_OneByteString can only be allocated by the VM");
|
|
}
|
|
|
|
int get hashCode native "String_getHashCode";
|
|
|
|
bool _isWhitespace(int codeUnit) {
|
|
return _StringBase._isOneByteWhitespace(codeUnit);
|
|
}
|
|
|
|
bool operator ==(Object other) {
|
|
return super == other;
|
|
}
|
|
|
|
String _substringUncheckedNative(int startIndex, int endIndex)
|
|
native "OneByteString_substringUnchecked";
|
|
|
|
List<String> _splitWithCharCode(int charCode)
|
|
native "OneByteString_splitWithCharCode";
|
|
|
|
List<String> split(Pattern pattern) {
|
|
if ((ClassID.getID(pattern) == ClassID.cidOneByteString) &&
|
|
(pattern.length == 1)) {
|
|
return _splitWithCharCode(pattern.codeUnitAt(0));
|
|
}
|
|
return super.split(pattern);
|
|
}
|
|
|
|
// All element of 'strings' must be OneByteStrings.
|
|
static _concatAll(List<String> strings, int totalLength) {
|
|
// TODO(srdjan): Improve code below and raise or eliminate the limit.
|
|
if (totalLength > 128) {
|
|
// Native is quicker.
|
|
return _StringBase._concatRangeNative(strings, 0, strings.length);
|
|
}
|
|
var res = _OneByteString._allocate(totalLength);
|
|
final stringsLength = strings.length;
|
|
int rIx = 0;
|
|
for (int i = 0; i < stringsLength; i++) {
|
|
_OneByteString e = strings[i];
|
|
final eLength = e.length;
|
|
for (int s = 0; s < eLength; s++) {
|
|
res._setAt(rIx++, e.codeUnitAt(s));
|
|
}
|
|
}
|
|
return res;
|
|
}
|
|
|
|
int indexOf(Pattern pattern, [int start = 0]) {
|
|
// Specialize for single character pattern.
|
|
final pCid = ClassID.getID(pattern);
|
|
if ((pCid == ClassID.cidOneByteString) ||
|
|
(pCid == ClassID.cidTwoByteString) ||
|
|
(pCid == ClassID.cidExternalOneByteString)) {
|
|
final len = this.length;
|
|
if ((pattern.length == 1) && (start >= 0) && (start < len)) {
|
|
final patternCu0 = pattern.codeUnitAt(0);
|
|
if (patternCu0 > 0xFF) {
|
|
return -1;
|
|
}
|
|
for (int i = start; i < len; i++) {
|
|
if (this.codeUnitAt(i) == patternCu0) {
|
|
return i;
|
|
}
|
|
}
|
|
return -1;
|
|
}
|
|
}
|
|
return super.indexOf(pattern, start);
|
|
}
|
|
|
|
bool contains(Pattern pattern, [int start = 0]) {
|
|
final pCid = ClassID.getID(pattern);
|
|
if ((pCid == ClassID.cidOneByteString) ||
|
|
(pCid == ClassID.cidTwoByteString) ||
|
|
(pCid == ClassID.cidExternalOneByteString)) {
|
|
final len = this.length;
|
|
if ((pattern.length == 1) && (start >= 0) && (start < len)) {
|
|
final patternCu0 = pattern.codeUnitAt(0);
|
|
if (patternCu0 > 0xFF) {
|
|
return false;
|
|
}
|
|
for (int i = start; i < len; i++) {
|
|
if (this.codeUnitAt(i) == patternCu0) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
}
|
|
return super.contains(pattern, start);
|
|
}
|
|
|
|
String operator*(int times) {
|
|
if (times <= 0) return "";
|
|
if (times == 1) return this;
|
|
int length = this.length;
|
|
if (this.isEmpty) return this; // Don't clone empty string.
|
|
_OneByteString result = _OneByteString._allocate(length * times);
|
|
int index = 0;
|
|
for (int i = 0; i < times; i ++) {
|
|
for (int j = 0; j < length; j++) {
|
|
result._setAt(index++, this.codeUnitAt(j));
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
String padLeft(int width, [String padding = ' ']) {
|
|
int padCid = ClassID.getID(padding);
|
|
if ((padCid != ClassID.cidOneByteString) &&
|
|
(padCid != ClassID.cidExternalOneByteString)) {
|
|
return super.padLeft(width, padding);
|
|
}
|
|
int length = this.length;
|
|
int delta = width - length;
|
|
if (delta <= 0) return this;
|
|
int padLength = padding.length;
|
|
int resultLength = padLength * delta + length;
|
|
_OneByteString result = _OneByteString._allocate(resultLength);
|
|
int index = 0;
|
|
if (padLength == 1) {
|
|
int padChar = padding.codeUnitAt(0);
|
|
for (int i = 0; i < delta; i++) {
|
|
result._setAt(index++, padChar);
|
|
}
|
|
} else {
|
|
for (int i = 0; i < delta; i++) {
|
|
for (int j = 0; j < padLength; j++) {
|
|
result._setAt(index++, padding.codeUnitAt(j));
|
|
}
|
|
}
|
|
}
|
|
for (int i = 0; i < length; i++) {
|
|
result._setAt(index++, this.codeUnitAt(i));
|
|
}
|
|
return result;
|
|
}
|
|
|
|
String padRight(int width, [String padding = ' ']) {
|
|
int padCid = ClassID.getID(padding);
|
|
if ((padCid != ClassID.cidOneByteString) &&
|
|
(padCid != ClassID.cidExternalOneByteString)) {
|
|
return super.padRight(width, padding);
|
|
}
|
|
int length = this.length;
|
|
int delta = width - length;
|
|
if (delta <= 0) return this;
|
|
int padLength = padding.length;
|
|
int resultLength = length + padLength * delta;
|
|
_OneByteString result = _OneByteString._allocate(resultLength);
|
|
int index = 0;
|
|
for (int i = 0; i < length; i++) {
|
|
result._setAt(index++, this.codeUnitAt(i));
|
|
}
|
|
if (padLength == 1) {
|
|
int padChar = padding.codeUnitAt(0);
|
|
for (int i = 0; i < delta; i++) {
|
|
result._setAt(index++, padChar);
|
|
}
|
|
} else {
|
|
for (int i = 0; i < delta; i++) {
|
|
for (int j = 0; j < padLength; j++) {
|
|
result._setAt(index++, padding.codeUnitAt(j));
|
|
}
|
|
}
|
|
}
|
|
return result;
|
|
}
|
|
|
|
// Lower-case conversion table for Latin-1 as string.
|
|
// Upper-case ranges: 0x41-0x5a ('A' - 'Z'), 0xc0-0xd6, 0xd8-0xde.
|
|
// Conversion to lower case performed by adding 0x20.
|
|
static const _LC_TABLE =
|
|
"\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f"
|
|
"\x10\x11\x12\x13\x14\x15\x16\x17\x18\x19\x1a\x1b\x1c\x1d\x1e\x1f"
|
|
"\x20\x21\x22\x23\x24\x25\x26\x27\x28\x29\x2a\x2b\x2c\x2d\x2e\x2f"
|
|
"\x30\x31\x32\x33\x34\x35\x36\x37\x38\x39\x3a\x3b\x3c\x3d\x3e\x3f"
|
|
"\x40\x61\x62\x63\x64\x65\x66\x67\x68\x69\x6a\x6b\x6c\x6d\x6e\x6f"
|
|
"\x70\x71\x72\x73\x74\x75\x76\x77\x78\x79\x7a\x5b\x5c\x5d\x5e\x5f"
|
|
"\x60\x61\x62\x63\x64\x65\x66\x67\x68\x69\x6a\x6b\x6c\x6d\x6e\x6f"
|
|
"\x70\x71\x72\x73\x74\x75\x76\x77\x78\x79\x7a\x7b\x7c\x7d\x7e\x7f"
|
|
"\x80\x81\x82\x83\x84\x85\x86\x87\x88\x89\x8a\x8b\x8c\x8d\x8e\x8f"
|
|
"\x90\x91\x92\x93\x94\x95\x96\x97\x98\x99\x9a\x9b\x9c\x9d\x9e\x9f"
|
|
"\xa0\xa1\xa2\xa3\xa4\xa5\xa6\xa7\xa8\xa9\xaa\xab\xac\xad\xae\xaf"
|
|
"\xb0\xb1\xb2\xb3\xb4\xb5\xb6\xb7\xb8\xb9\xba\xbb\xbc\xbd\xbe\xbf"
|
|
"\xe0\xe1\xe2\xe3\xe4\xe5\xe6\xe7\xe8\xe9\xea\xeb\xec\xed\xee\xef"
|
|
"\xf0\xf1\xf2\xf3\xf4\xf5\xf6\xd7\xf8\xf9\xfa\xfb\xfc\xfd\xfe\xdf"
|
|
"\xe0\xe1\xe2\xe3\xe4\xe5\xe6\xe7\xe8\xe9\xea\xeb\xec\xed\xee\xef"
|
|
"\xf0\xf1\xf2\xf3\xf4\xf5\xf6\xf7\xf8\xf9\xfa\xfb\xfc\xfd\xfe\xff";
|
|
|
|
// Upper-case conversion table for Latin-1 as string.
|
|
// Lower-case ranges: 0x61-0x7a ('a' - 'z'), 0xe0-0xff.
|
|
// The characters 0xb5 (µ) and 0xff (ÿ) have upper case variants
|
|
// that are not Latin-1. These are both marked as 0x00 in the table.
|
|
// The German "sharp s" \xdf (ß) should be converted into two characters (SS),
|
|
// and is also marked with 0x00.
|
|
// Conversion to lower case performed by subtracting 0x20.
|
|
static const _UC_TABLE =
|
|
"\x00\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0a\x0b\x0c\x0d\x0e\x0f"
|
|
"\x10\x11\x12\x13\x14\x15\x16\x17\x18\x19\x1a\x1b\x1c\x1d\x1e\x1f"
|
|
"\x20\x21\x22\x23\x24\x25\x26\x27\x28\x29\x2a\x2b\x2c\x2d\x2e\x2f"
|
|
"\x30\x31\x32\x33\x34\x35\x36\x37\x38\x39\x3a\x3b\x3c\x3d\x3e\x3f"
|
|
"\x40\x41\x42\x43\x44\x45\x46\x47\x48\x49\x4a\x4b\x4c\x4d\x4e\x4f"
|
|
"\x50\x51\x52\x53\x54\x55\x56\x57\x58\x59\x5a\x5b\x5c\x5d\x5e\x5f"
|
|
"\x60\x41\x42\x43\x44\x45\x46\x47\x48\x49\x4a\x4b\x4c\x4d\x4e\x4f"
|
|
"\x50\x51\x52\x53\x54\x55\x56\x57\x58\x59\x5a\x7b\x7c\x7d\x7e\x7f"
|
|
"\x80\x81\x82\x83\x84\x85\x86\x87\x88\x89\x8a\x8b\x8c\x8d\x8e\x8f"
|
|
"\x90\x91\x92\x93\x94\x95\x96\x97\x98\x99\x9a\x9b\x9c\x9d\x9e\x9f"
|
|
"\xa0\xa1\xa2\xa3\xa4\xa5\xa6\xa7\xa8\xa9\xaa\xab\xac\xad\xae\xaf"
|
|
"\xb0\xb1\xb2\xb3\xb4\x00\xb6\xb7\xb8\xb9\xba\xbb\xbc\xbd\xbe\xbf"
|
|
"\xc0\xc1\xc2\xc3\xc4\xc5\xc6\xc7\xc8\xc9\xca\xcb\xcc\xcd\xce\xcf"
|
|
"\xd0\xd1\xd2\xd3\xd4\xd5\xd6\xd7\xd8\xd9\xda\xdb\xdc\xdd\xde\x00"
|
|
"\xc0\xc1\xc2\xc3\xc4\xc5\xc6\xc7\xc8\xc9\xca\xcb\xcc\xcd\xce\xcf"
|
|
"\xd0\xd1\xd2\xd3\xd4\xd5\xd6\xf7\xd8\xd9\xda\xdb\xdc\xdd\xde\x00";
|
|
|
|
String toLowerCase() {
|
|
for (int i = 0; i < this.length; i++) {
|
|
final c = this.codeUnitAt(i);
|
|
if (c == _LC_TABLE.codeUnitAt(c)) continue;
|
|
// Upper-case character found.
|
|
final result = _allocate(this.length);
|
|
for (int j = 0; j < i; j++) {
|
|
result._setAt(j, this.codeUnitAt(j));
|
|
}
|
|
for (int j = i; j < this.length; j++) {
|
|
result._setAt(j, _LC_TABLE.codeUnitAt(this.codeUnitAt(j)));
|
|
}
|
|
return result;
|
|
}
|
|
return this;
|
|
}
|
|
|
|
String toUpperCase() {
|
|
for (int i = 0; i < this.length; i++) {
|
|
final c = this.codeUnitAt(i);
|
|
// Continue loop if character is unchanged by upper-case conversion.
|
|
if (c == _UC_TABLE.codeUnitAt(c)) continue;
|
|
|
|
// Check rest of string for characters that do not convert to
|
|
// single-characters in the Latin-1 range.
|
|
for (int j = i; j < this.length; j++) {
|
|
final c = this.codeUnitAt(j);
|
|
if ((_UC_TABLE.codeUnitAt(c) == 0x00) && (c != 0x00)) {
|
|
// We use the 0x00 value for characters other than the null character,
|
|
// that don't convert to a single Latin-1 character when upper-cased.
|
|
// In that case, call the generic super-class method.
|
|
return super.toUpperCase();
|
|
}
|
|
}
|
|
// Some lower-case characters found, but all upper-case to single Latin-1
|
|
// characters.
|
|
final result = _allocate(this.length);
|
|
for (int j = 0; j < i; j++) {
|
|
result._setAt(j, this.codeUnitAt(j));
|
|
}
|
|
for (int j = i; j < this.length; j++) {
|
|
result._setAt(j, _UC_TABLE.codeUnitAt(this.codeUnitAt(j)));
|
|
}
|
|
return result;
|
|
}
|
|
return this;
|
|
}
|
|
|
|
// Allocates a string of given length, expecting its content to be
|
|
// set using _setAt.
|
|
static _OneByteString _allocate(int length) native "OneByteString_allocate";
|
|
|
|
|
|
static _OneByteString _allocateFromOneByteList(List<int> list)
|
|
native "OneByteString_allocateFromOneByteList";
|
|
|
|
// This is internal helper method. Code point value must be a valid
|
|
// Latin1 value (0..0xFF), index must be valid.
|
|
void _setAt(int index, int codePoint) native "OneByteString_setAt";
|
|
}
|
|
|
|
|
|
class _TwoByteString extends _StringBase implements String {
|
|
factory _TwoByteString._uninstantiable() {
|
|
throw new UnsupportedError(
|
|
"_TwoByteString can only be allocated by the VM");
|
|
}
|
|
|
|
bool _isWhitespace(int codeUnit) {
|
|
return _StringBase._isTwoByteWhitespace(codeUnit);
|
|
}
|
|
|
|
bool operator ==(Object other) {
|
|
return super == other;
|
|
}
|
|
}
|
|
|
|
|
|
class _ExternalOneByteString extends _StringBase implements String {
|
|
factory _ExternalOneByteString._uninstantiable() {
|
|
throw new UnsupportedError(
|
|
"_ExternalOneByteString can only be allocated by the VM");
|
|
}
|
|
|
|
bool _isWhitespace(int codeUnit) {
|
|
return _StringBase._isOneByteWhitespace(codeUnit);
|
|
}
|
|
|
|
bool operator ==(Object other) {
|
|
return super == other;
|
|
}
|
|
|
|
static int _getCid() native "ExternalOneByteString_getCid";
|
|
}
|
|
|
|
|
|
class _ExternalTwoByteString extends _StringBase implements String {
|
|
factory _ExternalTwoByteString._uninstantiable() {
|
|
throw new UnsupportedError(
|
|
"_ExternalTwoByteString can only be allocated by the VM");
|
|
}
|
|
|
|
bool _isWhitespace(int codeUnit) {
|
|
return _StringBase._isTwoByteWhitespace(codeUnit);
|
|
}
|
|
|
|
bool operator ==(Object other) {
|
|
return super == other;
|
|
}
|
|
}
|
|
|
|
|
|
class _StringMatch implements Match {
|
|
const _StringMatch(int this.start,
|
|
String this.input,
|
|
String this.pattern);
|
|
|
|
int get end => start + pattern.length;
|
|
String operator[](int g) => group(g);
|
|
int get groupCount => 0;
|
|
|
|
String group(int group) {
|
|
if (group != 0) {
|
|
throw new RangeError.value(group);
|
|
}
|
|
return pattern;
|
|
}
|
|
|
|
List<String> groups(List<int> groups) {
|
|
List<String> result = new List<String>();
|
|
for (int g in groups) {
|
|
result.add(group(g));
|
|
}
|
|
return result;
|
|
}
|
|
|
|
final int start;
|
|
final String input;
|
|
final String pattern;
|
|
}
|
|
|
|
/**
|
|
* An [Iterable] of the UTF-16 code units of a [String] in index order.
|
|
*/
|
|
class _CodeUnits extends Object with ListMixin<int>,
|
|
UnmodifiableListMixin<int> {
|
|
/** The string that this is the code units of. */
|
|
String _string;
|
|
|
|
_CodeUnits(this._string);
|
|
|
|
int get length => _string.length;
|
|
int operator[](int i) => _string.codeUnitAt(i);
|
|
}
|