projects
/
prosody.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
util.sql: Fix log level of debug message
[prosody.git]
/
util
/
set.lua
diff --git
a/util/set.lua
b/util/set.lua
index 050446ec3f3aca668bd70933e7d5802f6651b4cf..4be39c1702da817cb2e2435c403233c9cad2240b 100644
(file)
--- a/
util/set.lua
+++ b/
util/set.lua
@@
-1,7
+1,7
@@
-- Prosody IM
-- Copyright (C) 2008-2010 Matthew Wild
-- Copyright (C) 2008-2010 Waqas Hussain
-- Prosody IM
-- Copyright (C) 2008-2010 Matthew Wild
-- Copyright (C) 2008-2010 Waqas Hussain
---
+--
-- This project is MIT/X11 licensed. Please see the
-- COPYING file in the source package for more information.
--
-- This project is MIT/X11 licensed. Please see the
-- COPYING file in the source package for more information.
--
@@
-23,29
+23,30
@@
function set_mt.__sub(set1, set2)
return _M.difference(set1, set2);
end
function set_mt.__div(set, func)
return _M.difference(set1, set2);
end
function set_mt.__div(set, func)
- local new_set
, new_items
= _M.new();
+ local new_set = _M.new();
local items, new_items = set._items, new_set._items;
for item in pairs(items) do
local items, new_items = set._items, new_set._items;
for item in pairs(items) do
- if func(item) then
- new_items[item] = true;
+ local new_item = func(item);
+ if new_item ~= nil then
+ new_items[new_item] = true;
end
end
return new_set;
end
function set_mt.__eq(set1, set2)
end
end
return new_set;
end
function set_mt.__eq(set1, set2)
-
local
set1, set2 = set1._items, set2._items;
+ set1, set2 = set1._items, set2._items;
for item in pairs(set1) do
if not set2[item] then
return false;
end
end
for item in pairs(set1) do
if not set2[item] then
return false;
end
end
-
+
for item in pairs(set2) do
if not set1[item] then
return false;
end
end
for item in pairs(set2) do
if not set1[item] then
return false;
end
end
-
+
return true;
end
function set_mt.__tostring(set)
return true;
end
function set_mt.__tostring(set)
@@
-64,58
+65,61
@@
end
function new(list)
local items = setmetatable({}, items_mt);
local set = { _items = items };
function new(list)
local items = setmetatable({}, items_mt);
local set = { _items = items };
-
+
+ -- We access the set through an upvalue in these methods, so ignore 'self' being unused
+ --luacheck: ignore 212/self
+
function set:add(item)
items[item] = true;
end
function set:add(item)
items[item] = true;
end
-
+
function set:contains(item)
return items[item];
end
function set:contains(item)
return items[item];
end
-
+
function set:items()
function set:items()
- return items;
+ return
next,
items;
end
end
-
+
function set:remove(item)
items[item] = nil;
end
function set:remove(item)
items[item] = nil;
end
-
- function set:add_list(list)
- if list then
- for _, item in ipairs(list) do
+
+ function set:add_list(
item_
list)
+ if
item_
list then
+ for _, item in ipairs(
item_
list) do
items[item] = true;
end
end
end
items[item] = true;
end
end
end
-
+
function set:include(otherset)
function set:include(otherset)
- for item in
pairs(otherset)
do
+ for item in
otherset
do
items[item] = true;
end
end
function set:exclude(otherset)
items[item] = true;
end
end
function set:exclude(otherset)
- for item in
pairs(otherset)
do
+ for item in
otherset
do
items[item] = nil;
end
end
items[item] = nil;
end
end
-
+
function set:empty()
return not next(items);
end
function set:empty()
return not next(items);
end
-
+
if list then
set:add_list(list);
end
if list then
set:add_list(list);
end
-
+
return setmetatable(set, set_mt);
end
function union(set1, set2)
local set = new();
local items = set._items;
return setmetatable(set, set_mt);
end
function union(set1, set2)
local set = new();
local items = set._items;
-
+
for item in pairs(set1._items) do
items[item] = true;
end
for item in pairs(set1._items) do
items[item] = true;
end
@@
-123,14
+127,14
@@
function union(set1, set2)
for item in pairs(set2._items) do
items[item] = true;
end
for item in pairs(set2._items) do
items[item] = true;
end
-
+
return set;
end
function difference(set1, set2)
local set = new();
local items = set._items;
return set;
end
function difference(set1, set2)
local set = new();
local items = set._items;
-
+
for item in pairs(set1._items) do
items[item] = (not set2._items[item]) or nil;
end
for item in pairs(set1._items) do
items[item] = (not set2._items[item]) or nil;
end
@@
-141,13
+145,13
@@
end
function intersection(set1, set2)
local set = new();
local items = set._items;
function intersection(set1, set2)
local set = new();
local items = set._items;
-
+
set1, set2 = set1._items, set2._items;
set1, set2 = set1._items, set2._items;
-
+
for item in pairs(set1) do
items[item] = (not not set2[item]) or nil;
end
for item in pairs(set1) do
items[item] = (not not set2[item]) or nil;
end
-
+
return set;
end
return set;
end