--- Sets
---
--- Sets can add/get unique elements.
---
--- **Usage notes**
---
--- 1. The elements stored must be hashable (e.g. strings, numbers, etc.).
type Set<K> = {
	--- Adds an element to the set
	add: (element: K) -> (),

	--- Inserts a set of elements into the set
	insert: (elements: {K}) -> (),

	--- Removes an element from the set 
	remove: (element: K) -> (),

	--- Deletes a set of elements from the set
	delete: (elements: {K}) -> (),

	--- Returns if an element exists in the priority set or not
	exists: (element: K) -> boolean,

	--- Clears the set
	clear: () -> (),

	--- Copy of the set
	--- 
	--- **Time complexity: O(n)** where \`n\` is the number of elements in the set.
	copy: () -> Set<K>,

	-- Metatable
	__iter: (self: Set<K>) -> () -> K?,
	__len: (self: Set<K>) -> number
}

function Set<K>() -> Set<K> end

--- Creates a set from a table of elements
---
--- **Time complexity: O(n)** where \`n\` is the number of elements in the table.
function fromtable<K>(table: {K}) -> Set<K> end