private Combo findChunk(int index) {
		boolean b = true;
		
		boolean startFirst = startFirst(index);
		
		int count;
		
		Chunk current;
		
		// This isn't 100% optimal, because the size of the chunks can be different, but it's not bad anyway
		if (startFirst) {
			count = 0;
			current = firstChunk;
		} else {
			count = size;
			current = lastChunk;
		}

		while (b) {
			if (startFirst) {
				if (count + current.getUsed() > index) {
					b=false;
				} else {
					count = count + current.getUsed();
				}
			} else {
				if (count - current.getUsed() < index) {
					b=false;
				} else {
					count = count - current.getUsed();
				}
			}
		}
		
		int position;
		
		if (startFirst) {
			position = index - count;
		} else {
			position = count - (current.getUsed() - index); // TODO pas bon...
		}
		
		return new Combo(current, position);
	}