aList->insert_after_element (ul_oocbs)

	new_tag.i4.v = insert_after_element(aList.s.r, item.g.r, size.i4.v,
	                                    element_number.i4.v, tag.i4.v)

	This method inserts an element immediately after the specified element.
	If the specified element is greater than the number of elements, the
	new node is appended at the tail. Elements are numbered beginning at
	one, so that specifying element zero causes the new element to be
	prepended at the head.
	The aList class actually allocates new space in which to store
	the data item, and makes its own copy of it, so that the original
	does not need to be kept after it has been inserted into the aList.

	aList              a pointer to the aList (structure of type aList)
	item              a pointer (of any type) to the item to be stored
	size              the size of the item (in bytes)
	element_number    the index into the aList (or position in the aList)
	                  corresponding to the item after which the
	                  new item is to be inserted into the aList
	tag               a unique (across the invocation of the program)
	                  tag which can be used for the retrieval of this
	                  item

	This function returns:

	an integer tag which can be used for subsequent pseudo-random
	retrieval of the item stored in the aList. (This is the same
	tag that was passed as the last argument.)

	Use of this class requires the following header files:

	aList.h

	Related functions:

	create_aList()     the constructor for instances of the aList class

	C/C++ usage:

	#include "aList.h"
	aList	*aList;
	int	item;
	int	length;
	int	element;
	int	new_tag;

	new_tag = (*aList->insert_after_element)(aList,(void *) &item,
	                                         sizeof(item),element,tag);