Stack Class / Queue Class

class "Queue" {

    count=0;
    isEmpty=true;
    _queue={};
    Queue=function(self)
    end
}

function Queue:clear()
    self._queue={}
end

function Queue:contains()
end

function Queue:enqueue(value)
    table.insert(self._queue,value)
    self.isEmpty=false

end

function Queue:dequeue()
    local val=table.remove(self._queue,1)
    if #self._queue==0 then
        self.isEmpty=true
    end
    return val
end

function Queue:peek()
    return self._queue[1]
end

function Queue:last()
    return self._queue[#self._queue]
end

function Queue:dequeueLast()
    local val=table.remove(self._queue)
    if #self._queue==0 then
        self.isEmpty=true
    end
    return val
end


-----------------------------------------------------------------------------------


class "Stack" {

    stack={};
    size=0;
    isEmpty=true;
    Stack=function(self)
        self.size=#self.stack
    end

}

function Stack:push(value)
    table.insert(self.stack,value)
    self.isEmpty=false
    self.size=#self.stack
end

function Stack:pop()
    local v=table.remove(self.stack,#self.stack)
    if #self.stack==0 then
        self.isEmpty=true
    end
    self.size=#self.stack
    return v
end

function Stack:peek()
    return self.stack[#self.stack]
end

function Stack:clear()
    self.stack={}
end

function Stack:contains(value)
    local found=false
    for i=1,#self.stack do
        if self.stack[i]==value then
            found=true
        end
    end
    return found
end