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

Project Activity

See All Activity >

Categories

Communications, Email

License

BSD License

Follow Multi depth pointer based Triangle List

Multi depth pointer based Triangle List Web Site

Other Useful Business Software
Full-stack observability with actually useful AI | Grafana Cloud Icon
Full-stack observability with actually useful AI | Grafana Cloud

Our generous forever free tier includes the full platform, including the AI Assistant, for 3 users with 10k metrics, 50GB logs, and 50GB traces.

Built on open standards like Prometheus and OpenTelemetry, Grafana Cloud includes Kubernetes Monitoring, Application Observability, Incident Response, plus the AI-powered Grafana Assistant. Get started with our generous free tier today.
Create free account
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Multi depth pointer based Triangle List!

Additional Project Details

Operating Systems

Windows

Intended Audience

Other Audience

User Interface

Plugins

Programming Language

C++

Related Categories

C++ Communications Software, C++ Email Software

Registered

2012-01-19