Slide 87
Slide 87 text
What Do You Mean by “Cache Friendly”? – NDC{TechTown} 2020 © Björn Fahller @bjorn_fahller 87/
typedef uint32_t (*timer_cb)(void*);
struct timer_data {
uint32_t deadline;
uint32_t id;
void* userp;
timer_cb callback;
};
struct timer {
uint32_t deadline;
uint32_t id;
};
std::vector timeouts;
uint32_t next_id = 0;
timer schedule_timer(uint32_t deadline, timer_cb cb, void* userp)
{
timer_data element{deadline, next_id, userp, cb};
auto i = std::lower_bound(timeouts.begin(), timeouts.end(),
element, is_after);
timeouts.insert(i, element);
return {deadline, next_id++};
}
Linear insertion
void cancel_timer(timer t) {
timer_data element{t.deadline, t.id, nullptr, nullptr};
auto [lo, hi] = std::equal_range(timeouts.begin(), timeouts.end(),
element, is_after);
auto i = std::find_if(lo, hi,
[t](const auto& e) { return e.id == t.id; });
if (i != hi) {
timeouts.erase(i);
}
}