<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="ja">
	<id>https://bsd.neuroinf.jp/w/index.php?action=history&amp;feed=atom&amp;title=%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB%3ASet</id>
	<title>モジュール:Set - 版の履歴</title>
	<link rel="self" type="application/atom+xml" href="https://bsd.neuroinf.jp/w/index.php?action=history&amp;feed=atom&amp;title=%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB%3ASet"/>
	<link rel="alternate" type="text/html" href="https://bsd.neuroinf.jp/w/index.php?title=%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB:Set&amp;action=history"/>
	<updated>2026-04-17T10:38:28Z</updated>
	<subtitle>このウィキのこのページに関する変更履歴</subtitle>
	<generator>MediaWiki 1.43.8</generator>
	<entry>
		<id>https://bsd.neuroinf.jp/w/index.php?title=%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB:Set&amp;diff=44220&amp;oldid=prev</id>
		<title>WikiSysop: 1版 をインポートしました</title>
		<link rel="alternate" type="text/html" href="https://bsd.neuroinf.jp/w/index.php?title=%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB:Set&amp;diff=44220&amp;oldid=prev"/>
		<updated>2020-07-13T01:10:38Z</updated>

		<summary type="html">&lt;p&gt;1版 をインポートしました&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;ja&quot;&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← 古い版&lt;/td&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;2020年7月13日 (月) 10:10時点における版&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-notice&quot; lang=&quot;ja&quot;&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(相違点なし)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>WikiSysop</name></author>
	</entry>
	<entry>
		<id>https://bsd.neuroinf.jp/w/index.php?title=%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB:Set&amp;diff=44219&amp;oldid=prev</id>
		<title>bsd&gt;Perhelion: Protected &quot;Module:Set&quot;: High traffic page ([Edit=Allow only autoconfirmed users] (indefinite) [Move=Allow only autoconfirmed users] (indefinite))</title>
		<link rel="alternate" type="text/html" href="https://bsd.neuroinf.jp/w/index.php?title=%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB:Set&amp;diff=44219&amp;oldid=prev"/>
		<updated>2018-09-04T11:35:07Z</updated>

		<summary type="html">&lt;p&gt;Protected &amp;quot;&lt;a href=&quot;/wiki/%E3%83%A2%E3%82%B8%E3%83%A5%E3%83%BC%E3%83%AB:Set&quot; title=&quot;モジュール:Set&quot;&gt;Module:Set&lt;/a&gt;&amp;quot;: &lt;a href=&quot;http://commons.wikimedia.org/wiki/Protection_policy&quot; class=&quot;extiw&quot; title=&quot;commons:Protection policy&quot;&gt;High traffic page&lt;/a&gt; ([Edit=Allow only autoconfirmed users] (indefinite) [Move=Allow only autoconfirmed users] (indefinite))&lt;/p&gt;
&lt;p&gt;&lt;b&gt;新規ページ&lt;/b&gt;&lt;/p&gt;&lt;div&gt;-- Derivative work of:&lt;br /&gt;
--[[&lt;br /&gt;
	(The MIT license)&lt;br /&gt;
	Copyright (c) 2013, Wouter Scherphof (wouter.scherphof@gmail.com)&lt;br /&gt;
	Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the &amp;quot;Software&amp;quot;), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:&lt;br /&gt;
	The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.&lt;br /&gt;
	THE SOFTWARE IS PROVIDED &amp;quot;AS IS&amp;quot;, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.&lt;br /&gt;
]]&lt;br /&gt;
&lt;br /&gt;
-- Source: https://github.com/wscherphof/lua-set/tree/master/src&lt;br /&gt;
-- &amp;quot;Straightforward Set library for Lua&amp;quot;&lt;br /&gt;
&lt;br /&gt;
local Set = {}&lt;br /&gt;
Set.mt = {__index = Set}&lt;br /&gt;
function Set:new(values)&lt;br /&gt;
  if getmetatable(values) == Set.mt then return values end&lt;br /&gt;
  local instance = {}&lt;br /&gt;
  if type(values) == &amp;quot;table&amp;quot; then&lt;br /&gt;
    if #values &amp;gt; 0 then&lt;br /&gt;
      for _,v in ipairs(values) do&lt;br /&gt;
        instance[v] = true&lt;br /&gt;
      end&lt;br /&gt;
    else&lt;br /&gt;
      for k in pairs(values) do&lt;br /&gt;
        instance[k] = true&lt;br /&gt;
      end&lt;br /&gt;
    end&lt;br /&gt;
  elseif values ~= nil then&lt;br /&gt;
    instance = {[values] = true}&lt;br /&gt;
  end&lt;br /&gt;
  return setmetatable(instance, Set.mt)&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
function Set:add(e)&lt;br /&gt;
  if e ~= nil then self[e] = true end&lt;br /&gt;
  return self&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
function Set:remove(e)&lt;br /&gt;
  if e ~= nil then self[e] = nil end&lt;br /&gt;
  return self&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
function Set:anelement()&lt;br /&gt;
  for e in pairs(self) do&lt;br /&gt;
    return e&lt;br /&gt;
  end&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
-- Union&lt;br /&gt;
Set.mt.__add = function (a, b)&lt;br /&gt;
  local res, a, b = Set:new(), Set:new(a), Set:new(b)&lt;br /&gt;
  for k in pairs(a) do res[k] = true end&lt;br /&gt;
  for k in pairs(b) do res[k] = true end&lt;br /&gt;
  return res&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
-- Subtraction&lt;br /&gt;
Set.mt.__sub = function (a, b)&lt;br /&gt;
  local res, a, b = Set:new(), Set:new(a), Set:new(b)&lt;br /&gt;
  for k in pairs(a) do res[k] = true end&lt;br /&gt;
  for k in pairs(b) do res[k] = nil end&lt;br /&gt;
  return res&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
-- Intersection&lt;br /&gt;
Set.mt.__mul = function (a, b)&lt;br /&gt;
  local res, a, b = Set:new(), Set:new(a), Set:new(b)&lt;br /&gt;
  for k in pairs(a) do&lt;br /&gt;
    res[k] = b[k]&lt;br /&gt;
  end&lt;br /&gt;
  return res&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
-- String representation&lt;br /&gt;
Set.mt.__tostring = function (set)&lt;br /&gt;
  local s = &amp;quot;{&amp;quot;&lt;br /&gt;
  local sep = &amp;quot;&amp;quot;&lt;br /&gt;
  for k in pairs(set) do&lt;br /&gt;
    s = s .. sep .. k&lt;br /&gt;
    sep = &amp;quot;, &amp;quot;&lt;br /&gt;
  end&lt;br /&gt;
  return s .. &amp;quot;}&amp;quot;&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
function Set:len()&lt;br /&gt;
  local num = 0&lt;br /&gt;
  for _ in pairs(self) do&lt;br /&gt;
    num = num + 1&lt;br /&gt;
  end&lt;br /&gt;
  return num&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
function Set:tolist()&lt;br /&gt;
  local res = {}&lt;br /&gt;
  for k in pairs(self) do&lt;br /&gt;
    table.insert(res, k)&lt;br /&gt;
  end&lt;br /&gt;
  return res&lt;br /&gt;
end&lt;br /&gt;
&lt;br /&gt;
return Set&lt;/div&gt;</summary>
		<author><name>bsd&gt;Perhelion</name></author>
	</entry>
</feed>