collections-d 0.1.0-alpha
Advanced containers for D
To use this package, run the following command in your project's root directory:
Manual usage
Put the following dependency into your project's dependences section:
collections-d
Advanced data containers for D.
Currently available containers
SortedList
An array-backed data structure that enforces the elements stored within itself to be in order. This eliminates the need for frequent reordering if a regular array was used. Has optimizations to reduce the search and insertion times.
Has random access for indexing, elements can be only put into the list with the put()
function.
Order can be set with a boolean in the template, which will reverse the order of elements.
Using as a sorted set
The template of the SortedList can disable duplicates, which will also enable certain functions, like removal by element.
TreeMap
Implements an AVL-tree backed associative array. Automatically rebalances itself after each insertion and removal, if imbalance is greater or equal than 2. The more elements the tree has, the better the optimization will be.
Accessing is done through keys, and accessing an n-th element needs some computation.
Tree traversal done through opApply()
and opApplyReverse()
functions, accessing elements in order when iterated with foreach
or foreach_reverse
.
To keep development simple, left hand side is fixed to be the lesser side.
Behavior is changed if E set to void, in that case keys will be the only way the TreeMap stores data, like a regular AVL-tree.
- 0.1.0-alpha released 4 years ago
- ZILtoid1991/collections-d
- Boost
- Copyright © 2020, laszl
- Authors:
- Dependencies:
- none
- Versions:
-
0.5.1 2023-Oct-18 0.5.0 2023-Apr-16 0.4.7 2022-Oct-11 0.4.6 2022-Oct-03 0.4.5 2021-Sep-21 - Download Stats:
-
-
0 downloads today
-
1 downloads this week
-
4 downloads this month
-
218 downloads total
-
- Score:
- 1.0
- Short URL:
- collections-d.dub.pm