[Feature Request] Apply more efficient allocate algorithm in vector

[iosmanthus]

Currently, our vector is too simple and have really bad performance in push/pop because we need to reallocate resource and execute memcpy when we add a new element to the end of the vector. Dynamic tables described in CLRS may be feasible in this situation.

0xffff-lib/src/collections/vector.h

Lines 59 to 70 in 5aa0f1c

	template <typename T>
	void Vec<T>::push(T data)
	{
	T* new_buf = new T[this->len + 1];
	std::copy(this->buf, this->buf + this->len, new_buf);
	new_buf[this->len] = data;
	delete[] this->buf;
	this->buf = new_buf;
	this->len++;
	}