* Allocate a pool item; possibly allocate a new block in the pool.

	 * @param first the first pool item to start searching

	 * @return the allocated pool item (or NULL when the pool is full).

	 */

	static T *AllocateRaw(uint &first)

	{

		for (T *t = Tpool->Get(first); t != NULL; t = (t->index < last_minus_one) ? Tpool->Get(t->index + 1U) : NULL) {

			if (!t->IsValid()) {

				first = t->index;

				Tid index = t->index;