CircularList.addAt

Time complexity: O(size() + number of elements in e)

CircularList addAt(size_t index, V element)
size_t addAt(size_t index, IContainer!(V) e)
class CircularList(V, alias Reap = Container.reap, alias Heap = Container.DefaultCollect)
final
size_t
addAt
(
size_t index
,
IContainer!(V) e
)

Meta

Source

See Implementation

ocean util container CircularList CircularList aliases

Type

constructors

this

destructors

~this

functions