Mirrors/lodash
1
0
Fork 0
mirror of https://github.com/whoisclebs/lodash.git synced 2026-02-03 16:47:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

more and more and more docs ... almost there

Browse Source
This commit is contained in:
Jeremy Ashkenas
2009-10-26 23:09:56 -04:00
parent 25d3177bd7
commit 9a881c70cb
3 changed files with 329 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
underscore.js
View File

@@ -227,17 +227,21 @@ window._ = {
// 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, sorted) {
uniq : function(array, isSorted) {
return _.inject(array, [], function(memo, el, i) {
if (0 == i || (sorted ? _.last(memo) != el : !_.include(memo, el))) memo.push(el);
if (0 == i || (isSorted ? _.last(memo) != el : !_.include(memo, el))) memo.push(el);
return memo;
});
},
// Produce an array that contains every item shared between two given arrays.
intersect : function(array1, array2) {
return _.select(_.uniq(array1), function(item1) {
return _.detect(array2, function(item2) { return item1 === item2; });
// Produce an array that contains every item shared between all the
// passed-in arrays.
intersect : function(array) {
var rest = _.toArray(arguments).slice(1);
return _.select(_.uniq(array), function(item1) {
return _.all(rest, function(other) {
return _.detect(other, function(item2){ return item1 === item2; });
});
});
},