gavindiaz/QuanTAlib
1
0
Fork 0
mirror of https://github.com/mihakralj/QuanTAlib.git synced 2026-08-22 12:38:06 +00:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source
This commit is contained in:
Miha Kralj
2026-03-13 13:46:52 -07:00
parent e3e9555fc1
commit c75135ab14
402 changed files with 2222 additions and 1779 deletions
Download Patch File Download Diff File Expand all files Collapse all files
lib/numerics/lowest/Lowest.md
+2 -4
View File
@@ -13,9 +13,7 @@
| **PineScript** | [lowest.pine](lowest.pine) |
- LOWEST calculates the minimum value over a rolling lookback window.
- Parameterized by `period`.
- Output range: Varies (see docs).
- Requires `period` bars of warmup before first valid output (IsHot = true).
- **Similar:** [Highest](../highest/Highest.md), [MinIndex](../minindex/Minindex.md) | **Trading note:** Rolling minimum; identifies support levels and breakdown points.
- Validated against TA-Lib, Skender, and Tulip reference implementations where available.
LOWEST calculates the minimum value over a rolling lookback window. This O(1) amortized streaming implementation uses a monotonic deque algorithm, enabling real-time updates without re-scanning the entire window. Validated against TA-Lib MIN and Tulip min functions.
@@ -149,4 +147,4 @@ For batch processing, SIMD can parallelize comparisons within segments. However,
- Tarjan, Robert E. (1985). "Amortized Computational Complexity." SIAM Journal on Algebraic Discrete Methods.
- Lemire, Daniel. (2006). "Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element."
- TA-Lib: MIN function documentation.
- TA-Lib: MIN function documentation.