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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
use serde::{Deserialize, Serialize};
use std::time::{Duration, Instant};
use thirtyfour::support::sleep;
/// Parameters used to determine the polling / timeout behaviour.
#[derive(Debug, Serialize, Deserialize, Clone)]
pub enum ElementPoller {
/// No polling, single attempt.
NoWait,
/// Poll up to the specified timeout, with the specified interval being the
/// minimum time elapsed between the start of each poll attempt.
/// If the previous poll attempt took longer than the interval, the next will
/// start immediately. Once the timeout is reached, a Timeout error will be
/// returned regardless of the actual number of polling attempts completed.
TimeoutWithInterval(Duration, Duration),
/// Poll once every interval, up to the maximum number of polling attempts.
/// If the previous poll attempt took longer than the interval, the next will
/// start immediately. However, in the case that the desired element is not
/// found, you will be guaranteed the specified number of polling attempts,
/// regardless of how long it takes.
NumTriesWithInterval(u32, Duration),
/// Poll once every interval, up to the specified timeout, or the specified
/// minimum number of polling attempts, whichever comes last.
/// If the previous poll attempt took longer than the interval, the next will
/// start immediately. If the timeout was reached before the minimum number
/// of polling attempts has been executed, then the query will continue
/// polling until the number of polling attempts equals the specified minimum.
/// If the minimum number of polling attempts is reached prior to the
/// specified timeout, then the polling attempts will continue until the
/// timeout is reached instead.
TimeoutWithIntervalAndMinTries(Duration, Duration, u32),
}
pub struct ElementPollerTicker {
timeout: Option<Duration>,
interval: Option<Duration>,
min_tries: u32,
start: Instant,
cur_tries: u32,
}
impl ElementPollerTicker {
pub fn new(poller: ElementPoller) -> Self {
let mut ticker = Self {
timeout: None,
interval: None,
min_tries: 0,
start: Instant::now(),
cur_tries: 0,
};
match poller {
ElementPoller::NoWait => {}
ElementPoller::TimeoutWithInterval(timeout, interval) => {
ticker.timeout = Some(timeout);
ticker.interval = Some(interval);
}
ElementPoller::NumTriesWithInterval(num_tries, interval) => {
ticker.interval = Some(interval);
ticker.min_tries = num_tries;
}
ElementPoller::TimeoutWithIntervalAndMinTries(timeout, interval, num_tries) => {
ticker.timeout = Some(timeout);
ticker.interval = Some(interval);
ticker.min_tries = num_tries
}
}
ticker
}
pub async fn tick(&mut self) -> bool {
self.cur_tries += 1;
if self.timeout.filter(|t| &self.start.elapsed() < t).is_none()
&& self.cur_tries >= self.min_tries
{
return false;
}
if let Some(i) = self.interval {
// Next poll is due no earlier than this long after the first poll started.
let minimum_elapsed = i * self.cur_tries;
// But this much time has elapsed since the first poll started.
let actual_elapsed = self.start.elapsed();
if actual_elapsed < minimum_elapsed {
// So we need to wait this much longer.
sleep(minimum_elapsed - actual_elapsed).await;
}
}
true
}
}