kotovalexarian-likes-github/jashkenas--coffeescript
1
0
Fork 0
mirror of https://github.com/jashkenas/coffeescript.git synced 2022-11-09 12:23:24 -05:00
Code Releases Activity

more underscore

Browse source
This commit is contained in:
Jeremy Ashkenas 2010-01-04 01:43:45 -05:00
parent 94bc7c1f92
commit 5efaff506c
1 changed files with 7 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

15
examples/underscore.coffee
View file

@ -136,12 +136,11 @@ _.include: obj, target =>
# Invoke a method with arguments on every item in a collection. # Invoke a method with arguments on every item in a collection.
_.invoke: obj, method => _.invoke: obj, method =>
args: _.rest(arguments, 2) args: _.rest(arguments, 2)
_.map(obj) value => (if method then val[method] else val).apply(val, args) for val in obj
(if method then value[method] else value).apply(value, args)
# Convenience version of a common use case of map: fetching a property. # Convenience version of a common use case of map: fetching a property.
_.pluck: obj, key => _.pluck: obj, key =>
_.map(obj, (value => value[key])) _.map(obj, (val => val[key]))
# Return the maximum item or (item-based computation). # Return the maximum item or (item-based computation).
_.max: obj, iterator, context => _.max: obj, iterator, context =>
@ -222,15 +221,15 @@ _.flatten: array =>
# Return a version of the array that does not contain the specified value(s). # Return a version of the array that does not contain the specified value(s).
_.without: array => _.without: array =>
values: _.rest(arguments) values: _.rest(arguments)
_.select(array, (value => not _.include(values, value))) val for val in _.toArray(array) when not _.include(values, val)
# Produce a duplicate-free version of the array. If the array has already # Produce a duplicate-free version of the array. If the array has already
# been sorted, you have the option of using a faster algorithm. # been sorted, you have the option of using a faster algorithm.
_.uniq: array, isSorted => _.uniq: array, isSorted =>
_.reduce(array, []) memo, el, i => memo: []
if (i is 0 || (if isSorted is true then _.last(memo) isnt el else not _.include(memo, el))) for el, i in _.toArray(array)
memo.push(el) memo.push(el) if i is 0 || (if isSorted is true then _.last(memo) isnt el else not _.include(memo, el))
memo memo
# Produce an array that contains every item shared between all the # Produce an array that contains every item shared between all the
# passed-in arrays. # passed-in arrays.