#linked-list #slab #queue #deque #memory-management

slabigator

A linked list that doesn't do dynamic memory allocations

10 releases

0.9.2 Mar 17, 2024
0.9.1 Sep 8, 2023
0.2.0 Aug 9, 2022
0.1.6 Aug 9, 2022
0.1.4 Jun 30, 2022

#421 in Data structures

Download history 246/week @ 2023-12-18 188/week @ 2024-01-01 221/week @ 2024-01-08 359/week @ 2024-01-15 379/week @ 2024-01-22 243/week @ 2024-01-29 351/week @ 2024-02-05 257/week @ 2024-02-12 428/week @ 2024-02-19 526/week @ 2024-02-26 249/week @ 2024-03-04 446/week @ 2024-03-11 634/week @ 2024-03-18 140/week @ 2024-03-25 706/week @ 2024-04-01

1,938 downloads per month
Used in 2 crates

MIT/Apache

19KB
451 lines

CI

Slabigator

A linked list that doesn't do dynamic memory allocations.

Things it was designed to do:

  • Add to the head of the list in O(1) - What you get back is a stable slot number
  • Pop from the tail of the list in O(1)
  • Delete an element given its slot number in O(1)
  • And nothing else.

Dumb, small, maintainable, zero dependencies.

Cargo features:

  • releasefast: assume that remove() will always be called with a valid index. This saves some memory, but has to be used with extreme caution. That feature is not set by default.
  • slot_u32: use u32 as the slot type (default)
  • slot_u64: use u64 as the slot type
  • slot_usize: use usize as the slot type

No runtime deps