mirror of
https://github.com/jashkenas/coffeescript.git
synced 2022-11-09 12:23:24 -05:00
1313 lines
No EOL
50 KiB
JavaScript
1313 lines
No EOL
50 KiB
JavaScript
(function(){
|
|
var AccessorNode, ArrayNode, AssignNode, CallNode, ClosureNode, CodeNode, CommentNode, ExistenceNode, Expressions, ExtendsNode, ForNode, IDENTIFIER, IfNode, IndexNode, LiteralNode, Node, ObjectNode, OpNode, ParentheticalNode, PushNode, RangeNode, ReturnNode, SliceNode, SplatNode, TAB, TRAILING_WHITESPACE, ThisNode, ThrowNode, TryNode, ValueNode, WhileNode, compact, del, flatten, inherit, merge, statement;
|
|
var __hasProp = Object.prototype.hasOwnProperty;
|
|
(typeof process !== "undefined" && process !== null) ? process.mixin(require('scope')) : (this.exports = this);
|
|
// Some helper functions
|
|
// Tabs are two spaces for pretty printing.
|
|
TAB = ' ';
|
|
TRAILING_WHITESPACE = /\s+$/gm;
|
|
// Keep the identifier regex in sync with the Lexer.
|
|
IDENTIFIER = /^[a-zA-Z$_](\w|\$)*$/;
|
|
// Merge objects.
|
|
merge = function merge(options, overrides) {
|
|
var _a, _b, fresh, key, val;
|
|
fresh = {};
|
|
_a = options;
|
|
for (key in _a) if (__hasProp.call(_a, key)) {
|
|
val = _a[key];
|
|
((fresh[key] = val));
|
|
}
|
|
if (overrides) {
|
|
_b = overrides;
|
|
for (key in _b) if (__hasProp.call(_b, key)) {
|
|
val = _b[key];
|
|
((fresh[key] = val));
|
|
}
|
|
}
|
|
return fresh;
|
|
};
|
|
// Trim out all falsy values from an array.
|
|
compact = function compact(array) {
|
|
var _a, _b, _c, item;
|
|
_a = []; _b = array;
|
|
for (_c = 0; _c < _b.length; _c++) {
|
|
item = _b[_c];
|
|
if (item) {
|
|
_a.push(item);
|
|
}
|
|
}
|
|
return _a;
|
|
};
|
|
// Return a completely flattened version of an array.
|
|
flatten = function flatten(array) {
|
|
var _a, _b, item, memo;
|
|
memo = [];
|
|
_a = array;
|
|
for (_b = 0; _b < _a.length; _b++) {
|
|
item = _a[_b];
|
|
item instanceof Array ? (memo = memo.concat(item)) : memo.push(item);
|
|
}
|
|
return memo;
|
|
};
|
|
// Delete a key from an object, returning the value.
|
|
del = function del(obj, key) {
|
|
var val;
|
|
val = obj[key];
|
|
delete obj[key];
|
|
return val;
|
|
};
|
|
// Quickie inheritance convenience wrapper to reduce typing.
|
|
inherit = function inherit(parent, props) {
|
|
var _a, _b, klass, name, prop;
|
|
klass = del(props, 'constructor');
|
|
_a = function(){};
|
|
_a.prototype = parent.prototype;
|
|
klass.__superClass__ = parent.prototype;
|
|
klass.prototype = new _a();
|
|
klass.prototype.constructor = klass;
|
|
_b = props;
|
|
for (name in _b) if (__hasProp.call(_b, name)) {
|
|
prop = _b[name];
|
|
((klass.prototype[name] = prop));
|
|
}
|
|
return klass;
|
|
};
|
|
// Mark a node as a statement, or a statement only.
|
|
statement = function statement(klass, only) {
|
|
klass.prototype.is_statement = function is_statement() {
|
|
return true;
|
|
};
|
|
if (only) {
|
|
return ((klass.prototype.is_statement_only = function is_statement_only() {
|
|
return true;
|
|
}));
|
|
}
|
|
};
|
|
// The abstract base class for all CoffeeScript nodes.
|
|
// All nodes are implement a "compile_node" method, which performs the
|
|
// code generation for that node. To compile a node, call the "compile"
|
|
// method, which wraps "compile_node" in some extra smarts, to know when the
|
|
// generated code should be wrapped up in a closure. An options hash is passed
|
|
// and cloned throughout, containing messages from higher in the AST,
|
|
// information about the current scope, and indentation level.
|
|
Node = (exports.Node = function Node() { });
|
|
// This is extremely important -- we convert JS statements into expressions
|
|
// by wrapping them in a closure, only if it's possible, and we're not at
|
|
// the top level of a block (which would be unnecessary), and we haven't
|
|
// already been asked to return the result.
|
|
Node.prototype.compile = function compile(o) {
|
|
var closure, top;
|
|
this.options = merge(o || {});
|
|
this.indent = o.indent;
|
|
top = this.top_sensitive() ? this.options.top : del(this.options, 'top');
|
|
closure = this.is_statement() && !this.is_statement_only() && !top && !this.options.returns && !(this instanceof CommentNode) && !this.contains(function(node) {
|
|
return node.is_statement_only();
|
|
});
|
|
return closure ? this.compile_closure(this.options) : this.compile_node(this.options);
|
|
};
|
|
// Statements converted into expressions share scope with their parent
|
|
// closure, to preserve JavaScript-style lexical scope.
|
|
Node.prototype.compile_closure = function compile_closure(o) {
|
|
this.indent = o.indent;
|
|
o.shared_scope = o.scope;
|
|
return ClosureNode.wrap(this).compile(o);
|
|
};
|
|
// Quick short method for the current indentation level, plus tabbing in.
|
|
Node.prototype.idt = function idt(tabs) {
|
|
var _a, _b, _c, _d, i, idt;
|
|
idt = (this.indent || '');
|
|
_c = 0; _d = (tabs || 0);
|
|
for (_b=0, i=_c; (_c <= _d ? i < _d : i > _d); (_c <= _d ? i += 1 : i -= 1), _b++) {
|
|
idt += TAB;
|
|
}
|
|
return idt;
|
|
};
|
|
// Does this node, or any of its children, contain a node of a certain kind?
|
|
Node.prototype.contains = function contains(block) {
|
|
var _a, _b, node;
|
|
_a = this.children;
|
|
for (_b = 0; _b < _a.length; _b++) {
|
|
node = _a[_b];
|
|
if (block(node)) {
|
|
return true;
|
|
}
|
|
if (node instanceof Node && node.contains(block)) {
|
|
return true;
|
|
}
|
|
}
|
|
return false;
|
|
};
|
|
// toString representation of the node, for inspecting the parse tree.
|
|
Node.prototype.toString = function toString(idt) {
|
|
var _a, _b, _c, child;
|
|
idt = idt || '';
|
|
return '\n' + idt + this.type + (function() {
|
|
_a = []; _b = this.children;
|
|
for (_c = 0; _c < _b.length; _c++) {
|
|
child = _b[_c];
|
|
_a.push(child.toString(idt + TAB));
|
|
}
|
|
return _a;
|
|
}).call(this).join('');
|
|
};
|
|
// Default implementations of the common node methods.
|
|
Node.prototype.unwrap = function unwrap() {
|
|
return this;
|
|
};
|
|
Node.prototype.children = [];
|
|
Node.prototype.is_statement = function is_statement() {
|
|
return false;
|
|
};
|
|
Node.prototype.is_statement_only = function is_statement_only() {
|
|
return false;
|
|
};
|
|
Node.prototype.top_sensitive = function top_sensitive() {
|
|
return false;
|
|
};
|
|
// A collection of nodes, each one representing an expression.
|
|
Expressions = (exports.Expressions = inherit(Node, {
|
|
type: 'Expressions',
|
|
constructor: function constructor(nodes) {
|
|
this.children = (this.expressions = compact(flatten(nodes || [])));
|
|
return this;
|
|
},
|
|
// Tack an expression on to the end of this expression list.
|
|
push: function push(node) {
|
|
this.expressions.push(node);
|
|
return this;
|
|
},
|
|
// Tack an expression on to the beginning of this expression list.
|
|
unshift: function unshift(node) {
|
|
this.expressions.unshift(node);
|
|
return this;
|
|
},
|
|
// If this Expressions consists of a single node, pull it back out.
|
|
unwrap: function unwrap() {
|
|
return this.expressions.length === 1 ? this.expressions[0] : this;
|
|
},
|
|
// Is this an empty block of code?
|
|
empty: function empty() {
|
|
return this.expressions.length === 0;
|
|
},
|
|
// Is the node last in this block of expressions?
|
|
is_last: function is_last(node) {
|
|
var l, last_index;
|
|
l = this.expressions.length;
|
|
last_index = this.expressions[l - 1] instanceof CommentNode ? 2 : 1;
|
|
return node === this.expressions[l - last_index];
|
|
},
|
|
compile: function compile(o) {
|
|
o = o || {};
|
|
return o.scope ? Node.prototype.compile.call(this, o) : this.compile_root(o);
|
|
},
|
|
// Compile each expression in the Expressions body.
|
|
compile_node: function compile_node(o) {
|
|
var _a, _b, _c, node;
|
|
return (function() {
|
|
_a = []; _b = this.expressions;
|
|
for (_c = 0; _c < _b.length; _c++) {
|
|
node = _b[_c];
|
|
_a.push(this.compile_expression(node, merge(o)));
|
|
}
|
|
return _a;
|
|
}).call(this).join("\n");
|
|
},
|
|
// If this is the top-level Expressions, wrap everything in a safety closure.
|
|
compile_root: function compile_root(o) {
|
|
var code, indent;
|
|
o.indent = (this.indent = (indent = o.no_wrap ? '' : TAB));
|
|
o.scope = new Scope(null, this, null);
|
|
code = o.globals ? this.compile_node(o) : this.compile_with_declarations(o);
|
|
code = code.replace(TRAILING_WHITESPACE, '');
|
|
return o.no_wrap ? code : "(function(){\n" + code + "\n})();";
|
|
},
|
|
// Compile the expressions body, with declarations of all inner variables
|
|
// pushed up to the top.
|
|
compile_with_declarations: function compile_with_declarations(o) {
|
|
var args, argv, code;
|
|
code = this.compile_node(o);
|
|
args = this.contains(function(node) {
|
|
return node instanceof ValueNode && node.is_arguments();
|
|
});
|
|
argv = args && o.scope.check('arguments') ? '' : 'var ';
|
|
if (args) {
|
|
code = this.idt() + argv + "arguments = Array.prototype.slice.call(arguments, 0);\n" + code;
|
|
}
|
|
if (o.scope.has_assignments(this)) {
|
|
code = this.idt() + 'var ' + o.scope.compiled_assignments() + ";\n" + code;
|
|
}
|
|
if (o.scope.has_declarations(this)) {
|
|
code = this.idt() + 'var ' + o.scope.compiled_declarations() + ";\n" + code;
|
|
}
|
|
return code;
|
|
},
|
|
// Compiles a single expression within the expressions body.
|
|
compile_expression: function compile_expression(node, o) {
|
|
var returns, stmt;
|
|
this.indent = o.indent;
|
|
stmt = node.is_statement();
|
|
// We need to return the result if this is the last node in the expressions body.
|
|
returns = del(o, 'returns') && this.is_last(node) && !node.is_statement_only();
|
|
// Return the regular compile of the node, unless we need to return the result.
|
|
if (!(returns)) {
|
|
return (stmt ? '' : this.idt()) + node.compile(merge(o, {
|
|
top: true
|
|
})) + (stmt ? '' : ';');
|
|
}
|
|
// If it's a statement, the node knows how to return itself.
|
|
if (node.is_statement()) {
|
|
return node.compile(merge(o, {
|
|
returns: true
|
|
}));
|
|
}
|
|
// Otherwise, we can just return the value of the expression.
|
|
return this.idt() + 'return ' + node.compile(o) + ';';
|
|
}
|
|
}));
|
|
// Wrap up a node as an Expressions, unless it already is one.
|
|
Expressions.wrap = function wrap(nodes) {
|
|
if (nodes.length === 1 && nodes[0] instanceof Expressions) {
|
|
return nodes[0];
|
|
}
|
|
return new Expressions(nodes);
|
|
};
|
|
statement(Expressions);
|
|
// Literals are static values that can be passed through directly into
|
|
// JavaScript without translation, eg.: strings, numbers, true, false, null...
|
|
LiteralNode = (exports.LiteralNode = inherit(Node, {
|
|
type: 'Literal',
|
|
constructor: function constructor(value) {
|
|
this.value = value;
|
|
return this;
|
|
},
|
|
// Break and continue must be treated as statements -- they lose their meaning
|
|
// when wrapped in a closure.
|
|
is_statement: function is_statement() {
|
|
return this.value === 'break' || this.value === 'continue';
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var end, idt;
|
|
idt = this.is_statement() ? this.idt() : '';
|
|
end = this.is_statement() ? ';' : '';
|
|
return idt + this.value + end;
|
|
},
|
|
toString: function toString(idt) {
|
|
return ' "' + this.value + '"';
|
|
}
|
|
}));
|
|
LiteralNode.prototype.is_statement_only = LiteralNode.prototype.is_statement;
|
|
// Return an expression, or wrap it in a closure and return it.
|
|
ReturnNode = (exports.ReturnNode = inherit(Node, {
|
|
type: 'Return',
|
|
constructor: function constructor(expression) {
|
|
this.children = [(this.expression = expression)];
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
if (this.expression.is_statement()) {
|
|
return this.expression.compile(merge(o, {
|
|
returns: true
|
|
}));
|
|
}
|
|
return this.idt() + 'return ' + this.expression.compile(o) + ';';
|
|
}
|
|
}));
|
|
statement(ReturnNode, true);
|
|
// A value, indexed or dotted into, or vanilla.
|
|
ValueNode = (exports.ValueNode = inherit(Node, {
|
|
type: 'Value',
|
|
SOAK: " == undefined ? undefined : ",
|
|
constructor: function constructor(base, properties) {
|
|
this.children = flatten([(this.base = base), (this.properties = (properties || []))]);
|
|
return this;
|
|
},
|
|
push: function push(prop) {
|
|
this.properties.push(prop);
|
|
this.children.push(prop);
|
|
return this;
|
|
},
|
|
has_properties: function has_properties() {
|
|
return this.properties.length || this.base instanceof ThisNode;
|
|
},
|
|
is_array: function is_array() {
|
|
return this.base instanceof ArrayNode && !this.has_properties();
|
|
},
|
|
is_object: function is_object() {
|
|
return this.base instanceof ObjectNode && !this.has_properties();
|
|
},
|
|
is_splice: function is_splice() {
|
|
return this.has_properties() && this.properties[this.properties.length - 1] instanceof SliceNode;
|
|
},
|
|
is_arguments: function is_arguments() {
|
|
return this.base.value === 'arguments';
|
|
},
|
|
unwrap: function unwrap() {
|
|
return this.properties.length ? this : this.base;
|
|
},
|
|
// Values are statements if their base is a statement.
|
|
is_statement: function is_statement() {
|
|
return this.base.is_statement && this.base.is_statement() && !this.has_properties();
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var _a, _b, baseline, code, only, part, parts, prop, props, soaked, temp;
|
|
soaked = false;
|
|
only = del(o, 'only_first');
|
|
props = only ? this.properties.slice(0, this.properties.length - 1) : this.properties;
|
|
baseline = this.base.compile(o);
|
|
if (this.base instanceof ObjectNode && this.has_properties()) {
|
|
baseline = '(' + baseline + ')';
|
|
}
|
|
parts = [baseline];
|
|
_a = props;
|
|
for (_b = 0; _b < _a.length; _b++) {
|
|
prop = _a[_b];
|
|
if (prop instanceof AccessorNode && prop.soak) {
|
|
soaked = true;
|
|
if (this.base instanceof CallNode && prop === props[0]) {
|
|
temp = o.scope.free_variable();
|
|
parts[parts.length - 1] = '(' + temp + ' = ' + baseline + ')' + this.SOAK + ((baseline = temp + prop.compile(o)));
|
|
} else {
|
|
parts[parts.length - 1] += (this.SOAK + (baseline += prop.compile(o)));
|
|
}
|
|
} else {
|
|
part = prop.compile(o);
|
|
baseline += part;
|
|
parts.push(part);
|
|
}
|
|
}
|
|
this.last = parts[parts.length - 1];
|
|
this.source = parts.length > 1 ? parts.slice(0, parts.length).join('') : null;
|
|
code = parts.join('').replace(/\)\(\)\)/, '()))');
|
|
if (!(soaked)) {
|
|
return code;
|
|
}
|
|
return '(' + code + ')';
|
|
}
|
|
}));
|
|
// Pass through CoffeeScript comments into JavaScript comments at the
|
|
// same position.
|
|
CommentNode = (exports.CommentNode = inherit(Node, {
|
|
type: 'Comment',
|
|
constructor: function constructor(lines) {
|
|
this.lines = lines;
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
return this.idt() + '//' + this.lines.join('\n' + this.idt() + '//');
|
|
}
|
|
}));
|
|
statement(CommentNode);
|
|
// Node for a function invocation. Takes care of converting super() calls into
|
|
// calls against the prototype's function of the same name.
|
|
CallNode = (exports.CallNode = inherit(Node, {
|
|
type: 'Call',
|
|
constructor: function constructor(variable, args) {
|
|
this.children = flatten([(this.variable = variable), (this.args = (args || []))]);
|
|
this.prefix = '';
|
|
return this;
|
|
},
|
|
new_instance: function new_instance() {
|
|
this.prefix = 'new ';
|
|
return this;
|
|
},
|
|
push: function push(arg) {
|
|
this.args.push(arg);
|
|
this.children.push(arg);
|
|
return this;
|
|
},
|
|
// Compile a vanilla function call.
|
|
compile_node: function compile_node(o) {
|
|
var _a, _b, _c, arg, args;
|
|
if (this.args[this.args.length - 1] instanceof SplatNode) {
|
|
return this.compile_splat(o);
|
|
}
|
|
args = (function() {
|
|
_a = []; _b = this.args;
|
|
for (_c = 0; _c < _b.length; _c++) {
|
|
arg = _b[_c];
|
|
_a.push(arg.compile(o));
|
|
}
|
|
return _a;
|
|
}).call(this).join(', ');
|
|
if (this.variable === 'super') {
|
|
return this.compile_super(args, o);
|
|
}
|
|
return this.prefix + this.variable.compile(o) + '(' + args + ')';
|
|
},
|
|
// Compile a call against the superclass's implementation of the current function.
|
|
compile_super: function compile_super(args, o) {
|
|
var arg_part, meth, methname;
|
|
methname = o.scope.method.name;
|
|
arg_part = args.length ? ', ' + args : '';
|
|
meth = o.scope.method.proto ? o.scope.method.proto + '.__superClass__.' + methname : methname + '.__superClass__.constructor';
|
|
return meth + '.call(this' + arg_part + ')';
|
|
},
|
|
// Compile a function call being passed variable arguments.
|
|
compile_splat: function compile_splat(o) {
|
|
var _a, _b, arg, args, code, i, meth, obj;
|
|
meth = this.variable.compile(o);
|
|
obj = this.variable.source || 'this';
|
|
args = (function() {
|
|
_a = []; _b = this.args;
|
|
for (i = 0; i < _b.length; i++) {
|
|
arg = _b[i];
|
|
_a.push((function() {
|
|
code = arg.compile(o);
|
|
code = arg instanceof SplatNode ? code : '[' + code + ']';
|
|
return i === 0 ? code : '.concat(' + code + ')';
|
|
}).call(this));
|
|
}
|
|
return _a;
|
|
}).call(this);
|
|
return this.prefix + meth + '.apply(' + obj + ', ' + args.join('') + ')';
|
|
},
|
|
// If the code generation wished to use the result of a function call
|
|
// in multiple places, ensure that the function is only ever called once.
|
|
compile_reference: function compile_reference(o) {
|
|
var call, reference;
|
|
reference = new LiteralNode(o.scope.free_variable());
|
|
call = new ParentheticalNode(new AssignNode(reference, this));
|
|
return [call, reference];
|
|
}
|
|
}));
|
|
// Node to extend an object's prototype with an ancestor object.
|
|
// After goog.inherits from the Closure Library.
|
|
ExtendsNode = (exports.ExtendsNode = inherit(Node, {
|
|
type: 'Extends',
|
|
constructor: function constructor(child, parent) {
|
|
this.children = [(this.child = child), (this.parent = parent)];
|
|
return this;
|
|
},
|
|
// Hooking one constructor into another's prototype chain.
|
|
compile_node: function compile_node(o) {
|
|
var child, child_var, construct, parent, parent_var, prefix;
|
|
construct = o.scope.free_variable();
|
|
child = this.child.compile(o);
|
|
parent = this.parent.compile(o);
|
|
prefix = '';
|
|
if (!(this.child instanceof ValueNode) || this.child.has_properties() || !(this.child.unwrap() instanceof LiteralNode)) {
|
|
child_var = o.scope.free_variable();
|
|
prefix += this.idt() + child_var + ' = ' + child + ';\n';
|
|
child = child_var;
|
|
}
|
|
if (!(this.parent instanceof ValueNode) || this.parent.has_properties() || !(this.parent.unwrap() instanceof LiteralNode)) {
|
|
parent_var = o.scope.free_variable();
|
|
prefix += this.idt() + parent_var + ' = ' + parent + ';\n';
|
|
parent = parent_var;
|
|
}
|
|
return prefix + this.idt() + construct + ' = function(){};\n' + this.idt() + construct + '.prototype = ' + parent + ".prototype;\n" + this.idt() + child + '.__superClass__ = ' + parent + ".prototype;\n" + this.idt() + child + '.prototype = new ' + construct + "();\n" + this.idt() + child + '.prototype.constructor = ' + child + ';';
|
|
}
|
|
}));
|
|
statement(ExtendsNode);
|
|
// A dotted accessor into a part of a value, or the :: shorthand for
|
|
// an accessor into the object's prototype.
|
|
AccessorNode = (exports.AccessorNode = inherit(Node, {
|
|
type: 'Accessor',
|
|
constructor: function constructor(name, tag) {
|
|
this.children = [(this.name = name)];
|
|
this.prototype = tag === 'prototype';
|
|
this.soak = tag === 'soak';
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
return '.' + (this.prototype ? 'prototype.' : '') + this.name.compile(o);
|
|
}
|
|
}));
|
|
// An indexed accessor into a part of an array or object.
|
|
IndexNode = (exports.IndexNode = inherit(Node, {
|
|
type: 'Index',
|
|
constructor: function constructor(index) {
|
|
this.children = [(this.index = index)];
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
return '[' + this.index.compile(o) + ']';
|
|
}
|
|
}));
|
|
// A this-reference, using '@'.
|
|
ThisNode = (exports.ThisNode = inherit(Node, {
|
|
type: 'This',
|
|
constructor: function constructor(property) {
|
|
this.property = property || null;
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
return 'this' + (this.property ? '.' + this.property.compile(o) : '');
|
|
}
|
|
}));
|
|
// A range literal. Ranges can be used to extract portions (slices) of arrays,
|
|
// or to specify a range for list comprehensions.
|
|
RangeNode = (exports.RangeNode = inherit(Node, {
|
|
type: 'Range',
|
|
constructor: function constructor(from, to, exclusive) {
|
|
this.children = [(this.from = from), (this.to = to)];
|
|
this.exclusive = !!exclusive;
|
|
return this;
|
|
},
|
|
compile_variables: function compile_variables(o) {
|
|
this.indent = o.indent;
|
|
this.from_var = o.scope.free_variable();
|
|
this.to_var = o.scope.free_variable();
|
|
return this.from_var + ' = ' + this.from.compile(o) + '; ' + this.to_var + ' = ' + this.to.compile(o) + ";\n" + this.idt();
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var compare, equals, idx, incr, intro, step, vars;
|
|
if (!(o.index)) {
|
|
return this.compile_array(o);
|
|
}
|
|
idx = del(o, 'index');
|
|
step = del(o, 'step');
|
|
vars = idx + '=' + this.from_var;
|
|
step = step ? step.compile(o) : '1';
|
|
equals = this.exclusive ? '' : '=';
|
|
intro = '(' + this.from_var + ' <= ' + this.to_var + ' ? ' + idx;
|
|
compare = intro + ' <' + equals + ' ' + this.to_var + ' : ' + idx + ' >' + equals + ' ' + this.to_var + ')';
|
|
incr = intro + ' += ' + step + ' : ' + idx + ' -= ' + step + ')';
|
|
return vars + '; ' + compare + '; ' + incr;
|
|
},
|
|
// Expand the range into the equivalent array, if it's not being used as
|
|
// part of a comprehension, slice, or splice.
|
|
// TODO: This generates pretty ugly code ... shrink it.
|
|
compile_array: function compile_array(o) {
|
|
var arr, body, name;
|
|
name = o.scope.free_variable();
|
|
body = Expressions.wrap([new LiteralNode(name)]);
|
|
arr = Expressions.wrap([new ForNode(body, {
|
|
source: (new ValueNode(this))
|
|
}, new LiteralNode(name))
|
|
]);
|
|
return (new ParentheticalNode(new CallNode(new CodeNode([], arr)))).compile(o);
|
|
}
|
|
}));
|
|
// An array slice literal. Unlike JavaScript's Array#slice, the second parameter
|
|
// specifies the index of the end of the slice (just like the first parameter)
|
|
// is the index of the beginning.
|
|
SliceNode = (exports.SliceNode = inherit(Node, {
|
|
type: 'Slice',
|
|
constructor: function constructor(range) {
|
|
this.children = [(this.range = range)];
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var from, plus_part, to;
|
|
from = this.range.from.compile(o);
|
|
to = this.range.to.compile(o);
|
|
plus_part = this.range.exclusive ? '' : ' + 1';
|
|
return ".slice(" + from + ', ' + to + plus_part + ')';
|
|
}
|
|
}));
|
|
// An object literal.
|
|
ObjectNode = (exports.ObjectNode = inherit(Node, {
|
|
type: 'Object',
|
|
constructor: function constructor(props) {
|
|
this.children = (this.objects = (this.properties = props || []));
|
|
return this;
|
|
},
|
|
// All the mucking about with commas is to make sure that CommentNodes and
|
|
// AssignNodes get interleaved correctly, with no trailing commas or
|
|
// commas affixed to comments. TODO: Extract this and add it to ArrayNode.
|
|
compile_node: function compile_node(o) {
|
|
var _a, _b, _c, _d, _e, i, indent, inner, join, last_noncom, non_comments, prop, props;
|
|
o.indent = this.idt(1);
|
|
non_comments = (function() {
|
|
_a = []; _b = this.properties;
|
|
for (_c = 0; _c < _b.length; _c++) {
|
|
prop = _b[_c];
|
|
if (!(prop instanceof CommentNode)) {
|
|
_a.push(prop);
|
|
}
|
|
}
|
|
return _a;
|
|
}).call(this);
|
|
last_noncom = non_comments[non_comments.length - 1];
|
|
props = (function() {
|
|
_d = []; _e = this.properties;
|
|
for (i = 0; i < _e.length; i++) {
|
|
prop = _e[i];
|
|
_d.push((function() {
|
|
join = ",\n";
|
|
if ((prop === last_noncom) || (prop instanceof CommentNode)) {
|
|
join = "\n";
|
|
}
|
|
if (i === this.properties.length - 1) {
|
|
join = '';
|
|
}
|
|
indent = prop instanceof CommentNode ? '' : this.idt(1);
|
|
return indent + prop.compile(o) + join;
|
|
}).call(this));
|
|
}
|
|
return _d;
|
|
}).call(this);
|
|
props = props.join('');
|
|
inner = props ? '\n' + props + '\n' + this.idt() : '';
|
|
return '{' + inner + '}';
|
|
}
|
|
}));
|
|
// An array literal.
|
|
ArrayNode = (exports.ArrayNode = inherit(Node, {
|
|
type: 'Array',
|
|
constructor: function constructor(objects) {
|
|
this.children = (this.objects = objects || []);
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var _a, _b, code, ending, i, obj, objects;
|
|
o.indent = this.idt(1);
|
|
objects = (function() {
|
|
_a = []; _b = this.objects;
|
|
for (i = 0; i < _b.length; i++) {
|
|
obj = _b[i];
|
|
_a.push((function() {
|
|
code = obj.compile(o);
|
|
if (obj instanceof CommentNode) {
|
|
return '\n' + code + '\n' + o.indent;
|
|
} else if (i === this.objects.length - 1) {
|
|
return code;
|
|
} else {
|
|
return code + ', ';
|
|
}
|
|
}).call(this));
|
|
}
|
|
return _a;
|
|
}).call(this);
|
|
objects = objects.join('');
|
|
ending = objects.indexOf('\n') >= 0 ? "\n" + this.idt() + ']' : ']';
|
|
return '[' + objects + ending;
|
|
}
|
|
}));
|
|
// A faux-node that is never created by the grammar, but is used during
|
|
// code generation to generate a quick "array.push(value)" tree of nodes.
|
|
PushNode = (exports.PushNode = {
|
|
wrap: function wrap(array, expressions) {
|
|
var expr;
|
|
expr = expressions.unwrap();
|
|
if (expr.is_statement_only() || expr.contains(function(n) {
|
|
return n.is_statement_only();
|
|
})) {
|
|
return expressions;
|
|
}
|
|
return Expressions.wrap([new CallNode(new ValueNode(new LiteralNode(array), [new AccessorNode(new LiteralNode('push'))]), [expr])]);
|
|
}
|
|
});
|
|
// A faux-node used to wrap an expressions body in a closure.
|
|
ClosureNode = (exports.ClosureNode = {
|
|
wrap: function wrap(expressions, statement) {
|
|
var call, func;
|
|
func = new ParentheticalNode(new CodeNode([], Expressions.wrap([expressions])));
|
|
call = new CallNode(new ValueNode(func, [new AccessorNode(new LiteralNode('call'))]), [new LiteralNode('this')]);
|
|
return statement ? Expressions.wrap([call]) : call;
|
|
}
|
|
});
|
|
// Setting the value of a local variable, or the value of an object property.
|
|
AssignNode = (exports.AssignNode = inherit(Node, {
|
|
type: 'Assign',
|
|
PROTO_ASSIGN: /^(\S+)\.prototype/,
|
|
LEADING_DOT: /^\.(prototype\.)?/,
|
|
constructor: function constructor(variable, value, context) {
|
|
this.children = [(this.variable = variable), (this.value = value)];
|
|
this.context = context;
|
|
return this;
|
|
},
|
|
top_sensitive: function top_sensitive() {
|
|
return true;
|
|
},
|
|
is_value: function is_value() {
|
|
return this.variable instanceof ValueNode;
|
|
},
|
|
is_statement: function is_statement() {
|
|
return this.is_value() && (this.variable.is_array() || this.variable.is_object());
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var last, match, name, proto, stmt, top, val;
|
|
top = del(o, 'top');
|
|
if (this.is_statement()) {
|
|
return this.compile_pattern_match(o);
|
|
}
|
|
if (this.is_value() && this.variable.is_splice()) {
|
|
return this.compile_splice(o);
|
|
}
|
|
stmt = del(o, 'as_statement');
|
|
name = this.variable.compile(o);
|
|
last = this.is_value() ? this.variable.last.replace(this.LEADING_DOT, '') : name;
|
|
match = name.match(this.PROTO_ASSIGN);
|
|
proto = match && match[1];
|
|
if (this.value instanceof CodeNode) {
|
|
if (last.match(IDENTIFIER)) {
|
|
this.value.name = last;
|
|
}
|
|
if (proto) {
|
|
this.value.proto = proto;
|
|
}
|
|
}
|
|
if (this.context === 'object') {
|
|
return name + ': ' + this.value.compile(o);
|
|
}
|
|
if (!(this.is_value() && this.variable.has_properties())) {
|
|
o.scope.find(name);
|
|
}
|
|
val = name + ' = ' + this.value.compile(o);
|
|
if (stmt) {
|
|
return this.idt() + val + ';';
|
|
}
|
|
if (!top || o.returns) {
|
|
val = '(' + val + ')';
|
|
}
|
|
if (o.returns) {
|
|
val = this.idt() + 'return ' + val;
|
|
}
|
|
return val;
|
|
},
|
|
// Implementation of recursive pattern matching, when assigning array or
|
|
// object literals to a value. Peeks at their properties to assign inner names.
|
|
// See: http://wiki.ecmascript.org/doku.php?id=harmony:destructuring
|
|
compile_pattern_match: function compile_pattern_match(o) {
|
|
var _a, _b, access_class, assigns, i, idx, obj, val, val_var;
|
|
val_var = o.scope.free_variable();
|
|
assigns = [this.idt() + val_var + ' = ' + this.value.compile(o) + ';'];
|
|
o.top = true;
|
|
o.as_statement = true;
|
|
_a = this.variable.base.objects;
|
|
for (i = 0; i < _a.length; i++) {
|
|
obj = _a[i];
|
|
idx = i;
|
|
if (this.variable.is_object()) {
|
|
_b = [obj.value, obj.variable.base];
|
|
obj = _b[0];
|
|
idx = _b[1];
|
|
}
|
|
access_class = this.variable.is_array() ? IndexNode : AccessorNode;
|
|
if (obj instanceof SplatNode) {
|
|
val = new LiteralNode(obj.compile_value(o, val_var, this.variable.base.objects.indexOf(obj)));
|
|
} else {
|
|
if (!(typeof idx === 'object')) {
|
|
idx = new LiteralNode(idx);
|
|
}
|
|
val = new ValueNode(new LiteralNode(val_var), [new access_class(idx)]);
|
|
}
|
|
assigns.push(new AssignNode(obj, val).compile(o));
|
|
}
|
|
return assigns.join("\n");
|
|
},
|
|
compile_splice: function compile_splice(o) {
|
|
var from, l, name, plus, range, to;
|
|
name = this.variable.compile(merge(o, {
|
|
only_first: true
|
|
}));
|
|
l = this.variable.properties.length;
|
|
range = this.variable.properties[l - 1].range;
|
|
plus = range.exclusive ? '' : ' + 1';
|
|
from = range.from.compile(o);
|
|
to = range.to.compile(o) + ' - ' + from + plus;
|
|
return name + '.splice.apply(' + name + ', [' + from + ', ' + to + '].concat(' + this.value.compile(o) + '))';
|
|
}
|
|
}));
|
|
// A function definition. The only node that creates a new Scope.
|
|
// A CodeNode does not have any children -- they're within the new scope.
|
|
CodeNode = (exports.CodeNode = inherit(Node, {
|
|
type: 'Code',
|
|
constructor: function constructor(params, body, tag) {
|
|
this.params = params;
|
|
this.body = body;
|
|
this.bound = tag === 'boundfunc';
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var _a, _b, _c, _d, _e, code, func, inner, name_part, param, params, shared_scope, splat, top;
|
|
shared_scope = del(o, 'shared_scope');
|
|
top = del(o, 'top');
|
|
o.scope = shared_scope || new Scope(o.scope, this.body, this);
|
|
o.returns = true;
|
|
o.top = true;
|
|
o.indent = this.idt(this.bound ? 2 : 1);
|
|
del(o, 'no_wrap');
|
|
del(o, 'globals');
|
|
if (this.params[this.params.length - 1] instanceof SplatNode) {
|
|
splat = this.params.pop();
|
|
splat.index = this.params.length;
|
|
this.body.unshift(splat);
|
|
}
|
|
params = (function() {
|
|
_a = []; _b = this.params;
|
|
for (_c = 0; _c < _b.length; _c++) {
|
|
param = _b[_c];
|
|
_a.push(param.compile(o));
|
|
}
|
|
return _a;
|
|
}).call(this);
|
|
_d = params;
|
|
for (_e = 0; _e < _d.length; _e++) {
|
|
param = _d[_e];
|
|
(o.scope.parameter(param));
|
|
}
|
|
code = this.body.expressions.length ? '\n' + this.body.compile_with_declarations(o) + '\n' : '';
|
|
name_part = this.name ? ' ' + this.name : '';
|
|
func = 'function' + (this.bound ? '' : name_part) + '(' + params.join(', ') + ') {' + code + this.idt(this.bound ? 1 : 0) + '}';
|
|
if (top && !this.bound) {
|
|
func = '(' + func + ')';
|
|
}
|
|
if (!(this.bound)) {
|
|
return func;
|
|
}
|
|
inner = '(function' + name_part + '() {\n' + this.idt(2) + 'return __func.apply(__this, arguments);\n' + this.idt(1) + '});';
|
|
return '(function(__this) {\n' + this.idt(1) + 'var __func = ' + func + ';\n' + this.idt(1) + 'return ' + inner + '\n' + this.idt() + '})(this)';
|
|
},
|
|
top_sensitive: function top_sensitive() {
|
|
return true;
|
|
},
|
|
toString: function toString(idt) {
|
|
var _a, _b, _c, child, children;
|
|
idt = idt || '';
|
|
children = flatten([this.params, this.body.expressions]);
|
|
return '\n' + idt + this.type + (function() {
|
|
_a = []; _b = children;
|
|
for (_c = 0; _c < _b.length; _c++) {
|
|
child = _b[_c];
|
|
_a.push(child.toString(idt + TAB));
|
|
}
|
|
return _a;
|
|
}).call(this).join('');
|
|
}
|
|
}));
|
|
// A splat, either as a parameter to a function, an argument to a call,
|
|
// or in a destructuring assignment.
|
|
SplatNode = (exports.SplatNode = inherit(Node, {
|
|
type: 'Splat',
|
|
constructor: function constructor(name) {
|
|
if (!(name.compile)) {
|
|
name = new LiteralNode(name);
|
|
}
|
|
this.children = [(this.name = name)];
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
return (typeof this.index !== "undefined" && this.index !== null) ? this.compile_param(o) : this.name.compile(o);
|
|
},
|
|
compile_param: function compile_param(o) {
|
|
var name;
|
|
name = this.name.compile(o);
|
|
o.scope.find(name);
|
|
return name + ' = Array.prototype.slice.call(arguments, ' + this.index + ')';
|
|
},
|
|
compile_value: function compile_value(o, name, index) {
|
|
return "Array.prototype.slice.call(" + name + ', ' + index + ')';
|
|
}
|
|
}));
|
|
// A while loop, the only sort of low-level loop exposed by CoffeeScript. From
|
|
// it, all other loops can be manufactured.
|
|
WhileNode = (exports.WhileNode = inherit(Node, {
|
|
type: 'While',
|
|
constructor: function constructor(condition, body) {
|
|
this.children = [(this.condition = condition), (this.body = body)];
|
|
return this;
|
|
},
|
|
top_sensitive: function top_sensitive() {
|
|
return true;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var cond, post, pre, returns, rvar, set, top;
|
|
returns = del(o, 'returns');
|
|
top = del(o, 'top') && !returns;
|
|
o.indent = this.idt(1);
|
|
o.top = true;
|
|
cond = this.condition.compile(o);
|
|
set = '';
|
|
if (!top) {
|
|
rvar = o.scope.free_variable();
|
|
set = this.idt() + rvar + ' = [];\n';
|
|
this.body = PushNode.wrap(rvar, this.body);
|
|
}
|
|
post = returns ? '\n' + this.idt() + 'return ' + rvar + ';' : '';
|
|
pre = set + this.idt() + 'while (' + cond + ')';
|
|
if (!this.body) {
|
|
return pre + ' null;' + post;
|
|
}
|
|
return pre + ' {\n' + this.body.compile(o) + '\n' + this.idt() + '}' + post;
|
|
}
|
|
}));
|
|
statement(WhileNode);
|
|
// Simple Arithmetic and logical operations. Performs some conversion from
|
|
// CoffeeScript operations into their JavaScript equivalents.
|
|
OpNode = (exports.OpNode = inherit(Node, {
|
|
type: 'Op',
|
|
CONVERSIONS: {
|
|
'==': '===',
|
|
'!=': '!==',
|
|
'and': '&&',
|
|
'or': '||',
|
|
'is': '===',
|
|
'isnt': '!==',
|
|
'not': '!'
|
|
},
|
|
CHAINABLE: ['<', '>', '>=', '<=', '===', '!=='],
|
|
ASSIGNMENT: ['||=', '&&=', '?='],
|
|
PREFIX_OPERATORS: ['typeof', 'delete'],
|
|
constructor: function constructor(operator, first, second, flip) {
|
|
this.children = compact([(this.first = first), (this.second = second)]);
|
|
this.operator = this.CONVERSIONS[operator] || operator;
|
|
this.flip = !!flip;
|
|
return this;
|
|
},
|
|
is_unary: function is_unary() {
|
|
return !this.second;
|
|
},
|
|
is_chainable: function is_chainable() {
|
|
return this.CHAINABLE.indexOf(this.operator) >= 0;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
if (this.is_chainable() && this.first.unwrap() instanceof OpNode && this.first.unwrap().is_chainable()) {
|
|
return this.compile_chain(o);
|
|
}
|
|
if (this.ASSIGNMENT.indexOf(this.operator) >= 0) {
|
|
return this.compile_assignment(o);
|
|
}
|
|
if (this.is_unary()) {
|
|
return this.compile_unary(o);
|
|
}
|
|
if (this.operator === '?') {
|
|
return this.compile_existence(o);
|
|
}
|
|
return this.first.compile(o) + ' ' + this.operator + ' ' + this.second.compile(o);
|
|
},
|
|
// Mimic Python's chained comparisons. See:
|
|
// http://docs.python.org/reference/expressions.html#notin
|
|
compile_chain: function compile_chain(o) {
|
|
var _a, shared;
|
|
shared = this.first.unwrap().second;
|
|
if (shared instanceof CallNode) {
|
|
_a = shared.compile_reference(o);
|
|
this.first.second = _a[0];
|
|
shared = _a[1];
|
|
}
|
|
return '(' + this.first.compile(o) + ') && (' + shared.compile(o) + ' ' + this.operator + ' ' + this.second.compile(o) + ')';
|
|
},
|
|
compile_assignment: function compile_assignment(o) {
|
|
var _a, first, second;
|
|
_a = [this.first.compile(o), this.second.compile(o)];
|
|
first = _a[0];
|
|
second = _a[1];
|
|
if (first.match(IDENTIFIER)) {
|
|
o.scope.find(first);
|
|
}
|
|
if (this.operator === '?=') {
|
|
return first + ' = ' + ExistenceNode.compile_test(o, this.first) + ' ? ' + first + ' : ' + second;
|
|
}
|
|
return first + ' = ' + first + ' ' + this.operator.substr(0, 2) + ' ' + second;
|
|
},
|
|
compile_existence: function compile_existence(o) {
|
|
var _a, first, second;
|
|
_a = [this.first.compile(o), this.second.compile(o)];
|
|
first = _a[0];
|
|
second = _a[1];
|
|
return ExistenceNode.compile_test(o, this.first) + ' ? ' + first + ' : ' + second;
|
|
},
|
|
compile_unary: function compile_unary(o) {
|
|
var parts, space;
|
|
space = this.PREFIX_OPERATORS.indexOf(this.operator) >= 0 ? ' ' : '';
|
|
parts = [this.operator, space, this.first.compile(o)];
|
|
if (this.flip) {
|
|
parts = parts.reverse();
|
|
}
|
|
return parts.join('');
|
|
}
|
|
}));
|
|
// A try/catch/finally block.
|
|
TryNode = (exports.TryNode = inherit(Node, {
|
|
type: 'Try',
|
|
constructor: function constructor(attempt, error, recovery, ensure) {
|
|
this.children = compact([(this.attempt = attempt), (this.recovery = recovery), (this.ensure = ensure)]);
|
|
this.error = error;
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var catch_part, error_part, finally_part;
|
|
o.indent = this.idt(1);
|
|
o.top = true;
|
|
error_part = this.error ? ' (' + this.error.compile(o) + ') ' : ' ';
|
|
catch_part = (this.recovery || '') && ' catch' + error_part + '{\n' + this.recovery.compile(o) + '\n' + this.idt() + '}';
|
|
finally_part = (this.ensure || '') && ' finally {\n' + this.ensure.compile(merge(o, {
|
|
returns: null
|
|
})) + '\n' + this.idt() + '}';
|
|
return this.idt() + 'try {\n' + this.attempt.compile(o) + '\n' + this.idt() + '}' + catch_part + finally_part;
|
|
}
|
|
}));
|
|
statement(TryNode);
|
|
// Throw an exception.
|
|
ThrowNode = (exports.ThrowNode = inherit(Node, {
|
|
type: 'Throw',
|
|
constructor: function constructor(expression) {
|
|
this.children = [(this.expression = expression)];
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
return this.idt() + 'throw ' + this.expression.compile(o) + ';';
|
|
}
|
|
}));
|
|
statement(ThrowNode, true);
|
|
// Check an expression for existence (meaning not null or undefined).
|
|
ExistenceNode = (exports.ExistenceNode = inherit(Node, {
|
|
type: 'Existence',
|
|
constructor: function constructor(expression) {
|
|
this.children = [(this.expression = expression)];
|
|
return this;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
return ExistenceNode.compile_test(o, this.expression);
|
|
}
|
|
}));
|
|
ExistenceNode.compile_test = function compile_test(o, variable) {
|
|
var _a, _b, first, second;
|
|
_a = [variable, variable];
|
|
first = _a[0];
|
|
second = _a[1];
|
|
if (variable instanceof CallNode) {
|
|
_b = variable.compile_reference(o);
|
|
first = _b[0];
|
|
second = _b[1];
|
|
}
|
|
return '(typeof ' + first.compile(o) + ' !== "undefined" && ' + second.compile(o) + ' !== null)';
|
|
};
|
|
// An extra set of parentheses, specified explicitly in the source.
|
|
ParentheticalNode = (exports.ParentheticalNode = inherit(Node, {
|
|
type: 'Paren',
|
|
constructor: function constructor(expression) {
|
|
this.children = [(this.expression = expression)];
|
|
return this;
|
|
},
|
|
is_statement: function is_statement() {
|
|
return this.expression.is_statement();
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var code, l;
|
|
code = this.expression.compile(o);
|
|
if (this.is_statement()) {
|
|
return code;
|
|
}
|
|
l = code.length;
|
|
if (code.substr(l - 1, 1) === ';') {
|
|
code = code.substr(o, l - 1);
|
|
}
|
|
return '(' + code + ')';
|
|
}
|
|
}));
|
|
// The replacement for the for loop is an array comprehension (that compiles)
|
|
// into a for loop. Also acts as an expression, able to return the result
|
|
// of the comprehenion. Unlike Python array comprehensions, it's able to pass
|
|
// the current index of the loop as a second parameter.
|
|
ForNode = (exports.ForNode = inherit(Node, {
|
|
type: 'For',
|
|
constructor: function constructor(body, source, name, index) {
|
|
var _a;
|
|
this.body = body;
|
|
this.name = name;
|
|
this.index = index || null;
|
|
this.source = source.source;
|
|
this.filter = source.filter;
|
|
this.step = source.step;
|
|
this.object = !!source.object;
|
|
if (this.object) {
|
|
_a = [this.index, this.name];
|
|
this.name = _a[0];
|
|
this.index = _a[1];
|
|
}
|
|
this.children = compact([this.body, this.source, this.filter]);
|
|
return this;
|
|
},
|
|
top_sensitive: function top_sensitive() {
|
|
return true;
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
var body, body_dent, for_part, index, index_found, index_var, ivar, name, name_found, range, return_result, rvar, scope, set_result, source, source_part, step_part, svar, top_level, var_part, vars;
|
|
top_level = del(o, 'top') && !o.returns;
|
|
range = this.source instanceof ValueNode && this.source.base instanceof RangeNode && !this.source.properties.length;
|
|
source = range ? this.source.base : this.source;
|
|
scope = o.scope;
|
|
name = this.name && this.name.compile(o);
|
|
index = this.index && this.index.compile(o);
|
|
name_found = name && scope.find(name);
|
|
index_found = index && scope.find(index);
|
|
body_dent = this.idt(1);
|
|
if (!(top_level)) {
|
|
rvar = scope.free_variable();
|
|
}
|
|
svar = scope.free_variable();
|
|
ivar = range ? name : index || scope.free_variable();
|
|
var_part = '';
|
|
body = Expressions.wrap([this.body]);
|
|
if (range) {
|
|
index_var = scope.free_variable();
|
|
source_part = source.compile_variables(o);
|
|
for_part = index_var + '=0, ' + source.compile(merge(o, {
|
|
index: ivar,
|
|
step: this.step
|
|
})) + ', ' + index_var + '++';
|
|
} else {
|
|
index_var = null;
|
|
source_part = svar + ' = ' + this.source.compile(o) + ';\n' + this.idt();
|
|
step_part = this.step ? ivar + ' += ' + this.step.compile(o) : ivar + '++';
|
|
for_part = ivar + ' = 0; ' + ivar + ' < ' + svar + '.length; ' + step_part;
|
|
if (name) {
|
|
var_part = body_dent + name + ' = ' + svar + '[' + ivar + '];\n';
|
|
}
|
|
}
|
|
set_result = rvar ? this.idt() + rvar + ' = []; ' : this.idt();
|
|
return_result = rvar || '';
|
|
if (top_level && this.contains(function(n) {
|
|
return n instanceof CodeNode;
|
|
})) {
|
|
body = ClosureNode.wrap(body, true);
|
|
}
|
|
if (!(top_level)) {
|
|
body = PushNode.wrap(rvar, body);
|
|
}
|
|
if (o.returns) {
|
|
return_result = 'return ' + return_result;
|
|
del(o, 'returns');
|
|
if (this.filter) {
|
|
body = new IfNode(this.filter, body, null, {
|
|
statement: true
|
|
});
|
|
}
|
|
} else if (this.filter) {
|
|
body = Expressions.wrap([new IfNode(this.filter, body)]);
|
|
}
|
|
if (this.object) {
|
|
o.scope.assign('__hasProp', 'Object.prototype.hasOwnProperty', true);
|
|
for_part = ivar + ' in ' + svar + ') if (__hasProp.call(' + svar + ', ' + ivar + ')';
|
|
}
|
|
if (!(top_level)) {
|
|
return_result = '\n' + this.idt() + return_result + ';';
|
|
}
|
|
body = body.compile(merge(o, {
|
|
indent: body_dent,
|
|
top: true
|
|
}));
|
|
vars = range ? name : name + ', ' + ivar;
|
|
return set_result + source_part + 'for (' + for_part + ') {\n' + var_part + body + '\n' + this.idt() + '}\n' + this.idt() + return_result;
|
|
}
|
|
}));
|
|
statement(ForNode);
|
|
// If/else statements. Switch/whens get compiled into these. Acts as an
|
|
// expression by pushing down requested returns to the expression bodies.
|
|
// Single-expression IfNodes are compiled into ternary operators if possible,
|
|
// because ternaries are first-class returnable assignable expressions.
|
|
IfNode = (exports.IfNode = inherit(Node, {
|
|
type: 'If',
|
|
constructor: function constructor(condition, body, else_body, tags) {
|
|
this.condition = condition;
|
|
this.body = body && body.unwrap();
|
|
this.else_body = else_body && else_body.unwrap();
|
|
this.children = compact([this.condition, this.body, this.else_body]);
|
|
this.tags = tags || {};
|
|
if (this.condition instanceof Array) {
|
|
this.multiple = true;
|
|
}
|
|
if (this.tags.invert) {
|
|
this.condition = new OpNode('!', new ParentheticalNode(this.condition));
|
|
}
|
|
return this;
|
|
},
|
|
push: function push(else_body) {
|
|
var eb;
|
|
eb = else_body.unwrap();
|
|
this.else_body ? this.else_body.push(eb) : (this.else_body = eb);
|
|
return this;
|
|
},
|
|
force_statement: function force_statement() {
|
|
this.tags.statement = true;
|
|
return this;
|
|
},
|
|
// Tag a chain of IfNodes with their switch condition for equality.
|
|
rewrite_condition: function rewrite_condition(expression) {
|
|
this.switcher = expression;
|
|
return this;
|
|
},
|
|
// Rewrite a chain of IfNodes with their switch condition for equality.
|
|
rewrite_switch: function rewrite_switch(o) {
|
|
var _a, _b, assigner, cond, i, variable;
|
|
assigner = this.switcher;
|
|
if (!(this.switcher.unwrap() instanceof LiteralNode)) {
|
|
variable = new LiteralNode(o.scope.free_variable());
|
|
assigner = new AssignNode(variable, this.switcher);
|
|
this.switcher = variable;
|
|
}
|
|
this.condition = (function() {
|
|
if (this.multiple) {
|
|
_a = []; _b = this.condition;
|
|
for (i = 0; i < _b.length; i++) {
|
|
cond = _b[i];
|
|
_a.push(new OpNode('is', (i === 0 ? assigner : this.switcher), cond));
|
|
}
|
|
return _a;
|
|
} else {
|
|
return new OpNode('is', assigner, this.condition);
|
|
}
|
|
}).call(this);
|
|
if (this.is_chain()) {
|
|
this.else_body.rewrite_condition(this.switcher);
|
|
}
|
|
return this;
|
|
},
|
|
// Rewrite a chain of IfNodes to add a default case as the final else.
|
|
add_else: function add_else(exprs) {
|
|
this.is_chain() ? this.else_body.add_else(exprs) : (this.else_body = exprs && exprs.unwrap());
|
|
this.children.push(exprs);
|
|
return this;
|
|
},
|
|
// If the else_body is an IfNode itself, then we've got an if-else chain.
|
|
is_chain: function is_chain() {
|
|
return this.chain = this.chain || this.else_body && this.else_body instanceof IfNode;
|
|
},
|
|
// The IfNode only compiles into a statement if either of the bodies needs
|
|
// to be a statement.
|
|
is_statement: function is_statement() {
|
|
return this.statement = this.statement || !!(this.comment || this.tags.statement || this.body.is_statement() || (this.else_body && this.else_body.is_statement()));
|
|
},
|
|
compile_condition: function compile_condition(o) {
|
|
var _a, _b, _c, cond;
|
|
return (function() {
|
|
_a = []; _b = flatten([this.condition]);
|
|
for (_c = 0; _c < _b.length; _c++) {
|
|
cond = _b[_c];
|
|
_a.push(cond.compile(o));
|
|
}
|
|
return _a;
|
|
}).call(this).join(' || ');
|
|
},
|
|
compile_node: function compile_node(o) {
|
|
return this.is_statement() ? this.compile_statement(o) : this.compile_ternary(o);
|
|
},
|
|
// Compile the IfNode as a regular if-else statement. Flattened chains
|
|
// force sub-else bodies into statement form.
|
|
compile_statement: function compile_statement(o) {
|
|
var body, child, com_dent, cond_o, else_part, if_dent, if_part, prefix;
|
|
if (this.switcher) {
|
|
this.rewrite_switch(o);
|
|
}
|
|
child = del(o, 'chain_child');
|
|
cond_o = merge(o);
|
|
del(cond_o, 'returns');
|
|
o.indent = this.idt(1);
|
|
o.top = true;
|
|
if_dent = child ? '' : this.idt();
|
|
com_dent = child ? this.idt() : '';
|
|
prefix = this.comment ? this.comment.compile(cond_o) + '\n' + com_dent : '';
|
|
body = Expressions.wrap([this.body]).compile(o);
|
|
if_part = prefix + if_dent + 'if (' + this.compile_condition(cond_o) + ') {\n' + body + '\n' + this.idt() + '}';
|
|
if (!(this.else_body)) {
|
|
return if_part;
|
|
}
|
|
else_part = this.is_chain() ? ' else ' + this.else_body.compile(merge(o, {
|
|
indent: this.idt(),
|
|
chain_child: true
|
|
})) : ' else {\n' + Expressions.wrap([this.else_body]).compile(o) + '\n' + this.idt() + '}';
|
|
return if_part + else_part;
|
|
},
|
|
// Compile the IfNode into a ternary operator.
|
|
compile_ternary: function compile_ternary(o) {
|
|
var else_part, if_part;
|
|
if_part = this.condition.compile(o) + ' ? ' + this.body.compile(o);
|
|
else_part = this.else_body ? this.else_body.compile(o) : 'null';
|
|
return if_part + ' : ' + else_part;
|
|
}
|
|
}));
|
|
})(); |