JavaScript 栈实现

/*
    栈的特点是后进先出
 */

var Stack = function(){
    this.count = 0;
    this.storage = {};

    /*
       将一个元素推入栈顶
     */
    this.push = function (value) {
        this.storage[this.count] = value;
        this.count++;
    },

     /*
        移除栈顶元素，并返回被移除的元素
      */
    this.pop = function () {
        if(this.count == 0){
            return undefined;
        }
        this.count--;
        var result = this.storage[this.count];
        delete  this.storage[this.count];
        return result;
    },

    /*
        返回栈顶元素
     */
    this.peek =  function () {
        return this.storage[this.count-1];
    },

    /*
        返回栈中元素的个数
     */
    this.size =  function () {
        return this.count;
    },

    /*
        获取栈中所有元素
     */
    this.getData =  function () {
        return this.storage;
    }
}