dulwich.diff_tree.RenameDetector

class documentation

class RenameDetector:

Constructor: RenameDetector(store, rename_threshold, max_files, rewrite_threshold, ...)

View In Hierarchy

Object for handling rename detection between two trees.

Method __init__ Initialize the rename detector.
Method changes_with_renames Iterate TreeChanges between two tree SHAs, with rename detection.
Method _add_change Undocumented
Method _choose_content_renames Undocumented
Method _collect_changes Undocumented
Method _find_content_rename_candidates Undocumented
Method _find_exact_renames Undocumented
Method _join_modifies Undocumented
Method _prune Undocumented
Method _prune_unchanged Undocumented
Method _rename_type Undocumented
Method _reset Undocumented
Method _should_find_content_renames Undocumented
Method _should_split Undocumented
Method _sorted_changes Undocumented
Instance Variable _adds Undocumented
Instance Variable _candidates Undocumented
Instance Variable _changes Undocumented
Instance Variable _deletes Undocumented
Instance Variable _find_copies_harder Undocumented
Instance Variable _include_trees Undocumented
Instance Variable _max_files Undocumented
Instance Variable _rename_threshold Undocumented
Instance Variable _rewrite_threshold Undocumented
Instance Variable _store Undocumented
Instance Variable _want_unchanged Undocumented
def __init__(self, store: BaseObjectStore, rename_threshold: int = RENAME_THRESHOLD, max_files: int | None = MAX_FILES, rewrite_threshold: int | None = REWRITE_THRESHOLD, find_copies_harder: bool = False):

Initialize the rename detector.

Parameters
store:BaseObjectStoreAn ObjectStore for looking up objects.
rename_threshold:intThe threshold similarity score for considering an add/delete pair to be a rename/copy; see _similarity_score.
max_files:int | NoneThe maximum number of adds and deletes to consider, or None for no limit. The detector is guaranteed to compare no more than max_files ** 2 add/delete pairs. This limit is provided because rename detection can be quadratic in the project size. If the limit is exceeded, no content rename detection is attempted.
rewrite_threshold:int | NoneThe threshold similarity score below which a modify should be considered a delete/add, or None to not break modifies; see _similarity_score.
find_copies_harder:boolIf True, consider unmodified files when detecting copies.
def changes_with_renames(self, tree1_id: ObjectID | None, tree2_id: ObjectID | None, want_unchanged: bool = False, include_trees: bool = False) -> list[TreeChange]:

Iterate TreeChanges between two tree SHAs, with rename detection.

def _add_change(self, change: TreeChange):

Undocumented

def _choose_content_renames(self):

Undocumented

def _collect_changes(self, tree1_id: ObjectID | None, tree2_id: ObjectID | None):

Undocumented

def _find_content_rename_candidates(self):

Undocumented

def _find_exact_renames(self):

Undocumented

def _join_modifies(self):

Undocumented

def _prune(self, add_paths: AbstractSet[bytes], delete_paths: AbstractSet[bytes]):

Undocumented

def _prune_unchanged(self):

Undocumented

def _rename_type(self, check_paths: bool, delete: TreeChange, add: TreeChange) -> str:

Undocumented

def _reset(self):

Undocumented

def _should_find_content_renames(self) -> bool:

Undocumented

def _should_split(self, change: TreeChange) -> bool:

Undocumented

def _sorted_changes(self) -> list[TreeChange]:

Undocumented

_adds: list[TreeChange] =

Undocumented

_candidates: list[tuple[int, TreeChange]] =

Undocumented

_changes: list[TreeChange] =

Undocumented

_deletes: list[TreeChange] =

Undocumented

_find_copies_harder =

Undocumented

_include_trees =

Undocumented

_max_files =

Undocumented

_rename_threshold =

Undocumented

_rewrite_threshold =

Undocumented

_store =

Undocumented

_want_unchanged =

Undocumented