| 42 | return pos; |
| 43 | } |
| 44 | void seek_to(uint64_t _pos) { |
| 45 | if (pos > _pos || |
| 46 | (iter != parent->seeds.end() && _pos >= iter->first)) { |
| 47 | iter = parent->seeds.upper_bound(_pos); |
| 48 | --iter; |
| 49 | current_state = iter->second; |
| 50 | current_val = rand_r(¤t_state); |
| 51 | pos = iter->first; |
| 52 | ++iter; |
| 53 | } |
| 54 | while (pos < _pos) ++(*this); |
| 55 | } |
| 56 | |
| 57 | void seek_to_first() { |
| 58 | seek_to(0); |
no test coverage detected