#linked-list #slab #deque #queue #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

#548 in Data structures

Download history 380/week @ 2024-01-21 240/week @ 2024-01-28 339/week @ 2024-02-04 269/week @ 2024-02-11 428/week @ 2024-02-18 523/week @ 2024-02-25 243/week @ 2024-03-03 403/week @ 2024-03-10 676/week @ 2024-03-17 151/week @ 2024-03-24 613/week @ 2024-03-31 176/week @ 2024-04-07 338/week @ 2024-04-14 270/week @ 2024-04-21 467/week @ 2024-04-28 224/week @ 2024-05-05

1,307 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