You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Implement a generic data structures in Towel.Datastructures:
B tree
Skip List
Heap with dynamic priorities HeapArrayMap<TCompare, TEquate, THash>
Towel already has a HeapArray<T, TCompare>, but for dynamic priority scenarios a Map<T, int> to look up an index of a T to adjust the priority and sift up/down as necessary.
KD Tree
runtime ND Omnitree
Towel already has omnitrees that have set numbers of dimensions at compile time, but not one that has dynamic dimensions at runtime. This will be much slower than the compile time dimension safe versions, but still nice to have.
The text was updated successfully, but these errors were encountered:
ZacharyPatten
added
Good First Issue
issues that are approachable even to first time contributors
Help Wanted
issues that could use more community engagement to assist
and removed
Good First Issue
issues that are approachable even to first time contributors
Help Wanted
issues that could use more community engagement to assist
labels
Jun 6, 2021
Implement a generic data structures in
Towel.Datastructures
:HeapArrayMap<TCompare, TEquate, THash>
HeapArray<T, TCompare>
, but for dynamic priority scenarios aMap<T, int>
to look up an index of aT
to adjust the priority and sift up/down as necessary.The text was updated successfully, but these errors were encountered: