set-lua is a complete implementation of the Set data structure.

In computer science, a set is an abstract data type that can store unique values, without any particular order. It is a computer implementation of the mathematical concept of a finite set. Unlike most other collection types, rather than retrieving a specific element from a set, one typically tests a value for membership in a set. - Wikipedia

To install set-lua, run:

$ luarocks install set-lua

local Set = require('Set')
local list = Set({ 'banana', 'apple', 'kiwi' })

list.has('banana') -- true
list.has('orange') -- false

list.delete('banana') -- true

list.insert('orange')
list.has('orange') -- true

• Set.items:table
  Items presented in Set.

• Set.size:number
  Current Set length.

• Set.insert(value:any):void
  Appends value to the Set object.

• Set.has(value:any):boolean
  Checks if value is present in the Set object or not.

• Set.clear():void
  Removes all items from the Set object.

• Set.delete(value:any):boolean
  Removes item from the Set object and returns a boolean value asserting wheater item was removed or not.

• Set.each(callback:function):void
  Removes item from the Set object and returns a boolean value asserting wheater item was removed or not.

• Set.every(callback:function):boolean
  Returns true whether all items pass the test provided by the callback function.

• Set.union(s1[, s2, ...]: Set):Set
  Returns a new Set that contains all items from the original Set and all items from the specified Sets.

• Set.intersection(s1[, s2, ...]: Set):Set
  Returns a new Set that contains all elements that are common in all Sets.

• Set.difference(s1[, s2, ...]: Set):Set
  Returns a new Set that contains the items that only exist in the original Set.

• Set.symmetric_difference(s2: Set):Set
  Returns a symetric difference of two Sets.

• Set.is_superset(subset: Set):boolean
  Returns true if set has all items present in the subset.

MIT