tuxmain/median-accumulator
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

v0.3.0

Browse source
This commit is contained in:
Pascal Engélibert 2024-03-15 20:15:21 +01:00
commit 7c73d32ffa
5 changed files with 32 additions and 44 deletions
Download patch file Download diff file Expand all files Collapse all files

7
README.md
View file

@ -7,11 +7,10 @@ Simple, space-efficient algorithm to compute the median of an accumulation of el
* **Space-efficient**: `O(D)` space, D being the number of _different_ samples, not the _total_ number of samples
* **Time-efficient**: push is `O(log(N))`
* **Generic**: `T: Clone + Ord`
* **Tested**
* **No unsafe**, no deps
* **No unsafe**
* **no_std** (optional): supports generic collections
Faster than other implementations if there are samples having the same value. If this is not your case, you should use another implementation.
Faster than other implementations if lots of samples have the same value. If this is not your case, you should use another implementation.
## Use
@ -45,7 +44,7 @@ For other collections than `Vec` or `SmallVec`, you must implement [cc-traits](h
## License
CopyLeft 2022-2023 Pascal Engélibert [(why copyleft?)](https://txmn.tk/blog/why-copyleft/)
CopyLeft 2022-2024 Pascal Engélibert [(why copyleft?)](https://txmn.tk/blog/why-copyleft/)
This program is free software: you can redistribute it and/or modify it under the terms of the GNU Affero General Public License as published by the Free Software Foundation, version 3 of the License.