coffee-script 0.1.6 → 0.2.0

data/coffee-script.gemspec

@@ -1,7 +1,7 @@
 Gem::Specification.new do |s|
   s.name      = 'coffee-script'
-  s.version   = '0.1.6'         # Keep version in sync with coffee-script.rb
-  s.date      = '2009-12-27'
+  s.version   = '0.2.0'         # Keep version in sync with coffee-script.rb
+  s.date      = '2010-1-5'
 
   s.homepage    = "http://jashkenas.github.com/coffee-script/"
   s.summary     = "The CoffeeScript Compiler"
@@ -22,5 +22,5 @@ Gem::Specification.new do |s|
   s.require_paths     = ['lib']
   s.executables       = ['coffee']
 
-  s.files = Dir['bin/*', 'examples/*', 'lib/**/*', 'coffee-script.gemspec', 'LICENSE', 'README']
+  s.files = Dir['bin/*', 'examples/*', 'lib/**/*', 'coffee-script.gemspec', 'LICENSE', 'README', 'package.json']
 end

data/examples/code.coffee

@@ -1,16 +1,16 @@
 # Functions:
-square: x => x * x.
+square: x => x * x
 
-sum: x, y => x + y.
+sum: x, y => x + y
 
-odd: x => x % 2 is 0.
+odd: x => x % 2 is 0
 
-even: x => x % 2 isnt 0.
+even: x => x % 2 isnt 0
 
 run_loop: =>
-  fire_events( e => e.stopPropagation(). )
+  fire_events(e => e.stopPropagation())
   listen()
-  wait().
+  wait()
 
 # Objects:
 dense_object_literal: {one: 1, two: 2, three: 3}
@@ -22,14 +22,14 @@ spaced_out_multiline_object: {
   three: new Idea()
 
   inner_obj: {
-    freedom: => _.freedom().
+    freedom: => _.freedom()
   }
 }
 
 # Arrays:
-stooges : [{moe: 45}, {curly: 43}, {larry: 46}]
+stooges: [{moe: 45}, {curly: 43}, {larry: 46}]
 
-exponents : [x => x., x => x * x., x => x * x * x.]
+exponents: [(x => x), (x => x * x), (x => x * x * x)]
 
 empty: []
 
@@ -45,9 +45,9 @@ if submarine.shields_up
 else if submarine.sinking
   abandon_ship()
 else
-  run_away().
+  run_away()
 
-eldest: if 25 > 21 then liz else marge.
+eldest: if 25 > 21 then liz else marge
 
 decoration: medal_of_honor if war_hero
 
@@ -58,8 +58,8 @@ race: =>
   run()
   walk()
   crawl()
-  if tired then return sleep().
-  race().
+  if tired then return sleep()
+  race()
 
 # Conditional assignment:
 good ||= evil
@@ -81,54 +81,54 @@ try
   dogs_and_cats_living_together()
   throw "up"
 catch error
-  print( error )
+  print(error)
 finally
-  clean_up().
+  clean_up()
 
-try all_hell_breaks_loose() catch error print(error) finally clean_up().
+try all_hell_breaks_loose() catch error then print(error) finally clean_up()
 
 # While loops, break and continue.
 while demand > supply
   sell()
-  restock().
+  restock()
 
-while supply > demand then buy().
+while supply > demand then buy()
 
 while true
   break if broken
-  continue if continuing.
+  continue if continuing
 
 # Unary operators.
 !!true
 
 # Lexical scoping.
-a: 5
+v_1: 5
 change_a_and_set_b: =>
-  a: 10
-  b: 15.
-b: 20
+  v_1: 10
+  v_2: 15
+v_2: 20
 
 # Array comprehensions.
-supper: food.capitalize() for food in ['toast', 'cheese', 'wine'].
+supper: food.capitalize() for food in ['toast', 'cheese', 'wine']
 
-drink(bottle) for bottle, i in ['soda', 'wine', 'lemonade'] if even(i).
+drink(bottle) for bottle, i in ['soda', 'wine', 'lemonade'] when even(i)
 
 # Switch statements ("else" serves as a default).
 activity: switch day
-when "Tuesday"   then eat_breakfast()
-when "Sunday"    then go_to_church()
-when "Saturday"  then go_to_the_park()
-when "Wednesday"
-  if day is bingo_day
-    go_to_bingo()
-  else
-    eat_breakfast()
-    go_to_work()
-    eat_dinner().
-else go_to_work().
+  when "Tuesday"   then eat_breakfast()
+  when "Sunday"    then go_to_church()
+  when "Saturday"  then go_to_the_park()
+  when "Wednesday"
+    if day is bingo_day
+      go_to_bingo()
+    else
+      eat_breakfast()
+      go_to_work()
+      eat_dinner()
+  else go_to_work()
 
 # Semicolons can optionally be used instead of newlines.
-wednesday: => eat_breakfast(); go_to_work(); eat_dinner(); .
+wednesday: => eat_breakfast(); go_to_work(); eat_dinner()
 
 # Array slice literals.
 zero_to_nine: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
@@ -140,21 +140,21 @@ sed diam nonummy nibh euismod tincidunt ut laoreet dolore magna
 aliquam erat volutpat. Ut wisi enim ad."
 
 # Inheritance and calling super.
-Animal: => .
+Animal: =>
 Animal.prototype.move: meters =>
-  alert(this.name + " moved " + meters + "m.").
+  alert(this.name + " moved " + meters + "m.")
 
-Snake: name => this.name: name.
+Snake: name => this.name: name
 Snake extends Animal
 Snake.prototype.move: =>
   alert('Slithering...')
-  super(5).
+  super(5)
 
-Horse: name => this.name: name.
+Horse: name => this.name: name
 Horse extends Animal
 Horse.prototype.move: =>
   alert('Galloping...')
-  super(45).
+  super(45)
 
 sam: new Snake("Sammy the Snake")
 tom: new Horse("Tommy the Horse")

data/examples/documents.coffee

@@ -1,7 +1,7 @@
 # Document Model
 dc.model.Document: dc.Model.extend({
 
-  constructor: attributes => this.base(attributes).
+  constructor: attributes => this.base(attributes)
 
   # For display, show either the highlighted search results, or the summary,
   # if no highlights are available.
@@ -9,22 +9,22 @@ dc.model.Document: dc.Model.extend({
   # version of the summary has all runs of whitespace squeezed out.
   displaySummary: =>
     text: this.get('highlight') or this.get('summary') or ''
-    text and text.replace(/\s+/g, ' ').
+    text and text.replace(/\s+/g, ' ')
 
   # Return a list of the document's metadata. Think about caching this on the
   # document by binding to Metadata, instead of on-the-fly.
   metadata: =>
     docId: this.id
-    _.select(Metadata.models()
-      meta => _.any(meta.get('instances')
-        instance => instance.document_id is docId.).).
+    _.select(Metadata.models(), (meta => 
+      _.any(meta.get('instances'), instance => 
+        instance.document_id is docId)))
 
   bookmark: pageNumber =>
     bookmark: new dc.model.Bookmark({title: this.get('title'), page_number: pageNumber, document_id: this.id})
-    Bookmarks.create(bookmark).
+    Bookmarks.create(bookmark)
 
   # Inspect.
-  toString: => 'Document ' + this.id + ' "' + this.get('title') + '"'.
+  toString: => 'Document ' + this.id + ' "' + this.get('title') + '"'
 
 })
 
@@ -37,31 +37,31 @@ dc.model.DocumentSet: dc.model.RESTfulSet.extend({
 
   constructor: options =>
     this.base(options)
-    _.bindAll(this, 'downloadSelectedViewers', 'downloadSelectedPDF', 'downloadSelectedFullText').
+    _.bindAll(this, 'downloadSelectedViewers', 'downloadSelectedPDF', 'downloadSelectedFullText')
 
-  selected: => _.select(this.models(), m => m.get('selected').).
+  selected: => _.select(this.models(), m => m.get('selected'))
 
-  selectedIds: => _.pluck(this.selected(), 'id').
+  selectedIds: => _.pluck(this.selected(), 'id')
 
-  countSelected: => this.selected().length.
+  countSelected: => this.selected().length
 
   downloadSelectedViewers: =>
-    dc.app.download('/download/' + this.selectedIds().join('/') + '/document_viewer.zip').
+    dc.app.download('/download/' + this.selectedIds().join('/') + '/document_viewer.zip')
 
   downloadSelectedPDF: =>
-    if this.countSelected() <= 1 then return window.open(this.selected()[0].get('pdf_url')).
-    dc.app.download('/download/' + this.selectedIds().join('/') + '/document_pdfs.zip').
+    if this.countSelected() <= 1 then return window.open(this.selected()[0].get('pdf_url'))
+    dc.app.download('/download/' + this.selectedIds().join('/') + '/document_pdfs.zip')
 
   downloadSelectedFullText: =>
-    if this.countSelected() <= 1 then return window.open(this.selected()[0].get('full_text_url')).
-    dc.app.download('/download/' + this.selectedIds().join('/') + '/document_text.zip').
+    if this.countSelected() <= 1 then return window.open(this.selected()[0].get('full_text_url'))
+    dc.app.download('/download/' + this.selectedIds().join('/') + '/document_text.zip')
 
   # We override "_onModelEvent" to fire selection changed events when documents
   # change their selected state.
   _onModelEvent: e, model =>
     this.base(e, model)
     fire: e == dc.Model.CHANGED and model.hasChanged('selected')
-    if fire then _.defer(_(this.fire).bind(this, this.SELECTION_CHANGED, this))..
+    if fire then _.defer(_(this.fire).bind(this, this.SELECTION_CHANGED, this))
 
 })
 

data/examples/poignant.coffee

@@ -2,7 +2,7 @@
 
 # ['toast', 'cheese', 'wine'].each { |food| print food.capitalize }
 
-['toast', 'wine', 'cheese'].each( food => print(food.capitalize()). )
+['toast', 'wine', 'cheese'].each(food => print(food.capitalize()))
 
 
 
@@ -14,10 +14,10 @@
 # end
 
 LotteryTicket: {
-  get_picks:    => this.picks.
-  set_picks:    nums => this.picks: nums.
-  get_purchase: => this.purchase.
-  set_purchase: amount => this.purchase: amount.
+  get_picks:    => this.picks
+  set_picks:    nums => this.picks: nums
+  get_purchase: => this.purchase
+  set_purchase: amount => this.purchase: amount
 }
 
 
@@ -33,8 +33,8 @@ LotteryTicket: {
 
 WishScanner: {
   scan_for_a_wish: =>
-    wish: this.read().detect( thought => thought.index('wish: ') is 0. )
-    wish.replace('wish: ', '').
+    wish: this.read().detect(thought => thought.index('wish: ') is 0)
+    wish.replace('wish: ', '')
 }
 
 
@@ -79,28 +79,28 @@ Creature : {
 
   # This method applies a hit taken during a fight.
   hit: damage =>
-    p_up: Math.rand( this.charisma )
+    p_up: Math.rand(this.charisma)
     if p_up % 9 is 7
       this.life += p_up / 4
-      puts( "[" + this.name + " magick powers up " + p_up + "!]" ).
+      puts("[" + this.name + " magick powers up " + p_up + "!]")
     this.life -= damage
-    if this.life <= 0 then puts( "[" + this.name + " has died.]" )..
+    if this.life <= 0 then puts("[" + this.name + " has died.]")
 
   # This method takes one turn in a fight.
   fight: enemy, weapon =>
-    if this.life <= 0 then return puts( "[" + this.name + "is too dead to fight!]" ).
+    if this.life <= 0 then return puts("[" + this.name + "is too dead to fight!]")
 
     # Attack the opponent.
-    your_hit: Math.rand( this.strength + weapon )
-    puts( "[You hit with " + your_hit + "points of damage!]" )
-    enemy.hit( your_hit )
+    your_hit: Math.rand(this.strength + weapon)
+    puts("[You hit with " + your_hit + "points of damage!]")
+    enemy.hit(your_hit)
 
     # Retaliation.
-    puts( enemy )
+    puts(enemy)
     if enemy.life > 0
-      enemy_hit: Math.rand( enemy.strength + enemy.weapon )
-      puts( "[Your enemy hit with " + enemy_hit + "points of damage!]" )
-      this.hit( enemy_hit )..
+      enemy_hit: Math.rand(enemy.strength + enemy.weapon)
+      puts("[Your enemy hit with " + enemy_hit + "points of damage!]")
+      this.hit(enemy_hit)
 
 }
 
@@ -123,12 +123,12 @@ Creature : {
 # Get evil idea and swap in code words
 print("Enter your new idea: ")
 idea: gets()
-code_words.each( real, code => idea.replace(real, code). )
+code_words.each(real, code => idea.replace(real, code))
 
 # Save the jibberish to a new file
 print("File encoded. Please enter a name for this idea: ")
 idea_name: gets().strip()
-File.open("idea-" + idea_name + '.txt', 'w', file => file.write(idea). )
+File.open("idea-" + idea_name + '.txt', 'w', file => file.write(idea))
 
 
 
@@ -149,5 +149,5 @@ wipe_mutterings_from: sentence =>
   while sentence.indexOf('(') >= 0
     open:     sentence.indexOf('(') - 1
     close:    sentence.indexOf(')') + 1
-    sentence: sentence[0..open] + sentence[close..sentence.length].
-    sentence.
+    sentence: sentence[0..open] + sentence[close..sentence.length]
+    sentence

data/examples/underscore.coffee

@@ -1,107 +1,126 @@
-# Underscore.js
-# (c) 2009 Jeremy Ashkenas, DocumentCloud Inc.
-# Underscore is freely distributable under the terms of the MIT license.
-# Portions of Underscore are inspired by or borrowed from Prototype.js,
-# Oliver Steele's Functional, and John Resig's Micro-Templating.
-# For all details and documentation:
-# http://documentcloud.github.com/underscore/
-
-# ------------------------- Baseline setup ---------------------------------
-
-# Establish the root object, "window" in the browser, or "global" on the server.
-root: this
-
-# Save the previous value of the "_" variable.
-previousUnderscore: root._
-
-# If Underscore is called as a function, it returns a wrapped object that
-# can be used OO-style. This wrapper holds altered versions of all the
-# underscore functions. Wrapped objects may be chained.
-wrapper: obj => this._wrapped: obj.
-
-# Establish the object that gets thrown to break out of a loop iteration.
-breaker: if typeof(StopIteration) is 'undefined' then '__break__' else StopIteration.
-
-# Create a safe reference to the Underscore object for reference below.
-_: root._: obj => new wrapper(obj).
-
-# Export the Underscore object for CommonJS.
-if typeof(exports) != 'undefined' then exports._: _.
-
-# Create quick reference variables for speed access to core prototypes.
-slice:                Array.prototype.slice
-unshift:              Array.prototype.unshift
-toString:             Object.prototype.toString
-hasOwnProperty:       Object.prototype.hasOwnProperty
-propertyIsEnumerable: Object.prototype.propertyIsEnumerable
-
-# Current version.
-_.VERSION: '0.5.1'
-
-# ------------------------ Collection Functions: ---------------------------
-
-# The cornerstone, an each implementation.
-# Handles objects implementing forEach, arrays, and raw objects.
-_.each: obj, iterator, context =>
-  index: 0
-  try
-    return obj.forEach(iterator, context) if obj.forEach
-    return iterator.call(context, item, i, obj) for item, i in obj. if _.isArray(obj) or _.isArguments(obj)
-    iterator.call(context, obj[key], key, obj) for key in _.keys(obj).
-  catch e
-    throw e if e isnt breaker.
-  obj.
-
-# Return the results of applying the iterator to each element. Use JavaScript
-# 1.6's version of map, if possible.
-_.map: obj, iterator, context =>
-  return obj.map(iterator, context) if (obj and _.isFunction(obj.map))
-  results: []
-  mapper: value, index, list => results.push(iterator.call(context, value, index, list)).
-  _.each(obj, mapper)
-  results.
-
-# Reduce builds up a single result from a list of values. Also known as
-# inject, or foldl. Uses JavaScript 1.8's version of reduce, if possible.
-_.reduce: obj, memo, iterator, context =>
-  return obj.reduce(_.bind(iterator, context), memo) if (obj and _.isFunction(obj.reduce))
-  reducer: value, index, list => memo: iterator.call(context, memo, value, index, list).
-  _.each(obj, reducer)
-  memo.
-
-# The right-associative version of reduce, also known as foldr. Uses
-# JavaScript 1.8's version of reduceRight, if available.
-_.reduceRight: obj, memo, iterator, context =>
-  return obj.reduceRight(_.bind(iterator, context), memo) if (obj and _.isFunction(obj.reduceRight))
-  reversed: _.clone(_.toArray(obj)).reverse()
-  reverser: value, index => memo: iterator.call(context, memo, value, index, obj).
-  _.each(reversed, reverser)
-  memo.
+
+  # Underscore.coffee
+  # (c) 2009 Jeremy Ashkenas, DocumentCloud Inc.
+  # Underscore is freely distributable under the terms of the MIT license.
+  # Portions of Underscore are inspired by or borrowed from Prototype.js,
+  # Oliver Steele's Functional, and John Resig's Micro-Templating.
+  # For all details and documentation:
+  # http://documentcloud.github.com/underscore/
+
+
+  # ------------------------- Baseline setup ---------------------------------
+
+  # Establish the root object, "window" in the browser, or "global" on the server.
+  root: this
+
+
+  # Save the previous value of the "_" variable.
+  previousUnderscore: root._
+
+
+  # If Underscore is called as a function, it returns a wrapped object that
+  # can be used OO-style. This wrapper holds altered versions of all the
+  # underscore functions. Wrapped objects may be chained.
+  wrapper: obj =>
+    this._wrapped: obj
+    this
+
+
+  # Establish the object that gets thrown to break out of a loop iteration.
+  breaker: if typeof(StopIteration) is 'undefined' then '__break__' else StopIteration
+
+
+  # Create a safe reference to the Underscore object for reference below.
+  _: root._: obj => new wrapper(obj)
+
+
+  # Export the Underscore object for CommonJS.
+  if typeof(exports) != 'undefined' then exports._: _
+
+
+  # Create quick reference variables for speed access to core prototypes.
+  slice:                Array.prototype.slice
+  unshift:              Array.prototype.unshift
+  toString:             Object.prototype.toString
+  hasOwnProperty:       Object.prototype.hasOwnProperty
+  propertyIsEnumerable: Object.prototype.propertyIsEnumerable
+
+
+  # Current version.
+  _.VERSION: '0.5.3'
+
+
+  # ------------------------ Collection Functions: ---------------------------
+
+  # The cornerstone, an each implementation.
+  # Handles objects implementing forEach, arrays, and raw objects.
+  _.each: obj, iterator, context =>
+    index: 0
+    try
+      return obj.forEach(iterator, context) if obj.forEach
+      if _.isArray(obj) or _.isArguments(obj)
+        return iterator.call(context, obj[i], i, obj) for i in [0...obj.length]
+      iterator.call(context, val, key, obj) for val, key in obj
+    catch e
+      throw e if e isnt breaker
+    obj
+
+
+  # Return the results of applying the iterator to each element. Use JavaScript
+  # 1.6's version of map, if possible.
+  _.map: obj, iterator, context =>
+    return obj.map(iterator, context) if (obj and _.isFunction(obj.map))
+    results: []
+    _.each(obj) value, index, list =>
+      results.push(iterator.call(context, value, index, list))
+    results
+
+
+  # Reduce builds up a single result from a list of values. Also known as
+  # inject, or foldl. Uses JavaScript 1.8's version of reduce, if possible.
+  _.reduce: obj, memo, iterator, context =>
+    return obj.reduce(_.bind(iterator, context), memo) if (obj and _.isFunction(obj.reduce))
+    _.each(obj) value, index, list =>
+      memo: iterator.call(context, memo, value, index, list)
+    memo
+
+
+  # The right-associative version of reduce, also known as foldr. Uses
+  # JavaScript 1.8's version of reduceRight, if available.
+  _.reduceRight: obj, memo, iterator, context =>
+    return obj.reduceRight(_.bind(iterator, context), memo) if (obj and _.isFunction(obj.reduceRight))
+    _.each(_.clone(_.toArray(obj)).reverse()) value, index =>
+      memo: iterator.call(context, memo, value, index, obj)
+    memo
+
 
   # Return the first value which passes a truth test.
   _.detect: obj, iterator, context =>
     result: null
-    _.each(obj, (value, index, list =>
+    _.each(obj) value, index, list =>
       if iterator.call(context, value, index, list)
         result: value
-        _.breakLoop()..))
-    result.
+        _.breakLoop()
+    result
+
 
   # Return all the elements that pass a truth test. Use JavaScript 1.6's
   # filter(), if it exists.
   _.select: obj, iterator, context =>
-    if obj and _.isFunction(obj.filter) then return obj.filter(iterator, context).
+    if obj and _.isFunction(obj.filter) then return obj.filter(iterator, context)
     results: []
-    _.each(obj, (value, index, list =>
-      results.push(value) if iterator.call(context, value, index, list).))
-    results.
+    _.each(obj) value, index, list =>
+      results.push(value) if iterator.call(context, value, index, list)
+    results
+
 
   # Return all the elements for which a truth test fails.
   _.reject: obj, iterator, context =>
     results: []
-    _.each(obj, (value, index, list =>
-      results.push(value) if not iterator.call(context, value, index, list).))
-    results.
+    _.each(obj) value, index, list =>
+      results.push(value) if not iterator.call(context, value, index, list)
+    results
+
 
   # Determine whether all of the elements match a truth test. Delegate to
   # JavaScript 1.6's every(), if it is present.
@@ -109,9 +128,10 @@ _.reduceRight: obj, memo, iterator, context =>
     iterator ||= _.identity
     return obj.every(iterator, context) if obj and _.isFunction(obj.every)
     result: true
-    _.each(obj, (value, index, list =>
-      _.breakLoop() unless result: result and iterator.call(context, value, index, list).))
-    result.
+    _.each(obj) value, index, list =>
+      _.breakLoop() unless (result: result and iterator.call(context, value, index, list))
+    result
+
 
   # Determine if at least one element in the object matches a truth test. Use
   # JavaScript 1.6's some(), if it exists.
@@ -119,193 +139,193 @@ _.reduceRight: obj, memo, iterator, context =>
     iterator ||= _.identity
     return obj.some(iterator, context) if obj and _.isFunction(obj.some)
     result: false
-    _.each(obj, (value, index, list =>
-      _.breakLoop() if (result: iterator.call(context, value, index, list)).))
-    result.
+    _.each(obj) value, index, list =>
+      _.breakLoop() if (result: iterator.call(context, value, index, list))
+    result
+
 
   # Determine if a given value is included in the array or object,
   # based on '==='.
   _.include: obj, target =>
     return _.indexOf(obj, target) isnt -1 if _.isArray(obj)
-    found: false
-    _.each(obj, (value =>
-      _.breakLoop() if (found: value is target).))
-    found.
+    for val in obj
+      return true if val is target
+    false
+
 
   # Invoke a method with arguments on every item in a collection.
   _.invoke: obj, method =>
     args: _.rest(arguments, 2)
-    _.map(obj, (value =>
-      (if method then value[method] else value.).apply(value, args).)).
+    (if method then val[method] else val).apply(val, args) for val in obj
+
 
   # Convenience version of a common use case of map: fetching a property.
   _.pluck: obj, key =>
-    _.map(obj, (value => value[key].)).
+    _.map(obj, (val => val[key]))
+
 
   # Return the maximum item or (item-based computation).
   _.max: obj, iterator, context =>
-    return Math.max.apply(Math, obj) if !iterator and _.isArray(obj)
+    return Math.max.apply(Math, obj) if not iterator and _.isArray(obj)
     result: {computed: -Infinity}
-    _.each(obj, (value, index, list =>
-      computed: if iterator then iterator.call(context, value, index, list) else value.
-      computed >= result.computed and (result: {value: value, computed: computed}).))
-    result.value.
-#
-#   # Return the minimum element (or element-based computation).
-#   _.min = function(obj, iterator, context) {
-#     if (!iterator && _.isArray(obj)) return Math.min.apply(Math, obj);
-#     var result = {computed : Infinity};
-#     _.each(obj, function(value, index, list) {
-#       var computed = iterator ? iterator.call(context, value, index, list) : value;
-#       computed < result.computed && (result = {value : value, computed : computed});
-#     });
-#     return result.value;
-#   };
-#
-#   # Sort the object's values by a criteria produced by an iterator.
-#   _.sortBy = function(obj, iterator, context) {
-#     return _.pluck(_.map(obj, function(value, index, list) {
-#       return {
-#         value : value,
-#         criteria : iterator.call(context, value, index, list)
-#       };
-#     }).sort(function(left, right) {
-#       var a = left.criteria, b = right.criteria;
-#       return a < b ? -1 : a > b ? 1 : 0;
-#     }), 'value');
-#   };
-#
-#   # Use a comparator function to figure out at what index an object should
-#   # be inserted so as to maintain order. Uses binary search.
-#   _.sortedIndex = function(array, obj, iterator) {
-#     iterator = iterator || _.identity;
-#     var low = 0, high = array.length;
-#     while (low < high) {
-#       var mid = (low + high) >> 1;
-#       iterator(array[mid]) < iterator(obj) ? low = mid + 1 : high = mid;
-#     }
-#     return low;
-#   };
-#
-#   # Convert anything iterable into a real, live array.
-#   _.toArray = function(iterable) {
-#     if (!iterable)                return [];
-#     if (iterable.toArray)         return iterable.toArray();
-#     if (_.isArray(iterable))      return iterable;
-#     if (_.isArguments(iterable))  return slice.call(iterable);
-#     return _.map(iterable, function(val){ return val; });
-#   };
-#
-#   # Return the number of elements in an object.
-#   _.size = function(obj) {
-#     return _.toArray(obj).length;
-#   };
-#
-#   /*-------------------------- Array Functions: ------------------------------*/
-#
-#   # Get the first element of an array. Passing "n" will return the first N
-#   # values in the array. Aliased as "head". The "guard" check allows it to work
-#   # with _.map.
-#   _.first = function(array, n, guard) {
-#     return n && !guard ? slice.call(array, 0, n) : array[0];
-#   };
-#
-#   # Returns everything but the first entry of the array. Aliased as "tail".
-#   # Especially useful on the arguments object. Passing an "index" will return
-#   # the rest of the values in the array from that index onward. The "guard"
-#    //check allows it to work with _.map.
-#   _.rest = function(array, index, guard) {
-#     return slice.call(array, _.isUndefined(index) || guard ? 1 : index);
-#   };
-#
-#   # Get the last element of an array.
-#   _.last = function(array) {
-#     return array[array.length - 1];
-#   };
-#
-#   # Trim out all falsy values from an array.
-#   _.compact = function(array) {
-#     return _.select(array, function(value){ return !!value; });
-#   };
-#
-#   # Return a completely flattened version of an array.
-#   _.flatten = function(array) {
-#     return _.reduce(array, [], function(memo, value) {
-#       if (_.isArray(value)) return memo.concat(_.flatten(value));
-#       memo.push(value);
-#       return memo;
-#     });
-#   };
-#
-#   # Return a version of the array that does not contain the specified value(s).
-#   _.without = function(array) {
-#     var values = _.rest(arguments);
-#     return _.select(array, function(value){ return !_.include(values, value); });
-#   };
-#
-#   # Produce a duplicate-free version of the array. If the array has already
-#   # been sorted, you have the option of using a faster algorithm.
-#   _.uniq = function(array, isSorted) {
-#     return _.reduce(array, [], function(memo, el, i) {
-#       if (0 == i || (isSorted === true ? _.last(memo) != el : !_.include(memo, el))) memo.push(el);
-#       return memo;
-#     });
-#   };
-#
-#   # Produce an array that contains every item shared between all the
-#   # passed-in arrays.
-#   _.intersect = function(array) {
-#     var rest = _.rest(arguments);
-#     return _.select(_.uniq(array), function(item) {
-#       return _.all(rest, function(other) {
-#         return _.indexOf(other, item) >= 0;
-#       });
-#     });
-#   };
-#
-#   # Zip together multiple lists into a single array -- elements that share
-#   # an index go together.
-#   _.zip = function() {
-#     var args = _.toArray(arguments);
-#     var length = _.max(_.pluck(args, 'length'));
-#     var results = new Array(length);
-#     for (var i=0; i<length; i++) results[i] = _.pluck(args, String(i));
-#     return results;
-#   };
-#
-#   # If the browser doesn't supply us with indexOf (I'm looking at you, MSIE),
-#   # we need this function. Return the position of the first occurence of an
-#   # item in an array, or -1 if the item is not included in the array.
-#   _.indexOf = function(array, item) {
-#     if (array.indexOf) return array.indexOf(item);
-#     for (var i=0, l=array.length; i<l; i++) if (array[i] === item) return i;
-#     return -1;
-#   };
-#
-#   # Provide JavaScript 1.6's lastIndexOf, delegating to the native function,
-#   # if possible.
-#   _.lastIndexOf = function(array, item) {
-#     if (array.lastIndexOf) return array.lastIndexOf(item);
-#     var i = array.length;
-#     while (i--) if (array[i] === item) return i;
-#     return -1;
-#   };
-#
-#   # Generate an integer Array containing an arithmetic progression. A port of
-#   # the native Python range() function. See:
-#   # http://docs.python.org/library/functions.html#range
-#   _.range = function(start, stop, step) {
-#     var a     = _.toArray(arguments);
-#     var solo  = a.length <= 1;
-#     var start = solo ? 0 : a[0], stop = solo ? a[0] : a[1], step = a[2] || 1;
-#     var len   = Math.ceil((stop - start) / step);
-#     if (len <= 0) return [];
-#     var range = new Array(len);
-#     for (var i = start, idx = 0; true; i += step) {
-#       if ((step > 0 ? i - stop : stop - i) >= 0) return range;
-#       range[idx++] = i;
-#     }
-#   };
+    _.each(obj) value, index, list =>
+      computed: if iterator then iterator.call(context, value, index, list) else value
+      computed >= result.computed and (result: {value: value, computed: computed})
+    result.value
+
+
+  # Return the minimum element (or element-based computation).
+  _.min: obj, iterator, context =>
+    return Math.min.apply(Math, obj) if not iterator and _.isArray(obj)
+    result: {computed: Infinity}
+    _.each(obj) value, index, list =>
+      computed: if iterator then iterator.call(context, value, index, list) else value
+      computed < result.computed and (result: {value: value, computed: computed})
+    result.value
+
+
+  # Sort the object's values by a criteria produced by an iterator.
+  _.sortBy: obj, iterator, context =>
+    _.pluck(((_.map(obj) value, index, list =>
+      {value: value, criteria: iterator.call(context, value, index, list)}
+    ).sort() left, right =>
+      a: left.criteria; b: right.criteria
+      if a < b then -1 else if a > b then 1 else 0
+    ), 'value')
+
+
+  # Use a comparator function to figure out at what index an object should
+  # be inserted so as to maintain order. Uses binary search.
+  _.sortedIndex: array, obj, iterator =>
+    iterator ||= _.identity
+    low: 0; high: array.length
+    while low < high
+      mid: (low + high) >> 1
+      if iterator(array[mid]) < iterator(obj) then low: mid + 1 else high: mid
+    low
+
+
+  # Convert anything iterable into a real, live array.
+  _.toArray: iterable =>
+    return []                   if (!iterable)
+    return iterable.toArray()   if (iterable.toArray)
+    return iterable             if (_.isArray(iterable))
+    return slice.call(iterable) if (_.isArguments(iterable))
+    _.values(iterable)
+
+
+  # Return the number of elements in an object.
+  _.size: obj => _.toArray(obj).length
+
+
+  # -------------------------- Array Functions: ------------------------------
+
+  # Get the first element of an array. Passing "n" will return the first N
+  # values in the array. Aliased as "head". The "guard" check allows it to work
+  # with _.map.
+  _.first: array, n, guard =>
+    if n and not guard then slice.call(array, 0, n) else array[0]
+
+
+  # Returns everything but the first entry of the array. Aliased as "tail".
+  # Especially useful on the arguments object. Passing an "index" will return
+  # the rest of the values in the array from that index onward. The "guard"
+  # check allows it to work with _.map.
+  _.rest: array, index, guard =>
+    slice.call(array, if _.isUndefined(index) or guard then 1 else index)
+
+
+  # Get the last element of an array.
+  _.last: array => array[array.length - 1]
+
+
+  # Trim out all falsy values from an array.
+  _.compact: array => array[i] for i in [0...array.length] when array[i]
+
+
+  # Return a completely flattened version of an array.
+  _.flatten: array =>
+    _.reduce(array, []) memo, value =>
+      return memo.concat(_.flatten(value)) if _.isArray(value)
+      memo.push(value)
+      memo
+
+
+  # Return a version of the array that does not contain the specified value(s).
+  _.without: array =>
+    values: _.rest(arguments)
+    val for val in _.toArray(array) when not _.include(values, val)
+
+
+  # Produce a duplicate-free version of the array. If the array has already
+  # been sorted, you have the option of using a faster algorithm.
+  _.uniq: array, isSorted =>
+    memo: []
+    for el, i in _.toArray(array)
+      memo.push(el) if i is 0 || (if isSorted is true then _.last(memo) isnt el else not _.include(memo, el))
+    memo
+
+
+  # Produce an array that contains every item shared between all the
+  # passed-in arrays.
+  _.intersect: array =>
+    rest: _.rest(arguments)
+    _.select(_.uniq(array)) item =>
+      _.all(rest) other =>
+        _.indexOf(other, item) >= 0
+
+
+  # Zip together multiple lists into a single array -- elements that share
+  # an index go together.
+  _.zip: =>
+    args:       _.toArray(arguments)
+    length:     _.max(_.pluck(args, 'length'))
+    results:    new Array(length)
+    for i in [0...length]
+      results[i]: _.pluck(args, String(i))
+    results
+
+
+  # If the browser doesn't supply us with indexOf (I'm looking at you, MSIE),
+  # we need this function. Return the position of the first occurence of an
+  # item in an array, or -1 if the item is not included in the array.
+  _.indexOf: array, item =>
+    return array.indexOf(item) if array.indexOf
+    i: 0; l: array.length
+    while l - i
+      if array[i] is item then return i else i++
+    -1
+
+
+  # Provide JavaScript 1.6's lastIndexOf, delegating to the native function,
+  # if possible.
+  _.lastIndexOf: array, item =>
+    return array.lastIndexOf(item) if array.lastIndexOf
+    i: array.length
+    while i
+      if array[i] is item then return i else i--
+    -1
+
+
+  # Generate an integer Array containing an arithmetic progression. A port of
+  # the native Python range() function. See:
+  # http://docs.python.org/library/functions.html#range
+  _.range: start, stop, step =>
+    a:        _.toArray(arguments)
+    solo:     a.length <= 1
+    i: start: if solo then 0 else a[0];
+    stop:     if solo then a[0] else a[1];
+    step:     a[2] or 1
+    len:      Math.ceil((stop - start) / step)
+    return [] if len <= 0
+    range:    new Array(len)
+    idx:      0
+    while true
+      return range if (if step > 0 then i - stop else stop - i) >= 0
+      range[idx]: i
+      idx++
+      i+= step
+
 
   # ----------------------- Function Functions: -----------------------------
 
@@ -313,34 +333,36 @@ _.reduceRight: obj, memo, iterator, context =>
   # optionally). Binding with arguments is also known as 'curry'.
   _.bind: func, obj =>
     args: _.rest(arguments, 2)
-    => func.apply(obj or root, args.concat(_.toArray(arguments)))..
-
-#   # Bind all of an object's methods to that object. Useful for ensuring that
-#   # all callbacks defined on an object belong to it.
-#   _.bindAll = function(obj) {
-#     var funcs = _.rest(arguments);
-#     if (funcs.length == 0) funcs = _.functions(obj);
-#     _.each(funcs, function(f) { obj[f] = _.bind(obj[f], obj); });
-#     return obj;
-#   };
-#
-#   # Delays a function for the given number of milliseconds, and then calls
-#   # it with the arguments supplied.
-#   _.delay = function(func, wait) {
-#     var args = _.rest(arguments, 2);
-#     return setTimeout(function(){ return func.apply(func, args); }, wait);
-#   };
+    => func.apply(obj or root, args.concat(_.toArray(arguments)))
+
+
+  # Bind all of an object's methods to that object. Useful for ensuring that
+  # all callbacks defined on an object belong to it.
+  _.bindAll: obj =>
+    funcs: if arguments.length > 1 then _.rest(arguments) else _.functions(obj)
+    _.each(funcs, (f => obj[f]: _.bind(obj[f], obj)))
+    obj
+
+
+  # Delays a function for the given number of milliseconds, and then calls
+  # it with the arguments supplied.
+  _.delay: func, wait =>
+    args: _.rest(arguments, 2)
+    setTimeout((=> func.apply(func, args)), wait)
+
 
   # Defers a function, scheduling it to run after the current call stack has
   # cleared.
   _.defer: func =>
-    _.delay.apply(_, [func, 1].concat(_.rest(arguments))).
+    _.delay.apply(_, [func, 1].concat(_.rest(arguments)))
+
 
   # Returns the first function passed as an argument to the second,
   # allowing you to adjust arguments, run code before and after, and
   # conditionally execute the original function.
   _.wrap: func, wrapper =>
-    => wrapper.apply(wrapper, [func].concat(_.toArray(arguments)))..
+    => wrapper.apply(wrapper, [func].concat(_.toArray(arguments)))
+
 
   # Returns a function that is the composition of a list of functions, each
   # consuming the return value of the function that follows.
@@ -348,40 +370,48 @@ _.reduceRight: obj, memo, iterator, context =>
     funcs: _.toArray(arguments)
     =>
       args: _.toArray(arguments)
-      args: [funcs[i]].apply(this, args) for i in [(funcs.length - 1)..0].
-      args[0]..
-
-#   /* ------------------------- Object Functions: ---------------------------- */
-#
-#   # Retrieve the names of an object's properties.
-#   _.keys = function(obj) {
-#     if(_.isArray(obj)) return _.range(0, obj.length);
-#     var keys = [];
-#     for (var key in obj) if (hasOwnProperty.call(obj, key)) keys.push(key);
-#     return keys;
-#   };
-#
-#   # Retrieve the values of an object's properties.
-#   _.values = function(obj) {
-#     return _.map(obj, _.identity);
-#   };
-#
-#   # Return a sorted list of the function names available in Underscore.
-#   _.functions = function(obj) {
-#     return _.select(_.keys(obj), function(key){ return _.isFunction(obj[key]); }).sort();
-#   };
-#
-#   # Extend a given object with all of the properties in a source object.
-#   _.extend = function(destination, source) {
-#     for (var property in source) destination[property] = source[property];
-#     return destination;
-#   };
-#
-#   # Create a (shallow-cloned) duplicate of an object.
-#   _.clone = function(obj) {
-#     if (_.isArray(obj)) return obj.slice(0);
-#     return _.extend({}, obj);
-#   };
+      for i in [(funcs.length - 1)..0]
+        args: [funcs[i].apply(this, args)]
+      args[0]
+
+
+  # ------------------------- Object Functions: ----------------------------
+
+  # Retrieve the names of an object's properties.
+  _.keys: obj =>
+    return _.range(0, obj.length) if _.isArray(obj)
+    key for val, key in obj
+
+
+  # Retrieve the values of an object's properties.
+  _.values: obj =>
+    _.map(obj, _.identity)
+
+
+  # Return a sorted list of the function names available in Underscore.
+  _.functions: obj =>
+    _.select(_.keys(obj), key => _.isFunction(obj[key])).sort()
+
+
+  # Extend a given object with all of the properties in a source object.
+  _.extend: destination, source =>
+    for val, key in source
+      destination[key]: val
+    destination
+
+
+  # Create a (shallow-cloned) duplicate of an object.
+  _.clone: obj =>
+    return obj.slice(0) if _.isArray(obj)
+    _.extend({}, obj)
+
+
+  # Invokes interceptor with the obj, and then returns obj.
+  # The primary purpose of this method is to "tap into" a method chain, in order to perform operations on intermediate results within the chain.
+  _.tap: obj, interceptor =>
+    interceptor(obj)
+    obj
+
 
   # Perform a deep comparison to check if two objects are equal.
   _.isEqual: a, b =>
@@ -402,10 +432,10 @@ _.reduceRight: obj, memo, iterator, context =>
     return true if _.isNaN(a) and _.isNaN(b)
     # Compare regular expressions.
     if _.isRegExp(a) and _.isRegExp(b)
-      return a.source     is b.source and \
-             a.global     is b.global and \
-             a.ignoreCase is b.ignoreCase and \
-             a.multiline  is b.multiline.
+      return a.source     is b.source and
+             a.global     is b.global and
+             a.ignoreCase is b.ignoreCase and
+             a.multiline  is b.multiline
     # If a is not an object by this point, we can't handle it.
     return false if atype isnt 'object'
     # Check for different array lengths before comparing contents.
@@ -416,42 +446,57 @@ _.reduceRight: obj, memo, iterator, context =>
     return false if aKeys.length isnt bKeys.length
     # Recursive comparison of contents.
     # for (var key in a) if (!_.isEqual(a[key], b[key])) return false;
-    return true.
+    return true
+
 
   # Is a given array or object empty?
-  _.isEmpty: obj => _.keys(obj).length is 0.
+  _.isEmpty:      obj => _.keys(obj).length is 0
+
 
   # Is a given value a DOM element?
-  _.isElement: obj => !!(obj and obj.nodeType is 1).
+  _.isElement:    obj => obj and obj.nodeType is 1
+
+
+  # Is a given value an array?
+  _.isArray:      obj => !!(obj and obj.concat and obj.unshift)
+
 
   # Is a given variable an arguments object?
-  _.isArguments: obj => obj and _.isNumber(obj.length) and !_.isArray(obj) and !propertyIsEnumerable.call(obj, 'length').
+  _.isArguments:  obj => obj and _.isNumber(obj.length) and !_.isArray(obj) and !propertyIsEnumerable.call(obj, 'length')
+
+
+  # Is the given value a function?
+  _.isFunction:   obj => !!(obj and obj.constructor and obj.call and obj.apply)
+
+
+  # Is the given value a string?
+  _.isString:     obj => !!(obj is '' or (obj and obj.charCodeAt and obj.substr))
+
+
+  # Is a given value a number?
+  _.isNumber:     obj => toString.call(obj) is '[object Number]'
+
+
+  # Is a given value a Date?
+  _.isDate:       obj => !!(obj and obj.getTimezoneOffset and obj.setUTCFullYear)
+
+
+  # Is the given value a regular expression?
+  _.isRegExp:     obj => !!(obj and obj.exec and (obj.ignoreCase or obj.ignoreCase is false))
+
 
   # Is the given value NaN -- this one is interesting. NaN != NaN, and
   # isNaN(undefined) == true, so we make sure it's a number first.
-  _.isNaN: obj => _.isNumber(obj) and isNaN(obj).
+  _.isNaN:        obj => _.isNumber(obj) and window.isNaN(obj)
+
 
   # Is a given value equal to null?
-  _.isNull: obj => obj is null.
+  _.isNull:       obj => obj is null
+
 
   # Is a given variable undefined?
-  _.isUndefined: obj => typeof obj is 'undefined'.
+  _.isUndefined:  obj => typeof obj is 'undefined'
 
-  # Invokes interceptor with the obj, and then returns obj.
-  # The primary purpose of this method is to "tap into" a method chain, in order to perform operations on intermediate results within the chain.
-  _.tap: obj, interceptor =>
-    interceptor(obj)
-    obj.
-
-#   # Define the isArray, isDate, isFunction, isNumber, isRegExp, and isString
-#   # functions based on their toString identifiers.
-#   var types = ['Array', 'Date', 'Function', 'Number', 'RegExp', 'String'];
-#   for (var i=0, l=types.length; i<l; i++) {
-#     (function() {
-#       var identifier = '[object ' + types[i] + ']';
-#       _['is' + types[i]] = function(obj) { return toString.call(obj) == identifier; };
-#     })();
-#   }
 
   # -------------------------- Utility Functions: --------------------------
 
@@ -459,39 +504,41 @@ _.reduceRight: obj, memo, iterator, context =>
   # previous owner. Returns a reference to the Underscore object.
   _.noConflict: =>
     root._: previousUnderscore
-    this.
+    this
+
 
   # Keep the identity function around for default iterators.
-  _.identity: value => value.
+  _.identity: value => value
+
 
   # Break out of the middle of an iteration.
-  _.breakLoop: => throw breaker.
-
-#   # Generate a unique integer id (unique within the entire client session).
-#   # Useful for temporary DOM ids.
-#   var idCounter = 0;
-#   _.uniqueId = function(prefix) {
-#     var id = idCounter++;
-#     return prefix ? prefix + id : id;
-#   };
-#
-#   # JavaScript templating a-la ERB, pilfered from John Resig's
-#   # "Secrets of the JavaScript Ninja", page 83.
-#   _.template = function(str, data) {
-#     var fn = new Function('obj',
-#       'var p=[],print=function(){p.push.apply(p,arguments);};' +
-#       'with(obj){p.push(\'' +
-#       str
-#         .replace(/[\r\t\n]/g, " ")
-#         .split("<%").join("\t")
-#         .replace(/((^|%>)[^\t]*)'/g, "$1\r")
-#         .replace(/\t=(.*?)%>/g, "',$1,'")
-#         .split("\t").join("');")
-#         .split("%>").join("p.push('")
-#         .split("\r").join("\\'")
-#     + "');}return p.join('');");
-#     return data ? fn(data) : fn;
-#   };
+  _.breakLoop: => throw breaker
+
+
+  # Generate a unique integer id (unique within the entire client session).
+  # Useful for temporary DOM ids.
+  idCounter: 0
+  _.uniqueId: prefix =>
+    (prefix or '') + idCounter++
+
+
+  # JavaScript templating a-la ERB, pilfered from John Resig's
+  # "Secrets of the JavaScript Ninja", page 83.
+  _.template: str, data =>
+    `var fn = new Function('obj',
+      'var p=[],print=function(){p.push.apply(p,arguments);};' +
+      'with(obj){p.push(\'' +
+      str.
+        replace(/[\r\t\n]/g, " ").
+        split("<%").join("\t").
+        replace(/((^|%>)[^\t]*)'/g, "$1\r").
+        replace(/\t=(.*?)%>/g, "',$1,'").
+        split("\t").join("');").
+        split("%>").join("p.push('").
+        split("\r").join("\\'") +
+      "');}return p.join('');")`
+    if data then fn(data) else fn
+
 
   # ------------------------------- Aliases ----------------------------------
 
@@ -505,48 +552,42 @@ _.reduceRight: obj, memo, iterator, context =>
   _.tail:    _.rest
   _.methods: _.functions
 
-#   /*------------------------ Setup the OOP Wrapper: --------------------------*/
-#
-#   # Helper function to continue chaining intermediate results.
-#   var result = function(obj, chain) {
-#     return chain ? _(obj).chain() : obj;
-#   };
-#
-#   # Add all of the Underscore functions to the wrapper object.
-#   _.each(_.functions(_), function(name) {
-#     var method = _[name];
-#     wrapper.prototype[name] = function() {
-#       unshift.call(arguments, this._wrapped);
-#       return result(method.apply(_, arguments), this._chain);
-#     };
-#   });
-#
-#   # Add all mutator Array functions to the wrapper.
-#   _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
-#     var method = Array.prototype[name];
-#     wrapper.prototype[name] = function() {
-#       method.apply(this._wrapped, arguments);
-#       return result(this._wrapped, this._chain);
-#     };
-#   });
-#
-#   # Add all accessor Array functions to the wrapper.
-#   _.each(['concat', 'join', 'slice'], function(name) {
-#     var method = Array.prototype[name];
-#     wrapper.prototype[name] = function() {
-#       return result(method.apply(this._wrapped, arguments), this._chain);
-#     };
-#   });
-#
-#   # Start chaining a wrapped Underscore object.
-#   wrapper.prototype.chain = function() {
-#     this._chain = true;
-#     return this;
-#   };
-#
-#   # Extracts the result from a wrapped and chained object.
-#   wrapper.prototype.value = function() {
-#     return this._wrapped;
-#   };
-#
-# ()
+
+  #   /*------------------------ Setup the OOP Wrapper: --------------------------*/
+
+  # Helper function to continue chaining intermediate results.
+  result: obj, chain =>
+    if chain then _(obj).chain() else obj
+
+
+  # Add all of the Underscore functions to the wrapper object.
+  _.each(_.functions(_)) name =>
+    method: _[name]
+    wrapper.prototype[name]: =>
+      unshift.call(arguments, this._wrapped)
+      result(method.apply(_, arguments), this._chain)
+
+
+  # Add all mutator Array functions to the wrapper.
+  _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift']) name =>
+    method: Array.prototype[name]
+    wrapper.prototype[name]: =>
+      method.apply(this._wrapped, arguments)
+      result(this._wrapped, this._chain)
+
+
+  # Add all accessor Array functions to the wrapper.
+  _.each(['concat', 'join', 'slice']) name =>
+    method: Array.prototype[name]
+    wrapper.prototype[name]: =>
+      result(method.apply(this._wrapped, arguments), this._chain)
+
+
+  # Start chaining a wrapped Underscore object.
+  wrapper.prototype.chain: =>
+    this._chain: true
+    this
+
+
+  # Extracts the result from a wrapped and chained object.
+  wrapper.prototype.value: => this._wrapped