forked from pierotofy/OpenSplat
-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.hpp
61 lines (51 loc) · 1.42 KB
/
utils.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#ifndef UTILS_H
#define UTILS_H
#include <vector>
#include <algorithm>
#include <random>
#include <iostream>
#include <thread>
#include <functional>
template <typename T>
class InfiniteRandomIterator
{
using VecType = std::vector<T>;
public:
InfiniteRandomIterator(const VecType &v) : v(v), engine(42) {
shuffleV();
}
void shuffleV(){
std::shuffle(std::begin(v), std::end(v), engine);
i = 0;
}
T next(){
T ret = v[i++];
if (i >= v.size()) shuffleV();
return ret;
}
private:
VecType v;
size_t i;
std::default_random_engine engine;
};
template <typename IndexType, typename FuncType>
void parallel_for(IndexType begin, IndexType end, FuncType func) {
size_t range = end - begin;
if (range <= 0) return;
size_t numThreads = (std::min)(static_cast<size_t>(std::thread::hardware_concurrency()), range);
size_t chunkSize = (range + numThreads - 1) / numThreads;
std::vector<std::thread> threads;
for (unsigned int i = 0; i < numThreads; i++) {
IndexType chunkBegin = begin + i * chunkSize;
IndexType chunkEnd = (std::min)(chunkBegin + chunkSize, end);
threads.emplace_back([chunkBegin, chunkEnd, &func]() {
for (IndexType item = chunkBegin; item < chunkEnd; item++) {
func(*item);
}
});
}
for (std::thread& t : threads) {
t.join();
}
}
#endif