2 -- Copyright (C) 2008-2010 Matthew Wild
3 -- Copyright (C) 2008-2010 Waqas Hussain
5 -- This project is MIT/X11 licensed. Please see the
6 -- COPYING file in the source package for more information.
9 local ipairs, pairs, setmetatable, next, tostring =
10 ipairs, pairs, setmetatable, next, tostring;
11 local t_concat = table.concat;
16 function set_mt.__call(set, _, k)
17 return next(set._items, k);
19 function set_mt.__add(set1, set2)
20 return _M.union(set1, set2);
22 function set_mt.__sub(set1, set2)
23 return _M.difference(set1, set2);
25 function set_mt.__div(set, func)
26 local new_set = _M.new();
27 local items, new_items = set._items, new_set._items;
28 for item in pairs(items) do
29 local new_item = func(item);
30 if new_item ~= nil then
31 new_items[new_item] = true;
36 function set_mt.__eq(set1, set2)
37 set1, set2 = set1._items, set2._items;
38 for item in pairs(set1) do
39 if not set2[item] then
44 for item in pairs(set2) do
45 if not set1[item] then
52 function set_mt.__tostring(set)
53 local s, items = { }, set._items;
54 for item in pairs(items) do
55 s[#s+1] = tostring(item);
57 return t_concat(s, ", ");
61 function items_mt.__call(items, _, k)
62 return next(items, k);
66 local items = setmetatable({}, items_mt);
67 local set = { _items = items };
69 -- We access the set through an upvalue in these methods, so ignore 'self' being unused
70 --luacheck: ignore 212/self
72 function set:add(item)
76 function set:contains(item)
84 function set:remove(item)
88 function set:add_list(item_list)
90 for _, item in ipairs(item_list) do
96 function set:include(otherset)
97 for item in otherset do
102 function set:exclude(otherset)
103 for item in otherset do
109 return not next(items);
116 return setmetatable(set, set_mt);
119 function union(set1, set2)
121 local items = set._items;
123 for item in pairs(set1._items) do
127 for item in pairs(set2._items) do
134 function difference(set1, set2)
136 local items = set._items;
138 for item in pairs(set1._items) do
139 items[item] = (not set2._items[item]) or nil;
145 function intersection(set1, set2)
147 local items = set._items;
149 set1, set2 = set1._items, set2._items;
151 for item in pairs(set1) do
152 items[item] = (not not set2[item]) or nil;
158 function xor(set1, set2)
159 return union(set1, set2) - intersection(set1, set2);