JGit 7.2.0.202503040940-r · org.eclipse.jgit.revwalk.RevSort

Field Summary

Modifier and Type	Field and Description
public static final RevSort	BOUNDARY Include `RevFlag#UNINTERESTING` boundary commits after all others.
public static final RevSort	COMMIT_TIME_DESC Sort by commit time, descending (newest first, oldest last).
public static final RevSort	NONE No specific sorting is requested.
public static final RevSort	REVERSE Flip the output into the reverse ordering.
public static final RevSort	TOPO Topological sorting (all children before parents).
public static final RevSort	TOPO_KEEP_BRANCH_TOGETHER Topological sorting (all children before parents) without intermixing lines of history.

Access	Constructor and Description
private	RevSort()

Modifier and Type	Method and Description
public static RevSort	valueOf(String name)
public static RevSort[]	values()

Field Detail

BOUNDARY back to summary

BOUNDARY	back to summary
public static final RevSort BOUNDARY Include `RevFlag#UNINTERESTING` boundary commits after all others. In `ObjectWalk`, objects associated with such commits (trees, blobs), and all other objects marked explicitly as UNINTERESTING are also included. A boundary commit is a UNINTERESTING parent of an interesting commit that was previously output.

public static final RevSort BOUNDARY

Include RevFlag#UNINTERESTING boundary commits after all others. In ObjectWalk, objects associated with such commits (trees, blobs), and all other objects marked explicitly as UNINTERESTING are also included.

A boundary commit is a UNINTERESTING parent of an interesting commit that was previously output.

COMMIT_TIME_DESC back to summary

COMMIT_TIME_DESC	back to summary
public static final RevSort COMMIT_TIME_DESC Sort by commit time, descending (newest first, oldest last). This strategy can be combined with `TOPO`.

public static final RevSort COMMIT_TIME_DESC

Sort by commit time, descending (newest first, oldest last).

This strategy can be combined with TOPO.

NONE	back to summary
public static final RevSort NONE No specific sorting is requested. Applications should not rely upon the ordering produced by this strategy. Any ordering in the output is caused by low level implementation details and may change without notice.

NONE

back to summary

public static final RevSort NONE

No specific sorting is requested.

Applications should not rely upon the ordering produced by this strategy. Any ordering in the output is caused by low level implementation details and may change without notice.

REVERSE	back to summary
public static final RevSort REVERSE Flip the output into the reverse ordering. This strategy can be combined with the others described by this type as it is usually performed at the very end.

REVERSE

back to summary

public static final RevSort REVERSE

Flip the output into the reverse ordering.

This strategy can be combined with the others described by this type as it is usually performed at the very end.

TOPO back to summary

TOPO	back to summary
public static final RevSort TOPO Topological sorting (all children before parents). This strategy can be combined with `COMMIT_TIME_DESC`.

public static final RevSort TOPO

Topological sorting (all children before parents).

This strategy can be combined with COMMIT_TIME_DESC.

TOPO_KEEP_BRANCH_TOGETHER back to summary

TOPO_KEEP_BRANCH_TOGETHER	back to summary
public static final RevSort TOPO_KEEP_BRANCH_TOGETHER Topological sorting (all children before parents) without intermixing lines of history. This behavior more closely resembles C Git's git-log --topo-order than `TOPO`. See C Git's topo-order description. Since 5.8

public static final RevSort TOPO_KEEP_BRANCH_TOGETHER

Topological sorting (all children before parents) without intermixing lines of history.

This behavior more closely resembles C Git's git-log --topo-order than TOPO. See C Git's topo-order description.

Since: 5.8

public final Enum RevSort

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail