v0.8.6: update indicator docs, ndepend tooling, ALMA refactor, gitignore cleanup

lib/numerics/minindex/Minindex.md

@@ -12,11 +12,9 @@
 | **Warmup**       | `period` bars                          |
 
 - MININDEX finds the position (index) of the minimum value within a rolling lookback window.
-- Parameterized by `period` (minimum 2).
 - Streaming mode outputs bars-ago offset (0 = current bar holds the min, period-1 = oldest bar).
 - Batch span mode outputs absolute array indices (TA-Lib MININDEX compatible).
 - Tie-breaking: last occurrence wins (most recent bar, `<=` comparison).
-- Requires `period` bars of warmup before first valid output (IsHot = true).
 - Cross-validation: `source[Minindex.Batch[i]] == Lowest.Batch[i]` for all bars after warmup.
 
 MININDEX identifies the position of the minimum value within a rolling window. While LOWEST tells you the trough *value*, MININDEX tells you *where* that trough is relative to the current bar. This is essential for support analysis, timing studies, and detecting how "stale" a low is.
@@ -162,4 +160,4 @@ Streaming uses a linear scan of the RingBuffer, which is O(period) per bar — a
 
 - TA-Lib: MININDEX function documentation.
 - Lemire, Daniel. (2006). "Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element."
-- Tarjan, Robert E. (1985). "Amortized Computational Complexity." SIAM Journal on Algebraic Discrete Methods.
+- Tarjan, Robert E. (1985). "Amortized Computational Complexity." SIAM Journal on Algebraic Discrete Methods.