d-major 0.0.0

Traverse directory trees in parallel, using relative entries to minimize allocation and maximize parallelism.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50

/*
 * Description: Traverse directory trees in parallel, using relative entries to minimize allocation
 * and maximize parallelism.
 *
 * Copyright (C) 2025 d@nny mc² <dmc2@hypnicjerk.ai>
 * SPDX-License-Identifier: LGPL-3.0-or-later
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published
 * by the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License
 * along with this program.  If not, see <https://www.gnu.org/licenses/>.
 */

//! Traverse directory trees in parallel, using relative entries to minimize allocation and
//! maximize parallelism.

/* Ensure any doctest warnings fail the doctest! */
#![doc(test(attr(deny(warnings))))]
/* #![warn(missing_docs)] */
#![cfg_attr(docsrs, feature(doc_auto_cfg))]
#![cfg_attr(feature = "nightly", feature(io_const_error))]
#![cfg_attr(feature = "nightly", feature(raw_os_error_ty))]
#![cfg_attr(feature = "nightly", feature(maybe_uninit_write_slice))]
#![cfg_attr(feature = "nightly", feature(dir_entry_ext2))]

pub mod c_string;
pub mod crawl;
pub mod errno;
pub(crate) mod handles;
pub(crate) mod libc_imports;
#[deny(missing_docs)]
pub mod null_term_str;
pub mod vfs;
pub mod visit;

/// See [`usize`](primitive@usize).
/// See [`slice`](primitive@slice).
pub mod std_docs {
  pub use ::memchr;
  pub use ::parking_lot;
  pub use ::std::{cell, iter, os::fd, pin};
}