large refactoring

src/obikentropy/build.rs

@@ -14,7 +14,7 @@ fn build_n_log_n() -> [f64; K_MAX + 1] {
 
 /// Max achievable entropy over `4^ws` raw sub-words given only `nwords`
 /// observations (most-uniform integer partition), per
-/// `docmd/theory/entropy.md`.
+/// `DevDocMD/theory/entropy.md`.
 fn build_emax() -> [[f64; WS_MAX + 1]; K_MAX + 1] {
     let mut t = [[0.0f64; WS_MAX + 1]; K_MAX + 1];
     for k in 2..=K_MAX {

src/obikentropy/src/lib.rs

@@ -1,7 +1,7 @@
 //! Normalized k-mer entropy: formulas, tables, and a streaming tracker.
 //!
 //! This crate holds every piece of the entropy computation described in
-//! `docmd/theory/entropy.md`: the compile-time tables ([`table`], private),
+//! `DevDocMD/theory/entropy.md`: the compile-time tables ([`table`], private),
 //! the incremental accumulator ([`EntropyTracker`]) that callers compose
 //! into their own streaming state, and the [`KmerEntropy`] convenience trait
 //! for scoring a single, already-built k-mer.

src/obikentropy/src/table.rs

@@ -1,5 +1,5 @@
 //! Compile-time tables backing the normalized k-mer entropy formula: the
-//! max-entropy correction for small samples. See `docmd/theory/entropy.md`.
+//! max-entropy correction for small samples. See `DevDocMD/theory/entropy.md`.
 //!
 //! Entropy is computed directly on raw (non-canonicalized) sub-words — no
 //! equivalence-class folding. Empirically (see the discussion that produced

src/obikentropy/src/tracker.rs

@@ -2,7 +2,7 @@
 //!
 //! [`EntropyTracker`] maintains, over a sliding window of the last `k` bases,
 //! the per-sub-word-size raw-word frequency statistics needed to evaluate
-//! the corrected Shannon entropy described in `docmd/theory/entropy.md`,
+//! the corrected Shannon entropy described in `DevDocMD/theory/entropy.md`,
 //! updated in O(1) per base rather than recomputed from scratch. No
 //! canonicalization is applied — each sub-word is tallied under its own raw
 //! 2-bit-packed value; only the small-sample max-entropy correction departs