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
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
use super::{Algorithm, Error, Reader, Verifier, Writer};
use std::collections::btree_map::IntoIter;
use std::collections::BTreeMap;
use std::ops::{Deref, DerefMut};
use std::str::FromStr;
use drawbridge_byte::Bytes;
use serde::{Deserialize, Serialize};
#[cfg(feature = "headers")]
use headers::{Error as HeadErr, Header, HeaderName, HeaderValue};
#[derive(Clone, Default, Debug, Serialize, Deserialize)]
pub struct ContentDigest<H = Box<[u8]>>(BTreeMap<Algorithm, Bytes<H>>)
where
H: AsRef<[u8]> + From<Vec<u8>>;
impl<H> ContentDigest<H>
where
H: AsRef<[u8]> + From<Vec<u8>>,
{
pub fn reader<T>(&self, reader: T) -> Reader<T> {
Reader::new(reader, self.iter().map(|x| *x.0))
}
pub fn writer<T>(&self, writer: T) -> Writer<T> {
Writer::new(writer, self.iter().map(|x| *x.0))
}
pub fn verifier<T>(self, reader: T) -> Verifier<T, H> {
Verifier::new(self.reader(reader), self)
}
}
impl<H> From<BTreeMap<Algorithm, Bytes<H>>> for ContentDigest<H>
where
H: AsRef<[u8]> + From<Vec<u8>>,
{
fn from(value: BTreeMap<Algorithm, Bytes<H>>) -> Self {
Self(value)
}
}
impl<H> Eq for ContentDigest<H> where H: AsRef<[u8]> + From<Vec<u8>> {}
impl<T, U> PartialEq<ContentDigest<U>> for ContentDigest<T>
where
T: AsRef<[u8]> + From<Vec<u8>>,
U: AsRef<[u8]> + From<Vec<u8>>,
{
fn eq(&self, other: &ContentDigest<U>) -> bool {
if self.len() != other.len() {
return false;
}
for (lhs, rhs) in self.0.iter().zip(other.0.iter()) {
if lhs.0 != rhs.0 {
return false;
}
if lhs.1.as_ref() != rhs.1.as_ref() {
return false;
}
}
true
}
}
impl<H> Deref for ContentDigest<H>
where
H: AsRef<[u8]> + From<Vec<u8>>,
{
type Target = BTreeMap<Algorithm, Bytes<H>>;
fn deref(&self) -> &Self::Target {
&self.0
}
}
impl<H> DerefMut for ContentDigest<H>
where
H: AsRef<[u8]> + From<Vec<u8>>,
{
fn deref_mut(&mut self) -> &mut Self::Target {
&mut self.0
}
}
impl<H> std::fmt::Display for ContentDigest<H>
where
H: AsRef<[u8]> + From<Vec<u8>>,
{
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
let mut comma = "";
for (algo, hash) in self.iter() {
write!(f, "{}{}=:{}:", comma, algo, hash)?;
comma = ",";
}
Ok(())
}
}
impl<H> FromStr for ContentDigest<H>
where
H: AsRef<[u8]> + From<Vec<u8>>,
{
type Err = Error;
fn from_str(s: &str) -> Result<Self, Self::Err> {
s.split(',')
.map(|s| {
let (key, val) = s.split_once('=').ok_or(Error::MissingEq)?;
let alg = key.parse()?;
let b64 = val
.strip_prefix(':')
.and_then(|val| val.strip_suffix(':'))
.ok_or(Error::MissingColons)?
.parse()?;
Ok((alg, b64))
})
.collect::<Result<_, _>>()
.map(Self)
}
}
impl<H> IntoIterator for ContentDigest<H>
where
H: AsRef<[u8]> + From<Vec<u8>>,
{
type Item = (Algorithm, Bytes<H>);
type IntoIter = IntoIter<Algorithm, Bytes<H>>;
fn into_iter(self) -> Self::IntoIter {
self.0.into_iter()
}
}
#[cfg(feature = "headers")]
static CONTENT_DIGEST: HeaderName = HeaderName::from_static("content-digest");
#[cfg(feature = "headers")]
impl<H> Header for ContentDigest<H>
where
H: Default + AsRef<[u8]> + From<Vec<u8>>,
{
fn name() -> &'static HeaderName {
&CONTENT_DIGEST
}
#[allow(single_use_lifetimes)]
fn decode<'i, I>(values: &mut I) -> Result<Self, HeadErr>
where
Self: Sized,
I: Iterator<Item = &'i HeaderValue>,
{
let mut all = Self::default();
for value in values {
let digests: ContentDigest<H> = std::str::from_utf8(value.as_bytes())
.map_err(|_| HeadErr::invalid())?
.parse()
.map_err(|_| HeadErr::invalid())?;
for (algo, hash) in digests {
let _ = all.insert(algo, hash);
}
}
if all.is_empty() {
return Err(HeadErr::invalid());
}
Ok(all)
}
fn encode<E: Extend<HeaderValue>>(&self, values: &mut E) {
let value = HeaderValue::from_str(&self.to_string()).unwrap();
values.extend([value].into_iter())
}
}
#[cfg(test)]
mod tests {
use super::*;
#[async_std::test]
async fn isomorphism() {
const STR: &str = "sha-224=:CAj2TmDViXn8tnbJbsk4Jw3qQkRa7vzTpOb42w==:,sha-256=:LCa0a2j/xo/5m0U8HTBBNBNCLXBkg7+g+YpeiGJm564=:,sha-384=:mMEf/f3VQGdrGhN8saIrKnA1DJpEFx1rEYDGvly7LuP3nVMsih3Z7y6OCOdSo7q7:,sha-512=:9/u6bgY2+JDlb7vzKD5STG+jIErimDgtYkdB0NxmODJuKCxBvl5CVNiCB3LFUYosWowMf37aGVlKfrU5RT4e1w==:";
assert_eq!(STR.parse::<ContentDigest>().unwrap().to_string(), STR);
}
}