sdk/lib/_internal/compiler/implementation/lib/js_string.dart - sdk.git - Git at Google

 // 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.

 part of _interceptors;

 /**
  * The interceptor class for [String]. The compiler recognizes this
  * class as an interceptor, and changes references to [:this:] to
  * actually use the receiver of the method, which is generated as an extra
  * argument added to each member.
  */
 class JSString extends Interceptor implements String, JSIndexable {
   const JSString();

   int codeUnitAt(int index) {
     if (index is !num) throw new ArgumentError(index);
     if (index < 0) throw new RangeError.value(index);
     if (index >= length) throw new RangeError.value(index);
     return JS('int', r'#.charCodeAt(#)', this, index);
   }

   Iterable<Match> allMatches(String str) {
     checkString(str);
     return allMatchesInStringUnchecked(this, str);
   }

   String operator +(String other) {
     if (other is !String) throw new ArgumentError(other);
     return JS('String', r'# + #', this, other);
   }

   String concat(String other) => this + other;

   bool endsWith(String other) {
     checkString(other);
     int otherLength = other.length;
     if (otherLength > length) return false;
     return other == substring(length - otherLength);
   }

   String replaceAll(Pattern from, String to) {
     checkString(to);
     return stringReplaceAllUnchecked(this, from, to);
   }

   String replaceAllMapped(Pattern from, String convert(Match match)) {
     return this.splitMapJoin(from, onMatch: convert);
   }

   String splitMapJoin(Pattern from,
                       {String onMatch(Match match),
                        String onNonMatch(String nonMatch)}) {
     return stringReplaceAllFuncUnchecked(this, from, onMatch, onNonMatch);
   }

   String replaceFirst(Pattern from, String to) {
     checkString(to);
     return stringReplaceFirstUnchecked(this, from, to);
   }

   List<String> split(Pattern pattern) {
     checkNull(pattern);
     if (pattern is String) {
       return JS('=List', r'#.split(#)', this, pattern);
     } else if (pattern is JSSyntaxRegExp) {
       var re = regExpGetNative(pattern);
       return JS('=List', r'#.split(#)', this, re);
     } else {
       throw "String.split(Pattern) UNIMPLEMENTED";
     }
   }

   bool startsWith(String other) {
     checkString(other);
     int otherLength = other.length;
     if (otherLength > length) return false;
     return JS('bool', r'# == #', other,
               JS('String', r'#.substring(0, #)', this, otherLength));
   }

   String substring(int startIndex, [int endIndex]) {
     checkNum(startIndex);
     if (endIndex == null) endIndex = length;
     checkNum(endIndex);
     if (startIndex < 0 ) throw new RangeError.value(startIndex);
     if (startIndex > endIndex) throw new RangeError.value(startIndex);
     if (endIndex > length) throw new RangeError.value(endIndex);
     return JS('String', r'#.substring(#, #)', this, startIndex, endIndex);
   }

   String toLowerCase() {
     return JS('String', r'#.toLowerCase()', this);
   }

   String toUpperCase() {
     return JS('String', r'#.toUpperCase()', this);
   }

   // 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 _isWhitespace(int codeUnit) {
     // Most codeUnits should be less than 256. Special case with a smaller
     // switch.
     if (codeUnit < 256) {
       switch (codeUnit) {
         case 0x09:
         case 0x0A:
         case 0x0B:
         case 0x0C:
         case 0x0D:
         case 0x20:
         case 0x85:
         case 0xA0:
           return true;
         default:
           return false;
       }
     }
     switch (codeUnit) {
       case 0x1680:
       case 0x180E:
       case 0x2000:
       case 0x2001:
       case 0x2002:
       case 0x2003:
       case 0x2004:
       case 0x2005:
       case 0x2006:
       case 0x2007:
       case 0x2008:
       case 0x2009:
       case 0x200A:
       case 0x2028:
       case 0x2029:
       case 0x202F:
       case 0x205F:
       case 0x3000:
       case 0xFEFF:
         return true;
       default:
         return false;
     }
   }

   // Dart2js can't use JavaScript trim, because JavaScript does not trim
   // the NEXT LINE character (0x85) and BOMs (0xFEFF).
   String trim() {
     const int CARRIAGE_RETURN = 0x0D;
     const int SPACE = 0x20;

     int startIndex = 0;
     while (startIndex < this.length) {
       int codeUnit = this.codeUnitAt(startIndex);
       if (codeUnit == SPACE ||
           codeUnit == CARRIAGE_RETURN ||
           _isWhitespace(codeUnit)) {
         startIndex++;
       } else {
         break;
       }
     }
     if (startIndex == this.length) return "";

     int endIndex = this.length;
     // We know that there is at least one character that is non-whitespace.
     // Therefore we don't need to verify that endIndex > startIndex.
     while (true) {
       int codeUnit = this.codeUnitAt(endIndex - 1);
       if (codeUnit == SPACE ||
           codeUnit == CARRIAGE_RETURN ||
           _isWhitespace(codeUnit)) {
         endIndex--;
       } else {
         break;
       }
     }
     if (startIndex == 0 && endIndex == this.length) return this;
     return JS('String', r'#.substring(#, #)', this, startIndex, endIndex);
   }

   List<int> get codeUnits => new _CodeUnits(this);

   Runes get runes => new Runes(this);

   int indexOf(String other, [int start = 0]) {
     checkNull(other);
     if (start is !int) throw new ArgumentError(start);
     if (other is !String) throw new ArgumentError(other);
     if (start < 0) return -1;
     return JS('int', r'#.indexOf(#, #)', this, other, start);
   }

   int lastIndexOf(String other, [int start]) {
     checkNull(other);
     if (other is !String) throw new ArgumentError(other);
     if (start != null) {
       if (start is !num) throw new ArgumentError(start);
       if (start < 0) return -1;
       if (start >= length) {
         if (other == "") return length;
         start = length - 1;
       }
     } else {
       start = length - 1;
     }
     return stringLastIndexOfUnchecked(this, other, start);
   }

   bool contains(Pattern other, [int startIndex = 0]) {
     checkNull(other);
     return stringContainsUnchecked(this, other, startIndex);
   }

   bool get isEmpty => length == 0;

   bool get isNotEmpty => !isEmpty;

   int compareTo(String other) {
     if (other is !String) throw new ArgumentError(other);
     return this == other ? 0
       : JS('bool', r'# < #', this, other) ? -1 : 1;
   }

   // Note: if you change this, also change the function [S].
   String toString() => this;

   /**
    * This is the [Jenkins hash function][1] but using masking to keep
    * values in SMI range.
    *
    * [1]: http://en.wikipedia.org/wiki/Jenkins_hash_function
    */
   int get hashCode {
     // TODO(ahe): This method shouldn't have to use JS. Update when our
     // optimizations are smarter.
     int hash = 0;
     for (int i = 0; i < length; i++) {
       hash = 0x1fffffff & (hash + JS('int', r'#.charCodeAt(#)', this, i));
       hash = 0x1fffffff & (hash + ((0x0007ffff & hash) << 10));
       hash = JS('int', '# ^ (# >> 6)', hash, hash);
     }
     hash = 0x1fffffff & (hash + ((0x03ffffff & hash) <<  3));
     hash = JS('int', '# ^ (# >> 11)', hash, hash);
     return 0x1fffffff & (hash + ((0x00003fff & hash) << 15));
   }

   Type get runtimeType => String;

   int get length => JS('int', r'#.length', this);

   String operator [](int index) {
     if (index is !int) throw new ArgumentError(index);
     if (index >= length || index < 0) throw new RangeError.value(index);
     return JS('String', '#[#]', this, index);
   }
 }

 /**
  * An [Iterable] of the UTF-16 code units of a [String] in index order.
  */
 class _CodeUnits extends UnmodifiableListBase<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);
 }
	// 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.

	part of _interceptors;

	/**
	* The interceptor class for [String]. The compiler recognizes this
	* class as an interceptor, and changes references to [:this:] to
	* actually use the receiver of the method, which is generated as an extra
	* argument added to each member.
	*/
	class JSString extends Interceptor implements String, JSIndexable {
	const JSString();

	int codeUnitAt(int index) {
	if (index is !num) throw new ArgumentError(index);
	if (index < 0) throw new RangeError.value(index);
	if (index >= length) throw new RangeError.value(index);
	return JS('int', r'#.charCodeAt(#)', this, index);
	}

	Iterable<Match> allMatches(String str) {
	checkString(str);
	return allMatchesInStringUnchecked(this, str);
	}

	String operator +(String other) {
	if (other is !String) throw new ArgumentError(other);
	return JS('String', r'# + #', this, other);
	}

	String concat(String other) => this + other;

	bool endsWith(String other) {
	checkString(other);
	int otherLength = other.length;
	if (otherLength > length) return false;
	return other == substring(length - otherLength);
	}

	String replaceAll(Pattern from, String to) {
	checkString(to);
	return stringReplaceAllUnchecked(this, from, to);
	}

	String replaceAllMapped(Pattern from, String convert(Match match)) {
	return this.splitMapJoin(from, onMatch: convert);
	}

	String splitMapJoin(Pattern from,
	{String onMatch(Match match),
	String onNonMatch(String nonMatch)}) {
	return stringReplaceAllFuncUnchecked(this, from, onMatch, onNonMatch);
	}

	String replaceFirst(Pattern from, String to) {
	checkString(to);
	return stringReplaceFirstUnchecked(this, from, to);
	}

	List<String> split(Pattern pattern) {
	checkNull(pattern);
	if (pattern is String) {
	return JS('=List', r'#.split(#)', this, pattern);
	} else if (pattern is JSSyntaxRegExp) {
	var re = regExpGetNative(pattern);
	return JS('=List', r'#.split(#)', this, re);
	} else {
	throw "String.split(Pattern) UNIMPLEMENTED";
	}
	}

	bool startsWith(String other) {
	checkString(other);
	int otherLength = other.length;
	if (otherLength > length) return false;
	return JS('bool', r'# == #', other,
	JS('String', r'#.substring(0, #)', this, otherLength));
	}

	String substring(int startIndex, [int endIndex]) {
	checkNum(startIndex);
	if (endIndex == null) endIndex = length;
	checkNum(endIndex);
	if (startIndex < 0 ) throw new RangeError.value(startIndex);
	if (startIndex > endIndex) throw new RangeError.value(startIndex);
	if (endIndex > length) throw new RangeError.value(endIndex);
	return JS('String', r'#.substring(#, #)', this, startIndex, endIndex);
	}

	String toLowerCase() {
	return JS('String', r'#.toLowerCase()', this);
	}

	String toUpperCase() {
	return JS('String', r'#.toUpperCase()', this);
	}

	// 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 _isWhitespace(int codeUnit) {
	// Most codeUnits should be less than 256. Special case with a smaller
	// switch.
	if (codeUnit < 256) {
	switch (codeUnit) {
	case 0x09:
	case 0x0A:
	case 0x0B:
	case 0x0C:
	case 0x0D:
	case 0x20:
	case 0x85:
	case 0xA0:
	return true;
	default:
	return false;
	}
	}
	switch (codeUnit) {
	case 0x1680:
	case 0x180E:
	case 0x2000:
	case 0x2001:
	case 0x2002:
	case 0x2003:
	case 0x2004:
	case 0x2005:
	case 0x2006:
	case 0x2007:
	case 0x2008:
	case 0x2009:
	case 0x200A:
	case 0x2028:
	case 0x2029:
	case 0x202F:
	case 0x205F:
	case 0x3000:
	case 0xFEFF:
	return true;
	default:
	return false;
	}
	}

	// Dart2js can't use JavaScript trim, because JavaScript does not trim
	// the NEXT LINE character (0x85) and BOMs (0xFEFF).
	String trim() {
	const int CARRIAGE_RETURN = 0x0D;
	const int SPACE = 0x20;

	int startIndex = 0;
	while (startIndex < this.length) {
	int codeUnit = this.codeUnitAt(startIndex);
	if (codeUnit == SPACE \|\|
	codeUnit == CARRIAGE_RETURN \|\|
	_isWhitespace(codeUnit)) {
	startIndex++;
	} else {
	break;
	}
	}
	if (startIndex == this.length) return "";

	int endIndex = this.length;
	// We know that there is at least one character that is non-whitespace.
	// Therefore we don't need to verify that endIndex > startIndex.
	while (true) {
	int codeUnit = this.codeUnitAt(endIndex - 1);
	if (codeUnit == SPACE \|\|
	codeUnit == CARRIAGE_RETURN \|\|
	_isWhitespace(codeUnit)) {
	endIndex--;
	} else {
	break;
	}
	}
	if (startIndex == 0 && endIndex == this.length) return this;
	return JS('String', r'#.substring(#, #)', this, startIndex, endIndex);
	}

	List<int> get codeUnits => new _CodeUnits(this);

	Runes get runes => new Runes(this);

	int indexOf(String other, [int start = 0]) {
	checkNull(other);
	if (start is !int) throw new ArgumentError(start);
	if (other is !String) throw new ArgumentError(other);
	if (start < 0) return -1;
	return JS('int', r'#.indexOf(#, #)', this, other, start);
	}

	int lastIndexOf(String other, [int start]) {
	checkNull(other);
	if (other is !String) throw new ArgumentError(other);
	if (start != null) {
	if (start is !num) throw new ArgumentError(start);
	if (start < 0) return -1;
	if (start >= length) {
	if (other == "") return length;
	start = length - 1;
	}
	} else {
	start = length - 1;
	}
	return stringLastIndexOfUnchecked(this, other, start);
	}

	bool contains(Pattern other, [int startIndex = 0]) {
	checkNull(other);
	return stringContainsUnchecked(this, other, startIndex);
	}

	bool get isEmpty => length == 0;

	bool get isNotEmpty => !isEmpty;

	int compareTo(String other) {
	if (other is !String) throw new ArgumentError(other);
	return this == other ? 0
	: JS('bool', r'# < #', this, other) ? -1 : 1;
	}

	// Note: if you change this, also change the function [S].
	String toString() => this;

	/**
	* This is the [Jenkins hash function][1] but using masking to keep
	* values in SMI range.
	*
	* [1]: http://en.wikipedia.org/wiki/Jenkins_hash_function
	*/
	int get hashCode {
	// TODO(ahe): This method shouldn't have to use JS. Update when our
	// optimizations are smarter.
	int hash = 0;
	for (int i = 0; i < length; i++) {
	hash = 0x1fffffff & (hash + JS('int', r'#.charCodeAt(#)', this, i));
	hash = 0x1fffffff & (hash + ((0x0007ffff & hash) << 10));
	hash = JS('int', '# ^ (# >> 6)', hash, hash);
	}
	hash = 0x1fffffff & (hash + ((0x03ffffff & hash) << 3));
	hash = JS('int', '# ^ (# >> 11)', hash, hash);
	return 0x1fffffff & (hash + ((0x00003fff & hash) << 15));
	}

	Type get runtimeType => String;

	int get length => JS('int', r'#.length', this);

	String operator [](int index) {
	if (index is !int) throw new ArgumentError(index);
	if (index >= length \|\| index < 0) throw new RangeError.value(index);
	return JS('String', '#[#]', this, index);
	}
	}

	/**
	* An [Iterable] of the UTF-16 code units of a [String] in index order.
	*/
	class _CodeUnits extends UnmodifiableListBase<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);
	}