# lseq-between

**Repository Path**: mirrors_marcelklehr/lseq-between

## Basic Information

- **Project Name**: lseq-between
- **Description**: Sort sequences without re-indexing on insert :sparkles:
- **Primary Language**: Unknown
- **License**: MIT
- **Default Branch**: master
- **Homepage**: None
- **GVP Project**: No

## Statistics

- **Stars**: 0
- **Forks**: 0
- **Created**: 2020-09-25
- **Last Updated**: 2026-07-19

## Categories & Tags

**Categories**: Uncategorized

**Tags**: None

## 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