Rename `CoreLib::*` to `Slang`

Getting rid of more namespace complexity and stripping things down to the basics.

This also gets rid of some dead code in the "core" library.

1 files changed, 515 insertions, 518 deletions

diff --git a/source/core/list.h b/source/core/list.h
index 6ff68ed7d..5315f788f 100644
--- a/source/core/list.h
+++ b/source/core/list.h
@@ -11,460 +11,458 @@
 
 const int MIN_QSORT_SIZE = 32;
 
-namespace CoreLib
+namespace Slang
 {
-	namespace Basic
+	template<typename T, int isPOD>
+	class Initializer
 	{
-		template<typename T, int isPOD>
-		class Initializer
-		{
 
-		};
+	};
 
-		template<typename T>
-		class Initializer<T, 0>
+	template<typename T>
+	class Initializer<T, 0>
+	{
+	public:
+		static void Initialize(T * buffer, int size)
 		{
-		public:
-			static void Initialize(T * buffer, int size)
-			{
-				for (int i = 0; i<size; i++)
-					new (buffer + i) T();
-			}
-		};
+			for (int i = 0; i<size; i++)
+				new (buffer + i) T();
+		}
+	};
 
-		template<typename T, typename TAllocator>
-		class AllocateMethod
+	template<typename T, typename TAllocator>
+	class AllocateMethod
+	{
+	public:
+		static inline T* Alloc(int size)
 		{
-		public:
-			static inline T* Alloc(int size)
-			{
-				TAllocator allocator;
-				T * rs = (T*)allocator.Alloc(size*sizeof(T));
-				Initializer<T, std::is_pod<T>::value>::Initialize(rs, size);
-				return rs;
-			}
-			static inline void Free(T * ptr, int bufferSize)
-			{
-				TAllocator allocator;
-				if (!std::is_trivially_destructible<T>::value)
-				{
-					for (int i = 0; i<bufferSize; i++)
-						ptr[i].~T();
-				}
-				allocator.Free(ptr);
-			}
-		};
-
-		template<typename T>
-		class AllocateMethod<T, StandardAllocator>
+			TAllocator allocator;
+			T * rs = (T*)allocator.Alloc(size*sizeof(T));
+			Initializer<T, std::is_pod<T>::value>::Initialize(rs, size);
+			return rs;
+		}
+		static inline void Free(T * ptr, int bufferSize)
 		{
-		public:
-			static inline T* Alloc(int size)
-			{
-				return new T[size];
-			}
-			static inline void Free(T* ptr, int /*bufferSize*/)
+			TAllocator allocator;
+			if (!std::is_trivially_destructible<T>::value)
 			{
-				delete [] ptr;
+				for (int i = 0; i<bufferSize; i++)
+					ptr[i].~T();
 			}
-		};
+			allocator.Free(ptr);
+		}
+	};
 
-		template<typename T>
-		class Initializer<T, 1>
+	template<typename T>
+	class AllocateMethod<T, StandardAllocator>
+	{
+	public:
+		static inline T* Alloc(int size)
 		{
-		public:
-			static void Initialize(T * buffer, int size)
-			{
-				for (int i = 0; i<size; i++)
-					new (buffer + i) T;
-			}
-		};
+			return new T[size];
+		}
+		static inline void Free(T* ptr, int /*bufferSize*/)
+		{
+			delete [] ptr;
+		}
+	};
 
-		template<typename T, typename TAllocator = StandardAllocator>
-		class List
+	template<typename T>
+	class Initializer<T, 1>
+	{
+	public:
+		static void Initialize(T * buffer, int size)
 		{
-		private:
+			for (int i = 0; i<size; i++)
+				new (buffer + i) T;
+		}
+	};
 
-			inline T * Allocate(int size)
-			{
-				return AllocateMethod<T, TAllocator>::Alloc(size);
+	template<typename T, typename TAllocator = StandardAllocator>
+	class List
+	{
+	private:
+
+		inline T * Allocate(int size)
+		{
+			return AllocateMethod<T, TAllocator>::Alloc(size);
 				
-			}
-		private:
-			static const int InitialSize = 16;
-			TAllocator allocator;
-		private:
-			T * buffer;
-			int _count;
-			int bufferSize;
-			void FreeBuffer()
-			{
-				AllocateMethod<T, TAllocator>::Free(buffer, bufferSize);
-				buffer = 0;
-			}
-			void Free()
-			{
-				if (buffer)
-				{
-					FreeBuffer();
-				}
-				buffer = 0;
-				_count = bufferSize = 0;
-			}
-		public:
-			T* begin() const
-			{
-				return buffer;
-			}
-			T* end() const
-			{
-				return buffer+_count;
-			}
-		private:
-			template<typename... Args>
-			void Init(const T & val, Args... args)
-			{
-				Add(val);
-				Init(args...);
-			}
-		public:
-			List()
-				: buffer(0), _count(0), bufferSize(0)
-			{
-			}
-			template<typename... Args>
-			List(const T & val, Args... args)
-			{
-				Init(val, args...);
-			}
-			List(const List<T> & list)
-				: buffer(0), _count(0), bufferSize(0)
-			{
-				this->operator=(list);
-			}
-			List(List<T> && list)
-				: buffer(0), _count(0), bufferSize(0)
-			{
-				this->operator=(static_cast<List<T>&&>(list));
-			}
-			static List<T> Create(const T & val, int count)
-			{
-				List<T> rs;
-				rs.SetSize(count);
-				for (int i = 0; i < count; i++)
-					rs[i] = val;
-				return rs;
-			}
-			~List()
+		}
+	private:
+		static const int InitialSize = 16;
+		TAllocator allocator;
+	private:
+		T * buffer;
+		int _count;
+		int bufferSize;
+		void FreeBuffer()
+		{
+			AllocateMethod<T, TAllocator>::Free(buffer, bufferSize);
+			buffer = 0;
+		}
+		void Free()
+		{
+			if (buffer)
 			{
-				Free();
+				FreeBuffer();
 			}
-			List<T> & operator=(const List<T> & list)
-			{
-				Free();
-				AddRange(list);
+			buffer = 0;
+			_count = bufferSize = 0;
+		}
+	public:
+		T* begin() const
+		{
+			return buffer;
+		}
+		T* end() const
+		{
+			return buffer+_count;
+		}
+	private:
+		template<typename... Args>
+		void Init(const T & val, Args... args)
+		{
+			Add(val);
+			Init(args...);
+		}
+	public:
+		List()
+			: buffer(0), _count(0), bufferSize(0)
+		{
+		}
+		template<typename... Args>
+		List(const T & val, Args... args)
+		{
+			Init(val, args...);
+		}
+		List(const List<T> & list)
+			: buffer(0), _count(0), bufferSize(0)
+		{
+			this->operator=(list);
+		}
+		List(List<T> && list)
+			: buffer(0), _count(0), bufferSize(0)
+		{
+			this->operator=(static_cast<List<T>&&>(list));
+		}
+		static List<T> Create(const T & val, int count)
+		{
+			List<T> rs;
+			rs.SetSize(count);
+			for (int i = 0; i < count; i++)
+				rs[i] = val;
+			return rs;
+		}
+		~List()
+		{
+			Free();
+		}
+		List<T> & operator=(const List<T> & list)
+		{
+			Free();
+			AddRange(list);
 
-				return *this;
-			}
+			return *this;
+		}
 
-			List<T> & operator=(List<T> && list)
-			{
-				Free();
-				_count = list._count;
-				bufferSize = list.bufferSize;
-				buffer = list.buffer;
-
-				list.buffer = 0;
-				list._count = 0;
-				list.bufferSize = 0;
-				return *this;
-			}
+		List<T> & operator=(List<T> && list)
+		{
+			Free();
+			_count = list._count;
+			bufferSize = list.bufferSize;
+			buffer = list.buffer;
+
+			list.buffer = 0;
+			list._count = 0;
+			list.bufferSize = 0;
+			return *this;
+		}
 
-			T & First() const
-			{
+		T & First() const
+		{
 #ifdef _DEBUG
-				if (_count == 0)
-					throw "Index out of range.";
+			if (_count == 0)
+				throw "Index out of range.";
 #endif
-				return buffer[0];
-			}
+			return buffer[0];
+		}
 
-			T & Last() const
-			{
+		T & Last() const
+		{
 #ifdef _DEBUG
-				if (_count == 0)
-					throw "Index out of range.";
+			if (_count == 0)
+				throw "Index out of range.";
 #endif
-				return buffer[_count-1];
-			}
+			return buffer[_count-1];
+		}
 
-			inline void SwapWith(List<T, TAllocator> & other)
-			{
-				T* tmpBuffer = this->buffer;
-				this->buffer = other.buffer;
-				other.buffer = tmpBuffer;
-				int tmpBufferSize = this->bufferSize;
-				this->bufferSize = other.bufferSize;
-				other.bufferSize = tmpBufferSize;
-				int tmpCount = this->_count;
-				this->_count = other._count;
-				other._count = tmpCount;
-				TAllocator tmpAlloc = _Move(this->allocator);
-				this->allocator = _Move(other.allocator);
-				other.allocator = _Move(tmpAlloc);
-			}
+		inline void SwapWith(List<T, TAllocator> & other)
+		{
+			T* tmpBuffer = this->buffer;
+			this->buffer = other.buffer;
+			other.buffer = tmpBuffer;
+			int tmpBufferSize = this->bufferSize;
+			this->bufferSize = other.bufferSize;
+			other.bufferSize = tmpBufferSize;
+			int tmpCount = this->_count;
+			this->_count = other._count;
+			other._count = tmpCount;
+			TAllocator tmpAlloc = _Move(this->allocator);
+			this->allocator = _Move(other.allocator);
+			other.allocator = _Move(tmpAlloc);
+		}
 
-			T* ReleaseBuffer()
-			{
-				T* rs = buffer;
-				buffer = nullptr;
-				_count = 0;
-				bufferSize = 0;
-				return rs;
-			}
+		T* ReleaseBuffer()
+		{
+			T* rs = buffer;
+			buffer = nullptr;
+			_count = 0;
+			bufferSize = 0;
+			return rs;
+		}
 
-			inline ArrayView<T> GetArrayView() const
-			{
-				return ArrayView<T>(buffer, _count);
-			}
+		inline ArrayView<T> GetArrayView() const
+		{
+			return ArrayView<T>(buffer, _count);
+		}
 
-			inline ArrayView<T> GetArrayView(int start, int count) const
-			{
+		inline ArrayView<T> GetArrayView(int start, int count) const
+		{
 #ifdef _DEBUG
-				if (start + count > _count || start < 0 || count < 0)
-					throw "Index out of range.";
+			if (start + count > _count || start < 0 || count < 0)
+				throw "Index out of range.";
 #endif
-				return ArrayView<T>(buffer + start, count);
-			}
+			return ArrayView<T>(buffer + start, count);
+		}
 
-			void Add(T && obj)
+		void Add(T && obj)
+		{
+			if (bufferSize < _count + 1)
 			{
-				if (bufferSize < _count + 1)
-				{
-					int newBufferSize = InitialSize;
-					if (bufferSize)
-						newBufferSize = (bufferSize << 1);
+				int newBufferSize = InitialSize;
+				if (bufferSize)
+					newBufferSize = (bufferSize << 1);
 
-					Reserve(newBufferSize);
-				}
-				buffer[_count++] = static_cast<T&&>(obj);
+				Reserve(newBufferSize);
 			}
+			buffer[_count++] = static_cast<T&&>(obj);
+		}
 
-			void Add(const T & obj)
+		void Add(const T & obj)
+		{
+			if (bufferSize < _count + 1)
 			{
-				if (bufferSize < _count + 1)
-				{
-					int newBufferSize = InitialSize;
-					if (bufferSize)
-						newBufferSize = (bufferSize << 1);
-
-					Reserve(newBufferSize);
-				}
-				buffer[_count++] = obj;
+				int newBufferSize = InitialSize;
+				if (bufferSize)
+					newBufferSize = (bufferSize << 1);
 
+				Reserve(newBufferSize);
 			}
+			buffer[_count++] = obj;
 
-			int Count() const
-			{
-				return _count;
-			}
+		}
 
-			T * Buffer() const
-			{
-				return buffer;
-			}
+		int Count() const
+		{
+			return _count;
+		}
 
-			int Capacity() const
-			{
-				return bufferSize;
-			}
+		T * Buffer() const
+		{
+			return buffer;
+		}
 
-			void Insert(int id, const T & val)
-			{
-				InsertRange(id, &val, 1);
-			}
+		int Capacity() const
+		{
+			return bufferSize;
+		}
 
-			void InsertRange(int id, const T * vals, int n)
+		void Insert(int id, const T & val)
+		{
+			InsertRange(id, &val, 1);
+		}
+
+		void InsertRange(int id, const T * vals, int n)
+		{
+			if (bufferSize < _count + n)
 			{
-				if (bufferSize < _count + n)
-				{
-					int newBufferSize = InitialSize;
-					while (newBufferSize < _count + n)
-						newBufferSize = newBufferSize << 1;
+				int newBufferSize = InitialSize;
+				while (newBufferSize < _count + n)
+					newBufferSize = newBufferSize << 1;
 
-					T * newBuffer = Allocate(newBufferSize);
-					if (bufferSize)
-					{
-						/*if (std::has_trivial_copy_assign<T>::value && std::has_trivial_destructor<T>::value)
-						{
-							memcpy(newBuffer, buffer, sizeof(T) * id);
-							memcpy(newBuffer + id + n, buffer + id, sizeof(T) * (_count - id));
-						}
-						else*/
-						{
-							for (int i = 0; i < id; i++)
-								newBuffer[i] = buffer[i];
-							for (int i = id; i < _count; i++)
-								newBuffer[i + n] = T(static_cast<T&&>(buffer[i]));
-						}
-						FreeBuffer();
-					}
-					buffer = newBuffer;
-					bufferSize = newBufferSize;
-				}
-				else
+				T * newBuffer = Allocate(newBufferSize);
+				if (bufferSize)
 				{
 					/*if (std::has_trivial_copy_assign<T>::value && std::has_trivial_destructor<T>::value)
-						memmove(buffer + id + n, buffer + id, sizeof(T) * (_count - id));
+					{
+						memcpy(newBuffer, buffer, sizeof(T) * id);
+						memcpy(newBuffer + id + n, buffer + id, sizeof(T) * (_count - id));
+					}
 					else*/
 					{
-						for (int i = _count - 1; i >= id; i--)
-							buffer[i + n] = static_cast<T&&>(buffer[i]);
+						for (int i = 0; i < id; i++)
+							newBuffer[i] = buffer[i];
+						for (int i = id; i < _count; i++)
+							newBuffer[i + n] = T(static_cast<T&&>(buffer[i]));
 					}
+					FreeBuffer();
 				}
+				buffer = newBuffer;
+				bufferSize = newBufferSize;
+			}
+			else
+			{
 				/*if (std::has_trivial_copy_assign<T>::value && std::has_trivial_destructor<T>::value)
-					memcpy(buffer + id, vals, sizeof(T) * n);
+					memmove(buffer + id + n, buffer + id, sizeof(T) * (_count - id));
 				else*/
-					for (int i = 0; i < n; i++)
-						buffer[id + i] = vals[i];
-
-				_count += n;
+				{
+					for (int i = _count - 1; i >= id; i--)
+						buffer[i + n] = static_cast<T&&>(buffer[i]);
+				}
 			}
+			/*if (std::has_trivial_copy_assign<T>::value && std::has_trivial_destructor<T>::value)
+				memcpy(buffer + id, vals, sizeof(T) * n);
+			else*/
+				for (int i = 0; i < n; i++)
+					buffer[id + i] = vals[i];
 
-			//slower than original edition
-			//void Add(const T & val)
-			//{
-			//	InsertRange(_count, &val, 1);
-			//}
+			_count += n;
+		}
 
-			void InsertRange(int id, const List<T> & list)
-			{
-				InsertRange(id, list.buffer, list._count);
-			}
+		//slower than original edition
+		//void Add(const T & val)
+		//{
+		//	InsertRange(_count, &val, 1);
+		//}
 
-			void AddRange(ArrayView<T> list)
-			{
-				InsertRange(_count, list.Buffer(), list.Count());
-			}
+		void InsertRange(int id, const List<T> & list)
+		{
+			InsertRange(id, list.buffer, list._count);
+		}
 
-			void AddRange(const T * vals, int n)
-			{
-				InsertRange(_count, vals, n);
-			}
+		void AddRange(ArrayView<T> list)
+		{
+			InsertRange(_count, list.Buffer(), list.Count());
+		}
 
-			void AddRange(const List<T> & list)
-			{
-				InsertRange(_count, list.buffer, list._count);
-			}
+		void AddRange(const T * vals, int n)
+		{
+			InsertRange(_count, vals, n);
+		}
 
-			void RemoveRange(int id, int deleteCount)
-			{
+		void AddRange(const List<T> & list)
+		{
+			InsertRange(_count, list.buffer, list._count);
+		}
+
+		void RemoveRange(int id, int deleteCount)
+		{
 #if _DEBUG
-				if (id >= _count || id < 0)
-					throw "Remove: Index out of range.";
-				if(deleteCount < 0)
-					throw "Remove: deleteCount smaller than zero.";
+			if (id >= _count || id < 0)
+				throw "Remove: Index out of range.";
+			if(deleteCount < 0)
+				throw "Remove: deleteCount smaller than zero.";
 #endif
-				int actualDeleteCount = ((id + deleteCount) >= _count)? (_count - id) : deleteCount;
-				for (int i = id + actualDeleteCount; i < _count; i++)
-					buffer[i - actualDeleteCount] = static_cast<T&&>(buffer[i]);
-				_count -= actualDeleteCount;
-			}
+			int actualDeleteCount = ((id + deleteCount) >= _count)? (_count - id) : deleteCount;
+			for (int i = id + actualDeleteCount; i < _count; i++)
+				buffer[i - actualDeleteCount] = static_cast<T&&>(buffer[i]);
+			_count -= actualDeleteCount;
+		}
 
-			void RemoveAt(int id)
-			{
-				RemoveRange(id, 1);
-			}
+		void RemoveAt(int id)
+		{
+			RemoveRange(id, 1);
+		}
 
-			void Remove(const T & val)
-			{
-				int idx = IndexOf(val);
-				if (idx != -1)
-					RemoveAt(idx);
-			}
+		void Remove(const T & val)
+		{
+			int idx = IndexOf(val);
+			if (idx != -1)
+				RemoveAt(idx);
+		}
 
-			void Reverse()
+		void Reverse()
+		{
+			for (int i = 0; i < (_count >> 1); i++)
 			{
-				for (int i = 0; i < (_count >> 1); i++)
-				{
-					Swap(buffer, i, _count - i - 1);
-				}
+				Swap(buffer, i, _count - i - 1);
 			}
+		}
 
-			void FastRemove(const T & val)
-			{
-				int idx = IndexOf(val);
-				FastRemoveAt(idx);
-			}
+		void FastRemove(const T & val)
+		{
+			int idx = IndexOf(val);
+			FastRemoveAt(idx);
+		}
 
-			void FastRemoveAt(int idx)
+		void FastRemoveAt(int idx)
+		{
+			if (idx != -1 && _count - 1 != idx)
 			{
-				if (idx != -1 && _count - 1 != idx)
-				{
-					buffer[idx] = _Move(buffer[_count - 1]);
-				}
-				_count--;
+				buffer[idx] = _Move(buffer[_count - 1]);
 			}
+			_count--;
+		}
 
-			void Clear()
-			{
-				_count = 0;
-			}
+		void Clear()
+		{
+			_count = 0;
+		}
 
-			void Reserve(int size)
+		void Reserve(int size)
+		{
+			if(size > bufferSize)
 			{
-				if(size > bufferSize)
+				T * newBuffer = Allocate(size);
+				if (bufferSize)
 				{
-					T * newBuffer = Allocate(size);
-					if (bufferSize)
+					/*if (std::has_trivial_copy_assign<T>::value && std::has_trivial_destructor<T>::value)
+						memcpy(newBuffer, buffer, _count * sizeof(T));
+					else*/
 					{
-						/*if (std::has_trivial_copy_assign<T>::value && std::has_trivial_destructor<T>::value)
-							memcpy(newBuffer, buffer, _count * sizeof(T));
-						else*/
-						{
-							for (int i = 0; i < _count; i++)
-								newBuffer[i] = static_cast<T&&>(buffer[i]);
-						}
-						FreeBuffer();
+						for (int i = 0; i < _count; i++)
+							newBuffer[i] = static_cast<T&&>(buffer[i]);
 					}
-					buffer = newBuffer;
-					bufferSize = size;
+					FreeBuffer();
 				}
+				buffer = newBuffer;
+				bufferSize = size;
 			}
+		}
 
-			void GrowToSize(int size)
+		void GrowToSize(int size)
+		{
+			int newBufferSize = 1<<Math::Log2Ceil(size);
+			if (bufferSize < newBufferSize)
 			{
-				int newBufferSize = 1<<Math::Log2Ceil(size);
-				if (bufferSize < newBufferSize)
-				{
-					Reserve(newBufferSize);
-				}
-				this->_count = size;
+				Reserve(newBufferSize);
 			}
+			this->_count = size;
+		}
 
-			void SetSize(int size)
-			{
-				Reserve(size);
-				_count = size;
-			}
+		void SetSize(int size)
+		{
+			Reserve(size);
+			_count = size;
+		}
 
-			void UnsafeShrinkToSize(int size)
-			{
-				_count = size;
-			}
+		void UnsafeShrinkToSize(int size)
+		{
+			_count = size;
+		}
 
-			void Compress()
+		void Compress()
+		{
+			if (bufferSize > _count && _count > 0)
 			{
-				if (bufferSize > _count && _count > 0)
-				{
-					T * newBuffer = Allocate(_count);
-					for (int i = 0; i < _count; i++)
-						newBuffer[i] = static_cast<T&&>(buffer[i]);
-					FreeBuffer();
-					buffer = newBuffer;
-					bufferSize = _count;
-				}
+				T * newBuffer = Allocate(_count);
+				for (int i = 0; i < _count; i++)
+					newBuffer[i] = static_cast<T&&>(buffer[i]);
+				FreeBuffer();
+				buffer = newBuffer;
+				bufferSize = _count;
 			}
+		}
 
 #ifndef FORCE_INLINE
 #ifdef _MSC_VER
@@ -474,200 +472,199 @@ namespace CoreLib
 #endif
 #endif
 
-			FORCE_INLINE T & operator [](int id) const
-			{
+		FORCE_INLINE T & operator [](int id) const
+		{
 #if _DEBUG
-				if(id >= _count || id < 0)
-					throw IndexOutofRangeException("Operator[]: Index out of Range.");
+			if(id >= _count || id < 0)
+				throw IndexOutofRangeException("Operator[]: Index out of Range.");
 #endif
-				return buffer[id];
-			}
+			return buffer[id];
+		}
 
-			template<typename Func>
-			int FindFirst(const Func & predicate) const
+		template<typename Func>
+		int FindFirst(const Func & predicate) const
+		{
+			for (int i = 0; i < _count; i++)
 			{
-				for (int i = 0; i < _count; i++)
-				{
-					if (predicate(buffer[i]))
-						return i;
-				}
-				return -1;
+				if (predicate(buffer[i]))
+					return i;
 			}
+			return -1;
+		}
 
-			template<typename Func>
-			int FindLast(const Func & predicate) const
+		template<typename Func>
+		int FindLast(const Func & predicate) const
+		{
+			for (int i = _count - 1; i >= 0; i--)
 			{
-				for (int i = _count - 1; i >= 0; i--)
-				{
-					if (predicate(buffer[i]))
-						return i;
-				}
-				return -1;
+				if (predicate(buffer[i]))
+					return i;
 			}
+			return -1;
+		}
 
-			template<typename T2>
-			int IndexOf(const T2 & val) const
+		template<typename T2>
+		int IndexOf(const T2 & val) const
+		{
+			for (int i = 0; i < _count; i++)
 			{
-				for (int i = 0; i < _count; i++)
-				{
-					if (buffer[i] == val)
-						return i;
-				}
-				return -1;
-			}
-
-			template<typename T2>
-			int LastIndexOf(const T2 & val) const
-			{
-				for (int i = _count - 1; i >= 0; i--)
-				{
-					if(buffer[i] == val)
-						return i;
-				}
-				return -1;
+				if (buffer[i] == val)
+					return i;
 			}
+			return -1;
+		}
 
-			void Sort()
+		template<typename T2>
+		int LastIndexOf(const T2 & val) const
+		{
+			for (int i = _count - 1; i >= 0; i--)
 			{
-				Sort([](T& t1, T& t2){return t1<t2;});
+				if(buffer[i] == val)
+					return i;
 			}
+			return -1;
+		}
 
-			bool Contains(const T & val)
-			{
-				for (int i = 0; i<_count; i++)
-					if (buffer[i] == val)
-						return true;
-				return false;
-			}
+		void Sort()
+		{
+			Sort([](T& t1, T& t2){return t1<t2;});
+		}
 
-			template<typename Comparer>
-			void Sort(Comparer compare)
-			{
-				//InsertionSort(buffer, 0, _count - 1);
-				//QuickSort(buffer, 0, _count - 1, compare);
-				std::sort(buffer, buffer + _count, compare);
-			}
+		bool Contains(const T & val)
+		{
+			for (int i = 0; i<_count; i++)
+				if (buffer[i] == val)
+					return true;
+			return false;
+		}
 
-			template <typename IterateFunc>
-			void ForEach(IterateFunc f) const
-			{
-				for (int i = 0; i<_count; i++)
-					f(buffer[i]);
-			}
+		template<typename Comparer>
+		void Sort(Comparer compare)
+		{
+			//InsertionSort(buffer, 0, _count - 1);
+			//QuickSort(buffer, 0, _count - 1, compare);
+			std::sort(buffer, buffer + _count, compare);
+		}
 
-			template<typename Comparer>
-			void QuickSort(T * vals, int startIndex, int endIndex, Comparer comparer)
-			{
-				if(startIndex < endIndex)
-				{
-					if (endIndex - startIndex < MIN_QSORT_SIZE)
-						InsertionSort(vals, startIndex, endIndex, comparer);
-					else
-					{
-						int pivotIndex = (startIndex + endIndex) >> 1;
-						int pivotNewIndex = Partition(vals, startIndex, endIndex, pivotIndex, comparer);
-						QuickSort(vals, startIndex, pivotNewIndex - 1, comparer);
-						QuickSort(vals, pivotNewIndex + 1, endIndex, comparer);
-					}
-				}
+		template <typename IterateFunc>
+		void ForEach(IterateFunc f) const
+		{
+			for (int i = 0; i<_count; i++)
+				f(buffer[i]);
+		}
 
-			}
-			template<typename Comparer>
-			int Partition(T * vals, int left, int right, int pivotIndex, Comparer comparer)
-			{
-				T pivotValue = vals[pivotIndex];
-				Swap(vals, right, pivotIndex);
-				int storeIndex = left;
-				for (int i = left; i < right; i++)
-				{
-					if (comparer(vals[i], pivotValue))
-					{
-						Swap(vals, i, storeIndex);
-						storeIndex++;
-					}
-				}
-				Swap(vals, storeIndex, right);
-				return storeIndex;
-			}
-			template<typename Comparer>
-			void InsertionSort(T * vals, int startIndex, int endIndex, Comparer comparer)
+		template<typename Comparer>
+		void QuickSort(T * vals, int startIndex, int endIndex, Comparer comparer)
+		{
+			if(startIndex < endIndex)
 			{
-				for (int i = startIndex  + 1; i <= endIndex; i++)
+				if (endIndex - startIndex < MIN_QSORT_SIZE)
+					InsertionSort(vals, startIndex, endIndex, comparer);
+				else
 				{
-					T insertValue = static_cast<T&&>(vals[i]);
-					int insertIndex = i - 1;
-					while (insertIndex >= startIndex && comparer(insertValue, vals[insertIndex]))
-					{
-						vals[insertIndex + 1] = static_cast<T&&>(vals[insertIndex]);
-						insertIndex--;
-					}
-					vals[insertIndex + 1] = static_cast<T&&>(insertValue);
+					int pivotIndex = (startIndex + endIndex) >> 1;
+					int pivotNewIndex = Partition(vals, startIndex, endIndex, pivotIndex, comparer);
+					QuickSort(vals, startIndex, pivotNewIndex - 1, comparer);
+					QuickSort(vals, pivotNewIndex + 1, endIndex, comparer);
 				}
 			}
 
-			inline void Swap(T * vals, int index1, int index2)
+		}
+		template<typename Comparer>
+		int Partition(T * vals, int left, int right, int pivotIndex, Comparer comparer)
+		{
+			T pivotValue = vals[pivotIndex];
+			Swap(vals, right, pivotIndex);
+			int storeIndex = left;
+			for (int i = left; i < right; i++)
 			{
-				if (index1 != index2)
+				if (comparer(vals[i], pivotValue))
 				{
-					T tmp = static_cast<T&&>(vals[index1]);
-					vals[index1] = static_cast<T&&>(vals[index2]);
-					vals[index2] = static_cast<T&&>(tmp);
+					Swap(vals, i, storeIndex);
+					storeIndex++;
 				}
 			}
-
-			template<typename T2, typename Comparer>
-			int BinarySearch(const T2 & obj, Comparer comparer)
+			Swap(vals, storeIndex, right);
+			return storeIndex;
+		}
+		template<typename Comparer>
+		void InsertionSort(T * vals, int startIndex, int endIndex, Comparer comparer)
+		{
+			for (int i = startIndex  + 1; i <= endIndex; i++)
 			{
-				int imin = 0, imax = _count - 1;
-				while (imax >= imin)
+				T insertValue = static_cast<T&&>(vals[i]);
+				int insertIndex = i - 1;
+				while (insertIndex >= startIndex && comparer(insertValue, vals[insertIndex]))
 				{
-					int imid = (imin + imax) >> 1;
-					int compareResult = comparer(buffer[imid], obj);
-					if (compareResult == 0)
-						return imid;
-					else if (compareResult < 0)
-						imin = imid + 1;
-					else
-						imax = imid - 1;
+					vals[insertIndex + 1] = static_cast<T&&>(vals[insertIndex]);
+					insertIndex--;
 				}
-				return -1;
+				vals[insertIndex + 1] = static_cast<T&&>(insertValue);
 			}
+		}
 
-			template<typename T2>
-			int BinarySearch(const T2 & obj)
+		inline void Swap(T * vals, int index1, int index2)
+		{
+			if (index1 != index2)
 			{
-				return BinarySearch(obj, 
-					[](T & curObj, const T2 & thatObj)->int
-					{
-						if (curObj < thatObj)
-							return -1;
-						else if (curObj == thatObj)
-							return 0;
-						else
-							return 1;
-					});
+				T tmp = static_cast<T&&>(vals[index1]);
+				vals[index1] = static_cast<T&&>(vals[index2]);
+				vals[index2] = static_cast<T&&>(tmp);
 			}
-		};
+		}
 
-		template<typename T>
-		T Min(const List<T> & list)
+		template<typename T2, typename Comparer>
+		int BinarySearch(const T2 & obj, Comparer comparer)
 		{
-			T minVal = list.First();
-			for (int i = 1; i<list.Count(); i++)
-				if (list[i] < minVal)
-					minVal = list[i];
-			return minVal;
+			int imin = 0, imax = _count - 1;
+			while (imax >= imin)
+			{
+				int imid = (imin + imax) >> 1;
+				int compareResult = comparer(buffer[imid], obj);
+				if (compareResult == 0)
+					return imid;
+				else if (compareResult < 0)
+					imin = imid + 1;
+				else
+					imax = imid - 1;
+			}
+			return -1;
 		}
 
-		template<typename T>
-		T Max(const List<T> & list)
+		template<typename T2>
+		int BinarySearch(const T2 & obj)
 		{
-			T maxVal = list.First();
-			for (int i = 1; i<list.Count(); i++)
-				if (list[i] > maxVal)
-					maxVal = list[i];
-			return maxVal;
+			return BinarySearch(obj, 
+				[](T & curObj, const T2 & thatObj)->int
+				{
+					if (curObj < thatObj)
+						return -1;
+					else if (curObj == thatObj)
+						return 0;
+					else
+						return 1;
+				});
 		}
+	};
+
+	template<typename T>
+	T Min(const List<T> & list)
+	{
+		T minVal = list.First();
+		for (int i = 1; i<list.Count(); i++)
+			if (list[i] < minVal)
+				minVal = list[i];
+		return minVal;
+	}
+
+	template<typename T>
+	T Max(const List<T> & list)
+	{
+		T maxVal = list.First();
+		for (int i = 1; i<list.Count(); i++)
+			if (list[i] > maxVal)
+				maxVal = list[i];
+		return maxVal;
 	}
 }