3 var utils = require('./utils');
5 module.exports = function(braces, options) {
12 .set('bos', function() {
13 if (this.output) return;
14 this.ast.queue = isEscaped(this.ast) ? [this.ast.val] : [];
22 .set('bracket', function(node) {
23 var close = node.close;
24 var open = !node.escaped ? '[' : '\\[';
25 var negated = node.negated;
26 var inner = node.inner;
28 inner = inner.replace(/\\(?=[\\\w]|$)/g, '\\\\');
33 if (negated && inner.indexOf('.') === -1) {
36 if (negated && inner.indexOf('/') === -1) {
40 var val = open + negated + inner + close;
41 var queue = node.parent.queue;
42 var last = utils.arrayify(queue.pop());
44 queue.push(utils.join(last, val));
45 queue.push.apply(queue, []);
52 .set('brace', function(node) {
53 node.queue = isEscaped(node) ? [node.val] : [];
55 return this.mapVisit(node.nodes);
62 .set('brace.open', function(node) {
63 node.parent.open = node.val;
70 .set('text', function(node) {
71 var queue = node.parent.queue;
72 var escaped = node.escaped;
73 var segs = [node.val];
75 if (node.optimize === false) {
76 options = utils.extend({}, options, {optimize: false});
79 if (node.multiplier > 1) {
80 node.parent.count *= node.multiplier;
83 if (options.quantifiers === true && utils.isQuantifier(node.val)) {
86 } else if (node.val.length > 1) {
87 if (isType(node.parent, 'brace') && !isEscaped(node)) {
88 var expanded = utils.expand(node.val, options);
91 if (expanded.isOptimized) {
92 node.parent.isOptimized = true;
95 // if nothing was expanded, we probably have a literal brace
97 var val = (expanded.val || node.val);
98 if (options.unescape !== false) {
99 // unescape unexpanded brace sequence/set separators
100 val = val.replace(/\\([,.])/g, '$1');
102 val = val.replace(/["'`]/g, '');
110 } else if (node.val === ',') {
111 if (options.expand) {
112 node.parent.queue.push(['']);
121 if (escaped && isType(node.parent, 'brace')) {
122 if (node.parent.nodes.length <= 4 && node.parent.count === 1) {
123 node.parent.escaped = true;
124 } else if (node.parent.length <= 3) {
125 node.parent.escaped = true;
129 if (!hasQueue(node.parent)) {
130 node.parent.queue = segs;
134 var last = utils.arrayify(queue.pop());
135 if (node.parent.count > 1 && options.expand) {
136 last = multiply(last, node.parent.count);
137 node.parent.count = 1;
140 queue.push(utils.join(utils.flatten(last), segs.shift()));
141 queue.push.apply(queue, segs);
148 .set('brace.close', function(node) {
149 var queue = node.parent.queue;
150 var prev = node.parent.parent;
151 var last = prev.queue.pop();
152 var open = node.parent.open;
153 var close = node.val;
155 if (open && close && isOptimized(node, options)) {
160 // if a close brace exists, and the previous segment is one character
161 // don't wrap the result in braces or parens
162 var ele = utils.last(queue);
163 if (node.parent.count > 1 && options.expand) {
164 ele = multiply(queue.pop(), node.parent.count);
165 node.parent.count = 1;
169 if (close && typeof ele === 'string' && ele.length === 1) {
174 if ((isLiteralBrace(node, options) || noInner(node)) && !node.parent.hasEmpty) {
175 queue.push(utils.join(open, queue.pop() || ''));
176 queue = utils.flatten(utils.join(queue, close));
179 if (typeof last === 'undefined') {
180 prev.queue = [queue];
182 prev.queue.push(utils.flatten(utils.join(last, queue)));
190 .set('eos', function(node) {
191 if (this.input) return;
193 if (options.optimize !== false) {
194 this.output = utils.last(utils.flatten(this.ast.queue));
195 } else if (Array.isArray(utils.last(this.ast.queue))) {
196 this.output = utils.flatten(this.ast.queue.pop());
198 this.output = utils.flatten(this.ast.queue);
201 if (node.parent.count > 1 && options.expand) {
202 this.output = multiply(this.output, node.parent.count);
205 this.output = utils.arrayify(this.output);
212 * Multiply the segments in the current brace level
215 function multiply(queue, n, options) {
216 return utils.flatten(utils.repeat(utils.arrayify(queue), n));
220 * Return true if `node` is escaped
223 function isEscaped(node) {
224 return node.escaped === true;
228 * Returns true if regex parens should be used for sets. If the parent `type`
229 * is not `brace`, then we're on a root node, which means we should never
230 * expand segments and open/close braces should be `{}` (since this indicates
231 * a brace is missing from the set)
234 function isOptimized(node, options) {
235 if (node.parent.isOptimized) return true;
236 return isType(node.parent, 'brace')
237 && !isEscaped(node.parent)
238 && options.expand !== true;
242 * Returns true if the value in `node` should be wrapped in a literal brace.
246 function isLiteralBrace(node, options) {
247 return isEscaped(node.parent) || options.optimize !== false;
251 * Returns true if the given `node` does not have an inner value.
255 function noInner(node, type) {
256 if (node.parent.queue.length === 1) {
259 var nodes = node.parent.nodes;
260 return nodes.length === 3
261 && isType(nodes[0], 'brace.open')
262 && !isType(nodes[1], 'text')
263 && isType(nodes[2], 'brace.close');
267 * Returns true if the given `node` is the given `type`
271 function isType(node, type) {
272 return typeof node !== 'undefined' && node.type === type;
276 * Returns true if the given `node` has a non-empty queue.
280 function hasQueue(node) {
281 return Array.isArray(node.queue) && node.queue.length;