javascript小结20150511

栈

var colors = new Array();
   var count = colors.push("red","green");
   alert(count);
   var count = colors.push("black");
   alert(count);
   alert(colors.pop());

队列

var colors = new Array();
   var count = colors.push("red","green");
   alert(count);
   var count = colors.push("black");
   alert(count);
   alert(colors.shift());

var colors = new Array();
   var count = colors.unshift("red","green");
   alert(count);
   var count = colors.unshift("black");
   alert(count);
   alert(colors.pop());

重新排序

var value = [1,2,3,4,5]

value.reverse();

[5,4,3,2,1]

迭代方法

every()

filter()

forEach()

map()

some()

var numbers = [1,2,3,4,5,4,3,2,1]

var filterResult = numbers,filter(function(item,index,array){

return (item>2);

});