Function fxResizeEntries

xs/sources/xsMapSet.c:1162–1220

}

void fxResizeEntries(txMachine* the, txSlot* table, txSlot* list) 
{
	txSize size = list->next->value.integer;
	txSize formerLength = table->value.table.length;
	txSize currentLength = formerLength;
	txSize high = mxTableThreshold(formerLength);
	txSize low = mxTableThreshold(formerLength) >> 1;
	if (high < size) {
		currentLength = formerLength << 1;
		if (currentLength > mxTableMaxLength)
			currentLength = mxTableMaxLength;
	}
	else if (low >= size) {
		currentLength = formerLength >> 1;
		if (currentLength < mxTableMinLength)
			currentLength = mxTableMinLength;
	}
	if (formerLength != currentLength) {
		txSlot** currentAddress = (txSlot**)fxNewChunk(the, currentLength * sizeof(txSlot*));
		if (currentAddress) {
			txSlot** formerAddress = table->value.table.address;

            txSize currentMask = currentLength - 1;
			c_memset(currentAddress, 0, currentLength * sizeof(txSlot*));
			while (formerLength) {
				txSlot* entry;
				while ((entry = *formerAddress)) {
					txU4 index = entry->value.entry.sum & currentMask;
					 *formerAddress = entry->next;
					entry->next = currentAddress[index];
					currentAddress[index] = entry;
				}
				formerLength--;
				formerAddress++;
			}
			table->value.table.address = currentAddress;
			table->value.table.length = currentLength;
		}
	}
// 	{
// 		txSize holes = 0;
// 		txSize collisions = 0;
// 		txSize i = 	0;
// 		while (i < table->value.table.length) {
// 			txSize j = 0;
// 			txSlot* entry = table->value.table.address[i];
// 			while (entry) {
// 				j++;
// 				entry = entry->next;
// 			}
// 			if (j == 0)
// 				holes++;
// 			else if (collisions < j)
// 				collisions = j;
// 			i++;
// 		}
// 		fprintf(stderr, "# size %d capacity %d holes %d collisions <%d\n", size, table->value.table.length, holes, collisions);
// 	}