Buckets:
| import {COMMENT, RULESET, DECLARATION} from './Enum.js' | |
| import {abs, charat, trim, from, sizeof, strlen, substr, append, replace, indexof} from './Utility.js' | |
| import {node, char, prev, next, peek, caret, alloc, dealloc, delimit, whitespace, escaping, identifier, commenter} from './Tokenizer.js' | |
| /** | |
| * @param {string} value | |
| * @return {object[]} | |
| */ | |
| export function compile (value) { | |
| return dealloc(parse('', null, null, null, [''], value = alloc(value), 0, [0], value)) | |
| } | |
| /** | |
| * @param {string} value | |
| * @param {object} root | |
| * @param {object?} parent | |
| * @param {string[]} rule | |
| * @param {string[]} rules | |
| * @param {string[]} rulesets | |
| * @param {number[]} pseudo | |
| * @param {number[]} points | |
| * @param {string[]} declarations | |
| * @return {object} | |
| */ | |
| export function parse (value, root, parent, rule, rules, rulesets, pseudo, points, declarations) { | |
| var index = 0 | |
| var offset = 0 | |
| var length = pseudo | |
| var atrule = 0 | |
| var property = 0 | |
| var previous = 0 | |
| var variable = 1 | |
| var scanning = 1 | |
| var ampersand = 1 | |
| var character = 0 | |
| var type = '' | |
| var props = rules | |
| var children = rulesets | |
| var reference = rule | |
| var characters = type | |
| while (scanning) | |
| switch (previous = character, character = next()) { | |
| // ( | |
| case 40: | |
| if (previous != 108 && charat(characters, length - 1) == 58) { | |
| if (indexof(characters += replace(delimit(character), '&', '&\f'), '&\f') != -1) | |
| ampersand = -1 | |
| break | |
| } | |
| // " ' [ | |
| case 34: case 39: case 91: | |
| characters += delimit(character) | |
| break | |
| // \t \n \r \s | |
| case 9: case 10: case 13: case 32: | |
| characters += whitespace(previous) | |
| break | |
| // \ | |
| case 92: | |
| characters += escaping(caret() - 1, 7) | |
| continue | |
| // / | |
| case 47: | |
| switch (peek()) { | |
| case 42: case 47: | |
| append(comment(commenter(next(), caret()), root, parent), declarations) | |
| break | |
| default: | |
| characters += '/' | |
| } | |
| break | |
| // { | |
| case 123 * variable: | |
| points[index++] = strlen(characters) * ampersand | |
| // } ; \0 | |
| case 125 * variable: case 59: case 0: | |
| switch (character) { | |
| // \0 } | |
| case 0: case 125: scanning = 0 | |
| // ; | |
| case 59 + offset: if (ampersand == -1) characters = replace(characters, /\f/g, '') | |
| if (property > 0 && (strlen(characters) - length)) | |
| append(property > 32 ? declaration(characters + ';', rule, parent, length - 1) : declaration(replace(characters, ' ', '') + ';', rule, parent, length - 2), declarations) | |
| break | |
| // @ ; | |
| case 59: characters += ';' | |
| // { rule/at-rule | |
| default: | |
| append(reference = ruleset(characters, root, parent, index, offset, rules, points, type, props = [], children = [], length), rulesets) | |
| if (character === 123) | |
| if (offset === 0) | |
| parse(characters, root, reference, reference, props, rulesets, length, points, children) | |
| else | |
| switch (atrule === 99 && charat(characters, 3) === 110 ? 100 : atrule) { | |
| // d l m s | |
| case 100: case 108: case 109: case 115: | |
| parse(value, reference, reference, rule && append(ruleset(value, reference, reference, 0, 0, rules, points, type, rules, props = [], length), children), rules, children, length, points, rule ? props : children) | |
| break | |
| default: | |
| parse(characters, reference, reference, reference, [''], children, 0, points, children) | |
| } | |
| } | |
| index = offset = property = 0, variable = ampersand = 1, type = characters = '', length = pseudo | |
| break | |
| // : | |
| case 58: | |
| length = 1 + strlen(characters), property = previous | |
| default: | |
| if (variable < 1) | |
| if (character == 123) | |
| --variable | |
| else if (character == 125 && variable++ == 0 && prev() == 125) | |
| continue | |
| switch (characters += from(character), character * variable) { | |
| // & | |
| case 38: | |
| ampersand = offset > 0 ? 1 : (characters += '\f', -1) | |
| break | |
| // , | |
| case 44: | |
| points[index++] = (strlen(characters) - 1) * ampersand, ampersand = 1 | |
| break | |
| // @ | |
| case 64: | |
| // - | |
| if (peek() === 45) | |
| characters += delimit(next()) | |
| atrule = peek(), offset = length = strlen(type = characters += identifier(caret())), character++ | |
| break | |
| // - | |
| case 45: | |
| if (previous === 45 && strlen(characters) == 2) | |
| variable = 0 | |
| } | |
| } | |
| return rulesets | |
| } | |
| /** | |
| * @param {string} value | |
| * @param {object} root | |
| * @param {object?} parent | |
| * @param {number} index | |
| * @param {number} offset | |
| * @param {string[]} rules | |
| * @param {number[]} points | |
| * @param {string} type | |
| * @param {string[]} props | |
| * @param {string[]} children | |
| * @param {number} length | |
| * @return {object} | |
| */ | |
| export function ruleset (value, root, parent, index, offset, rules, points, type, props, children, length) { | |
| var post = offset - 1 | |
| var rule = offset === 0 ? rules : [''] | |
| var size = sizeof(rule) | |
| for (var i = 0, j = 0, k = 0; i < index; ++i) | |
| for (var x = 0, y = substr(value, post + 1, post = abs(j = points[i])), z = value; x < size; ++x) | |
| if (z = trim(j > 0 ? rule[x] + ' ' + y : replace(y, /&\f/g, rule[x]))) | |
| props[k++] = z | |
| return node(value, root, parent, offset === 0 ? RULESET : type, props, children, length) | |
| } | |
| /** | |
| * @param {number} value | |
| * @param {object} root | |
| * @param {object?} parent | |
| * @return {object} | |
| */ | |
| export function comment (value, root, parent) { | |
| return node(value, root, parent, COMMENT, from(char()), substr(value, 2, -2), 0) | |
| } | |
| /** | |
| * @param {string} value | |
| * @param {object} root | |
| * @param {object?} parent | |
| * @param {number} length | |
| * @return {object} | |
| */ | |
| export function declaration (value, root, parent, length) { | |
| return node(value, root, parent, DECLARATION, substr(value, 0, length), substr(value, length + 1, -1), length) | |
| } | |
Xet Storage Details
- Size:
- 5.72 kB
- Xet hash:
- 3ae75bba9d423339e5c1e861a722dbc0c5188bb628dc442fed6c39d63b39543c
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.