/// An iterator over the ancestors one or more starting commitspub struct Ancestors<Find, Predicate, StateMut> { find: Find, predicate: Predicate, state: StateMut, parents: Parents, sorting: Sorting,} /// Specify how to handle commit parents during traversal.#[derive(Copy, Clone)]pub enum Parents { /// Traverse all parents, useful for traversing the entire ancestry. All, /// Only traverse along the first parent, which commonly ignores all branches. First,} impl Default for Parents { fn default() -> Self { Parents::All }} /// Specify how to sort commits during traversal.#[derive(Copy, Clone)]pub enum Sorting { /// Commits are sorted as they are mentioned in the commit graph. Topological, /// Order commit looking up the commit date of the most recent parents. /// /// Note that since only parents are looked up this ordering is partial. ByCommitterDate,} impl Default for Sorting { fn default() -> Self { Sorting::Topological }} ///pub mod ancestors { use std::{ borrow::BorrowMut, collections::{BTreeSet, VecDeque}, }; use git_hash::{oid, ObjectId}; use git_object::CommitRefIter; use quick_error::quick_error; use crate::commit::{Ancestors, Parents, Sorting}; quick_error! { /// The error is part of the item returned by the [Ancestors] iterator. #[derive(Debug)] #[allow(missing_docs)] pub enum Error { FindExisting{oid: ObjectId, err: Box<dyn std::error::Error + Send + Sync + 'static> } { display("The commit {} could not be found", oid) source(&**err) } ObjectDecode(err: git_object::decode::Error) { display("An object could not be decoded") source(err) from() } } } /// The state used and potentially shared by multiple graph traversals. #[derive(Default, Clone)] pub struct State { next: VecDeque<ObjectId>, buf: Vec<u8>, seen: BTreeSet<ObjectId>, parents_with_date: Vec<(ObjectId, u32)>, parents_buf: Vec<u8>, } impl State { fn clear(&mut self) { self.next.clear(); self.buf.clear(); self.seen.clear(); } } impl<Find, Predicate, StateMut> Ancestors<Find, Predicate, StateMut> { /// Change our commit parent handling mode to the given one. pub fn parents(mut self, mode: Parents) -> Self { self.parents = mode; self } /// Set the sorting method, either topological or by author date pub fn sorting(mut self, sorting: Sorting) -> Self { self.sorting = sorting; self } } impl<Find, StateMut, E> Ancestors<Find, fn(&oid) -> bool, StateMut> where Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>, StateMut: BorrowMut<State>, E: std::error::Error + Send + Sync + 'static, { /// Create a new instance. /// /// * `find` - a way to lookup new object data during traversal by their ObjectId, writing their data into buffer and returning /// an iterator over commit tokens if the object is present and is a commit. Caching should be implemented within this function /// as needed. /// * `state` - all state used for the traversal. If multiple traversals are performed, allocations can be minimized by reusing /// this state. /// * `tips` /// * the starting points of the iteration, usually commits /// * each commit they lead to will only be returned once, including the tip that started it pub fn new(tips: impl IntoIterator<Item = impl Into<ObjectId>>, state: StateMut, find: Find) -> Self { Self::filtered(tips, state, find, |_| true) } } impl<Find, Predicate, StateMut, E> Ancestors<Find, Predicate, StateMut> where Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>, Predicate: FnMut(&oid) -> bool, StateMut: BorrowMut<State>, E: std::error::Error + Send + Sync + 'static, { /// Create a new instance with commit filtering enabled. /// /// * `find` - a way to lookup new object data during traversal by their ObjectId, writing their data into buffer and returning /// an iterator over commit tokens if the object is present and is a commit. Caching should be implemented within this function /// as needed. /// * `state` - all state used for the traversal. If multiple traversals are performed, allocations can be minimized by reusing /// this state. /// * `tips` /// * the starting points of the iteration, usually commits /// * each commit they lead to will only be returned once, including the tip that started it /// * `predicate` - indicate whether a given commit should be included in the result as well /// as whether its parent commits should be traversed. pub fn filtered( tips: impl IntoIterator<Item = impl Into<ObjectId>>, mut state: StateMut, find: Find, mut predicate: Predicate, ) -> Self { let tips = tips.into_iter(); { let state = state.borrow_mut(); state.clear(); state.next.reserve(tips.size_hint().0); for tip in tips.map(Into::into) { let was_inserted = state.seen.insert(tip); if was_inserted && predicate(&tip) { state.next.push_back(tip); } } } Self { find, predicate, state, parents: Default::default(), sorting: Default::default(), } } } impl<Find, Predicate, StateMut, E> Iterator for Ancestors<Find, Predicate, StateMut> where Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>, Predicate: FnMut(&oid) -> bool, StateMut: BorrowMut<State>, E: std::error::Error + Send + Sync + 'static, { type Item = Result<ObjectId, Error>; fn next(&mut self) -> Option<Self::Item> { if matches!(self.parents, Parents::First) { self.next_by_topology() } else { match self.sorting { Sorting::Topological => self.next_by_topology(), Sorting::ByCommitterDate => self.next_by_commit_date(), } } } } impl<Find, Predicate, StateMut, E> Ancestors<Find, Predicate, StateMut> where Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>, Predicate: FnMut(&oid) -> bool, StateMut: BorrowMut<State>, E: std::error::Error + Send + Sync + 'static, { fn next_by_commit_date(&mut self) -> Option<Result<ObjectId, Error>> { let state = self.state.borrow_mut(); state.parents_with_date.clear(); let res = state.next.pop_front(); if let Some(oid) = res { match (self.find)(&oid, &mut state.buf) { Ok(mut commit_iter) => { if let Some(Err(decode_tree_err)) = commit_iter.next() { return Some(Err(decode_tree_err.into())); } for token in commit_iter { match token { Ok(git_object::commit::ref_iter::Token::Parent { id }) => { let parent = (self.find)(id.as_ref(), &mut state.parents_buf).ok(); let parent_committer_date = parent .and_then(|parent| parent.committer().ok().map(|committer| committer.time)); if let Some(parent_committer_date) = parent_committer_date { state .parents_with_date .push((id, parent_committer_date.seconds_since_unix_epoch)); } if matches!(self.parents, Parents::First) { break; } } Ok(_unused_token) => break, Err(err) => return Some(Err(err.into())), } } } Err(err) => return Some(Err(Error::FindExisting { oid, err: err.into() })), } } state .parents_with_date .sort_by(|(_, time), (_, other_time)| time.cmp(other_time).reverse()); for parent in &state.parents_with_date { let id = parent.0; let was_inserted = state.seen.insert(id); if was_inserted && (self.predicate)(&id) { state.next.push_back(id); } } res.map(Ok) } } impl<Find, Predicate, StateMut, E> Ancestors<Find, Predicate, StateMut> where Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>, Predicate: FnMut(&oid) -> bool, StateMut: BorrowMut<State>, E: std::error::Error + Send + Sync + 'static, { fn next_by_topology(&mut self) -> Option<Result<ObjectId, Error>> { let state = self.state.borrow_mut(); let res = state.next.pop_front(); if let Some(oid) = res { match (self.find)(&oid, &mut state.buf) { Ok(mut commit_iter) => { if let Some(Err(decode_tree_err)) = commit_iter.next() { return Some(Err(decode_tree_err.into())); } for token in commit_iter { match token { Ok(git_object::commit::ref_iter::Token::Parent { id }) => { let was_inserted = state.seen.insert(id); if was_inserted && (self.predicate)(&id) { state.next.push_back(id); } if matches!(self.parents, Parents::First) { break; } } Ok(_a_token_past_the_parents) => break, Err(err) => return Some(Err(err.into())), } } } Err(err) => return Some(Err(Error::FindExisting { oid, err: err.into() })), } } res.map(Ok) } }}
/// An iterator over the ancestors one or more starting commits
pub struct Ancestors<Find, Predicate, StateMut> {
find: Find,
predicate: Predicate,
state: StateMut,
parents: Parents,
sorting: Sorting,
}
/// Specify how to handle commit parents during traversal.
#[derive(Copy, Clone)]
pub enum Parents {
/// Traverse all parents, useful for traversing the entire ancestry.
All,
/// Only traverse along the first parent, which commonly ignores all branches.
First,
}
impl Default for Parents {
fn default() -> Self {
Parents::All
}
}
/// Specify how to sort commits during traversal.
#[derive(Copy, Clone)]
pub enum Sorting {
/// Commits are sorted as they are mentioned in the commit graph.
Topological,
/// Order commit looking up the commit date of the most recent parents.
///
/// Note that since only parents are looked up this ordering is partial.
ByCommitterDate,
}
impl Default for Sorting {
fn default() -> Self {
Sorting::Topological
}
}
///
pub mod ancestors {
use std::{
borrow::BorrowMut,
collections::{BTreeSet, VecDeque},
};
use git_hash::{oid, ObjectId};
use git_object::CommitRefIter;
use quick_error::quick_error;
use crate::commit::{Ancestors, Parents, Sorting};
quick_error! {
/// The error is part of the item returned by the [Ancestors] iterator.
#[derive(Debug)]
#[allow(missing_docs)]
pub enum Error {
FindExisting{oid: ObjectId, err: Box<dyn std::error::Error + Send + Sync + 'static> } {
display("The commit {} could not be found", oid)
source(&**err)
}
ObjectDecode(err: git_object::decode::Error) {
display("An object could not be decoded")
source(err)
from()
}
}
}
/// The state used and potentially shared by multiple graph traversals.
#[derive(Default, Clone)]
pub struct State {
next: VecDeque<ObjectId>,
buf: Vec<u8>,
seen: BTreeSet<ObjectId>,
parents_with_date: Vec<(ObjectId, u32)>,
parents_buf: Vec<u8>,
}
impl State {
fn clear(&mut self) {
self.next.clear();
self.buf.clear();
self.seen.clear();
}
}
impl<Find, Predicate, StateMut> Ancestors<Find, Predicate, StateMut> {
/// Change our commit parent handling mode to the given one.
pub fn parents(mut self, mode: Parents) -> Self {
self.parents = mode;
self
}
/// Set the sorting method, either topological or by author date
pub fn sorting(mut self, sorting: Sorting) -> Self {
self.sorting = sorting;
self
}
}
impl<Find, StateMut, E> Ancestors<Find, fn(&oid) -> bool, StateMut>
where
Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>,
StateMut: BorrowMut<State>,
E: std::error::Error + Send + Sync + 'static,
{
/// Create a new instance.
///
/// * `find` - a way to lookup new object data during traversal by their ObjectId, writing their data into buffer and returning
/// an iterator over commit tokens if the object is present and is a commit. Caching should be implemented within this function
/// as needed.
/// * `state` - all state used for the traversal. If multiple traversals are performed, allocations can be minimized by reusing
/// this state.
/// * `tips`
/// * the starting points of the iteration, usually commits
/// * each commit they lead to will only be returned once, including the tip that started it
pub fn new(tips: impl IntoIterator<Item = impl Into<ObjectId>>, state: StateMut, find: Find) -> Self {
Self::filtered(tips, state, find, |_| true)
}
}
impl<Find, Predicate, StateMut, E> Ancestors<Find, Predicate, StateMut>
where
Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>,
Predicate: FnMut(&oid) -> bool,
StateMut: BorrowMut<State>,
E: std::error::Error + Send + Sync + 'static,
{
/// Create a new instance with commit filtering enabled.
///
/// * `find` - a way to lookup new object data during traversal by their ObjectId, writing their data into buffer and returning
/// an iterator over commit tokens if the object is present and is a commit. Caching should be implemented within this function
/// as needed.
/// * `state` - all state used for the traversal. If multiple traversals are performed, allocations can be minimized by reusing
/// this state.
/// * `tips`
/// * the starting points of the iteration, usually commits
/// * each commit they lead to will only be returned once, including the tip that started it
/// * `predicate` - indicate whether a given commit should be included in the result as well
/// as whether its parent commits should be traversed.
pub fn filtered(
tips: impl IntoIterator<Item = impl Into<ObjectId>>,
mut state: StateMut,
find: Find,
mut predicate: Predicate,
) -> Self {
let tips = tips.into_iter();
{
let state = state.borrow_mut();
state.clear();
state.next.reserve(tips.size_hint().0);
for tip in tips.map(Into::into) {
let was_inserted = state.seen.insert(tip);
if was_inserted && predicate(&tip) {
state.next.push_back(tip);
}
}
}
Self {
find,
predicate,
state,
parents: Default::default(),
sorting: Default::default(),
}
}
}
impl<Find, Predicate, StateMut, E> Iterator for Ancestors<Find, Predicate, StateMut>
where
Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>,
Predicate: FnMut(&oid) -> bool,
StateMut: BorrowMut<State>,
E: std::error::Error + Send + Sync + 'static,
{
type Item = Result<ObjectId, Error>;
fn next(&mut self) -> Option<Self::Item> {
if matches!(self.parents, Parents::First) {
self.next_by_topology()
} else {
match self.sorting {
Sorting::Topological => self.next_by_topology(),
Sorting::ByCommitterDate => self.next_by_commit_date(),
}
}
}
}
impl<Find, Predicate, StateMut, E> Ancestors<Find, Predicate, StateMut>
where
Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>,
Predicate: FnMut(&oid) -> bool,
StateMut: BorrowMut<State>,
E: std::error::Error + Send + Sync + 'static,
{
fn next_by_commit_date(&mut self) -> Option<Result<ObjectId, Error>> {
let state = self.state.borrow_mut();
state.parents_with_date.clear();
let res = state.next.pop_front();
if let Some(oid) = res {
match (self.find)(&oid, &mut state.buf) {
Ok(mut commit_iter) => {
if let Some(Err(decode_tree_err)) = commit_iter.next() {
return Some(Err(decode_tree_err.into()));
}
for token in commit_iter {
match token {
Ok(git_object::commit::ref_iter::Token::Parent { id }) => {
let parent = (self.find)(id.as_ref(), &mut state.parents_buf).ok();
let parent_committer_date = parent
.and_then(|parent| parent.committer().ok().map(|committer| committer.time));
if let Some(parent_committer_date) = parent_committer_date {
state
.parents_with_date
.push((id, parent_committer_date.seconds_since_unix_epoch));
}
if matches!(self.parents, Parents::First) {
break;
}
}
Ok(_unused_token) => break,
Err(err) => return Some(Err(err.into())),
}
}
}
Err(err) => return Some(Err(Error::FindExisting { oid, err: err.into() })),
}
}
state
.parents_with_date
.sort_by(|(_, time), (_, other_time)| time.cmp(other_time).reverse());
for parent in &state.parents_with_date {
let id = parent.0;
let was_inserted = state.seen.insert(id);
if was_inserted && (self.predicate)(&id) {
state.next.push_back(id);
}
}
res.map(Ok)
}
}
impl<Find, Predicate, StateMut, E> Ancestors<Find, Predicate, StateMut>
where
Find: for<'a> FnMut(&oid, &'a mut Vec<u8>) -> Result<CommitRefIter<'a>, E>,
Predicate: FnMut(&oid) -> bool,
StateMut: BorrowMut<State>,
E: std::error::Error + Send + Sync + 'static,
{
fn next_by_topology(&mut self) -> Option<Result<ObjectId, Error>> {
let state = self.state.borrow_mut();
let res = state.next.pop_front();
if let Some(oid) = res {
match (self.find)(&oid, &mut state.buf) {
Ok(mut commit_iter) => {
if let Some(Err(decode_tree_err)) = commit_iter.next() {
return Some(Err(decode_tree_err.into()));
}
for token in commit_iter {
match token {
Ok(git_object::commit::ref_iter::Token::Parent { id }) => {
let was_inserted = state.seen.insert(id);
if was_inserted && (self.predicate)(&id) {
state.next.push_back(id);
}
if matches!(self.parents, Parents::First) {
break;
}
}
Ok(_a_token_past_the_parents) => break,
Err(err) => return Some(Err(err.into())),
}
}
}
Err(err) => return Some(Err(Error::FindExisting { oid, err: err.into() })),
}
}
res.map(Ok)
}
}
}