Skip to content

Commit

Permalink
Pull new skulpty
Browse files Browse the repository at this point in the history
  • Loading branch information
@basicer
basicer committed Jan 23, 2017
1 parent 042910d commit c5c9971
Show file tree
Hide file tree
Showing 11 changed files with 87 additions and 37 deletions.
47 changes: 36 additions & 11 deletions build/aether.js
View file
Expand Up @@ -10642,7 +10642,7 @@ define(function (require, exports, module) {
},{"amdefine":37}],37:[function(require,module,exports){
(function (process,__filename){
/** vim: et:ts=4:sw=4:sts=4
* @license amdefine 1.0.0 Copyright (c) 2011-2015, The Dojo Foundation All Rights Reserved.
* @license amdefine 1.0.1 Copyright (c) 2011-2016, The Dojo Foundation All Rights Reserved.
* Available via the MIT or new BSD license.
* see: http://github.com/jrburke/amdefine for details
*/
Expand Down Expand Up @@ -27780,12 +27780,12 @@ return /******/ (function(modules) { // webpackBootstrap

var isArray = Array.isArray;

//TODO: Find a way to not have to do this.
function getOpName(op) {
if (op.name) return op.name;
//Work around browsers that dont suport Function#name (like IE11)
var matches = op.toString().match(/function ([^)]+)\(/);
if ( matches === null ) return undefined;
return matches[1];
if (op.prototype._astname) {
return op.prototype._astname;
}
throw new Error("Coudlnt decode operator name for: " + (op.name || op.toString()));
}

function abort(why) {
Expand Down Expand Up @@ -27915,6 +27915,7 @@ return /******/ (function(modules) { // webpackBootstrap
case 'Continue': return tranformContinue(node, ctx);
case 'Compare': return transformCompare(node, ctx);
case 'Dict': return transformDict(node, ctx);
case 'Delete': return transformDel(node, ctx);
case 'Expr': return transformExpr(node, ctx);
case 'For': return transformFor(node, ctx);
case 'FunctionDef': return transformFunctionDef(node, ctx);
Expand All @@ -27939,7 +27940,7 @@ return /******/ (function(modules) { // webpackBootstrap
default:
console.log("Dont know how to transform: " + node._astname);
console.log(JSON.stringify(node, null, ' '));
throw new Error("Up");
throw new Error("Dont know how to transform: " + node._astname);
}
}

Expand Down Expand Up @@ -28037,7 +28038,7 @@ return /******/ (function(modules) { // webpackBootstrap

};

if ( !(op in operators) ) abort("Unknwon binary operator: " + op);
if ( !(op in operators) ) abort("Unknown binary operator: " + op);

return binOp(left, operators[op], right);
}
Expand Down Expand Up @@ -28294,6 +28295,7 @@ return /******/ (function(modules) { // webpackBootstrap

var fxOps = {
"In_": "in",
"In": "in",
"NotIn": "in"
};
var opName = getOpName(op);
Expand Down Expand Up @@ -28352,6 +28354,29 @@ return /******/ (function(modules) { // webpackBootstrap

}

function transformDel(node, ctx) {
var result = [];
for ( var i = 0; i < node.targets.length; ++i ) {
var st = node.targets[i];
var partial = transform(st, ctx);
result.push({
type: "AssignmentExpression",
operator: "=",
left: partial,
right: {
type: "UnaryExpression",
argument: literal(0),
operator: 'void',
prefix: true
}
});
}
return ensureStatement({
type: "SequenceExpression",
expressions: result
});
}

function transformDict(node, ctx) {
var args = [];
for ( var i = 0; i < node.keys.length; ++i ) {
Expand Down Expand Up @@ -28483,11 +28508,12 @@ return /******/ (function(modules) { // webpackBootstrap
var iter = transform(node.iter, ctx);
var body = ensureStatement(transform(node.body, ctx));

if ( node.orelse && node.orelse.length > 0 ) abort("else: for-else statement unsupported.");
return createForLoop(iident, tident, iter, node.target, body, ctx);
}

function prepareFunctionBody(node, ctx) {
var args = node.args.args.slice(0);
var args = node.args.args.slice(0);
if ( ctx.inClass ) {
//TODO: Make sure it's named self, maybe?
args.shift();
Expand Down Expand Up @@ -29252,8 +29278,7 @@ return /******/ (function(modules) { // webpackBootstrap
},
"pop": {
value: function (i) {
if (!i)
i = this.length - 1;
if (arguments.length<1) i = this.length - 1;
var item = this[i];
this.splice(i, 1);
return item;
Expand Down
6 changes: 3 additions & 3 deletions build/aether.min.js
View file

Large diffs are not rendered by default.

4 changes: 2 additions & 2 deletions build/coffeescript.js
View file
Expand Up @@ -30622,7 +30622,7 @@ define(function (require, exports, module) {
},{"amdefine":29}],29:[function(require,module,exports){
(function (process,__filename){
/** vim: et:ts=4:sw=4:sts=4
* @license amdefine 1.0.0 Copyright (c) 2011-2015, The Dojo Foundation All Rights Reserved.
* @license amdefine 1.0.1 Copyright (c) 2011-2016, The Dojo Foundation All Rights Reserved.
* Available via the MIT or new BSD license.
* see: http://github.com/jrburke/amdefine for details
*/
Expand Down Expand Up @@ -30990,7 +30990,7 @@ module.exports={
"readme": "CoffeeScript II: The Wrath of Khan\n==================================\n\n```\n {\n } } {\n { { } }\n } }{ {\n { }{ } } _____ __ __\n ( }{ }{ { ) / ____| / _|/ _|\n .- { { } { }} -. | | ___ | |_| |_ ___ ___\n ( ( } { } { } } ) | | / _ \\| _| _/ _ \\/ _ \\\n |`-..________ ..-'| | |___| (_) | | | || __/ __/\n | | \\_____\\___/|_| |_| \\___|\\___| .-''-.\n | ;--. .' .-. )\n | (__ \\ _____ _ _ / .' / /\n | | ) ) / ____| (_) | | (_/ / /\n | |/ / | (___ ___ _ __ _ _ __ | |_ / /\n | ( / \\___ \\ / __| '__| | '_ \\| __| / /\n | |/ ____) | (__| | | | |_) | |_ . '\n | | |_____/ \\___|_| |_| .__/ \\__| / / _.-')\n `-.._________..-' | | .' ' _.'.-''\n |_| / /.-'_.'\n / _.'\n ( _.-'\n```\n\n### Status\n\nComplete enough to use for nearly every project. See the [roadmap to 2.0](https://github.com/michaelficarra/CoffeeScriptRedux/wiki/Roadmap).\n\n### Getting Started\n\n npm install -g coffee-script-redux\n coffee --help\n coffee --js <input.coffee >output.js\n\nBefore transitioning from Jeremy's compiler, see the\n[intentional deviations from jashkenas/coffee-script](https://github.com/michaelficarra/CoffeeScriptRedux/wiki/Intentional-Deviations-From-jashkenas-coffee-script)\nwiki page.\n\n### Development\n\n git clone git://github.com/michaelficarra/CoffeeScriptRedux.git && cd CoffeeScriptRedux && npm install\n make clean && git checkout -- lib && make -j build && make test\n\n### Notable Contributors\n\nI'd like to thank the following financial contributors for their large\ndonations to [the Kickstarter project](https://www.kickstarter.com/projects/michaelficarra/make-a-better-coffeescript-compiler)\nthat funded the initial work on this compiler.\nTogether, you donated over $10,000. Without you, I wouldn't have been able to do this.\n\n* [Groupon](https://www.groupon.com/), who is generously allowing me to work in their offices\n* [Trevor Burnham](http://trevorburnham.com)\n* [Shopify](https://www.shopify.com/)\n* [Abakas](http://abakas.com)\n* [37signals](http://37signals.com)\n* [Brightcove](https://www.brightcove.com/en/)\n* [Gaslight](https://teamgaslight.com/)\n* [Pantheon](https://pantheon.io/)\n* Benbria\n* Sam Stephenson\n* Bevan Hunt\n* Meryn Stol\n* Rob Tsuk\n* Dion Almaer\n* Andrew Davey\n* Thomas Burleson\n* Michael Kedzierski\n* Jeremy Kemper\n* Kyle Cordes\n* Jason R. Lauman\n* Martin Drenovac (Envizion Systems - Aust)\n* Julian Bilcke\n* Michael Edmondson\n\nAnd of course, thank you [Jeremy](https://github.com/jashkenas) (and all the other\n[contributors](https://github.com/jashkenas/coffeescript/graphs/contributors))\nfor making [the original CoffeeScript compiler](https://github.com/jashkenas/coffeescript).\n",
"readmeFilename": "README.md",
"_id": "coffee-script-redux@2.0.0-beta9-dev",
"_shasum": "b0ab378967e97b9bcc2b4443a9f4e9674ffc68d5",
"_shasum": "737857abc3cbb842e2f95d33ffacaf783a4b46c5",
"_from": "git://github.com/michaelficarra/CoffeeScriptRedux.git",
"_resolved": "git://github.com/michaelficarra/CoffeeScriptRedux.git#ad91003538d0d4d4d94469df6afcc0c35f56d36c"
}
Expand Down
4 changes: 2 additions & 2 deletions build/coffeescript.min.js
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion build/html.js
View file
Expand Up @@ -6953,8 +6953,8 @@ Tokenizer.prototype._stateInHexEntity = function(c){
Tokenizer.prototype._cleanup = function (){
if(this._sectionStart < 0){
this._buffer = "";
this._index = 0;
this._bufferOffset += this._index;
this._index = 0;
} else if(this._running){
if(this._state === TEXT){
if(this._sectionStart !== this._index){
Expand Down
4 changes: 2 additions & 2 deletions build/html.min.js
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion build/java.min.js
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion build/javascript.min.js
View file

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion build/lua.min.js
View file

Large diffs are not rendered by default.

45 changes: 35 additions & 10 deletions build/python.js
View file
Expand Up @@ -10026,12 +10026,12 @@ return /******/ (function(modules) { // webpackBootstrap

var isArray = Array.isArray;

//TODO: Find a way to not have to do this.
function getOpName(op) {
if (op.name) return op.name;
//Work around browsers that dont suport Function#name (like IE11)
var matches = op.toString().match(/function ([^)]+)\(/);
if ( matches === null ) return undefined;
return matches[1];
if (op.prototype._astname) {
return op.prototype._astname;
}
throw new Error("Coudlnt decode operator name for: " + (op.name || op.toString()));
}

function abort(why) {
Expand Down Expand Up @@ -10161,6 +10161,7 @@ return /******/ (function(modules) { // webpackBootstrap
case 'Continue': return tranformContinue(node, ctx);
case 'Compare': return transformCompare(node, ctx);
case 'Dict': return transformDict(node, ctx);
case 'Delete': return transformDel(node, ctx);
case 'Expr': return transformExpr(node, ctx);
case 'For': return transformFor(node, ctx);
case 'FunctionDef': return transformFunctionDef(node, ctx);
Expand All @@ -10185,7 +10186,7 @@ return /******/ (function(modules) { // webpackBootstrap
default:
console.log("Dont know how to transform: " + node._astname);
console.log(JSON.stringify(node, null, ' '));
throw new Error("Up");
throw new Error("Dont know how to transform: " + node._astname);
}
}

Expand Down Expand Up @@ -10283,7 +10284,7 @@ return /******/ (function(modules) { // webpackBootstrap

};

if ( !(op in operators) ) abort("Unknwon binary operator: " + op);
if ( !(op in operators) ) abort("Unknown binary operator: " + op);

return binOp(left, operators[op], right);
}
Expand Down Expand Up @@ -10540,6 +10541,7 @@ return /******/ (function(modules) { // webpackBootstrap

var fxOps = {
"In_": "in",
"In": "in",
"NotIn": "in"
};
var opName = getOpName(op);
Expand Down Expand Up @@ -10598,6 +10600,29 @@ return /******/ (function(modules) { // webpackBootstrap

}

function transformDel(node, ctx) {
var result = [];
for ( var i = 0; i < node.targets.length; ++i ) {
var st = node.targets[i];
var partial = transform(st, ctx);
result.push({
type: "AssignmentExpression",
operator: "=",
left: partial,
right: {
type: "UnaryExpression",
argument: literal(0),
operator: 'void',
prefix: true
}
});
}
return ensureStatement({
type: "SequenceExpression",
expressions: result
});
}

function transformDict(node, ctx) {
var args = [];
for ( var i = 0; i < node.keys.length; ++i ) {
Expand Down Expand Up @@ -10729,11 +10754,12 @@ return /******/ (function(modules) { // webpackBootstrap
var iter = transform(node.iter, ctx);
var body = ensureStatement(transform(node.body, ctx));

if ( node.orelse && node.orelse.length > 0 ) abort("else: for-else statement unsupported.");
return createForLoop(iident, tident, iter, node.target, body, ctx);
}

function prepareFunctionBody(node, ctx) {
var args = node.args.args.slice(0);
var args = node.args.args.slice(0);
if ( ctx.inClass ) {
//TODO: Make sure it's named self, maybe?
args.shift();
Expand Down Expand Up @@ -11498,8 +11524,7 @@ return /******/ (function(modules) { // webpackBootstrap
},
"pop": {
value: function (i) {
if (!i)
i = this.length - 1;
if (arguments.length<1) i = this.length - 1;
var item = this[i];
this.splice(i, 1);
return item;
Expand Down
6 changes: 3 additions & 3 deletions build/python.min.js
View file

Large diffs are not rendered by default.

0 comments on commit c5c9971

Please sign in to comment.