std::multiset<int>::const_iterator
86 else if(value >= *
_itMedian&& sz % 2 != 0) {
101 if(value <= *
_itMedian&& sz % 2 == 0) {
108 else if(value >= *
_itMedian&& sz % 2 != 0) {
165*next(window.begin(),
167 if(window.size() % 2 != 0) {
170 return0.5f * median +
1710.5f * *next(window.begin(), window.size() / 2 - 1);
182static void test(
conststd::vector<int> &vals,
intwindowSize) {
184 for(
const autoval : vals) {
185windowedMedian.
insert(val);
198 test({1, 2, 3, 4, 5, 6, 7, 8, 9},
200 test({9, 8, 7, 6, 5, 4, 3, 2, 1},
202 test({9, 8, 7, 6, 5, 4, 5, 6}, 4);
203 test({3, 3, 3, 3, 3, 3, 3, 3, 3}, 3);
204 test({3, 3, 3, 3, 7, 3, 3, 3, 3}, 3);
205 test({4, 3, 3, -5, -5, 1, 3, 4, 5},
211 test({470211272, 101027544, 1457850878, 1458777923, 2007237709, 823564440,
2121115438165, 1784484492, 74243042, 114807987},
216std::srand(
static_cast<unsigned int>(std::time(
nullptr)));
217std::vector<int> vals;
218 for(
inti = 8; i < 100; i++) {
221((RAND_MAX + 5u) / 20);
2231 + std::rand() / ((RAND_MAX + 3u) /
227 for(
inti = 0; i < n; i++) {
231 test(vals, windowSize);
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4