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
use std::io;
use bstr::{BString, ByteSlice};
use quick_error::quick_error;
use crate::{
encode::SPACE,
tree::{Entry, EntryRef},
Kind, Tree, TreeRef,
};
quick_error! {
#[derive(Debug)]
#[allow(missing_docs)]
pub enum Error {
NewlineInFilename(name: BString) {
display("Newlines are invalid in file paths: {:?}", name)
}
}
}
impl From<Error> for io::Error {
fn from(err: Error) -> Self {
io::Error::new(io::ErrorKind::Other, err)
}
}
impl crate::WriteTo for Tree {
fn write_to(&self, mut out: impl io::Write) -> io::Result<()> {
debug_assert_eq!(
&{
let mut entries_sorted = self.entries.clone();
entries_sorted.sort();
entries_sorted
},
&self.entries,
"entries for serialization must be sorted by filename"
);
for Entry { mode, filename, oid } in &self.entries {
out.write_all(mode.as_bytes())?;
out.write_all(SPACE)?;
if filename.find_byte(b'\n').is_some() {
return Err(Error::NewlineInFilename((*filename).to_owned()).into());
}
out.write_all(filename)?;
out.write_all(&[b'\0'])?;
out.write_all(oid.as_bytes())?;
}
Ok(())
}
fn kind(&self) -> Kind {
Kind::Tree
}
}
impl<'a> crate::WriteTo for TreeRef<'a> {
fn write_to(&self, mut out: impl io::Write) -> io::Result<()> {
debug_assert_eq!(
&{
let mut entries_sorted = self.entries.clone();
entries_sorted.sort();
entries_sorted
},
&self.entries,
"entries for serialization must be sorted by filename"
);
for EntryRef { mode, filename, oid } in &self.entries {
out.write_all(mode.as_bytes())?;
out.write_all(SPACE)?;
if filename.find_byte(b'\n').is_some() {
return Err(Error::NewlineInFilename((*filename).to_owned()).into());
}
out.write_all(filename)?;
out.write_all(&[b'\0'])?;
out.write_all(oid.as_bytes())?;
}
Ok(())
}
fn kind(&self) -> Kind {
Kind::Tree
}
}