Multi depth pointer based Triangle List

This is used for store data as elements and treat them with indices in maximized speed.
Subtraction of middle-indexed element will not cause pushing of backward elements. Specified index of an element will remain until Sub() is called.

-Technical Time Complexity-

Get() : If TotalBufferAllocated < Capacity Then 1(with existing bit check, 2),
else, log capacity ElementCount (the higher capacity, the extremely faster access speed)

Add() : 1(always finds empty index at once). with setting existing bit, 2.

Sub() : 1. For stacking sub index, about 2. Including deletion of existing bit, 3.

Contact me to jpjps@naver.com