for (int i = 2; i < 2 + count; ++i) {
for( unsigned int i = 2; i < 2 + count; ++i ) {
	inline void remove(const cItem *item) {		bool found = false;		size_t count = this->count();		// Iterate trough all items.		for (int i = 2; i < 2 + count; ++i) {						if (content[i] != item) {				continue; // Skip this item			}			// We found the item we want to remove here			// What we do now is seek ahead and write all following items in the array			// one index downwards			for (int j = i + 1; j < 2 + count; ++j) {				content[j - 1] = content[j]; // Swap Values			}			found = true;			break; // It's insured that there is only once instance of an item here		}		if (found)  {			ensureCapacity(count - 1); // Decrease itemcount		}	}