sass-embedded 1.0.0-beta.1 → 1.0.0-beta.7

package/dist/lib/src/value/string.js

@@ -0,0 +1,117 @@
+"use strict";
+// Copyright 2021 Google Inc. Use of this source code is governed by an
+// MIT-style license that can be found in the LICENSE file or at
+// https://opensource.org/licenses/MIT.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.SassString = void 0;
+const immutable_1 = require("immutable");
+const index_1 = require("./index");
+const utils_1 = require("../utils");
+/** A SassScript string. */
+class SassString extends index_1.Value {
+    constructor(textOrOptions, options) {
+        var _a, _b;
+        super();
+        if (typeof textOrOptions === 'string') {
+            this.textInternal = textOrOptions;
+            this.hasQuotesInternal = (_a = options === null || options === void 0 ? void 0 : options.quotes) !== null && _a !== void 0 ? _a : true;
+        }
+        else {
+            this.textInternal = '';
+            this.hasQuotesInternal = (_b = textOrOptions === null || textOrOptions === void 0 ? void 0 : textOrOptions.quotes) !== null && _b !== void 0 ? _b : true;
+        }
+    }
+    /** Creates an empty string, optionally with quotes. */
+    static empty(options) {
+        return options === undefined || (options === null || options === void 0 ? void 0 : options.quotes)
+            ? emptyQuoted
+            : emptyUnquoted;
+    }
+    /** `this`'s text. */
+    get text() {
+        return this.textInternal;
+    }
+    /** Whether `this` has quotes. */
+    get hasQuotes() {
+        return this.hasQuotesInternal;
+    }
+    assertString() {
+        return this;
+    }
+    /**
+     * Sass's notion of `this`'s length.
+     *
+     * Sass treats strings as a series of Unicode code points while JS treats them
+     * as a series of UTF-16 code units. For example, the character U+1F60A,
+     * Smiling Face With Smiling Eyes, is a single Unicode code point but is
+     * represented in UTF-16 as two code units (`0xD83D` and `0xDE0A`). So in
+     * JS, `"n😊b".length` returns `4`, whereas in Sass `string.length("n😊b")`
+     * returns `3`.
+     */
+    get sassLength() {
+        let length = 0;
+        // eslint-disable-next-line @typescript-eslint/no-unused-vars
+        for (const codepoint of this.text) {
+            length++;
+        }
+        return length;
+    }
+    /**
+     * Converts `sassIndex` to a JS index into `text`.
+     *
+     * Sass indices are one-based, while JS indices are zero-based. Sass
+     * indices may also be negative in order to index from the end of the string.
+     *
+     * In addition, Sass indices refer to Unicode code points while JS string
+     * indices refer to UTF-16 code units. For example, the character U+1F60A,
+     * Smiling Face With Smiling Eyes, is a single Unicode code point but is
+     * represented in UTF-16 as two code units (`0xD83D` and `0xDE0A`). So in
+     * JS, `"n😊b".charAt(1)` returns `0xD83D`, whereas in Sass
+     * `string.slice("n😊b", 1, 1)` returns `"😊"`.
+     *
+     * This function converts Sass's code point indices to JS's code unit
+     * indices. This means it's O(n) in the length of `text`.
+     *
+     * Throws an error `sassIndex` isn't a number, if that number isn't an
+     * integer, or if that integer isn't a valid index for this string.
+     *
+     * If `sassIndex` came from a function argument, `name` is the argument name
+     * (without the `$`) and is used for error reporting.
+     */
+    sassIndexToStringIndex(sassIndex, name) {
+        let sassIdx = sassIndex.assertNumber().assertInt();
+        if (sassIdx === 0) {
+            throw (0, utils_1.valueError)('String index may not be 0', name);
+        }
+        const sassLength = this.sassLength;
+        if (Math.abs(sassIdx) > sassLength) {
+            throw (0, utils_1.valueError)(`Invalid index ${sassIdx} for a string with ${sassLength} characters`, name);
+        }
+        if (sassIdx < 0)
+            sassIdx += sassLength + 1;
+        let pointer = 1;
+        let idx = 0;
+        for (const codePoint of this.text) {
+            if (pointer === sassIdx)
+                break;
+            idx += codePoint.length;
+            pointer++;
+        }
+        return idx;
+    }
+    equals(other) {
+        return other instanceof SassString && this.text === other.text;
+    }
+    hashCode() {
+        return (0, immutable_1.hash)(this.text);
+    }
+    toString() {
+        return this.hasQuotes ? `"${this.text}"` : this.text;
+    }
+}
+exports.SassString = SassString;
+// A quoted empty string returned by `SassString.empty()`.
+const emptyQuoted = new SassString('', { quotes: true });
+// An unquoted empty string returned by `SassString.empty()`.
+const emptyUnquoted = new SassString('', { quotes: false });
+//# sourceMappingURL=string.js.map

package/dist/lib/src/value/string.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"string.js","sourceRoot":"","sources":["../../../../lib/src/value/string.ts"],"names":[],"mappings":";AAAA,uEAAuE;AACvE,gEAAgE;AAChE,uCAAuC;;;AAEvC,yCAA+B;AAE/B,mCAA8B;AAC9B,oCAAoC;AAEpC,2BAA2B;AAC3B,MAAa,UAAW,SAAQ,aAAK;IAOnC,YACE,aAA2C,EAC3C,OAA4B;;QAE5B,KAAK,EAAE,CAAC;QAER,IAAI,OAAO,aAAa,KAAK,QAAQ,EAAE;YACrC,IAAI,CAAC,YAAY,GAAG,aAAa,CAAC;YAClC,IAAI,CAAC,iBAAiB,GAAG,MAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,mCAAI,IAAI,CAAC;SAClD;aAAM;YACL,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;YACvB,IAAI,CAAC,iBAAiB,GAAG,MAAA,aAAa,aAAb,aAAa,uBAAb,aAAa,CAAE,MAAM,mCAAI,IAAI,CAAC;SACxD;IACH,CAAC;IAED,uDAAuD;IACvD,MAAM,CAAC,KAAK,CAAC,OAAiD;QAC5D,OAAO,OAAO,KAAK,SAAS,KAAI,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,MAAM,CAAA;YAC7C,CAAC,CAAC,WAAW;YACb,CAAC,CAAC,aAAa,CAAC;IACpB,CAAC;IAED,qBAAqB;IACrB,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,YAAY,CAAC;IAC3B,CAAC;IAED,iCAAiC;IACjC,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAChC,CAAC;IAED,YAAY;QACV,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;;OASG;IACH,IAAI,UAAU;QACZ,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,6DAA6D;QAC7D,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE;YACjC,MAAM,EAAE,CAAC;SACV;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,sBAAsB,CAAC,SAAgB,EAAE,IAAa;QACpD,IAAI,OAAO,GAAG,SAAS,CAAC,YAAY,EAAE,CAAC,SAAS,EAAE,CAAC;QACnD,IAAI,OAAO,KAAK,CAAC,EAAE;YACjB,MAAM,IAAA,kBAAU,EAAC,2BAA2B,EAAE,IAAI,CAAC,CAAC;SACrD;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,UAAU,EAAE;YAClC,MAAM,IAAA,kBAAU,EACd,iBAAiB,OAAO,sBAAsB,UAAU,aAAa,EACrE,IAAI,CACL,CAAC;SACH;QACD,IAAI,OAAO,GAAG,CAAC;YAAE,OAAO,IAAI,UAAU,GAAG,CAAC,CAAC;QAE3C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,IAAI,EAAE;YACjC,IAAI,OAAO,KAAK,OAAO;gBAAE,MAAM;YAC/B,GAAG,IAAI,SAAS,CAAC,MAAM,CAAC;YACxB,OAAO,EAAE,CAAC;SACX;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,MAAM,CAAC,KAAY;QACjB,OAAO,KAAK,YAAY,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,CAAC,IAAI,CAAC;IACjE,CAAC;IAED,QAAQ;QACN,OAAO,IAAA,gBAAI,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;IACvD,CAAC;CACF;AAxHD,gCAwHC;AAED,0DAA0D;AAC1D,MAAM,WAAW,GAAG,IAAI,UAAU,CAAC,EAAE,EAAE,EAAC,MAAM,EAAE,IAAI,EAAC,CAAC,CAAC;AAEvD,6DAA6D;AAC7D,MAAM,aAAa,GAAG,IAAI,UAAU,CAAC,EAAE,EAAE,EAAC,MAAM,EAAE,KAAK,EAAC,CAAC,CAAC"}

package/dist/lib/src/value/utils.js

@@ -0,0 +1,120 @@
+"use strict";
+// Copyright 2021 Google Inc. Use of this source code is governed by an
+// MIT-style license that can be found in the LICENSE file or at
+// https://opensource.org/licenses/MIT.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.positiveMod = exports.fuzzyAssertInRange = exports.fuzzyInRange = exports.fuzzyRound = exports.fuzzyAsInt = exports.fuzzyIsInt = exports.fuzzyGreaterThanOrEquals = exports.fuzzyGreaterThan = exports.fuzzyLessThanOrEquals = exports.fuzzyLessThan = exports.fuzzyHashCode = exports.fuzzyEquals = exports.precision = void 0;
+const immutable_1 = require("immutable");
+const utils_1 = require("../utils");
+/** The precision of Sass numbers. */
+exports.precision = 10;
+// The max distance two Sass numbers can be from each another before they're
+// considered different.
+//
+// Uses ** instead of Math.pow() for constant folding.
+const epsilon = 10 ** (-exports.precision - 1);
+/** Whether `num1` and `num2` are equal within `epsilon`. */
+function fuzzyEquals(num1, num2) {
+    return Math.abs(num1 - num2) < epsilon;
+}
+exports.fuzzyEquals = fuzzyEquals;
+/**
+ * Returns a hash code for `num`.
+ *
+ * Two numbers that `fuzzyEquals` each other must have the same hash code.
+ */
+function fuzzyHashCode(num) {
+    return !isFinite(num) || isNaN(num)
+        ? (0, immutable_1.hash)(num)
+        : (0, immutable_1.hash)(Math.round(num / epsilon));
+}
+exports.fuzzyHashCode = fuzzyHashCode;
+/** Whether `num1` < `num2`, within `epsilon`. */
+function fuzzyLessThan(num1, num2) {
+    return num1 < num2 && !fuzzyEquals(num1, num2);
+}
+exports.fuzzyLessThan = fuzzyLessThan;
+/** Whether `num1` <= `num2`, within `epsilon`. */
+function fuzzyLessThanOrEquals(num1, num2) {
+    return num1 < num2 || fuzzyEquals(num1, num2);
+}
+exports.fuzzyLessThanOrEquals = fuzzyLessThanOrEquals;
+/** Whether `num1` > `num2`, within `epsilon`. */
+function fuzzyGreaterThan(num1, num2) {
+    return num1 > num2 && !fuzzyEquals(num1, num2);
+}
+exports.fuzzyGreaterThan = fuzzyGreaterThan;
+/** Whether `num1` >= `num2`, within `epsilon`. */
+function fuzzyGreaterThanOrEquals(num1, num2) {
+    return num1 > num2 || fuzzyEquals(num1, num2);
+}
+exports.fuzzyGreaterThanOrEquals = fuzzyGreaterThanOrEquals;
+/** Whether `num` `fuzzyEquals` an integer. */
+function fuzzyIsInt(num) {
+    return !isFinite(num) || isNaN(num)
+        ? false
+        : // Check against 0.5 rather than 0.0 so that we catch numbers that are
+            // both very slightly above an integer, and very slightly below.
+            fuzzyEquals(Math.abs(num - 0.5) % 1, 0.5);
+}
+exports.fuzzyIsInt = fuzzyIsInt;
+/**
+ * If `num` `fuzzyIsInt`, returns it as an integer. Otherwise, returns `null`.
+ */
+function fuzzyAsInt(num) {
+    return fuzzyIsInt(num) ? Math.round(num) : null;
+}
+exports.fuzzyAsInt = fuzzyAsInt;
+/**
+ * Rounds `num` to the nearest integer.
+ *
+ * If `num` `fuzzyEquals` `x.5`, rounds away from zero.
+ */
+function fuzzyRound(num) {
+    if (num > 0) {
+        return fuzzyLessThan(num % 1, 0.5) ? Math.floor(num) : Math.ceil(num);
+    }
+    else {
+        return fuzzyGreaterThan(num % 1, -0.5) ? Math.ceil(num) : Math.floor(num);
+    }
+}
+exports.fuzzyRound = fuzzyRound;
+/**
+ * Returns `num` if it's within `min` and `max`, or `null` if it's not.
+ *
+ * If `num` `fuzzyEquals` `min` or `max`, it gets clamped to that value.
+ */
+function fuzzyInRange(num, min, max) {
+    if (fuzzyEquals(num, min))
+        return min;
+    if (fuzzyEquals(num, max))
+        return max;
+    if (num > min && num < max)
+        return num;
+    return null;
+}
+exports.fuzzyInRange = fuzzyInRange;
+/**
+ * Returns `num` if it's within `min` and `max`. Otherwise, throws an error.
+ *
+ * If `num` `fuzzyEquals` `min` or `max`, it gets clamped to that value.
+ *
+ * If `name` is provided, it is used as the parameter name for error reporting.
+ */
+function fuzzyAssertInRange(num, min, max, name) {
+    if (fuzzyEquals(num, min))
+        return min;
+    if (fuzzyEquals(num, max))
+        return max;
+    if (num > min && num < max)
+        return num;
+    throw (0, utils_1.valueError)(`${num} must be between ${min} and ${max}`, name);
+}
+exports.fuzzyAssertInRange = fuzzyAssertInRange;
+/** Returns `dividend % modulus`, but always in the range `[0, modulus)`. */
+function positiveMod(dividend, modulus) {
+    const result = dividend % modulus;
+    return result < 0 ? result + modulus : result;
+}
+exports.positiveMod = positiveMod;
+//# sourceMappingURL=utils.js.map

package/dist/lib/src/value/utils.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../../lib/src/value/utils.ts"],"names":[],"mappings":";AAAA,uEAAuE;AACvE,gEAAgE;AAChE,uCAAuC;;;AAEvC,yCAA+B;AAE/B,oCAAoC;AAEpC,qCAAqC;AACxB,QAAA,SAAS,GAAG,EAAE,CAAC;AAE5B,4EAA4E;AAC5E,wBAAwB;AACxB,EAAE;AACF,sDAAsD;AACtD,MAAM,OAAO,GAAG,EAAE,IAAI,CAAC,CAAC,iBAAS,GAAG,CAAC,CAAC,CAAC;AAEvC,4DAA4D;AAC5D,SAAgB,WAAW,CAAC,IAAY,EAAE,IAAY;IACpD,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,OAAO,CAAC;AACzC,CAAC;AAFD,kCAEC;AAED;;;;GAIG;AACH,SAAgB,aAAa,CAAC,GAAW;IACvC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC;QACjC,CAAC,CAAC,IAAA,gBAAI,EAAC,GAAG,CAAC;QACX,CAAC,CAAC,IAAA,gBAAI,EAAC,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC;AACtC,CAAC;AAJD,sCAIC;AAED,iDAAiD;AACjD,SAAgB,aAAa,CAAC,IAAY,EAAE,IAAY;IACtD,OAAO,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACjD,CAAC;AAFD,sCAEC;AAED,kDAAkD;AAClD,SAAgB,qBAAqB,CAAC,IAAY,EAAE,IAAY;IAC9D,OAAO,IAAI,GAAG,IAAI,IAAI,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAChD,CAAC;AAFD,sDAEC;AAED,iDAAiD;AACjD,SAAgB,gBAAgB,CAAC,IAAY,EAAE,IAAY;IACzD,OAAO,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AACjD,CAAC;AAFD,4CAEC;AAED,kDAAkD;AAClD,SAAgB,wBAAwB,CAAC,IAAY,EAAE,IAAY;IACjE,OAAO,IAAI,GAAG,IAAI,IAAI,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;AAChD,CAAC;AAFD,4DAEC;AAED,8CAA8C;AAC9C,SAAgB,UAAU,CAAC,GAAW;IACpC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC;QACjC,CAAC,CAAC,KAAK;QACP,CAAC,CAAC,sEAAsE;YACtE,gEAAgE;YAChE,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;AAChD,CAAC;AAND,gCAMC;AAED;;GAEG;AACH,SAAgB,UAAU,CAAC,GAAW;IACpC,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAClD,CAAC;AAFD,gCAEC;AAED;;;;GAIG;AACH,SAAgB,UAAU,CAAC,GAAW;IACpC,IAAI,GAAG,GAAG,CAAC,EAAE;QACX,OAAO,aAAa,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;KACvE;SAAM;QACL,OAAO,gBAAgB,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;KAC3E;AACH,CAAC;AAND,gCAMC;AAED;;;;GAIG;AACH,SAAgB,YAAY,CAC1B,GAAW,EACX,GAAW,EACX,GAAW;IAEX,IAAI,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IACtC,IAAI,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IACtC,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG;QAAE,OAAO,GAAG,CAAC;IACvC,OAAO,IAAI,CAAC;AACd,CAAC;AATD,oCASC;AAED;;;;;;GAMG;AACH,SAAgB,kBAAkB,CAChC,GAAW,EACX,GAAW,EACX,GAAW,EACX,IAAa;IAEb,IAAI,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IACtC,IAAI,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC;QAAE,OAAO,GAAG,CAAC;IACtC,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG;QAAE,OAAO,GAAG,CAAC;IACvC,MAAM,IAAA,kBAAU,EAAC,GAAG,GAAG,oBAAoB,GAAG,QAAQ,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;AACrE,CAAC;AAVD,gDAUC;AAED,4EAA4E;AAC5E,SAAgB,WAAW,CAAC,QAAgB,EAAE,OAAe;IAC3D,MAAM,MAAM,GAAG,QAAQ,GAAG,OAAO,CAAC;IAClC,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;AAChD,CAAC;AAHD,kCAGC"}