Skip to content

Instantly share code, notes, and snippets.

@dreampuf
Created May 21, 2011 13:44
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save dreampuf/984534 to your computer and use it in GitHub Desktop.
Save dreampuf/984534 to your computer and use it in GitHub Desktop.
函数化Javascript
var sgs = sgs || {};
(function(sgs){
var srd = Math.random,
slice = Array.prototype.slice,
copy = function(ary){ return slice.apply(ary); };
sgs.func = sgs.func || {};
sgs.func.rint = function(max) {
max = max || 100;
return srd() * max | 0;
};
sgs.func.shuffle = (function(rint) { return function(list) {
var llen = list.length,
newlist = [],
cur = 0;
for(; cur < llen; cur++) {
newlist.splice(rint(cur+1), 0, list[cur]);
}
return newlist;
} })(sgs.func.rint);
sgs.func.choice = (function(rint) { return function(list, num) {
var llen = list.length,
choiced = []
num = num || 1,
tmp = -1;
if(llen < num) {
throw new Error("choice num can't more then list length");
}
if(num * 2 <= llen) {
while(choiced.length < num) {
tmp = rint(llen);
if(choiced.indexOf(list[tmp]) == -1) {
choiced.push(list[tmp]);
}
}
} else {
choiced = sgs.func.shuffle(list);
choiced = choiced.splice(llen - num);
}
return choiced;
} })(sgs.func.rint);
sgs.func.range = function(num, func) {
if(func) {
var i = 0;
while(i < num) {
if(func(i++) == false) {
return ;
}
}
} else {
var i = 0, slist = [];
for(; i < num; i++) {
slist.push(i);
}
return slist;
};
};
sgs.func.each = function(list, func) {
var llen = list.length,
cur = 0;
for(;cur < llen; cur++) {
if(func(cur, list[cur], llen) == false)
return;
}
};
sgs.func.format = function(source) {
var args = copy(arguments).splice(1);
return source.replace(/\{(\d+)\}/gm, function(m, i) {
return args[i];
});
};
sgs.func.filter = (function(each){ return function(list, func) {
var result = [];
each(list, function(n, i) {
if(func(i)) {
result.push(i);
}
});
return result;
} })(sgs.func.each);
sgs.func.exclude = (function(each){ return function(list, func) {
var result = [];
each(list, function(n, i) {
if(!func(i)) {
result.push(i);
}
});
return result;
} })(sgs.func.each);
sgs.func.max = (function(each){ return function(list, func) {
var max;
each(list, function(n, i) {
i = func ? func(i) : i;
if(!max || max < i) {
max = i;
}
});
return max;
} })(sgs.func.each);
sgs.func.min = (function(each){ return function(list, func) {
var min;
each(list, function(n, i) {
i = func ? func(i) : i;
if(!min || min > i) {
min = i;
}
});
return min;
} })(sgs.func.each);
sgs.func.zip = (function(each, range, max){ return function() {
var alen = arguments.length,
args = slice.call(arguments, 0, alen - 1),
func = slice.call(arguments, alen - 1)[0],
maxlen = max(args, function(i) { return i.length; }),
tmpargs,
result = [];
range(maxlen, function(n) {
tmpargs = [];
each(args, function(nn, ii) {
tmpargs.push(args[nn][n]);
});
tmpargs.push(n);
result.push(func.apply({}, tmpargs));
});
return result;
} })(sgs.func.each, sgs.func.range, sgs.func.max);
sgs.func.map = (function(each){ return function(list, func) {
var result = [];
each(list, function(n, i) {
result.push(func(i, n));
});
return result;
} })(sgs.func.each);
sgs.func.and = (function(each){ return function(list_a, list_b, func) {
var result = [];
each(list_a, function(n, i) {
each(list_b, function(nn, ii) {
if(func && func(i, ii) ||
i == ii) {
result.push(i);
}
});
});
return result;
} })(sgs.func.each);
sgs.func.or = (function(each){ return function(list_a, list_b, func) {
var result = [];
each(list_a.concat(list_b), function(n, i) {
if(result.indexOf(i) == -1) {
result.push(i);
}
});
return result;
} })(sgs.func.each);
sgs.func.sub = (function(each){ return function(list_a, list_b, func) {
var result = [];
each(list_a, function(n, i) {
if(func && func(i) ||
list_b.indexOf(i) == -1) {
result.push(i);
}
});
return result;
} })(sgs.func.each);
})(window.sgs);
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment