|
| 1 | +module.exports = { |
| 2 | + |
| 3 | + /** |
| 4 | + * Internal. Smart split bunch on '\n' symbols; |
| 5 | + * @param {Array} bunch |
| 6 | + * @param {Boolean} isPrevDeclExists |
| 7 | + */ |
| 8 | + _splitBunch: function(bunch, isPrevDeclExists) { |
| 9 | + var nextBunch = []; |
| 10 | + var declAlready = false; |
| 11 | + var flag = false; |
| 12 | + var item; |
| 13 | + var indexOf; |
| 14 | + |
| 15 | + for (var i = 0; i < bunch.length; ++i) { |
| 16 | + if (flag) { nextBunch.push(bunch[i]); continue; } |
| 17 | + if (bunch[i][0] === 'declaration') { declAlready = true; } |
| 18 | + |
| 19 | + if (isPrevDeclExists && !declAlready) continue; |
| 20 | + if (bunch[i][0] !== 's') continue; |
| 21 | + |
| 22 | + var indexOfNewLine = bunch[i][1].indexOf('\n'); |
| 23 | + |
| 24 | + if (indexOfNewLine === -1) continue; |
| 25 | + |
| 26 | + nextBunch.push(['s', bunch[i][1].substr(indexOfNewLine + 1)]); |
| 27 | + bunch[i][1] = bunch[i][1].substr(0, indexOfNewLine + 1); |
| 28 | + |
| 29 | + flag = i + 1; |
| 30 | + } |
| 31 | + |
| 32 | + if (nextBunch.length === 1 && nextBunch[0][0] === 's') { |
| 33 | + item = nextBunch[0]; |
| 34 | + indexOf = item[1].lastIndexOf('\n'); |
| 35 | + |
| 36 | + indexOf !== -1 && (item[1] = item[1].substr(indexOf + 1)); |
| 37 | + } |
| 38 | + |
| 39 | + flag && bunch.splice(flag); |
| 40 | + |
| 41 | + return nextBunch; |
| 42 | + }, |
| 43 | + |
| 44 | + /** |
| 45 | + * Internal. Create extended node in format of list |
| 46 | + * { |
| 47 | + * data:[,,declaration,] |
| 48 | + * decl: declarationPropertyName |
| 49 | + * }; |
| 50 | + * @param {node} node |
| 51 | + */ |
| 52 | + _createNodeExt: function(node) { |
| 53 | + var extNode = []; |
| 54 | + var bunch = []; |
| 55 | + var nextBunch; |
| 56 | + var prevDeclPropertyName; |
| 57 | + |
| 58 | + node.forEach(function(node) { |
| 59 | + if (node[0] === 'declaration') { |
| 60 | + nextBunch = this._splitBunch(bunch, prevDeclPropertyName); |
| 61 | + extNode.push({ data: bunch, decl: prevDeclPropertyName }); |
| 62 | + bunch = nextBunch; |
| 63 | + prevDeclPropertyName = node[1][1][1]; |
| 64 | + } |
| 65 | + bunch.push(node); |
| 66 | + }, this); |
| 67 | + |
| 68 | + nextBunch = this._splitBunch(bunch, prevDeclPropertyName); |
| 69 | + extNode.push({ data: bunch, decl: prevDeclPropertyName }); |
| 70 | + nextBunch.length && extNode.push({ data: nextBunch }); |
| 71 | + |
| 72 | + return extNode; |
| 73 | + }, |
| 74 | + |
| 75 | + /** |
| 76 | + * Internal. Add delimiter at the end of groups of properties |
| 77 | + * @param {extNode} extNodePrev |
| 78 | + * @param {extNode} extNode |
| 79 | + */ |
| 80 | + _addGroupDelimiter: function(extNodePrev, extNode) { |
| 81 | + if (!extNodePrev.decl || !extNode.decl) return; |
| 82 | + |
| 83 | + var indexA = this._order[extNodePrev.decl]; |
| 84 | + var indexB = this._order[extNode.decl]; |
| 85 | + var isGroupBorder = indexA && indexB && indexA.group !== indexB.group; |
| 86 | + |
| 87 | + if (isGroupBorder) extNode.data.unshift(['s', '\n']); |
| 88 | + }, |
| 89 | + |
| 90 | + /** |
| 91 | + * Internal. apply extNode back at common format node. |
| 92 | + * @param {node} node |
| 93 | + * @param {extNode} extNode |
| 94 | + */ |
| 95 | + _applyNodeExt: function(node, extNode) { |
| 96 | + node.splice(0, node.length); |
| 97 | + extNode.forEach(function(item, i) { |
| 98 | + i > 0 && this._addGroupDelimiter(extNode[i - 1], item); |
| 99 | + node.push.apply(node, item.data); |
| 100 | + }, this); |
| 101 | + }, |
| 102 | + |
| 103 | + /** |
| 104 | + * Sets handler value. |
| 105 | + * |
| 106 | + * @param {Array} value Option value |
| 107 | + * @returns {Object} |
| 108 | + */ |
| 109 | + setValue: function(value) { |
| 110 | + if (!value) return; |
| 111 | + |
| 112 | + this._order = {}; |
| 113 | + value.forEach(function(group, groupIndex) { |
| 114 | + group.forEach(function(prop, propIndex) { |
| 115 | + this._order[prop] = { group: groupIndex, prop: propIndex }; |
| 116 | + }, this); |
| 117 | + }, this); |
| 118 | + |
| 119 | + return this; |
| 120 | + }, |
| 121 | + |
| 122 | + /** |
| 123 | + * Processes tree node. |
| 124 | + * @param {String} nodeType |
| 125 | + * @param {node} node |
| 126 | + */ |
| 127 | + process: function(nodeType, node) { |
| 128 | + if (nodeType !== 'block') return; |
| 129 | + |
| 130 | + var order = this._order; |
| 131 | + var nodeExt = this._createNodeExt(node); |
| 132 | + var firstSymbols = nodeExt[0].decl || nodeExt.shift(); |
| 133 | + var lastSymbols = nodeExt[nodeExt.length - 1].decl || nodeExt.pop(); |
| 134 | + |
| 135 | + nodeExt.sort(function(a, b) { |
| 136 | + var indexA = order[a.decl] || { prop: -1 }; |
| 137 | + var indexB = order[b.decl] || { prop: -1 }; |
| 138 | + var groupDelta = indexA.group - indexB.group; |
| 139 | + var propDelta = indexA.prop - indexB.prop; |
| 140 | + |
| 141 | + return groupDelta !== 0 ? groupDelta : propDelta; |
| 142 | + }); |
| 143 | + |
| 144 | + firstSymbols && nodeExt.unshift(firstSymbols); |
| 145 | + lastSymbols && nodeExt.push(lastSymbols); |
| 146 | + |
| 147 | + this._applyNodeExt(node, nodeExt); |
| 148 | + } |
| 149 | + |
| 150 | +}; |
0 commit comments