lseq-between
v0.0.0
Published
Sort sequences using a clever allocation strategy for creating identifiers that naturally sort without reindexing when you need to insert a new item.
Downloads
7
Readme
lseq-between
Sort sequences using a clever allocation strategy for creating identifiers that naturally sort without reindexing when you need to insert a new item.
This version uses the allocation strategy first described in the following paper: https://hal.archives-ouvertes.fr/file/index/docid/921633/filename/fp025-nedelec.pdf
License
MIT