#tree #data-structures #doubly-linked

dltree

Doubly linked tree with leaf-considering typing

6 releases

0.1.5 Nov 7, 2021
0.1.4 Nov 2, 2021
0.1.1 Oct 31, 2021

#197 in #data-structure

MIT/Apache

21KB
477 lines

Crates.io Docs Actions Status grcov

dltree

About

dltree is a library that provides a doubly linked tree with leaf-considering typing.

Current state

The current implementation is well tested but far from being final. Several future changes will be implemented until the first stable version 1.0:

  • Add documentation to all public structures and methods
  • Remove all panicking elements and return Result<T,E> instead
    • Inserting and removing elements may panic. This will only happen if the tree integrity is violated. This is a library bug and therefore a panic is appropriate here.
  • Add missing methods like insertion of children (in addition to just pushing)
  • Reevaluate the mutability of all methods
  • Add concise documentation how to use dltree in README.md

So please keep in mind that the interface and behaviour may change over time until version 1.0.

Donation

dltree is a purely private project and does not follow any commercial interests. If you still want to support my work, you are welcome to do so with a small donation:


You can make donations via IOTA anonymously, instantly and without any fees:

iota1qpmzj0hwmykcxwj9s80e5u7tpeuwpzh9ta8q5k5fj754wsxfq0afu8hrzax


No runtime deps