Lib.rs

A simple ring buffer tailored for maintaining sorted data. A typical usecase is when handling almost-chronological data that might be slightly off.

The name halo is already taken on crates.io, and kirkos is the Greek for circle, so here we are.

lib.rs:

A heap-allocated ring buffer targeted for sorted data using only core features.

The buffer can retrieve a contiguous slice on demand with no additional copies. It supports slicing and insertion for comparable elements. Insertion only discards older elements when necessary and moves the minimum number of elements. Sorting is also available.