All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.google.javascript.jscomp.js.es6.string.js Maven / Gradle / Ivy

Go to download

Closure Compiler is a JavaScript optimizing compiler. It parses your JavaScript, analyzes it, removes dead code and rewrites and minimizes what's left. It also checks syntax, variable references, and types, and warns about common JavaScript pitfalls. It is used in many of Google's JavaScript apps, including Gmail, Google Web Search, Google Maps, and Google Docs.

There is a newer version: v20240317
Show newest version
/*
 * Copyright 2016 The Closure Compiler Authors.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

/**
 * @fileoverview Polyfills for ES6 String functions.
 */

$jscomp.string = $jscomp.string || {};


/**
 * Throws if the argument is null or undefined.
 * @param {*} str The argument to check.
 * @param {string} func Name of the function, for reporting.
 * @private
 */
$jscomp.string.noNullOrUndefined_ = function(str, func) {
  if (str == null) {
    throw new TypeError(
        `The 'this' value for String.prototype.${func} ` +
        'must not be null or undefined');
  }
};


/**
 * Throws if the argument is a RegExp.
 * @param {*} str The argument to check.
 * @param {string} func Name of the function, for reporting.
 * @private
 */
$jscomp.string.noRegExp_ = function(str, func) {
  if (str instanceof RegExp) {
    throw new TypeError(
        `First argument to String.prototype.${func} ` +
          'must not be a regular expression');
  }
};


/**
 * Creates a new string from the given codepoints.
 *
 * 

Polyfills the static function String.fromCodePoint(). * * @param {...number} codepoints * @return {string} */ $jscomp.string.fromCodePoint = function(...codepoints) { // Note: this is taken from v8's harmony-string.js StringFromCodePoint. let result = ''; for (let code of codepoints) { code = +code; if (code < 0 || code > 0x10FFFF || code !== Math.floor(code)) { throw new RangeError('invalid_code_point ' + code); } if (code <= 0xFFFF) { result += String.fromCharCode(code); } else { code -= 0x10000; result += String.fromCharCode((code >>> 10) & 0x3FF | 0xD800); result += String.fromCharCode(code & 0x3FF | 0xDC00); } } return result; }; /** * Returns a new string repeated the given number of times. * *

Polyfills the instance method String.prototype.repeat(). * * @this {*} * @param {number} copies * @return {string} */ $jscomp.string.repeat = function(copies) { 'use strict'; $jscomp.string.noNullOrUndefined_(this, 'repeat'); let /** string */ string = String(this); if (copies < 0 || copies > 0x4FFFFFFF) { // impose a 1GB limit throw new RangeError('Invalid count value'); } copies = copies | 0; // cast to a signed integer. let result = ''; while (copies) { if (copies & 1) result += string; if ((copies >>>= 1)) string += string; } return result; }; /** * Installs the String.prototype.repeat polyfill. * @const @suppress {const,checkTypes} */ $jscomp.string.repeat$install = function() { if (!String.prototype.repeat) { String.prototype.repeat = $jscomp.string.repeat; } }; /** * Returns the UTF-16 codepoint at the given index. * *

Polyfills the instance method String.prototype.codePointAt(). * * @this {*} * @param {number} position * @return {number|undefined} The codepoint. */ $jscomp.string.codePointAt = function(position) { // NOTE: this is taken from v8's harmony-string.js StringCodePointAt 'use strict'; $jscomp.string.noNullOrUndefined_(this, 'codePointAt'); const string = String(this); const size = string.length; position = Number(position) || 0; if (!(position >= 0 && position < size)) { return void 0; } position = position | 0; const first = string.charCodeAt(position); if (first < 0xD800 || first > 0xDBFF || position + 1 === size) { return first; } const second = string.charCodeAt(position + 1); if (second < 0xDC00 || second > 0xDFFF) { return first; } return (first - 0xD800) * 0x400 + second + 0x2400; }; /** * Installs the String.prototype.codePointAt polyfill. * @suppress {const,checkTypes} */ $jscomp.string.codePointAt$install = function() { if (!String.prototype.codePointAt) { String.prototype.codePointAt = $jscomp.string.codePointAt; } }; /** * Searches for a substring, starting at the given position. * *

Polyfills the instance method String.prototype.includes(). * * @this {*} * @param {string} searchString * @param {number=} opt_position * @return {boolean} */ $jscomp.string.includes = function(searchString, opt_position = 0) { 'use strict'; $jscomp.string.noRegExp_(searchString, 'includes'); $jscomp.string.noNullOrUndefined_(this, 'includes'); const string = String(this); return string.indexOf(searchString, opt_position) !== -1; }; /** * Installs the String.prototype.includes polyfill. * @suppress {const,checkTypes} */ $jscomp.string.includes$install = function() { if (!String.prototype.includes) { String.prototype.includes = $jscomp.string.includes; } }; /** * Tests whether the string starts with a given substring. * *

Polyfills the instance method String.prototype.startsWith(). * * @this {*} * @param {string} searchString * @param {number=} opt_position * @return {boolean} */ $jscomp.string.startsWith = function(searchString, opt_position = 0) { 'use strict'; $jscomp.string.noRegExp_(searchString, 'startsWith'); $jscomp.string.noNullOrUndefined_(this, 'startsWith'); const string = String(this); searchString = searchString + ''; const strLen = string.length; const searchLen = searchString.length; let i = Math.max(0, Math.min(opt_position | 0, string.length)); let j = 0; while (j < searchLen && i < strLen) { if (string[i++] != searchString[j++]) return false; } return j >= searchLen; }; /** * Installs the String.prototype.startsWith polyfill. * @suppress {const,checkTypes} */ $jscomp.string.startsWith$install = function() { if (!String.prototype.startsWith) { String.prototype.startsWith = $jscomp.string.startsWith; } }; /** * Tests whether the string ends with a given substring. * *

Polyfills the instance method String.prototype.endsWith(). * * @this {*} * @param {string} searchString * @param {number=} opt_position * @return {boolean} */ $jscomp.string.endsWith = function(searchString, opt_position = void 0) { 'use strict'; $jscomp.string.noRegExp_(searchString, 'endsWith'); $jscomp.string.noNullOrUndefined_(this, 'endsWith'); const string = String(this); searchString = searchString + ''; if (opt_position === void 0) opt_position = string.length; let i = Math.max(0, Math.min(opt_position | 0, string.length)); let j = searchString.length; while (j > 0 && i > 0) { if (string[--i] != searchString[--j]) return false; } return j <= 0; }; /** * Installs the String.prototype.endsWith polyfill. * @suppress {const,checkTypes} */ $jscomp.string.endsWith$install = function() { if (!String.prototype.endsWith) { String.prototype.endsWith = $jscomp.string.endsWith; } }; // TODO(sdh): String.prototype.normalize?





© 2015 - 2025 Weber Informatics LLC | Privacy Policy