This is the .NET-implementation of
Clusters
used for ordering and sorting.
It has some advatages compared to the default List and Dictionary.
The List is not an array and multiple times faster.
My Index and my Map can be looked up by near-by values.
There is a package available at
nuget.org
 |
The entries are stored in groups. |
 |
The size of the groups is limited and 10 by default. |
 |
If the group is full a parent-group is created. |
 |
The first and the last entry can be moved to the neighbour-group. |
 |
The entries are moved between the groups, so all groups get as full as possible. |
 |
The number of groups is limited too, another parent-group is created. |
 |
If an entry needs to be inserted in a full group, a whole sub-tree can be moved. |
You can find detailed information in the Wiki.