1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
|
--
-- This file is part of LEM, a Lua Event Machine.
-- Copyright 2013 Emil Renner Berthing
--
-- LEM is free software: you can redistribute it and/or modify it
-- under the terms of the GNU Lesser General Public License as
-- published by the Free Software Foundation, either version 3 of
-- the License, or (at your option) any later version.
--
-- LEM is distributed in the hope that it will be useful, but
-- WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU Lesser General Public License for more details.
--
-- You should have received a copy of the GNU Lesser General Public
-- License along with LEM. If not, see <http://www.gnu.org/licenses/>.
--
local utils = require 'lem.utils'
local M = {}
local Queue = {}
Queue.__index = Queue
M.Queue = Queue
local remove = table.remove
local thisthread, suspend, resume =
utils.thisthread, utils.suspend, utils.resume
function Queue:put(v)
local n = self.n + 1
self.n = n
if n >= 1 then
self[n] = v
else
resume(remove(self, 1), v)
end
end
function Queue:signal(...)
local n = self.n
if n < 0 then
for i = 1, -n do
resume(self[i], ...)
self[i] = nil
end
self.n = 0
end
end
function Queue:get()
local n = self.n - 1
self.n = n
if n >= 0 then
return remove(self, 1)
end
self[-n] = thisthread()
return suspend()
end
function Queue:reset()
self:signal(nil, 'reset')
for i = self.n, 1, -1 do
self[i] = nil
end
self.n = 0
end
local get = Queue.get
function Queue:consume()
return get, self
end
function Queue:empty()
return self.n <= 0
end
function M.new()
return setmetatable({ n = 0 }, Queue)
end
return M
-- vim: ts=2 sw=2 noet:
|
