UnrolledList.front

Time complexity is O(1)

struct UnrolledList(T, Allocator = Mallocator, bool supportGC = shouldAddGCRange!T, size_t cacheLineSize = 64)
inout(T)
front
inout @property
(
)
in { assert (!empty); assert (_front.registry != 0); }

Return Value

Type: inout(T)

the item at the front of the list

Meta