Clean and fast binary search tree ('B-Tree') implementation suitable for usage in fast on disk storage engines for providing fast and as direct as possible access on items.
felixklauke/arya
Clean and fast binary search tree ('B-Tree') implementation suitable for usage in fast on disk storage engines for providing fast and as direct as possible access on items.
C++MIT