Struct git2::Revwalk [] [src]

pub struct Revwalk<'repo> { /* fields omitted */ }

A revwalk allows traversal of the commit graph defined by including one or more leaves and excluding one or more roots.

Methods

impl<'repo> Revwalk<'repo>
[src]

[src]

Reset a revwalk to allow re-configuring it.

The revwalk is automatically reset when iteration of its commits completes.

[src]

Set the order in which commits are visited.

[src]

Simplify the history by first-parent

No parents other than the first for each commit will be enqueued.

[src]

Mark a commit to start traversal from.

The given OID must belong to a committish on the walked repository.

The given commit will be used as one of the roots when starting the revision walk. At least one commit must be pushed onto the walker before a walk can be started.

[src]

Push the repository's HEAD

For more information, see push.

[src]

Push matching references

The OIDs pointed to by the references that match the given glob pattern will be pushed to the revision walker.

A leading 'refs/' is implied if not present as well as a trailing / \ * if the glob lacks '?', ' \ *' or '['.

Any references matching this glob which do not point to a committish will be ignored.

[src]

Push and hide the respective endpoints of the given range.

The range should be of the form <commit>..<commit> where each <commit> is in the form accepted by revparse_single. The left-hand commit will be hidden and the right-hand commit pushed.

[src]

Push the OID pointed to by a reference

The reference must point to a committish.

[src]

Mark a commit as not of interest to this revwalk.

[src]

Hide the repository's HEAD

For more information, see hide.

[src]

Hide matching references.

The OIDs pointed to by the references that match the given glob pattern and their ancestors will be hidden from the output on the revision walk.

A leading 'refs/' is implied if not present as well as a trailing / \ * if the glob lacks '?', ' \ *' or '['.

Any references matching this glob which do not point to a committish will be ignored.

[src]

Hide the OID pointed to by a reference.

The reference must point to a committish.

Trait Implementations

impl<'repo> Drop for Revwalk<'repo>
[src]

[src]

Executes the destructor for this type. Read more

impl<'repo> Iterator for Revwalk<'repo>
[src]

The type of the elements being iterated over.

[src]

Advances the iterator and returns the next value. Read more

1.0.0
[src]

Returns the bounds on the remaining length of the iterator. Read more

1.0.0
[src]

Consumes the iterator, counting the number of iterations and returning it. Read more

1.0.0
[src]

Consumes the iterator, returning the last element. Read more

1.0.0
[src]

Returns the nth element of the iterator. Read more

[src]

🔬 This is a nightly-only experimental API. (iterator_step_by)

unstable replacement of Range::step_by

Creates an iterator starting at the same point, but stepping by the given amount at each iteration. Read more

1.0.0
[src]

Takes two iterators and creates a new iterator over both in sequence. Read more

1.0.0
[src]

'Zips up' two iterators into a single iterator of pairs. Read more

1.0.0
[src]

Takes a closure and creates an iterator which calls that closure on each element. Read more

[src]

🔬 This is a nightly-only experimental API. (iterator_for_each)

Calls a closure on each element of an iterator. Read more

1.0.0
[src]

Creates an iterator which uses a closure to determine if an element should be yielded. Read more

1.0.0
[src]

Creates an iterator that both filters and maps. Read more

1.0.0
[src]

Creates an iterator which gives the current iteration count as well as the next value. Read more

1.0.0
[src]

Creates an iterator which can use peek to look at the next element of the iterator without consuming it. Read more

1.0.0
[src]

Creates an iterator that [skip]s elements based on a predicate. Read more

1.0.0
[src]

Creates an iterator that yields elements based on a predicate. Read more

1.0.0
[src]

Creates an iterator that skips the first n elements. Read more

1.0.0
[src]

Creates an iterator that yields its first n elements. Read more

1.0.0
[src]

An iterator adaptor similar to [fold] that holds internal state and produces a new iterator. Read more

1.0.0
[src]

Creates an iterator that works like map, but flattens nested structure. Read more

1.0.0
[src]

Creates an iterator which ends after the first [None]. Read more

1.0.0
[src]

Do something with each element of an iterator, passing the value on. Read more

1.0.0
[src]

Borrows an iterator, rather than consuming it. Read more

1.0.0
[src]

Transforms an iterator into a collection. Read more

1.0.0
[src]

Consumes an iterator, creating two collections from it. Read more

1.0.0
[src]

An iterator adaptor that applies a function, producing a single, final value. Read more

1.0.0
[src]

Tests if every element of the iterator matches a predicate. Read more

1.0.0
[src]

Tests if any element of the iterator matches a predicate. Read more

1.0.0
[src]

Searches for an element of an iterator that satisfies a predicate. Read more

1.0.0
[src]

Searches for an element in an iterator, returning its index. Read more

1.0.0
[src]

Searches for an element in an iterator from the right, returning its index. Read more

1.0.0
[src]

Returns the maximum element of an iterator. Read more

1.0.0
[src]

Returns the minimum element of an iterator. Read more

1.6.0
[src]

Returns the element that gives the maximum value from the specified function. Read more

1.15.0
[src]

Returns the element that gives the maximum value with respect to the specified comparison function. Read more

1.6.0
[src]

Returns the element that gives the minimum value from the specified function. Read more

1.15.0
[src]

Returns the element that gives the minimum value with respect to the specified comparison function. Read more

1.0.0
[src]

Reverses an iterator's direction. Read more

1.0.0
[src]

Converts an iterator of pairs into a pair of containers. Read more

1.0.0
[src]

Creates an iterator which [clone]s all of its elements. Read more

1.0.0
[src]

Repeats an iterator endlessly. Read more

1.11.0
[src]

Sums the elements of an iterator. Read more

1.11.0
[src]

Iterates over the entire iterator, multiplying all the elements Read more

1.5.0
[src]

Lexicographically compares the elements of this Iterator with those of another. Read more

1.5.0
[src]

Lexicographically compares the elements of this Iterator with those of another. Read more

1.5.0
[src]

Determines if the elements of this Iterator are equal to those of another. Read more

1.5.0
[src]

Determines if the elements of this Iterator are unequal to those of another. Read more

1.5.0
[src]

Determines if the elements of this Iterator are lexicographically less than those of another. Read more

1.5.0
[src]

Determines if the elements of this Iterator are lexicographically less or equal to those of another. Read more

1.5.0
[src]

Determines if the elements of this Iterator are lexicographically greater than those of another. Read more

1.5.0
[src]

Determines if the elements of this Iterator are lexicographically greater than or equal to those of another. Read more