Searched refs:MissingAncestors (Results 1 – 7 of 7) sorted by relevance
| /dports/devel/mercurial/mercurial-6.0/rust/hg-cpython/src/ |
| H A D | ancestors.rs | 48 MissingAncestors as CoreMissing,
126 py_class!(pub class MissingAncestors |py| {
134 -> PyResult<MissingAncestors> {
137 MissingAncestors::create_instance(py, RefCell::new(Box::new(inner)))
218 m.add_class::<MissingAncestors>(py)?; in init_module()
|
| /dports/devel/mercurial/mercurial-6.0/rust/hg-core/src/ |
| H A D | ancestors.rs | 38 pub struct MissingAncestors<G: Graph> { struct
211 impl<G: Graph> MissingAncestors<G> { impl
213 let mut created = MissingAncestors { in new()
589 MissingAncestors::new(SampleGraph, [5, 3, 1, 3].iter().cloned()); in test_missing_bases()
614 MissingAncestors::new(SampleGraph, bases.iter().cloned()); in assert_missing_remove()
641 MissingAncestors::new(SampleGraph, bases.iter().cloned()); in assert_missing_ancestors()
770 let mut missing_ancestors: MissingAncestors<VecGraph> = in test_remove_ancestors_from_case1()
771 MissingAncestors::new( in test_remove_ancestors_from_case1()
|
| H A D | discovery.rs | 14 use crate::{ancestors::MissingAncestors, dagops, FastHashMap};
26 common: MissingAncestors<G>,
181 common: MissingAncestors::new(graph, vec![]), in new_with_seed()
|
| H A D | lib.rs | 10 pub use ancestors::{AncestorsIterator, LazyAncestors, MissingAncestors};
|
| /dports/devel/mercurial/mercurial-6.0/tests/ |
| H A D | test-rust-ancestor.py | 21 MissingAncestors,
99 missanc = MissingAncestors(idx, [1])
109 missanc = MissingAncestors(idx, [1])
|
| /dports/devel/mercurial/mercurial-6.0/rust/hg-core/tests/ |
| H A D | test_missing_ancestors.rs | 74 MissingAncestors(HashSet<Revision>), enumerator
138 .push(MissingAncestorsAction::MissingAncestors(revs_as_set)); in missing_ancestors()
302 let mut inc = MissingAncestors::<VecGraph>::new( in test_missing_ancestors_compare_naive()
|
| /dports/devel/mercurial/mercurial-6.0/mercurial/ |
| H A D | revlog.py | 1100 return rustancestor.MissingAncestors(self.index, common)
|