summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
ef9dc5d)
* Shrink capacity in `RateLimitStorage::remove_older_than`
* Update rate_limiter.rs
* rerun ci
* rerun ci
* rerun ci
* Update rate_limiter.rs
use once_cell::sync::Lazy;
use std::{
collections::HashMap,
use once_cell::sync::Lazy;
use std::{
collections::HashMap,
net::{IpAddr, Ipv4Addr, Ipv6Addr},
time::{Duration, Instant},
};
net::{IpAddr, Ipv4Addr, Ipv6Addr},
time::{Duration, Instant},
};
.all(|bucket| bucket.last_checked.to_instant() > instant)
};
.all(|bucket| bucket.last_checked.to_instant() > instant)
};
- self.ipv4_buckets.retain(|_, group| is_recently_used(group));
+ retain_and_shrink(&mut self.ipv4_buckets, |_, group| is_recently_used(group));
- self.ipv6_buckets.retain(|_, group_48| {
- group_48.children.retain(|_, group_56| {
- group_56
- .children
- .retain(|_, group_64| is_recently_used(group_64));
+ retain_and_shrink(&mut self.ipv6_buckets, |_, group_48| {
+ retain_and_shrink(&mut group_48.children, |_, group_56| {
+ retain_and_shrink(&mut group_56.children, |_, group_64| {
+ is_recently_used(group_64)
+ });
!group_56.children.is_empty()
});
!group_48.children.is_empty()
!group_56.children.is_empty()
});
!group_48.children.is_empty()
+fn retain_and_shrink<K, V, F>(map: &mut HashMap<K, V>, f: F)
+where
+ K: Eq + Hash,
+ F: FnMut(&K, &mut V) -> bool,
+{
+ map.retain(f);
+ map.shrink_to_fit();
+}
+
fn split_ipv6(ip: Ipv6Addr) -> ([u8; 6], u8, u8) {
let [a0, a1, a2, a3, a4, a5, b, c, ..] = ip.octets();
([a0, a1, a2, a3, a4, a5], b, c)
fn split_ipv6(ip: Ipv6Addr) -> ([u8; 6], u8, u8) {
let [a0, a1, a2, a3, a4, a5, b, c, ..] = ip.octets();
([a0, a1, a2, a3, a4, a5], b, c)