Struct gix_commitgraph::Graph

source ·
pub struct Graph { /* private fields */ }
Expand description

A complete commit graph.

The data in the commit graph may come from a monolithic objects/info/commit-graph file, or it may come from one or more objects/info/commit-graphs/graph-*.graph files. These files are generated via git commit-graph write ... commands.

Implementations§

source§

impl Graph

Access

source

pub fn commit_at(&self, pos: Position) -> Commit<'_>

Returns the commit at the given position pos.

§Panics

If pos is greater or equal to num_commits().

source

pub fn commit_by_id(&self, id: impl AsRef<oid>) -> Option<Commit<'_>>

Returns the commit matching the given id.

source

pub fn id_at(&self, pos: Position) -> &oid

Returns the hash at the given position pos.

§Panics

If pos is greater or equal to num_commits().

source

pub fn iter_commits(&self) -> impl Iterator<Item = Commit<'_>>

Iterate over commits in unsorted order.

source

pub fn iter_ids(&self) -> impl Iterator<Item = &oid>

Iterate over commit IDs in unsorted order.

source

pub fn lookup(&self, id: impl AsRef<oid>) -> Option<Position>

Translate the given id to its position in the file.

source

pub fn num_commits(&self) -> u32

Returns the number of commits stored in this file.

source§

impl Graph

Instantiate a Graph from various sources.

source

pub fn at(path: &Path) -> Result<Self, Error>

Instantiate a commit graph from path which may be a directory containing graph files or the graph file itself.

source

pub fn from_commit_graphs_dir(path: &Path) -> Result<Self, Error>

Instantiate a commit graph from the directory containing all of its files.

source

pub fn from_file(path: &Path) -> Result<Self, Error>

Instantiate a commit graph from a .git/objects/info/commit-graph or .git/objects/info/commit-graphs/graph-*.graph file.

source

pub fn from_info_dir(info_dir: &Path) -> Result<Self, Error>

Instantiate a commit graph from an .git/objects/info directory.

source

pub fn new(files: Vec<File>) -> Result<Self, Error>

Create a new commit graph from a list of files.

source§

impl Graph

source

pub fn verify_integrity<E>( &self, processor: impl FnMut(&Commit<'_>) -> Result<(), E>, ) -> Result<Outcome, Error<E>>
where E: Error + 'static,

Traverse all commits in the graph and call processor(&commit) -> Result<(), E> on it while verifying checksums.

When processor returns an error, the entire verification is stopped and the error returned.

Trait Implementations§

source§

impl TryFrom<&Path> for Graph

§

type Error = Error

The type returned in the event of a conversion error.
source§

fn try_from(path: &Path) -> Result<Self, Self::Error>

Performs the conversion.

Auto Trait Implementations§

§

impl Freeze for Graph

§

impl RefUnwindSafe for Graph

§

impl Send for Graph

§

impl Sync for Graph

§

impl Unpin for Graph

§

impl UnwindSafe for Graph

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.