#linked-list #dynamically-sized #node #hold #dyn #allocator #data

nightly no-std dyn_list

A linked list that can hold dynamically sized values in its nodes

2 unstable releases

0.1.0 Dec 22, 2024
0.0.0 Dec 13, 2024

#739 in Data structures

Download history 142/week @ 2024-12-11 104/week @ 2024-12-18 22/week @ 2024-12-25

268 downloads per month

MIT/Apache

105KB
2.5K SLoC

DynList

A linked list that can have dynamically sized types in its nodes.

use core::fmt::Debug;
use dyn_list::DynList;

let mut list = DynList::<dyn Debug>::new();

list.push_back_unsize("Hello, World");
list.push_back_unsize(0);
list.push_back_unsize([1, 2, 3, 4]);

println!("{list:?}"); // ["Hello, World!", 0, [1, 2, 3, 4]]

This crate currently only works on the nightly channel.

How Does it Work?

Each node has a header, containing pointers to the previous and next nodes as well as metadata for the data. This is modelled after ThinBox. For Sized types, this works exactly like a regular linked list.

Features

  • alloc - Adds features that require the alloc crate. This includes operations specific to the Global allocator and sets it as the default allocator in generics.
  • std (requires alloc, default) - Adds features that require the std crate. Currently, this adds nothing, but disabling it enables the no_std attribute.

TODO

This library is still in development and breaking changes may occur.

  • Comment unsafe blocks.
  • Add tests.

License

DynList is dual-licensed under either the Apache License Version 2.0 or MIT license at your option.

No runtime deps

Features