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
Features
- Management with index of elements
- Very very fast in technically
License
BSD LicenseFollow Multi depth pointer based Triangle List
Other Useful Business Software
Go From AI Idea to AI App Fast
Access Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Multi depth pointer based Triangle List!