devela/data/list/queue/
mod.rs

1// devela::data::list::queue
2//
3//! Homogeneous data structures that process elements in
4//! <abbr title="First-In, First-Out">FIFO</abbr> order.
5//!
6//! Elements are typically added at one end (the "tail" or "back")
7//! and removed from the other (the "head" or "front").
8//!
9//! Variants like double-ended queues (deques) allow insertion and removal
10//! at both ends, providing additional flexibility.
11//
12
13mod adt;
14#[cfg(_destaque··)]
15mod destaque;
16mod reexports;
17
18crate::items! { // structural access: _mods, _all, _always
19    #[allow(unused)]
20    pub use _mods::*;
21
22    mod _mods { #![allow(unused)]
23        pub use super::{adt::*, reexports::*};
24
25        #[cfg(_destaque··)]
26        pub use super::destaque::_all::*;
27        // WIPZONE
28        // pub use super::destaque_define::_all::*;
29    }
30    pub(super) mod _all { #![allow(unused)]
31        #[doc(inline)]
32        pub use super::_mods::*;
33    }
34    pub(super) mod _always { #![allow(unused)]
35        pub use super::{adt::*, reexports::*};
36    }
37}
38// WIPZONE
39// mod destaque_define; // WIP: