5 #include <unordered_set>
9 /** This is the IoTSet implementation for C++
11 * @author Rahmadi Trimananda <rahmadi.trimananda @ uci.edu>
18 unordered_set<T>* set;
21 ISet(unordered_set<T> const* s);
24 typename unordered_set<T>::const_iterator find(const T& k); // Find the object
25 typename unordered_set<T>::const_iterator insert(const T& k); // Insert the object
26 bool empty(); // Test is empty?
27 typename unordered_set<T>::const_iterator begin(); // Iterator
28 typename unordered_set<T>::const_iterator end(); // Iterator
29 int size(); // Set size
30 unordered_set<T>* values(); // Return set contents
40 set = new unordered_set<T>();
48 ISet<T>::ISet(const unordered_set<T>* s) {
66 * Find the object k in the set
69 typename unordered_set<T>::const_iterator ISet<T>::find(const T& k) {
76 * Insert object k into the set
79 typename unordered_set<T>::const_iterator ISet<T>::insert(const T& k) {
81 return set->insert(k);
86 * Return the "begin" iterator
89 typename unordered_set<T>::const_iterator ISet<T>::begin() {
96 * Return the "end" iterator
99 typename unordered_set<T>::const_iterator ISet<T>::end() {
106 * Return the size of the set
109 int ISet<T>::size() {
116 * Return a new copy of the set
119 unordered_set<T>* ISet<T>::values() {