Struct Ancestry 

pub struct Ancestry { /* private fields */ }

The host queues distinct commits, starting at the proposed tip, and follows only parent edges. Queue storage can be paged; no history lives in this value. One visit budget covers every branch update in the receive operation.

Implementations

impl Ancestry

pub const fn new(format: ObjectFormat, max_visits: u64) -> Ancestry

pub fn start(&mut self, old: ObjectId) -> Result<(), Error>

Start searching for the old tip without replenishing the request budget.

pub fn visit(&mut self, id: ObjectId, kind: ObjectKind) -> Result<bool, Error>

Return true only when a visited commit is the old tip. Exhausting the host’s queue without a match means the update is not a fast-forward.