Lua实现的栈、队列

基于quick cocos2d-x2.2.5的API，写的一个栈，队列。满足游戏开发中的需求。

避免重复造车轮~（简单测试。留着自己用。不确定是否还存在bug）

栈Stack：

--
-- Date: 2014-11-19 15:29:02
--
local Stack = class("Stack")

function Stack:ctor()
    self.stack_table = {}
end

function Stack:push(element)
    local size = self:size()
    self.stack_table[size + 1] = element
end

function Stack:pop()
    local size = self:size()
    if self:isEmpty() then
        printError("Error: Stack is empty!")
        return
    end
    return table.remove(self.stack_table,size)
end

function Stack:top()
    local size = self:size()
    if self:isEmpty() then
        printError("Error: Stack is empty!")
        return
    end
    return self.stack_table[size]
end

function Stack:isEmpty()
    local size = self:size()
    if size == 0 then
        return true
    end
    return false
end

function Stack:size()
    return table.nums(self.stack_table) or 0
end

function Stack:clear()
    -- body
    self.stack_table = nil
    self.stack_table = {}
end

function Stack:printElement()
    local size = self:size()

    if self:isEmpty() then
        printError("Error: Stack is empty!")
        return
    end

    local str = "{"..self.stack_table[size]
    size = size - 1
    while size > 0 do
        str = str..", "..self.stack_table[size]
        size = size - 1
    end
    str = str.."}"
    print(str)
end


return Stack

队列Queue:

--
-- Date: 2014-11-19 16:51:19
--
local Queue = class("Queue")

function Queue:ctor(capacity)
    self.capacity = capacity
    self.queue = {}
    self.size_ = 0
    self.head = -1
    self.rear = -1
end

function Queue:enQueue(element)
    if self.size_ == 0 then
        self.head = 0
        self.rear = 1
        self.size_ = 1
        self.queue[self.rear] = element
    else
        local temp = (self.rear + 1) % self.capacity
        if temp == self.head then
            printError("Error: capacity is full.")
            return 
        else
            self.rear = temp
        end

        self.queue[self.rear] = element
        self.size_ = self.size_ + 1
    end

end

function Queue:deQueue()
    if self:isEmpty() then
        printError("Error: The Queue is empty.")
        return
    end
    self.size_ = self.size_ - 1
    self.head = (self.head + 1) % self.capacity
    local value = self.queue[self.head]
    return value
end

function Queue:clear()
    self.queue = nil
    self.queue = {}
    self.size_ = 0
    self.head = -1
    self.rear = -1
end

function Queue:isEmpty()
    if self:size() == 0 then
        return true
    end
    return false
end

function Queue:size()
    return self.size_
end

function Queue:printElement()
    local h = self.head
    local r = self.rear
    local str = nil
    local first_flag = true
    while h ~= r do
        if first_flag == true then
            str = "{"..self.queue[h]
            h = (h + 1) % self.capacity
            first_flag = false
        else
            str = str..","..self.queue[h]
            h = (h + 1) % self.capacity
        end
    end
    str = str..","..self.queue[r].."}"
    print(str)
end

return Queue

 ======================================================

--调用过程：
local MainScene = class("MainScene", function()
    return display.newScene("MainScene")
end)

local CURRENT_MODULE_NAME = ...
local Queue = import("../datastruct/Queue", CURRENT_MODULE_NAME)

function MainScene:ctor()
    local queue = Queue.new(5)
    queue:enQueue("a")
    queue:deQueue()
    queue:enQueue("b")
    queue:enQueue("c")
    queue:enQueue("d")
    queue:deQueue()
    queue:deQueue()
    queue:enQueue("e")
    queue:enQueue("f")
    queue:enQueue("g")
    queue:deQueue()
    queue:enQueue("h")
    queue:enQueue("i")
    queue:printElement()
end

function MainScene:onEnter()
end

function MainScene:onExit()
end

return MainScene

over~