Show More
@@ -206,11 +206,10 impl<G: Graph> MissingAncestors<G> { | |||
|
206 | 206 | new_bases |
|
207 | 207 | .into_iter() |
|
208 | 208 | .filter(|&rev| rev != NULL_REVISION) |
|
209 |
. |
|
|
209 | .inspect(|&r| { | |
|
210 | 210 | if r > max_base { |
|
211 | 211 | max_base = r; |
|
212 | 212 | } |
|
213 | r | |
|
214 | 213 | }), |
|
215 | 214 | ); |
|
216 | 215 | self.max_base = max_base; |
@@ -217,7 +217,7 pub struct FilelogRevisionData(Vec<u8>); | |||
|
217 | 217 | impl FilelogRevisionData { |
|
218 | 218 | /// Split into metadata and data |
|
219 | 219 | pub fn split(&self) -> Result<(Option<&[u8]>, &[u8]), HgError> { |
|
220 |
const DELIMITER: &[u8; 2] = |
|
|
220 | const DELIMITER: &[u8; 2] = b"\x01\n"; | |
|
221 | 221 | |
|
222 | 222 | if let Some(rest) = self.0.drop_prefix(DELIMITER) { |
|
223 | 223 | if let Some((metadata, data)) = rest.split_2_by_slice(DELIMITER) { |
General Comments 0
You need to be logged in to leave comments.
Login now