/* a d d N u m b e r  */
returnValue Indexlist_addNumber(Indexlist *_THIS, int addnumber)
/* a d d N u m b e r  */
returnValue Indexlist_addNumber(Indexlist *_THIS, int addnumber)
{
	int i, j;
	if ( _THIS->length >= _THIS->physicallength )
		return THROWERROR( RET_INDEXLIST_EXCEEDS_MAX_LENGTH );
	_THIS->number[_THIS->length] = addnumber;
	j = Indexlist_findInsert(_THIS,addnumber);
	for (i = _THIS->length; i > j+1; i--)
		_THIS->iSort[i] = _THIS->iSort[i-1];
	_THIS->iSort[j+1] = _THIS->length;
	++(_THIS->length);
	return SUCCESSFUL_RETURN;
}