This is an archive of the discontinued Mercurial Phabricator instance.

	bases: HashSet<Revision>,			bases: HashSet<Revision>,
	}			}

	impl<G: Graph> AncestorsIterator<G> {			impl<G: Graph> AncestorsIterator<G> {
	/// Constructor.			/// Constructor.
	///			///
	/// if `inclusive` is true, then the init revisions are emitted in			/// if `inclusive` is true, then the init revisions are emitted in
	/// particular, otherwise iteration starts from their parents.			/// particular, otherwise iteration starts from their parents.
	pub fn new<I>(			pub fn new(
	graph: G,			graph: G,
	initrevs: I,			initrevs: impl IntoIterator<Item = Revision>,
	stoprev: Revision,			stoprev: Revision,
	inclusive: bool,			inclusive: bool,
	) -> Result<Self, GraphError>			) -> Result<Self, GraphError> {
	where
	I: IntoIterator<Item = Revision>,
	{
	let filtered_initrevs = initrevs.into_iter().filter(\|&r\| r >= stoprev);			let filtered_initrevs = initrevs.into_iter().filter(\|&r\| r >= stoprev);
	if inclusive {			if inclusive {
	let visit: BinaryHeap<Revision> = filtered_initrevs.collect();			let visit: BinaryHeap<Revision> = filtered_initrevs.collect();
	let seen = visit.iter().map(\|&x\| x).collect();			let seen = visit.iter().map(\|&x\| x).collect();
	return Ok(AncestorsIterator {			return Ok(AncestorsIterator {
	visit: visit,			visit: visit,
	seen: seen,			seen: seen,
	stoprev: stoprev,			stoprev: stoprev,

rust: use 'impl Trait' in method argument of AncestorsIteratorClosedPublic