Get the object at the specified ordinal position. If the index was greater than the size of the collection then this asserts.
The object accessed in this way is remembered by the class and further access will be fast. Access to elements one either side of that saved element, and the head and tail of the list, will always be fast.
Here is the call graph for this function: