large refactoring

src/obikphylo/src/siblings/family_scan.rs

@@ -76,7 +76,7 @@ const FAMILY_BATCH: usize = 65536;
 
 /// Restricts [`scan_layer_families`] to a subset of a layer's families,
 /// identified by their iteration-order index — see
-/// `docmd/architecture/siblings.md`, "`--subsample`/`--shannon`", for why:
+/// `DevDocMD/architecture/siblings.md`, "`--subsample`/`--shannon`", for why:
 /// bounding which families actually pay the expensive cross-partition
 /// resolution cost is what makes a sampled run cheap on an index far larger
 /// than the sample itself. `All` (the default for every pre-existing
@@ -145,7 +145,7 @@ struct SourceBatch {
     start_family_idx: usize,
     /// One entry per minorant family in this batch, straight from
     /// `iter_minorants_batch` — `order` (iteration-order index, not an MPHF
-    /// slot; see `docmd/architecture/siblings.md`), `kmer`, and `mask`
+    /// slot; see `DevDocMD/architecture/siblings.md`), `kmer`, and `mask`
     /// already carried through, no second annex read.
     entries: Vec<SiblingEntry>,
     _permit: ThrottleGuard,
@@ -207,7 +207,7 @@ pub(super) fn scan_layer_families(
 
     // Streamed straight from `iter_minorants_batch` (zips this layer's own
     // `iter_kmers()` with the annex, both in iteration order — never an
-    // MPHF slot; see `docmd/architecture/siblings.md`) — never collected
+    // MPHF slot; see `DevDocMD/architecture/siblings.md`) — never collected
     // into a `Vec` first: a layer can hold billions of k-mers, so
     // materialising every minorant family up front is exactly the memory
     // blowup an earlier version of this traversal was rewritten to avoid