Cycle cost

[origyndev]

Have you done an analysis of how this differs in cycle cost from a normal buffer?

Suggestion: create function that adds nats to a buffer and a stable buffer from iter.range(0…n) and see how many you can stuff in before hitting the cycle limit for each type.

[ByronBecker]

I have not yet done a cycle cost analysis of this, although it follows that the cycle cost should be identical to that of the Buffer library in motoko-base.

I would not recommend using this data structure if you are planning on stuffing a large amount of data into it due to the array doubling costs. In this case, it may make more sense to use a LinkedList or a different data structure that better handles batch inserts (like an array of arrays)