[This topic is pre-release documentation and is subject to change in future releases. Blank topics are included as placeholders.]

Tries to ensure that we are using a list that supports O(1) random access lookups. In short, the requestor wants to ensure that they do not pay a penalty for requesting data anywhere in the list. This can be a problem if the list is represented as a linkedlist or other such structure where lookup time can be proportional to length.

Namespace: net.esper.compat
Assembly:   NEsper (in NEsper.dll)

Syntax

Visual Basic (Declaration)
Public Shared Function RandomAccessList(Of T) ( _
	baseList As IList(Of T) _
) As IList(Of T)
C#
public static IList<T> RandomAccessList<T> (
	IList<T> baseList
)
Visual C++
public:
generic<typename T>
static IList<T>^ RandomAccessList (
	IList<T>^ baseList
)

Parameters

baseList
System.Collections.Generic.IList<(Of T>)

Return Value

Type Parameters

T