Function AR_INSERT

src/arithmetic/list_funcs/list_funcs.c:509–558

given a list, return a list after inserting given value at a given position list.insert(list, idx, val, dups = TRUE) -> list RETURN list.insert([0, 1], 0, 2) -> [2, 0, 1]

// list.insert(list, idx, val, dups = TRUE) -> list
// RETURN list.insert([0, 1], 0, 2) -> [2, 0, 1]
SIValue AR_INSERT(SIValue *argv, int argc, void *private_data) {
	SIValue list = argv[0];
	if(SI_TYPE(list) == T_NULL) {
		return SI_NullVal();
	}

	SIValue val = argv[2];
	if(SI_TYPE(val) == T_NULL) {
		// in the case where the added value is NULL
		// simply return a clone of the list unmodified
		return SIArray_Clone(list);
	}

	int32_t  index    = (int32_t)SI_GET_NUMERIC(argv[1]);
	uint32_t arrayLen = SIArray_Length(list);
	if(!normalize_index(&index, arrayLen, true)) {
		// index out of bounds, simply return a clone of the list unmodified
		return SIArray_Clone(list);
	}

	bool allow_dups = true;  // default value
	if(argc == 4) {
		allow_dups = SIValue_IsTrue(argv[3]);
	}

	if(!allow_dups && SIArray_ContainsValue(list, val, NULL)) {
		// caller requested no duplicates
		// if value already exists in list return the original list
		return SIArray_Clone(list);
	}

	// we're guarantee value will be added
	// allocate a new array
	SIValue array = SI_Array(arrayLen + 1);

	// append elements up to index
	for(uint i = 0; i < index; i++) {
		SIArray_Append(&array, SIArray_Get(list, i));
	}

	// append new value
	SIArray_Append(&array, val);

	// append remaining elements
	for(uint i = index; i < arrayLen; i++) {
		SIArray_Append(&array, SIArray_Get(list, i));
	}

	return array;
}

static dict *_list2dict
(