Show More
@@ -1,4 +1,5 b'' | |||
|
1 | 1 | use bytes_cast::BytesCast; |
|
2 | use micro_timer::timed; | |
|
2 | 3 | use std::path::PathBuf; |
|
3 | 4 | use std::{collections::BTreeMap, convert::TryInto}; |
|
4 | 5 | |
@@ -499,6 +500,7 b' impl super::dispatch::DirstateMapMethods' | |||
|
499 | 500 | self.dirty_parents = true; |
|
500 | 501 | } |
|
501 | 502 | |
|
503 | #[timed] | |
|
502 | 504 | fn read<'a>( |
|
503 | 505 | &mut self, |
|
504 | 506 | file_contents: &'a [u8], |
@@ -13,6 +13,7 b' use crate::HgPathBuf;' | |||
|
13 | 13 | use crate::PatternFileWarning; |
|
14 | 14 | use crate::StatusError; |
|
15 | 15 | use crate::StatusOptions; |
|
16 | use micro_timer::timed; | |
|
16 | 17 | use rayon::prelude::*; |
|
17 | 18 | use std::borrow::Cow; |
|
18 | 19 | use std::io; |
@@ -29,6 +30,7 b' use std::sync::Mutex;' | |||
|
29 | 30 | /// and its use of `itertools::merge_join_by`. When reaching a path that only |
|
30 | 31 | /// exists in one of the two trees, depending on information requested by |
|
31 | 32 | /// `options` we may need to traverse the remaining subtree. |
|
33 | #[timed] | |
|
32 | 34 | pub fn status<'tree>( |
|
33 | 35 | dmap: &'tree mut DirstateMap, |
|
34 | 36 | matcher: &(dyn Matcher + Sync), |
General Comments 0
You need to be logged in to leave comments.
Login now