Compile and print a little snippet of CoffeeScript directly from the
- command line (or from stdin). For example: coffee -e "square: x => x * x"
+ command line (or from stdin). For example: coffee -e "square: (x) -> x * x"
@@ -188,7 +186,7 @@ gem install coffee-script
-v, --verbose
As the JavaScript is being generated, print out every step of code
- generation, including lexical scope and the node in the
+ generation, including lexical scope and the nodes in the
AST.
+ You don't need to use parentheses to invoke a function, if you're passing
+ arguments: print "coffee"
+
+
You can use newlines to break up your expression into smaller pieces,
- as long as CoffeeScript can tell that the line hasn't finished
- (similar to how Ruby handles it). For example,
- if the line ends in an operator, dot, or keyword.
+ as long as CoffeeScript can determine that the line hasn't finished yet.
Functions and Invocation
Functions are defined by a list of parameters, an arrow, and the
- function body. The empty function looks like this: =>. All
- functions in CoffeeScript are named by default, for the benefit of debug messages.
- If you'd like to create an anonymous function, just wrap it in parentheses.
+ function body. The empty function looks like this: ->. All
+ functions in CoffeeScript are named by default, for easier debugging.
<%= code_for('functions', 'cube(5)') %>
+
+ If you'd like to create an anonymous function, just wrap it in parentheses:
+ ((x) -> x * x)
+
- Declarations of new variables are pushed up to the top of the nearest
+ Declaration of new variables are pushed up to the top of the nearest
lexical scope, so that assignment may always be performed within expressions.
@@ -281,7 +285,7 @@ coffee --print app/scripts/*.coffee > concatenation.js
Object and Array literals look very similar to their JavaScript cousins.
When you spread out each assignment on a separate line, the commas are
optional. In this way, assigning object properties looks the same as
- assigning local variables, and can be moved around freely. You can mix
+ assigning local variables, and can be moved around freely. Feel free to mix
and match the two styles.
<%= code_for('objects_and_arrays', 'song.join(",")') %>
@@ -306,9 +310,14 @@ coffee --print app/scripts/*.coffee > concatenation.js
CoffeeScript output is wrapped in an anonymous function:
(function(){ ... })(); This safety wrapper, combined with the
automatic generation of the var keyword, make it exceedingly difficult
- to pollute the global namespace by accident. If you'd like to create
- global variables, attach them as properties on window,
- or on the exports object in CommonJS.
+ to pollute the global namespace by accident.
+
+
+ If you'd like to create top-level variables for other scripts to use,
+ attach them as properties on window, or on the exports
+ object in CommonJS. The existential operator (below), gives you a
+ reliable way to figure out where to add them, if you're targeting both
+ CommonJS and the browser: root: exports ? this
- The Existential Operator
- It's a little difficult to check for the existence of a variable in
- JavaScript. if (variable) ... comes close, but fails for zero,
- the empty string, and false. The existential operator ? returns true unless
- a variable is null or undefined, which makes it analogous
- to Ruby's nil?
-
-
- It can also be used for safer conditional assignment than ||=
- provides, for cases where you may be handling numbers or strings.
-
- <%= code_for('existence', 'speed') %>
-
Aliases
Because the == operator frequently causes undesirable coercion,
@@ -379,7 +374,7 @@ coffee --print app/scripts/*.coffee > concatenation.js
The JavaScript arguments object is a useful way to work with
functions that accept variable numbers of arguments. CoffeeScript provides
splats ..., both for function definition as well as invocation,
- making variable arguments a little bit more palatable.
+ making variable numbers of arguments a little bit more palatable.
There are a handful of statements in JavaScript that can't be meaningfully
- converted into expressions: break, continue,
- and return. If you make use of them within a block of code,
+ converted into expressions, namely break, continue,
+ and return. If you make use of them within a block of code,
CoffeeScript won't try to perform the conversion.
+
+
+ The Existential Operator
+ It's a little difficult to check for the existence of a variable in
+ JavaScript. if (variable) ... comes close, but fails for zero,
+ the empty string, and false. CoffeeScript's existential operator ? returns true unless
+ a variable is null or undefined, which makes it analogous
+ to Ruby's nil?
+
+
+ It can also be used for safer conditional assignment than ||=
+ provides, for cases where you may be handling numbers or strings.
+
+ <%= code_for('existence', 'speed') %>
+
+ The accessor variant of the existential operator ?. can be used to soak
+ up null references in a chain of properties. Use it instead
+ of the dot accessor . in cases where the base value may be null
+ or undefined. If all of the properties exist then you'll get the expected
+ result, if the chain is broken, undefined is returned instead of
+ the TypeError that would be raised otherwise.
+
Inheritance, and Calling Super from a Subclass
@@ -508,20 +532,6 @@ coffee --print app/scripts/*.coffee > concatenation.js
<%= code_for('super', true) %>
-
- Blocks
- Many common looping functions (in Prototype, jQuery, and Underscore,
- for example) take a single function as their final argument. To make
- final functions easier to pass, CoffeeScript includes block syntax,
- so you don't have to close the parentheses on the other side.
-
- <%= code_for('blocks') %>
-
- If you prefer not to use blocks, you'll need to add a pair of parentheses
- to help distinguish the arguments from the definition of the function:
- _.map(array, (num => num * 2))
-
-
Pattern Matching (Destructuring Assignment)
To make extracting values from complex arrays and objects more convenient,
@@ -544,16 +554,16 @@ coffee --print app/scripts/*.coffee > concatenation.js
Function binding
- The long arrow ==> can be used to both define a function, and to bind
+ The fat arrow => can be used to both define a function, and to bind
it to the current value of this, right on the spot. This is helpful
when using callback-based libraries like Prototype or jQuery, for creating
iterator functions to pass to each, or event-handler functions
- to use with bind. Functions created with the long arrow are able to access
+ to use with bind. Functions created with the fat arrow are able to access
properties of the this where they're defined.
+ CoffeePot
+ An implementation of CoffeeScript, written in CoffeeScript, by
+ Tim Caswell. Compiles just
+ a limited subset at this point.
+
BistroCar
A Rails plugin by
@@ -639,39 +655,24 @@ coffee --print app/scripts/*.coffee > concatenation.js
-
Contributing
+
Change Log
- Here's a wish list of things that would be wonderful to have contributed:
+ 0.3.0
+ CoffeeScript 0.3 includes major syntax changes:
+
+ The function symbol was changed to
+ ->, and the bound function symbol is now =>.
+
+ Parameter lists in function definitions must now be wrapped in parentheses.
+
+ Added property soaking, with the ?. operator.
+
+ Made parentheses optional, when invoking functions with arguments.
+
+ Removed the obsolete block literal syntax.
- Test cases for any syntax errors you encounter that you think CoffeeScript
- should be able to compile properly.
-
-
- A tutorial that introduces CoffeeScript from the ground up for folks
- without knowledge of JavaScript.
-
-
- Integration with Processing.js's JavaScript API (this would depend on
- having a JavaScript version of the compiler).
-
-
- A lot of the code generation in nodes.rb gets into messy
- string manipulation. Techniques for cleaning this up across the board
- would be appreciated.
-
-
-
-
Change Log
-
0.2.6
Added Python-style chained comparisons, the conditional existence
diff --git a/documentation/js/array_comprehensions.js b/documentation/js/array_comprehensions.js
index fae31ce941..85ca79927b 100644
--- a/documentation/js/array_comprehensions.js
+++ b/documentation/js/array_comprehensions.js
@@ -8,7 +8,7 @@
__a.push(eat(food));
}
return __a;
- })();
+ }).call(this);
// Naive collision detection.
__d = asteroids;
for (__e = 0; __e < __d.length; __e++) {
diff --git a/documentation/js/blocks.js b/documentation/js/blocks.js
deleted file mode 100644
index f95dd31b45..0000000000
--- a/documentation/js/blocks.js
+++ /dev/null
@@ -1,8 +0,0 @@
-(function(){
- $('table.list').each(function(table) {
- return $('tr.account', table).each(function(row) {
- row.show();
- return row.highlight();
- });
- });
-})();
\ No newline at end of file
diff --git a/documentation/js/expressions_comprehension.js b/documentation/js/expressions_comprehension.js
index 294c3db4ed..01d5ba45a5 100644
--- a/documentation/js/expressions_comprehension.js
+++ b/documentation/js/expressions_comprehension.js
@@ -10,5 +10,5 @@
}
}
return __a;
- })()).slice(0, 10);
+ }).call(this)).slice(0, 10);
})();
\ No newline at end of file
diff --git a/documentation/js/expressions_try.js b/documentation/js/expressions_try.js
index 7787cfb74e..79c77e40c7 100644
--- a/documentation/js/expressions_try.js
+++ b/documentation/js/expressions_try.js
@@ -3,7 +3,7 @@
try {
return nonexistent / undefined;
} catch (error) {
- return "Caught an error: " + error;
+ return "And the error is ... " + error;
}
- })());
+ }).call(this));
})();
\ No newline at end of file
diff --git a/documentation/js/long_arrow.js b/documentation/js/fat_arrow.js
similarity index 100%
rename from documentation/js/long_arrow.js
rename to documentation/js/fat_arrow.js
diff --git a/documentation/js/object_comprehensions.js b/documentation/js/object_comprehensions.js
index 9c7d3783b9..ddc81f0526 100644
--- a/documentation/js/object_comprehensions.js
+++ b/documentation/js/object_comprehensions.js
@@ -15,5 +15,5 @@
}
}
return __a;
- })();
+ }).call(this);
})();
\ No newline at end of file
diff --git a/documentation/js/overview.js b/documentation/js/overview.js
index 2098e3a30f..97b0f43589 100644
--- a/documentation/js/overview.js
+++ b/documentation/js/overview.js
@@ -39,5 +39,5 @@
__a.push(math.cube(num));
}
return __a;
- })();
+ }).call(this);
})();
\ No newline at end of file
diff --git a/documentation/js/range_comprehensions.js b/documentation/js/range_comprehensions.js
index 9272dcff38..a67917f4bb 100644
--- a/documentation/js/range_comprehensions.js
+++ b/documentation/js/range_comprehensions.js
@@ -6,7 +6,7 @@
__a.push(num);
}
return __a;
- })();
+ }).call(this);
egg_delivery = function egg_delivery() {
var __f, __g, __h, __i, __j, dozen_eggs, i;
__f = []; __i = 0; __j = eggs.length;
@@ -14,7 +14,7 @@
__f.push((function() {
dozen_eggs = eggs.slice(i, i + 12);
return deliver(new egg_carton(dozen));
- })());
+ }).call(this));
}
return __f;
};
diff --git a/documentation/js/soaks.js b/documentation/js/soaks.js
new file mode 100644
index 0000000000..efacb69265
--- /dev/null
+++ b/documentation/js/soaks.js
@@ -0,0 +1,4 @@
+(function(){
+ var __a;
+ ((__a = lottery.draw_winner()) == undefined ? undefined : __a.address == undefined ? undefined : __a.address.zipcode);
+})();
\ No newline at end of file
diff --git a/documentation/js/splats.js b/documentation/js/splats.js
index 4fb2085bca..052437fe47 100644
--- a/documentation/js/splats.js
+++ b/documentation/js/splats.js
@@ -1,7 +1,7 @@
(function(){
- var contenders, gold, medalists, silver, the_field;
+ var award_medals, contenders, gold, silver, the_field;
gold = (silver = (the_field = "unknown"));
- medalists = function medalists(first, second) {
+ award_medals = function award_medals(first, second) {
var rest;
rest = Array.prototype.slice.call(arguments, 2);
gold = first;
@@ -9,7 +9,7 @@
return the_field = rest;
};
contenders = ["Michael Phelps", "Liu Xiang", "Yao Ming", "Allyson Felix", "Shawn Johnson", "Roman Sebrle", "Guo Jingjing", "Tyson Gay", "Asafa Powell", "Usain Bolt"];
- medalists.apply(this, contenders);
+ award_medals.apply(this, contenders);
alert("Gold: " + gold);
alert("Silver: " + silver);
alert("The Field: " + the_field);
diff --git a/documentation/js/while.js b/documentation/js/while.js
index 0ac87e11a4..ee7f0b06bb 100644
--- a/documentation/js/while.js
+++ b/documentation/js/while.js
@@ -1,5 +1,6 @@
(function(){
var __a, lyrics, num;
+ // Econ 101
if (this.studying_economics) {
while (supply > demand) {
buy();
@@ -8,6 +9,7 @@
sell();
}
}
+ // Nursery Rhyme
num = 6;
lyrics = (function() {
__a = [];
@@ -16,5 +18,5 @@
One fell out and bumped his head.");
}
return __a;
- })();
+ }).call(this);
})();
\ No newline at end of file
diff --git a/documentation/underscore.html b/documentation/underscore.html
index 5ce7f0cc61..357a94c0a7 100644
--- a/documentation/underscore.html
+++ b/documentation/underscore.html
@@ -19,7 +19,7 @@
1 2 # Underscore.coffee
- 3 # (c) 2009 Jeremy Ashkenas, DocumentCloud Inc.
+ 3 # (c) 2010 Jeremy Ashkenas, DocumentCloud Inc. 4 # Underscore is freely distributable under the terms of the MIT license. 5 # Portions of Underscore are inspired by or borrowed from Prototype.js, 6 # Oliver Steele's Functional, and John Resig's Micro-Templating.
@@ -40,7 +40,7 @@
21 # If Underscore is called as a function, it returns a wrapped object that 22 # can be used OO-style. This wrapper holds altered versions of all the 23 # underscore functions. Wrapped objects may be chained.
- 24 wrapper: obj =>
+ 24 wrapper:(obj)-> 25 this._wrapped: obj
26 this 27
@@ -50,7 +50,7 @@
31 32 33 # Create a safe reference to the Underscore object forreference below.
- 34 _: root._: obj =>newwrapper(obj)
+ 34 _:root._:(obj)->newwrapper(obj)
35 36 37 # Export the Underscore object for CommonJS.
@@ -58,22 +58,22 @@
39 40 41 # Create quick reference variables for speed access to core prototypes.
- 42 slice: Array::slice
- 43 unshift: Array::unshift
- 44 toString: Object::toString
- 45 hasOwnProperty: Object::hasOwnProperty
- 46 propertyIsEnumerable: Object::propertyIsEnumerable
+ 42 slice:Array::slice
+ 43 unshift:Array::unshift
+ 44 toString:Object::toString
+ 45 hasOwnProperty:Object::hasOwnProperty
+ 46 propertyIsEnumerable:Object::propertyIsEnumerable
47 48 49 # Current version.
- 50 _.VERSION:'0.5.5'
+ 50 _.VERSION:'0.5.7' 51 52 53 # ------------------------ Collection Functions: --------------------------- 54 55 # The cornerstone, an each implementation. 56 # Handles objects implementing forEach, arrays, and raw objects.
- 57 _.each: obj, iterator, context =>
+ 57 _.each:(obj, iterator, context)-> 58 index:0 59 try 60 return obj.forEach(iterator, context) if obj.forEach
@@ -87,36 +87,36 @@
68 69 # Return the results of applying the iterator to each element. Use JavaScript 70 # 1.6's version of map, if possible.
- 71 _.map: obj, iterator, context =>
+ 71 _.map:(obj, iterator, context)-> 72 return obj.map(iterator, context) if (obj and _.isFunction(obj.map))
73 results: []
- 74 _.each(obj) value, index, list =>
+ 74 _.each obj, (value, index, list)-> 75 results.push(iterator.call(context, value, index, list))
76 results
77 78 79 # Reduce builds up a single result from a list of values. Also known as 80 # inject, or foldl. Uses JavaScript 1.8's version of reduce, if possible.
- 81 _.reduce: obj, memo, iterator, context =>
+ 81 _.reduce:(obj, memo, iterator, context)-> 82 return obj.reduce(_.bind(iterator, context), memo) if (obj and _.isFunction(obj.reduce))
- 83 _.each(obj) value, index, list =>
+ 83 _.each obj, (value, index, list)-> 84 memo: iterator.call(context, memo, value, index, list)
85 memo
86 87 88 # The right-associative version of reduce, also known as foldr. Uses 89 # JavaScript 1.8's version of reduceRight, if available.
- 90 _.reduceRight: obj, memo, iterator, context =>
+ 90 _.reduceRight:(obj, memo, iterator, context)-> 91 return obj.reduceRight(_.bind(iterator, context), memo) if (obj and _.isFunction(obj.reduceRight))
- 92 _.each(_.clone(_.toArray(obj)).reverse()) value, index =>
+ 92 _.each _.clone(_.toArray(obj)).reverse(), (value, index)-> 93 memo: iterator.call(context, memo, value, index, obj)
94 memo
95 96 97 # Return the first value which passes a truth test.
- 98 _.detect: obj, iterator, context =>
+ 98 _.detect:(obj, iterator, context)-> 99 result:null
- 100 _.each(obj) value, index, list =>
+ 100 _.each obj, (value, index, list)-> 101 if iterator.call(context, value, index, list)
102 result: value
103 _.breakLoop()
@@ -125,47 +125,47 @@
106 107 # Return all the elements that pass a truth test. Use JavaScript 1.6's 108 # filter(), if it exists.
- 109 _.select: obj, iterator, context =>
+ 109 _.select:(obj, iterator, context)-> 110 if obj and _.isFunction(obj.filter) thenreturn obj.filter(iterator, context)
111 results: []
- 112 _.each(obj) value, index, list =>
+ 112 _.each obj, (value, index, list)-> 113 results.push(value) if iterator.call(context, value, index, list)
114 results
115 116 117 # Return all the elements for which a truth test fails.
- 118 _.reject: obj, iterator, context =>
+ 118 _.reject:(obj, iterator, context)-> 119 results: []
- 120 _.each(obj) value, index, list =>
+ 120 _.each obj, (value, index, list)-> 121 results.push(value) ifnot iterator.call(context, value, index, list)
122 results
123 124 125 # Determine whether all of the elements match a truth test. Delegate to 126 # JavaScript 1.6's every(), if it is present.
- 127 _.all: obj, iterator, context =>
+ 127 _.all:(obj, iterator, context)-> 128 iterator ||= _.identity
129 return obj.every(iterator, context) if obj and _.isFunction(obj.every)
130 result:true
- 131 _.each(obj) value, index, list =>
+ 131 _.each obj, (value, index, list)-> 132 _.breakLoop() unless (result: result and iterator.call(context, value, index, list))
133 result
134 135 136 # Determine if at least one element in the object matches a truth test. Use 137 # JavaScript 1.6's some(), if it exists.
- 138 _.any: obj, iterator, context =>
+ 138 _.any:(obj, iterator, context)-> 139 iterator ||= _.identity
140 return obj.some(iterator, context) if obj and _.isFunction(obj.some)
141 result:false
- 142 _.each(obj) value, index, list =>
+ 142 _.each obj, (value, index, list)-> 143 _.breakLoop() if (result: iterator.call(context, value, index, list))
144 result
145 146 147 # Determine if a given value is included in the array or object, 148 # based on '==='.
- 149 _.include: obj, target =>
+ 149 _.include:(obj, target)-> 150 return _.indexOf(obj, target) isnt-1if _.isArray(obj)
151 for key, val of obj
152 returntrueif val is target
@@ -173,49 +173,49 @@
154 155 156 # Invoke a method with arguments on every item in a collection.
- 157 _.invoke: obj, method =>
+ 157 _.invoke:(obj, method)-> 158 args: _.rest(arguments, 2)
159 (if method then val[method] else val).apply(val, args) for val in obj
160 161 162 # Convenience version of a common use case of map: fetching a property.
- 163 _.pluck: obj, key =>
- 164 _.map(obj, (val => val[key]))
+ 163 _.pluck:(obj, key)->
+ 164 _.map(obj, ((val)-> val[key]))
165 166 167 # Return the maximum item or (item-based computation).
- 168 _.max: obj, iterator, context =>
+ 168 _.max:(obj, iterator, context)-> 169 return Math.max.apply(Math, obj) ifnot iterator and _.isArray(obj)
170 result: {computed:-Infinity}
- 171 _.each(obj) value, index, list =>
+ 171 _.each obj, (value, index, list)-> 172 computed:if iterator then iterator.call(context, value, index, list) else value
173 computed >= result.computed and (result: {value: value, computed: computed})
174 result.value
175 176 177 # Return the minimum element (or element-based computation).
- 178 _.min: obj, iterator, context =>
+ 178 _.min:(obj, iterator, context)-> 179 return Math.min.apply(Math, obj) ifnot iterator and _.isArray(obj)
180 result: {computed:Infinity}
- 181 _.each(obj) value, index, list =>
+ 181 _.each obj, (value, index, list)-> 182 computed:if iterator then iterator.call(context, value, index, list) else value
183 computed < result.computed and (result: {value: value, computed: computed})
184 result.value
185 186 187 # Sort the object's values by a criteria produced by an iterator.
- 188 _.sortBy: obj, iterator, context =>
- 189 _.pluck(((_.map(obj) value, index, list =>
+ 188 _.sortBy:(obj, iterator, context)->
+ 189 _.pluck(((_.map obj, (value, index, list)-> 190 {value: value, criteria: iterator.call(context, value, index, list)}
- 191 ).sort() left, right =>
+ 191 ).sort((left, right)-> 192 a: left.criteria; b: right.criteria
193 if a < b then-1elseif a > b then1else0
- 194 ), 'value')
+ 194 )), 'value')
195 196 197 # Use a comparator function to figure out at what index an object should 198 # be inserted so as to maintain order. Uses binary search.
- 199 _.sortedIndex: array, obj, iterator =>
+ 199 _.sortedIndex:(array, obj, iterator)-> 200 iterator ||= _.identity
201 low:0; high: array.length
202 while low < high
@@ -225,7 +225,7 @@
206 207 208 # Convert anything iterable into a real, live array.
- 209 _.toArray: iterable =>
+ 209 _.toArray:(iterable)-> 210 return [] if (!iterable)
211 return iterable.toArray() if (iterable.toArray)
212 return iterable if (_.isArray(iterable))
@@ -234,7 +234,7 @@
215 216 217 # Return the number of elements in an object.
- 218 _.size: obj => _.toArray(obj).length
+ 218 _.size:(obj)-> _.toArray(obj).length
219 220 221 # -------------------------- Array Functions: ------------------------------
@@ -242,7 +242,7 @@
223 # Get the first element of an array. Passing "n" will return the first N 224 # values in the array. Aliased as "head". The "guard" check allows it to work 225 # with _.map.
- 226 _.first: array, n, guard =>
+ 226 _.first:(array, n, guard)-> 227 if n andnot guard then slice.call(array, 0, n) else array[0]
228 229
@@ -250,35 +250,35 @@
231 # Especially useful on the arguments object. Passing an "index" will return 232 # the rest of the values in the array from that index onward. The "guard" 233 # check allows it to work with _.map.
- 234 _.rest: array, index, guard =>
+ 234 _.rest:(array, index, guard)-> 235 slice.call(array, if _.isUndefined(index) or guard then1else index)
236 237 238 # Get the last element of an array.
- 239 _.last: array => array[array.length -1]
+ 239 _.last:(array)-> array[array.length -1]
240 241 242 # Trim out all falsy values from an array.
- 243 _.compact: array => array[i] for i in [0...array.length] when array[i]
+ 243 _.compact:(array)-> array[i] for i in [0...array.length] when array[i]
244 245 246 # Return a completely flattened version of an array.
- 247 _.flatten: array =>
- 248 _.reduce(array, []) memo, value =>
+ 247 _.flatten:(array)->
+ 248 _.reduce array, [], (memo, value)-> 249 return memo.concat(_.flatten(value)) if _.isArray(value)
250 memo.push(value)
251 memo
252 253 254 # Return a version of the array that does not contain the specified value(s).
- 255 _.without: array =>
+ 255 _.without:(array)-> 256 values: _.rest(arguments)
257 val for val in _.toArray(array) whennot _.include(values, val)
258 259 260 # Produce a duplicate-free version of the array. If the array has already 261 # been sorted, you have the option of using a faster algorithm.
- 262 _.uniq: array, isSorted =>
+ 262 _.uniq:(array, isSorted)-> 263 memo: []
264 for el, i in _.toArray(array)
265 memo.push(el) if i is0|| (if isSorted istruethen _.last(memo) isnt el elsenot _.include(memo, el))
@@ -287,330 +287,339 @@
268 269 # Produce an array that contains every item shared between all the 270 # passed-in arrays.
- 271 _.intersect: array =>
+ 271 _.intersect:(array)-> 272 rest: _.rest(arguments)
- 273 _.select(_.uniq(array)) item =>
- 274 _.all(rest) other =>
+ 273 _.select _.uniq(array), (item)->
+ 274 _.all rest, (other)-> 275 _.indexOf(other, item) >=0 276 277 278 # Zip together multiple lists into a single array -- elements that share 279 # an index go together.
- 280 _.zip: =>
- 281 args: _.toArray(arguments)
- 282 length: _.max(_.pluck(args, 'length'))
- 283 results:newArray(length)
- 284 for i in [0...length]
- 285 results[i]: _.pluck(args, String(i))
- 286 results
+ 280 _.zip:->
+ 281 length: _.max(_.pluck(arguments, 'length'))
+ 282 results:newArray(length)
+ 283 for i in [0...length]
+ 284 results[i]: _.pluck(arguments, String(i))
+ 285 results
+ 286 287
- 288
- 289 # If the browser doesn't supply us with indexOf (I'm looking at you, MSIE),
- 290 # we need this function. Return the position of the first occurence of an
- 291 # item in an array, or -1 if the item is not included in the array.
- 292 _.indexOf: array, item =>
- 293 return array.indexOf(item) if array.indexOf
- 294 i:0; l: array.length
- 295 while l - i
- 296 if array[i] is item thenreturn i else i++
- 297 -1
+ 288 # If the browser doesn't supply us with indexOf (I'm looking at you, MSIE),
+ 289 # we need this function. Return the position of the first occurence of an
+ 290 # item in an array, or -1 if the item is not included in the array.
+ 291 _.indexOf:(array, item)->
+ 292 return array.indexOf(item) if array.indexOf
+ 293 i:0; l: array.length
+ 294 while l - i
+ 295 if array[i] is item thenreturn i else i++
+ 296 -1
+ 297 298
- 299
- 300 # Provide JavaScript 1.6's lastIndexOf, delegating to the native function,
- 301 # if possible.
- 302 _.lastIndexOf: array, item =>
- 303 return array.lastIndexOf(item) if array.lastIndexOf
- 304 i: array.length
- 305 while i
- 306 if array[i] is item thenreturn i else i--
- 307 -1
+ 299 # Provide JavaScript 1.6's lastIndexOf, delegating to the native function,
+ 300 # if possible.
+ 301 _.lastIndexOf:(array, item)->
+ 302 return array.lastIndexOf(item) if array.lastIndexOf
+ 303 i: array.length
+ 304 while i
+ 305 if array[i] is item thenreturn i else i--
+ 306 -1
+ 307 308
- 309
- 310 # Generate an integer Array containing an arithmetic progression. A port of
- 311 # the native Python range() function. See:
- 312 # http://docs.python.org/library/functions.html#range
- 313 _.range: start, stop, step =>
- 314 a: _.toArray(arguments)
- 315 solo: a.length <=1
- 316 i:start:if solo then0else a[0];
- 317 stop:if solo then a[0] else a[1];
- 318 step: a[2] or1
- 319 len: Math.ceil((stop - start) / step)
- 320 return [] if len <=0
- 321 range:newArray(len)
- 322 idx:0
- 323 whiletrue
- 324 return range if (if step >0then i - stop else stop - i) >=0
- 325 range[idx]: i
- 326 idx++
- 327 i+= step
+ 309 # Generate an integer Array containing an arithmetic progression. A port of
+ 310 # the native Python range() function. See:
+ 311 # http://docs.python.org/library/functions.html#range
+ 312 _.range:(start, stop, step)->
+ 313 a: arguments
+ 314 solo: a.length <=1
+ 315 i:start:if solo then0else a[0];
+ 316 stop:if solo then a[0] else a[1];
+ 317 step: a[2] or1
+ 318 len: Math.ceil((stop - start) / step)
+ 319 return [] if len <=0
+ 320 range:newArray(len)
+ 321 idx:0
+ 322 whiletrue
+ 323 return range if (if step >0then i - stop else stop - i) >=0
+ 324 range[idx]: i
+ 325 idx++
+ 326 i+= step
+ 327 328
- 329
- 330 # ----------------------- Function Functions: -----------------------------
- 331
- 332 # Create a function bound to a given object (assigning 'this', and arguments,
- 333 # optionally). Binding with arguments is also known as 'curry'.
- 334 _.bind: func, obj =>
- 335 args: _.rest(arguments, 2)
- 336 => func.apply(obj or root, args.concat(_.toArray(arguments)))
+ 329 # ----------------------- Function Functions: -----------------------------
+ 330
+ 331 # Create a function bound to a given object (assigning 'this', and arguments,
+ 332 # optionally). Binding with arguments is also known as 'curry'.
+ 333 _.bind:(func, obj)->
+ 334 args: _.rest(arguments, 2)
+ 335 -> func.apply(obj or root, args.concat(arguments))
+ 336 337
- 338
- 339 # Bind all of an object's methods to that object. Useful for ensuring that
- 340 # all callbacks defined on an object belong to it.
- 341 _.bindAll: obj =>
- 342 funcs:if arguments.length >1then _.rest(arguments) else _.functions(obj)
- 343 _.each(funcs, (f => obj[f]: _.bind(obj[f], obj)))
- 344 obj
+ 338 # Bind all of an object's methods to that object. Useful for ensuring that
+ 339 # all callbacks defined on an object belong to it.
+ 340 _.bindAll:(obj)->
+ 341 funcs:if arguments.length >1then _.rest(arguments) else _.functions(obj)
+ 342 _.each(funcs, (f)-> obj[f]: _.bind(obj[f], obj))
+ 343 obj
+ 344 345
- 346
- 347 # Delays a function for the given number of milliseconds, and then calls
- 348 # it with the arguments supplied.
- 349 _.delay: func, wait =>
- 350 args: _.rest(arguments, 2)
- 351 setTimeout((=> func.apply(func, args)), wait)
+ 346 # Delays a function for the given number of milliseconds, and then calls
+ 347 # it with the arguments supplied.
+ 348 _.delay:(func, wait)->
+ 349 args: _.rest(arguments, 2)
+ 350 setTimeout((-> func.apply(func, args)), wait)
+ 351 352
- 353
- 354 # Defers a function, scheduling it to run after the current call stack has
- 355 # cleared.
- 356 _.defer: func =>
- 357 _.delay.apply(_, [func, 1].concat(_.rest(arguments)))
+ 353 # Defers a function, scheduling it to run after the current call stack has
+ 354 # cleared.
+ 355 _.defer:(func)->
+ 356 _.delay.apply(_, [func, 1].concat(_.rest(arguments)))
+ 357 358
- 359
- 360 # Returns the first function passed as an argument to the second,
- 361 # allowing you to adjust arguments, run code before and after, and
- 362 # conditionally execute the original function.
- 363 _.wrap: func, wrapper =>
- 364 => wrapper.apply(wrapper, [func].concat(_.toArray(arguments)))
+ 359 # Returns the first function passed as an argument to the second,
+ 360 # allowing you to adjust arguments, run code before and after, and
+ 361 # conditionally execute the original function.
+ 362 _.wrap:(func, wrapper)->
+ 363 -> wrapper.apply(wrapper, [func].concat(arguments))
+ 364 365
- 366
- 367 # Returns a function that is the composition of a list of functions, each
- 368 # consuming the return value of the function that follows.
- 369 _.compose: =>
- 370 funcs: _.toArray(arguments)
- 371 =>
- 372 args: _.toArray(arguments)
- 373 for i in [(funcs.length -1)..0]
- 374 args: [funcs[i].apply(this, args)]
- 375 args[0]
+ 366 # Returns a function that is the composition of a list of functions, each
+ 367 # consuming the return value of the function that follows.
+ 368 _.compose:->
+ 369 funcs: arguments
+ 370 ->
+ 371 args: arguments
+ 372 for i in [(funcs.length -1)..0]
+ 373 args: [funcs[i].apply(this, args)]
+ 374 args[0]
+ 375 376
- 377
- 378 # ------------------------- Object Functions: ----------------------------
- 379
- 380 # Retrieve the names of an object's properties.
- 381 _.keys: obj =>
- 382 return _.range(0, obj.length) if _.isArray(obj)
- 383 key for key, val of obj
+ 377 # ------------------------- Object Functions: ----------------------------
+ 378
+ 379 # Retrieve the names of an object's properties.
+ 380 _.keys:(obj)->
+ 381 return _.range(0, obj.length) if _.isArray(obj)
+ 382 key for key, val of obj
+ 383 384
- 385
- 386 # Retrieve the values of an object's properties.
- 387 _.values: obj =>
- 388 _.map(obj, _.identity)
+ 385 # Retrieve the values of an object's properties.
+ 386 _.values:(obj)->
+ 387 _.map(obj, _.identity)
+ 388 389
- 390
- 391 # Return a sorted list of the function names available in Underscore.
- 392 _.functions: obj =>
- 393 _.select(_.keys(obj), key => _.isFunction(obj[key])).sort()
+ 390 # Return a sorted list of the function names available in Underscore.
+ 391 _.functions:(obj)->
+ 392 _.select(_.keys(obj), (key)-> _.isFunction(obj[key])).sort()
+ 393 394
- 395
- 396 # Extend a given object with all of the properties in a source object.
- 397 _.extend: destination, source =>
- 398 for key, val of source
- 399 destination[key]: val
- 400 destination
+ 395 # Extend a given object with all of the properties in a source object.
+ 396 _.extend:(destination, source)->
+ 397 for key, val of source
+ 398 destination[key]: val
+ 399 destination
+ 400 401
- 402
- 403 # Create a (shallow-cloned) duplicate of an object.
- 404 _.clone: obj =>
- 405 return obj.slice(0) if _.isArray(obj)
- 406 _.extend({}, obj)
+ 402 # Create a (shallow-cloned) duplicate of an object.
+ 403 _.clone:(obj)->
+ 404 return obj.slice(0) if _.isArray(obj)
+ 405 _.extend({}, obj)
+ 406 407
- 408
- 409 # Invokes interceptor with the obj, and then returns obj.
- 410 # The primary purpose of this method is to "tap into" a method chain, in order to perform operations on intermediate results within the chain.
- 411 _.tap: obj, interceptor =>
- 412 interceptor(obj)
- 413 obj
+ 408 # Invokes interceptor with the obj, and then returns obj.
+ 409 # The primary purpose of this method is to "tap into" a method chain, in order to perform operations on intermediate results within the chain.
+ 410 _.tap:(obj, interceptor)->
+ 411 interceptor(obj)
+ 412 obj
+ 413 414
- 415
- 416 # Perform a deep comparison to check if two objects are equal.
- 417 _.isEqual: a, b =>
- 418 # Check object identity.
- 419 returntrueif a is b
- 420 # Different types?
- 421 atype:typeof(a); btype:typeof(b)
- 422 returnfalseif atype isnt btype
- 423 # Basic equality test (watch out for coercions).
- 424 returntrueif`a == b`
- 425 # One is falsy and the other truthy.
- 426 returnfalseif (!a and b) or (a and!b)
- 427 # One of them implements an isEqual()?
- 428 return a.isEqual(b) if a.isEqual
- 429 # Check dates' integer values.
- 430 return a.getTime() is b.getTime() if _.isDate(a) and _.isDate(b)
- 431 # Both are NaN?
- 432 returntrueif _.isNaN(a) and _.isNaN(b)
- 433 # Compare regular expressions.
- 434 if _.isRegExp(a) and _.isRegExp(b)
- 435 return a.source is b.source and
- 436 a.global is b.global and
- 437 a.ignoreCase is b.ignoreCase and
- 438 a.multiline is b.multiline
- 439 # If a is not an object by this point, we can't handle it.
- 440 returnfalseif atype isnt'object'
- 441 # Check for different array lengths before comparing contents.
- 442 returnfalseif a.length and (a.length isnt b.length)
- 443 # Nothing else worked, deep compare the contents.
- 444 aKeys: _.keys(a); bKeys: _.keys(b)
- 445 # Different object sizes?
- 446 returnfalseif aKeys.length isnt bKeys.length
- 447 # Recursive comparison of contents.
- 448 # for (var key in a) if (!_.isEqual(a[key], b[key])) return false;
- 449 returntrue
+ 415 # Perform a deep comparison to check if two objects are equal.
+ 416 _.isEqual:(a, b)->
+ 417 # Check object identity.
+ 418 returntrueif a is b
+ 419 # Different types?
+ 420 atype:typeof(a); btype:typeof(b)
+ 421 returnfalseif atype isnt btype
+ 422 # Basic equality test (watch out for coercions).
+ 423 returntrueif`a == b`
+ 424 # One is falsy and the other truthy.
+ 425 returnfalseif (!a and b) or (a and!b)
+ 426 # One of them implements an isEqual()?
+ 427 return a.isEqual(b) if a.isEqual
+ 428 # Check dates' integer values.
+ 429 return a.getTime() is b.getTime() if _.isDate(a) and _.isDate(b)
+ 430 # Both are NaN?
+ 431 returntrueif _.isNaN(a) and _.isNaN(b)
+ 432 # Compare regular expressions.
+ 433 if _.isRegExp(a) and _.isRegExp(b)
+ 434 return a.source is b.source and
+ 435 a.global is b.global and
+ 436 a.ignoreCase is b.ignoreCase and
+ 437 a.multiline is b.multiline
+ 438 # If a is not an object by this point, we can't handle it.
+ 439 returnfalseif atype isnt'object'
+ 440 # Check for different array lengths before comparing contents.
+ 441 returnfalseif a.length and (a.length isnt b.length)
+ 442 # Nothing else worked, deep compare the contents.
+ 443 aKeys: _.keys(a); bKeys: _.keys(b)
+ 444 # Different object sizes?
+ 445 returnfalseif aKeys.length isnt bKeys.length
+ 446 # Recursive comparison of contents.
+ 447 # for (var key in a) if (!_.isEqual(a[key], b[key])) return false;
+ 448 returntrue
+ 449 450
- 451
- 452 # Is a given array or object empty?
- 453 _.isEmpty: obj => _.keys(obj).length is0
+ 451 # Is a given array or object empty?
+ 452 _.isEmpty:(obj)-> _.keys(obj).length is0
+ 453 454
- 455
- 456 # Is a given value a DOM element?
- 457 _.isElement: obj => obj and obj.nodeType is1
+ 455 # Is a given value a DOM element?
+ 456 _.isElement:(obj)-> obj and obj.nodeType is1
+ 457 458
- 459
- 460 # Is a given value an array?
- 461 _.isArray: obj =>!!(obj and obj.concat and obj.unshift)
+ 459 # Is a given value an array?
+ 460 _.isArray:(obj)->!!(obj and obj.concat and obj.unshift)
+ 461 462
- 463
- 464 # Is a given variable an arguments object?
- 465 _.isArguments: obj => obj and _.isNumber(obj.length) and!_.isArray(obj) and!propertyIsEnumerable.call(obj, 'length')
+ 463 # Is a given variable an arguments object?
+ 464 _.isArguments:(obj)-> obj and _.isNumber(obj.length) andnot obj.concat and
+ 465 not obj.substr andnot obj.apply andnot propertyIsEnumerable.call(obj, 'length')
466 467 468 # Is the given value a function?
- 469 _.isFunction: obj =>!!(obj and obj.constructor and obj.call and obj.apply)
+ 469 _.isFunction:(obj)->!!(obj and obj.constructor and obj.call and obj.apply)
470 471 472 # Is the given value a string?
- 473 _.isString: obj =>!!(obj is''or (obj and obj.charCodeAt and obj.substr))
+ 473 _.isString:(obj)->!!(obj is''or (obj and obj.charCodeAt and obj.substr))
474 475 476 # Is a given value a number?
- 477 _.isNumber: obj => toString.call(obj) is'[object Number]'
+ 477 _.isNumber:(obj)-> (obj is+obj) or toString.call(obj) is'[object Number]' 478 479 480 # Is a given value a Date?
- 481 _.isDate: obj =>!!(obj and obj.getTimezoneOffset and obj.setUTCFullYear)
+ 481 _.isDate:(obj)->!!(obj and obj.getTimezoneOffset and obj.setUTCFullYear)
482 483 484 # Is the given value a regular expression?
- 485 _.isRegExp: obj =>!!(obj and obj.exec and (obj.ignoreCase or obj.ignoreCase isfalse))
+ 485 _.isRegExp:(obj)->!!(obj and obj.exec and (obj.ignoreCase or obj.ignoreCase isfalse))
486 487 488 # Is the given value NaN -- this one is interesting. NaN != NaN, and 489 # isNaN(undefined) == true, so we make sure it's a number first.
- 490 _.isNaN: obj => _.isNumber(obj) and window.isNaN(obj)
+ 490 _.isNaN:(obj)-> _.isNumber(obj) and window.isNaN(obj)
491 492 493 # Is a given value equal to null?
- 494 _.isNull: obj => obj isnull
+ 494 _.isNull:(obj)-> obj isnull 495 496 497 # Is a given variable undefined?
- 498 _.isUndefined: obj =>typeof obj is'undefined'
+ 498 _.isUndefined:(obj)->typeof obj is'undefined' 499 500 501 # -------------------------- Utility Functions: -------------------------- 502 503 # Run Underscore.js in noConflict mode, returning the '_' variable to its 504 # previous owner. Returns a reference to the Underscore object.
- 505 _.noConflict: =>
+ 505 _.noConflict:-> 506 root._: previousUnderscore
507 this 508 509 510 # Keep the identity function around for default iterators.
- 511 _.identity: value => value
+ 511 _.identity:(value)-> value
512 513 514 # Break out of the middle of an iteration.
- 515 _.breakLoop: =>throw breaker
+ 515 _.breakLoop:->throw breaker
516 517 518 # Generate a unique integer id (unique within the entire client session). 519 # Useful for temporary DOM ids. 520 idCounter:0
- 521 _.uniqueId: prefix =>
+ 521 _.uniqueId:(prefix)-> 522 (prefix or'') + idCounter++ 523 524
- 525 # JavaScript templating a-la ERB, pilfered from John Resig's
- 526 # "Secrets of the JavaScript Ninja", page 83.
- 527 _.template: str, data =>
- 528 `var fn = new Function('obj',
- 529 'var p=[],print=function(){p.push.apply(p,arguments);};' +
- 530 'with(obj){p.push(\'' +
- 531 str.
- 532 replace(/[\r\t\n]/g, " ").
- 533 split("<%").join("\t").
- 534 replace(/((^|%>)[^\t]*)'/g, "$1\r").
- 535 replace(/\t=(.*?)%>/g, "',$1,'").
- 536 split("\t").join("');").
- 537 split("%>").join("p.push('").
- 538 split("\r").join("\\'") +
- 539 "');}return p.join('');")`
- 540 if data then fn(data) else fn
- 541
- 542
- 543 # ------------------------------- Aliases ----------------------------------
- 544
- 545 _.forEach: _.each
- 546 _.foldl:_.inject: _.reduce
- 547 _.foldr: _.reduceRight
- 548 _.filter: _.select
- 549 _.every: _.all
- 550 _.some: _.any
- 551 _.head: _.first
- 552 _.tail: _.rest
- 553 _.methods: _.functions
+ 525 # By default, Underscore uses ERB-style template delimiters, change the
+ 526 # following template settings to use alternative delimiters.
+ 527 _.templateSettings: {
+ 528 start:'<%'
+ 529 end:'%>'
+ 530 interpolate:/<%=(.+?)%>/g
+ 531 }
+ 532
+ 533
+ 534 # JavaScript templating a-la ERB, pilfered from John Resig's
+ 535 # "Secrets of the JavaScript Ninja", page 83.
+ 536 # Single-quotea fix from Rick Strahl's version.
+ 537 _.template:(str, data)->
+ 538 c: _.templateSettings
+ 539 fn:newFunction'obj',
+ 540 'var p=[],print=function(){p.push.apply(p,arguments);};'+
+ 541 'with(obj){p.push(\''+
+ 542 str.replace(/[\r\t\n]/g, "")
+ 543 .replace(newRegExp("'(?=[^"+c.end[0]+"]*"+c.end+")","g"),"\t")
+ 544 .split("'").join("\\'")
+ 545 .split("\t").join("'")
+ 546 .replace(c.interpolate, "',$1,'")
+ 547 .split(c.start).join("');")
+ 548 .split(c.end).join("p.push('") +
+ 549 "');}return p.join('');"
+ 550 if data then fn(data) else fn
+ 551
+ 552
+ 553 # ------------------------------- Aliases ---------------------------------- 554
- 555
- 556 # /*------------------------ Setup the OOP Wrapper: --------------------------*/
- 557
- 558 # Helper function to continue chaining intermediate results.
- 559 result: obj, chain =>
- 560 if chain then _(obj).chain() else obj
- 561
- 562
- 563 # Add all of the Underscore functions to the wrapper object.
- 564 _.each(_.functions(_)) name =>
- 565 method: _[name]
- 566 wrapper.prototype[name]:=>
- 567 args: _.toArray(arguments)
- 568 unshift.call(args, this._wrapped)
- 569 result(method.apply(_, args), this._chain)
- 570
+ 555 _.forEach: _.each
+ 556 _.foldl:_.inject: _.reduce
+ 557 _.foldr: _.reduceRight
+ 558 _.filter: _.select
+ 559 _.every: _.all
+ 560 _.some: _.any
+ 561 _.head: _.first
+ 562 _.tail: _.rest
+ 563 _.methods: _.functions
+ 564
+ 565
+ 566 # /*------------------------ Setup the OOP Wrapper: --------------------------*/
+ 567
+ 568 # Helper function to continue chaining intermediate results.
+ 569 result:(obj, chain)->
+ 570 if chain then _(obj).chain() else obj
571
- 572 # Add all mutator Array functions to the wrapper.
- 573 _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift']) name =>
- 574 method: Array.prototype[name]
- 575 wrapper.prototype[name]:=>
- 576 method.apply(this._wrapped, arguments)
- 577 result(this._wrapped, this._chain)
- 578
+ 572
+ 573 # Add all of the Underscore functions to the wrapper object.
+ 574 _.each _.functions(_), (name)->
+ 575 method: _[name]
+ 576 wrapper.prototype[name]:->
+ 577 unshift.call(arguments, this._wrapped)
+ 578 result(method.apply(_, arguments), this._chain)
579
- 580 # Add all accessor Array functions to the wrapper.
- 581 _.each(['concat', 'join', 'slice']) name =>
- 582 method: Array.prototype[name]
- 583 wrapper.prototype[name]:=>
- 584 result(method.apply(this._wrapped, arguments), this._chain)
- 585
- 586
- 587 # Start chaining a wrapped Underscore object.
- 588 wrapper::chain: =>
- 589 this._chain:true
- 590 this
- 591
- 592
- 593 # Extracts the result from a wrapped and chained object.
- 594 wrapper::value: =>this._wrapped
+ 580
+ 581 # Add all mutator Array functions to the wrapper.
+ 582 _.each ['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], (name)->
+ 583 method: Array.prototype[name]
+ 584 wrapper.prototype[name]:->
+ 585 method.apply(this._wrapped, arguments)
+ 586 result(this._wrapped, this._chain)
+ 587
+ 588
+ 589 # Add all accessor Array functions to the wrapper.
+ 590 _.each ['concat', 'join', 'slice'], (name)->
+ 591 method: Array.prototype[name]
+ 592 wrapper.prototype[name]:->
+ 593 result(method.apply(this._wrapped, arguments), this._chain)
+ 594
+ 595
+ 596 # Start chaining a wrapped Underscore object.
+ 597 wrapper::chain:->
+ 598 this._chain:true
+ 599 this
+ 600
+ 601
+ 602 # Extracts the result from a wrapped and chained object.
+ 603 wrapper::value:->this._wrapped
number:-42if opposite_day
# Functions:
-square:x=> x * x
+square:(x)-> x * x
# Arrays:list: [1, 2, 3, 4, 5]
@@ -94,18 +92,18 @@
Mini Overview
math: {
root: Math.sqrt
square: square
- cube: x => x * square(x)
+ cube:(x)-> x * square x
}
# Splats:
-race: winner, runners... =>
- print(winner, runners)
+race:(winner, runners...)->
+ print winner, runners
# Existence:
-alert("I knew it!") if elvis?
+alert "I knew it!"if elvis?# Array comprehensions:
-cubed_list: math.cube(num) for num in list
+cubed_list: math.cube num for num in list
var __a, __b, __c, cubed_list, list, math, num, number, opposite_day, race, square;
// Assignment:
number =42;
@@ -146,7 +144,7 @@
Compile and print a little snippet of CoffeeScript directly from the
- command line (or from stdin). For example: coffee -e "square: x => x * x"
+ command line (or from stdin). For example: coffee -e "square: (x) -> x * x"
@@ -285,7 +283,7 @@
Installation and Usage
-v, --verbose
As the JavaScript is being generated, print out every step of code
- generation, including lexical scope and the node in the
+ generation, including lexical scope and the nodes in the
AST.
@@ -345,22 +343,24 @@
Language Reference
use indentation.
+
+ You don't need to use parentheses to invoke a function, if you're passing
+ arguments: print "coffee"
+
+
You can use newlines to break up your expression into smaller pieces,
- as long as CoffeeScript can tell that the line hasn't finished
- (similar to how Ruby handles it). For example,
- if the line ends in an operator, dot, or keyword.
+ as long as CoffeeScript can determine that the line hasn't finished yet.
Functions and Invocation
Functions are defined by a list of parameters, an arrow, and the
- function body. The empty function looks like this: =>. All
- functions in CoffeeScript are named by default, for the benefit of debug messages.
- If you'd like to create an anonymous function, just wrap it in parentheses.
+ function body. The empty function looks like this: ->. All
+ functions in CoffeeScript are named by default, for easier debugging.
-
square:x=> x * x
-cube:x=> square(x) * x
+
square:(x)-> x * x
+cube:(x)-> square(x) * x
var cube, square;
square =functionsquare(x) {
return x * x;
@@ -376,6 +376,10 @@
- Declarations of new variables are pushed up to the top of the nearest
+ Declaration of new variables are pushed up to the top of the nearest
lexical scope, so that assignment may always be performed within expressions.
@@ -402,7 +406,7 @@
Language Reference
Object and Array literals look very similar to their JavaScript cousins.
When you spread out each assignment on a separate line, the commas are
optional. In this way, assigning object properties looks the same as
- assigning local variables, and can be moved around freely. You can mix
+ assigning local variables, and can be moved around freely. Feel free to mix
and match the two styles.
CoffeeScript output is wrapped in an anonymous function:
(function(){ ... })(); This safety wrapper, combined with the
automatic generation of the var keyword, make it exceedingly difficult
- to pollute the global namespace by accident. If you'd like to create
- global variables, attach them as properties on window,
- or on the exports object in CommonJS.
+ to pollute the global namespace by accident.
+
+
+ If you'd like to create top-level variables for other scripts to use,
+ attach them as properties on window, or on the exports
+ object in CommonJS. The existential operator (below), gives you a
+ reliable way to figure out where to add them, if you're targeting both
+ CommonJS and the browser: root: exports ? this
@@ -520,38 +529,6 @@
Language Reference
truthy variables.
-
- The Existential Operator
- It's a little difficult to check for the existence of a variable in
- JavaScript. if (variable) ... comes close, but fails for zero,
- the empty string, and false. The existential operator ? returns true unless
- a variable is null or undefined, which makes it analogous
- to Ruby's nil?
-
-
- It can also be used for safer conditional assignment than ||=
- provides, for cases where you may be handling numbers or strings.
-
var solipsism, speed;
-if ((typeof mind !=="undefined"&& mind !==null) &&!(typeof world !=="undefined"&& world !==null)) {
- solipsism =true;
-}
-speed = (typeof speed !=="undefined"&& speed !==null) ? speed : 140;
-
-
Aliases
Because the == operator frequently causes undesirable coercion,
@@ -605,11 +582,11 @@
Language Reference
The JavaScript arguments object is a useful way to work with
functions that accept variable numbers of arguments. CoffeeScript provides
splats ..., both for function definition as well as invocation,
- making variable arguments a little bit more palatable.
+ making variable numbers of arguments a little bit more palatable.
gold:silver:the_field:"unknown"
-medalists: first, second, rest... =>
+award_medals:(first, second, rest...)->gold: first
silver: second
the_field: rest
@@ -627,14 +604,14 @@