@@ -2,3 +2,4 @@
 node_modules/
 *.lua
 !dist/*.js
+!dist/lualib/*.lua
@@ -0,0 +1,22 @@
+declare class Set<T> {
+    constructor(other?: Set<T>);
+    add(item: T): void;
+    contains(item: T): boolean;
+    remove(item: T): boolean;
+    items(): T[];
+    count(): number;
+
+    //forEach<U>((item: T) => U): U[];
+}
+
+declare class Map<S,T> {
+    constructor(other?: Map<S,T>);
+    put(key: S, value: T): void;
+    remove(key: S): boolean;
+    get(key: S): T;
+    containsKey(key: S): boolean;
+    keys(): S[];
+    values(): T[];
+    items(): {key: S, value: T}[];
+    count(): number;
+}
@@ -0,0 +1,99 @@
+-- Ternary operator
+function TS_ITE(condition, v1f, v2f)
+    if condition then
+        return v1f()
+    else
+        return v2f()
+    end
+end
+
+-- Set data structure implementation
+Set = Set or {}
+Set.__index = Set
+function Set.new(construct, ...)
+    local instance = setmetatable({}, Set)
+    Set.constructor(instance, ...)
+    return instance
+end
+function Set.constructor(self, other)
+    self._items = {}
+    if other then
+        for a, _ in pairs(other) do
+            self._items[a] = true
+        end
+    end
+end
+function Set.add(self, item) self._items[item] = true end
+function Set.contains(self, item) return self._items[item] ~= nil end
+function Set.remove(self, item)
+    local contains = Set.contains(self, item)
+    self._items[item] = nil
+    return contains
+end
+function Set.items(self)
+    local out = {}
+    for item, _ in pairs(self._items) do
+        table.insert(out, item)
+    end
+    return out
+end
+function Set.count(self)
+    local count = 0
+    for item, _ in pairs(self._items) do
+        count = count + 1
+    end
+    return count
+end
+
+-- Set data structure implementation
+Map = Map or {}
+Map.__index = Map
+function Map.new(construct, ...)
+    local instance = setmetatable({}, Map)
+    Map.constructor(instance, ...)
+    return instance
+end
+function Map.constructor(self, other)
+    self._items = {}
+    if other then
+        for k, v in pairs(other) do
+            self._items[k] = v
+        end
+    end
+end
+function Map.put(self, key, value) self._items[key] = value end
+function Map.containsKey(self, key) return self._items[key] ~= nil end
+function Map.remove(self, key)
+    local contains = self.containsKey(self, key)
+    self._items[key] = nil
+    return contains
+end
+function Map.get(self, key) return self._items[key] end
+function Map.keys(self)
+    local out = {}
+    for k, v in pairs(self._items) do
+        table.insert(out, k)
+    end
+    return out
+end
+function Map.values(self)
+    local out = {}
+    for k, v in pairs(self._items) do
+        table.insert(out, v)
+    end
+    return out
+end
+function Map.items(self)
+    local out = {}
+    for k, v in pairs(self._items) do
+        table.insert(out, {key=k, value=v})
+    end
+    return out
+end
+function Map.count(self)
+    local count = 0
+    for k, v in pairs(self._items) do
+        count = count + 1
+    end
+    return count
+end