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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
|
--[[
A library providing advanced queue support and better optimizations for queue-based operations.
]]
_libs = _libs or {}
require('tables')
local table = _libs.tables
local queue = {}
_libs.queues = queue
_raw = _raw or {}
_raw.table = _raw.table or {}
_meta = _meta or {}
_meta.Q = {}
_meta.Q.__index = function(q, k)
if type(k) == 'number' then
if k < 0 then
return rawget(q.data, q.back - k + 1)
else
return rawget(q.data, q.front + k - 1)
end
end
return rawget(queue, k) or rawget(table, k)
end
_meta.Q.__newindex = function(q, k, v)
error('Cannot assign queue value:', k)
end
_meta.Q.__class = 'Queue'
function Q(t)
if class(t) == 'Set' then
local q = Q{}
for el in pairs(t) do
q:push(el)
end
return q
end
local q = {}
q.data = setmetatable(t, nil)
q.front = 1
if class(t) == 'List' then
q.back = t.n + 1
else
q.back = #t + 1
end
return setmetatable(q, _meta.Q)
end
function queue.empty(q)
return q.front == q.back
end
function queue.length(q)
return q.back - q.front
end
function queue.push(q, el)
rawset(q.data, q.back, el)
q.back = q.back + 1
return q
end
function queue.pop(q)
if q:empty() then
return nil
end
local res = rawget(q.data, q.front)
rawset(q.data, q.front, nil)
q.front = q.front + 1
return res
end
function queue.insert(q, i, el)
q.back = q.back + 1
table.insert(q.data, q.front + i - 1, el)
return q
end
function queue.remove(q, i)
q.back = q.back - 1
table.remove(q.data, q.front + i - 1)
return q
end
function queue.it(q)
local key = q.front - 1
return function()
key = key + 1
return rawget(q.data, key), key
end
end
function queue.clear(q)
q.data = {}
q.front = q.back
return q
end
function queue.copy(q)
local res = {}
for key = q.front, q.back do
rawset(res, key, rawget(q.data, key))
end
res.front = q.front
res.back = q.back
return setmetatable(res, _meta.Q)
end
function queue.reassign(q, qn)
q:clear()
for key = qn.front, qn.back do
rawset(q, key, rawget(qn.data, key))
end
q.front = qn.front
q.back = qn.back
return q
end
function queue.sort(q, ...)
_raw.table.sort(q.data, ...)
return q
end
function queue.tostring(q)
local str = '|'
for key = q.front, q.back - 1 do
if key > q.front then
str = str .. ' < '
end
str = str .. tostring(rawget(q.data, key))
end
return str .. '|'
end
_meta.Q.__tostring = queue.tostring
--[[
Copyright © 2013, Windower
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution.
* Neither the name of Windower nor the names of its contributors may be used to endorse or promote products derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL Windower BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
]]
|
