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
use std::collections::hash_map::{self, HashMap};
use std::ops::Index;
#[derive(Clone, Debug, Default, PartialEq, Eq)]
pub struct PathParams(HashMap<String, String>);
impl PathParams {
#[inline]
pub fn new() -> PathParams {
PathParams::default()
}
#[inline]
pub fn insert<T, U>(&mut self, key: T, value: U)
where
T: Into<String>,
U: Into<String>,
{
self.0.insert(key.into(), value.into());
}
#[inline]
pub fn iter(&self) -> Iter<'_> {
Iter(self.0.iter())
}
}
impl<'a> IntoIterator for &'a PathParams {
type IntoIter = Iter<'a>;
type Item = (&'a str, &'a str);
#[inline]
fn into_iter(self) -> Iter<'a> {
self.iter()
}
}
impl<'a> Index<&'a str> for PathParams {
type Output = str;
#[inline]
fn index(&self, key: &'a str) -> &str {
&self.0[key]
}
}
pub struct Iter<'a>(hash_map::Iter<'a, String, String>);
impl<'a> Iterator for Iter<'a> {
type Item = (&'a str, &'a str);
#[inline]
fn next(&mut self) -> Option<(&'a str, &'a str)> {
self.0.next().map(|v| (&**v.0, &**v.1))
}
#[inline]
fn size_hint(&self) -> (usize, Option<usize>) {
self.0.size_hint()
}
}
impl<'a> ExactSizeIterator for Iter<'a> {
#[inline]
fn len(&self) -> usize {
self.0.len()
}
}