| [Overview][Types][Classes][Index] |
[Properties (by Name)] [Methods (by Name)] [Events (by Name)]
Source position: lazlistclasses.pas line 372
public |
||
procedure Create(); |
|
|
end; |
|
||
| ? |
The first element of the list can be anywhere within the allocated memory (capacity). If the elements of the list reach the end of the memory, the list will wrap around and continues in the available memory at the start of the allocation.
This list can be used for a first-in, first-out queue. If the list does never exceed the size set by its capacity, then elements can be pushed/shifted from/to the list without any need to reallocate or move entries to new locations.
| Version 4.0 | Generated 2025-05-03 | Home |