devela/data/list/link/
mod.rs

1// devela::data::list::link
2//
3//! Linked lists.
4//!
5//! Linked lists are sequentially accessed, homogeneous data structures.
6//!
7//! They enable efficient insertion and deletion at any position,
8//! storing a sequence of elements of the same type, each pointing to the next.
9//
10
11mod r#const;
12mod reexports;
13
14crate::items! { // structural access: _mods, _all, _always
15    #[allow(unused)]
16    pub use _mods::*;
17
18    mod _mods { #![allow(unused)]
19        pub use super::{r#const::*, reexports::*};
20        // WIPZONE
21        // pub use super::l1::*;
22        // pub use super::l2::*;
23    }
24    pub(super) mod _all {
25        #[doc(inline)]
26        pub use super::_mods::*;
27    }
28    pub(super) mod _always { #![allow(unused)]
29        pub use super::{r#const::*, reexports::*};
30    }
31}
32// WIPZONE
33// #[cfg(_list1··)]
34// mod l1;
35// #[cfg(_list2··)]
36// mod l2;