--- /dev/null
+/*
+ * File: Queue.h
+ * Author: patrik
+ *
+ * Created on August 1, 2009, 7:12 PM
+ */
+
+#pragma once
+
+// HACK
+#ifndef NULL
+#define NULL 0
+#endif
+
+namespace bear
+{
+ /// ***** Header Class *****
+
+ template < class Item >
+ class Queue
+ {
+ public:
+ Queue();
+ ~Queue() {}
+
+ void init(int iStartSize = 2, int iSizeMultiplier = 2);
+ void fini();
+
+ void alloc(int iSize);
+ void trim();
+
+ bool isEmpty() const;
+
+ Item& getFront();
+ Item& getBack();
+
+ void pushFront(const Item& i);
+ void popBack(const Item& i);
+
+ private:
+ int m_iStartSize;
+ int m_iSizeMultiplier;
+
+ int m_iAllocated;
+ Item* m_pArrayItems;
+
+ int m_iHead;
+ int m_iTail;
+ };
+
+} // namespace bear
+
+template < class Item >
+bear::Queue<Item>::Queue()
+ : m_iStartSize(0),
+ m_iSizeMultiplier(0),
+ m_iAllocated(0),
+ m_pArrayItems(NULL),
+ m_iHead(0),
+ m_iTail(0)
+{
+
+}
+
+template < class Item >
+void bear::Queue<Item>::init
+(
+ int iStartSize,
+ int iSizeMultiplier
+)
+{
+ m_iStartSize = iStartSize;
+ m_iSizeMultiplier = iSizeMultiplier;
+}
+template < class Item >
+void bear::Queue<Item>::fini()
+{
+
+}
+
+template < class Item >
+void bear::Queue<Item>::alloc(int iSize)
+{
+
+}
+template < class Item >
+void bear::Queue<Item>::trim()
+{
+
+}
+
+template < class Item >
+bool bear::Queue<Item>::isEmpty() const
+{
+ return false;
+}
+
+template < class Item >
+Item& bear::Queue<Item>::getFront()
+{
+
+}
+
+template < class Item >
+Item& bear::Queue<Item>::getBack()
+{
+
+}
+
+template < class Item >
+void bear::Queue<Item>::pushFront(const Item& i)
+{
+
+}
+
+template < class Item >
+void bear::Queue<Item>::popBack(const Item& i)
+{
+
+}
+
--- /dev/null
+/*
+ * Author: Patrik Gornicz
+ *
+ * Created on August 1, 2009, 6:53 PM
+ */
+
+#ifndef _SET_H
+#define _SET_H
+
+namespace bear
+{
+ /// ***** Header Class *****
+
+ class Set
+ {
+ // TODO
+ };
+
+} // namespace bear
+
+
+#endif // _SET_H
+