This implementation will reduce the use of heap by elimininating Box<> from the individual iterators but it will still need heap for maintaining a vector of iterators from nodes.
18 lines
348 B
Rust
18 lines
348 B
Rust
#![feature(round_char_boundary)]
|
|
#![feature(exit_status_error)]
|
|
#![feature(trait_alias)]
|
|
// TODO: #![warn(missing_docs)]
|
|
|
|
#[cfg(feature = "compare")]
|
|
pub mod compare;
|
|
|
|
mod context;
|
|
mod error;
|
|
mod iter;
|
|
pub mod parser;
|
|
pub mod types;
|
|
|
|
pub use context::FileAccessInterface;
|
|
pub use context::GlobalSettings;
|
|
pub use context::LocalFileAccessInterface;
|