Crates.io | ksq |
lib.rs | ksq |
version | 0.1.1 |
source | src |
created_at | 2024-11-27 21:52:17.691534 |
updated_at | 2024-11-28 04:54:23.242293 |
description | implementation of a k-2 tree |
homepage | https://github.com/paultag/ksq-rs |
repository | |
max_upload_size | |
id | 1463675 |
size | 36,593 |
ksq
is an implementation of a K2 tree (k²-tree), which, when storing sparse
bits, is a very space-effective matrix. This library implements the tree as a
flat 1-d array, rather than explicitly encoding dimensionality.
Unlike some other k2 trees, I've opted to use a u16
, not a u8
. This means
that the tree will grow by N<<4
each layer -- and each cell can represent a
maximum of 16 other cells, not 8. This may change in the future.