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
use std::collections::HashMap;
use serde::{Deserialize, Serialize};
#[derive(Serialize, Deserialize, Debug, Clone, Copy, Hash, PartialEq, Eq, PartialOrd, Ord)]
#[cfg_attr(
feature = "enum_ext",
derive(
strum::EnumString,
strum::Display,
strum::AsRefStr,
strum::IntoStaticStr,
strum::EnumVariantNames
),
strum(ascii_case_insensitive)
)]
pub enum RuleType {
Domain,
DomainSuffix,
DomainKeyword,
GeoIP,
IPCIDR,
SrcIPCIDR,
SrcPort,
DstPort,
Process,
Match,
Direct,
Reject,
#[serde(other)]
Unknown,
}
#[derive(Serialize, Deserialize, Debug, Clone, Hash, PartialEq, Eq, PartialOrd, Ord)]
pub struct Rule {
#[serde(rename = "type")]
pub rule_type: RuleType,
pub payload: String,
pub proxy: String,
}
#[derive(Serialize, Deserialize, Debug, Clone, Default, Hash, PartialEq, Eq, PartialOrd, Ord)]
pub struct Rules {
pub rules: Vec<Rule>,
}
impl Rules {
pub fn most_frequent_proxy(&self) -> Option<&str> {
self.frequency()
.into_iter()
.max_by_key(|(_, v)| *v)
.map(|(k, _)| k)
}
pub fn frequency(&self) -> HashMap<&str, usize> {
let mut counts = HashMap::new();
self.rules
.iter()
.filter(|x| x.proxy != "DIRECT" && x.proxy != "REJECT")
.map(|x| x.proxy.as_str())
.for_each(|item| *counts.entry(item).or_default() += 1);
counts
}
pub fn owned_frequency(&self) -> HashMap<String, usize> {
let mut counts = HashMap::new();
self.rules
.iter()
.filter(|x| x.proxy != "DIRECT" && x.proxy != "REJECT")
.map(|x| x.proxy.to_owned())
.for_each(|item| *counts.entry(item).or_default() += 1);
counts
}
}