STL-アナログ実装vector(タイプ抽出含む)

//    

struct TrueType
{
	bool Get()
	{
		return true;
	}
};

struct FalseType
{
	bool Get()
	{
		return false;
	}
};

template
struct Type
{
	typedef FalseType NowType;
};

template<>
struct Type
{
	typedef TrueType NowType;
};

template<>
struct Type
{
	typedef TrueType NowType;
};

template<>
struct Type
{
	typedef TrueType NowType;
};

template<>
struct Type
{
	typedef TrueType NowType;
};

template<>
struct Type
{
	typedef TrueType NowType;
};

template<>
struct Type
{
	typedef TrueType NowType;
};

template<>
struct Type
{
	typedef TrueType NowType;
};

template
struct Type
{
	typedef TrueType NowType;
};

#include 
#include 
#include 
#include "TypeTrais.h"

using namespace std;

template
class Vector
{
public:
	typedef T* Iterator;
	typedef const T* ConstIterator;
public:
	Vector()
		: _start(NULL)
		, _finish(NULL)
		, _endOfStorage(NULL)
	{}

	Vector(const Vector& v)
	{
		_start = new T[v.Capacity()];
		//    
	
		if (Type::NowType().Get())
		{
			memcpy(_start, v._start, v.Size()*sizeof(T));
		}
		else
		{			
			for (size_t i = 0; i < v.Size(); ++i)
			{
				_start[i] = v._start[i];
			}
		}
		_finish = _start + v.Size();
		_endOfStorage = _start + v.Capacity();
	}

	Vector& operator=(const Vector& v)
	{
		if (this != &v)
		{
			T* tmp = new T[v.Capacity()];

			//    

			if (Type::NowType().Get())
			{
				memcpy(tmp, v._start, v.Size()*sizeof(T));
			}
			else
			{
				for (size_t i = 0; i < v.Size(); ++i)
				{
					tmp[i] = v._start[i];
				}
			}

			delete[] _start;
			_start = tmp;
			_finish = _start + v.Size();
			_endOfStorage = _start + v.Capacity();

		}
		return *this;
	}

	~Vector()
	{
		delete[] _start;
		_start = NULL;
		_finish = NULL;
		_endOfStorage = NULL;
	}

	void PushBack(const T& x)
	{
		CheckCapacity();
		*_finish = x;
		_finish++;
	}

	Iterator Insert(Iterator Pos, const T& x)
	{
		assert(Pos);

		CheckCapacity();
		size_t size = Pos - _start;
		for (size_t i = Size(); i>size; --i)
		{
			_start[i] = _start[i-1];
		}
		*Pos = x;
		_finish++;

		return Pos;
	}

	Iterator Erase(Iterator Pos)
	{
		assert(Pos >= _start&& Pos <= _finish);

		size_t size = Pos - _start;
		for (size_t i = size; i