Enhanced C#
Language of your choice: library documentation
|
Enumerates through a VList from index 0 up to index Count-1. More...
Enumerates through a VList from index 0 up to index Count-1.
Normally, enumerating the list takes O(Count + log(Count)^2) = O(Count) time. However, if the list's block chain does not increase in size exponentially (due to the way that the list has been modified in the past), the search can have worse performance; the worst case is O(n^2), but this is unlikely. FVList's Enumerator doesn't have this problem because it enumerates in the other direction.
Public fields | |
ushort | _localIndex |
ushort | _localCount |
VListBlock< T > | _curBlock |
VListBlock< T > | _nextBlock |
FVList< T > | _outerList |
Properties | |
T | Current [get] |
object System.Collections.IEnumerator. | Current [get] |
Public Member Functions | |
Enumerator (VList< T > list) | |
Enumerator (VList< T > list, VList< T > subList) | |
Enumerator (FVList< T > list) | |
Enumerator (FVList< T > list, FVList< T > subList) | |
bool | MoveNext () |
void | Reset () |
void | Dispose () |