mirror of
https://github.com/jackyzha0/quartz.git
synced 2025-12-25 13:54:05 -06:00
112 lines
3.5 KiB
JavaScript
112 lines
3.5 KiB
JavaScript
/**
|
||
* @param {number} a The number to test.
|
||
* @param {number} min The minimum value in the range, inclusive.
|
||
* @param {number} max The maximum value in the range, inclusive.
|
||
* @return {boolean} True if a >= min and a <= max.
|
||
*/
|
||
export function inRange(a, min, max) {
|
||
return min <= a && a <= max;
|
||
}
|
||
/**
|
||
* @param {!Array.<*>} array The array to check.
|
||
* @param {*} item The item to look for in the array.
|
||
* @return {boolean} True if the item appears in the array.
|
||
*/
|
||
export function includes(array, item) {
|
||
return array.indexOf(item) !== -1;
|
||
}
|
||
/**
|
||
* @param {*} o
|
||
* @return {Object}
|
||
*/
|
||
export function ToDictionary(o) {
|
||
if (o === undefined || o === null)
|
||
return {};
|
||
if (o === Object(o))
|
||
return o;
|
||
throw TypeError('Could not convert argument to dictionary');
|
||
}
|
||
/**
|
||
* @param {string} string Input string of UTF-16 code units.
|
||
* @return {!Array.<number>} Code points.
|
||
*/
|
||
export function stringToCodePoints(string) {
|
||
// https://heycam.github.io/webidl/#dfn-obtain-unicode
|
||
// 1. Let S be the DOMString value.
|
||
const s = String(string);
|
||
// 2. Let n be the length of S.
|
||
const n = s.length;
|
||
// 3. Initialize i to 0.
|
||
let i = 0;
|
||
// 4. Initialize U to be an empty sequence of Unicode characters.
|
||
const u = [];
|
||
// 5. While i < n:
|
||
while (i < n) {
|
||
// 1. Let c be the code unit in S at index i.
|
||
const c = s.charCodeAt(i);
|
||
// 2. Depending on the value of c:
|
||
// c < 0xD800 or c > 0xDFFF
|
||
if (c < 0xD800 || c > 0xDFFF) {
|
||
// Append to U the Unicode character with code point c.
|
||
u.push(c);
|
||
}
|
||
// 0xDC00 ≤ c ≤ 0xDFFF
|
||
else if (0xDC00 <= c && c <= 0xDFFF) {
|
||
// Append to U a U+FFFD REPLACEMENT CHARACTER.
|
||
u.push(0xFFFD);
|
||
}
|
||
// 0xD800 ≤ c ≤ 0xDBFF
|
||
else if (0xD800 <= c && c <= 0xDBFF) {
|
||
// 1. If i = n−1, then append to U a U+FFFD REPLACEMENT
|
||
// CHARACTER.
|
||
if (i === n - 1) {
|
||
u.push(0xFFFD);
|
||
}
|
||
// 2. Otherwise, i < n−1:
|
||
else {
|
||
// 1. Let d be the code unit in S at index i+1.
|
||
const d = s.charCodeAt(i + 1);
|
||
// 2. If 0xDC00 ≤ d ≤ 0xDFFF, then:
|
||
if (0xDC00 <= d && d <= 0xDFFF) {
|
||
// 1. Let a be c & 0x3FF.
|
||
const a = c & 0x3FF;
|
||
// 2. Let b be d & 0x3FF.
|
||
const b = d & 0x3FF;
|
||
// 3. Append to U the Unicode character with code point
|
||
// 2^16+2^10*a+b.
|
||
u.push(0x10000 + (a << 10) + b);
|
||
// 4. Set i to i+1.
|
||
i += 1;
|
||
}
|
||
// 3. Otherwise, d < 0xDC00 or d > 0xDFFF. Append to U a
|
||
// U+FFFD REPLACEMENT CHARACTER.
|
||
else {
|
||
u.push(0xFFFD);
|
||
}
|
||
}
|
||
}
|
||
// 3. Set i to i+1.
|
||
i += 1;
|
||
}
|
||
// 6. Return U.
|
||
return u;
|
||
}
|
||
/**
|
||
* @param {!Array.<number>} code_points Array of code points.
|
||
* @return {string} string String of UTF-16 code units.
|
||
*/
|
||
export function codePointsToString(code_points) {
|
||
let s = '';
|
||
for (let i = 0; i < code_points.length; ++i) {
|
||
let cp = code_points[i];
|
||
if (cp <= 0xFFFF) {
|
||
s += String.fromCharCode(cp);
|
||
}
|
||
else {
|
||
cp -= 0x10000;
|
||
s += String.fromCharCode((cp >> 10) + 0xD800, (cp & 0x3FF) + 0xDC00);
|
||
}
|
||
}
|
||
return s;
|
||
}
|
||
//# sourceMappingURL=utilities.js.map
|