Function fxSortArrayItems

xs/sources/xsArray.c:757–933

}

void fxSortArrayItems(txMachine* the, txSlot* function, txSlot* array, txNumber LENGTH, txSlot* target)
{
	txBoolean flag = mxThis->value.reference != target->value.reference;
	txSlot* instance = C_NULL;
 	txIndex index;
    txSlot* item;
 	txIndex length;
 	txIndex size;
again:
	if (!array) {
		LENGTH = fxGetArrayLength(the, mxThis);
		if (LENGTH > 0xFFFFFFFF)
			mxRangeError("array overflow");
		mxPush(mxArrayPrototype);
		instance = fxNewArrayInstance(the);
		array = instance->next;
		item = array;
        index = 0;
		while (index < LENGTH) {
			mxPushSlot(mxThis);
			if (flag || fxHasIndex(the, index)) {
				item->next = fxNewSlot(the);
				item = item->next;
				array->value.array.length++;
				mxPushSlot(mxThis);
				mxGetIndex(index);
				mxPullSlot(item);
			}
			index++;
		}
		fxCacheArray(the, instance);
	}
	length = array->value.array.length;
	size = mxArraySize(array);
	/* like GCC qsort */
	#define CHECK \
		if (size != mxArraySize(array)) { \
			array = C_NULL; \
			goto again; \
		}
	#define COMPARE(INDEX) \
		fxCompareArrayItem(the, function, array, INDEX)
	#define COPY \
		to->next = from->next; \
		to->ID = from->ID; \
		to->kind = from->kind; \
		to->value = from->value
	#define MOVE(FROM,TO) \
		from = array->value.array.address + (FROM); \
		to = array->value.array.address + (TO); \
		COPY
	#define PUSH(INDEX) \
		from = array->value.array.address + (INDEX); \
		mxPushUndefined(); \
		to = the->stack; \
		COPY
	#define PULL(INDEX) \
		from = the->stack++; \