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
use rand;
use super::LoadBalancingStrategy;
pub struct Random<N> {
pub cluster: Vec<N>,
}
impl<N> Random<N> {
pub fn new(cluster: Vec<N>) -> Self {
Random { cluster }
}
fn rnd_idx(bounds: (usize, usize)) -> usize {
let min = bounds.0;
let max = bounds.1;
let rnd = rand::random::<usize>();
rnd % (max - min) + min
}
}
impl<N> From<Vec<N>> for Random<N> {
fn from(cluster: Vec<N>) -> Random<N> {
Random { cluster }
}
}
impl<N> LoadBalancingStrategy<N> for Random<N> {
fn init(&mut self, cluster: Vec<N>) {
self.cluster = cluster;
}
fn next(&self) -> Option<&N> {
let len = self.cluster.len();
if len == 0 {
return None;
}
self.cluster.get(Self::rnd_idx((0, len)))
}
fn remove_node<F>(&mut self, filter: F)
where
F: FnMut(&N) -> bool,
{
if let Some(i) = self.cluster.iter().position(filter) {
self.cluster.remove(i);
}
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn next_random() {
let nodes = vec!["a", "b", "c", "d", "e", "f", "g"];
let load_balancer = Random::from(nodes);
for _ in 0..100 {
let s = load_balancer.next();
assert!(s.is_some());
}
}
#[test]
fn remove_from_random() {
let nodes = vec!["a"];
let mut load_balancer = Random::from(nodes);
let s = load_balancer.next();
assert!(s.is_some());
load_balancer.remove_node(|n| n == &"a");
let s = load_balancer.next();
assert!(s.is_none());
}
}