-
Notifications
You must be signed in to change notification settings - Fork 18
/
diff.py
146 lines (108 loc) · 3.5 KB
/
diff.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
from dataclasses import dataclass, field
from typing import TYPE_CHECKING, List, Optional, Tuple
if TYPE_CHECKING:
from dvc_objects.file import HashFile
from .hashfile.hash_info import HashInfo
from .hashfile.meta import Meta
ADD = "add"
MODIFY = "modify"
DELETE = "delete"
UNCHANGED = "unchanged"
class TreeEntry:
__slots__ = ("in_cache", "key", "meta", "oid")
def __init__(
self,
in_cache: bool,
key: Tuple[str],
meta: Optional["Meta"],
oid: Optional["HashInfo"],
):
self.in_cache = in_cache
self.key = key
self.meta = meta
self.oid = oid
def __bool__(self):
return bool(self.oid)
def __eq__(self, other):
if not isinstance(other, TreeEntry):
return False
if self.key != other.key:
return False
return self.oid == other.oid
class Change:
__slots__ = ("old", "new")
def __init__(self, old: TreeEntry, new: TreeEntry):
self.old = old
self.new = new
@property
def typ(self):
if not self.old and not self.new:
return UNCHANGED
if self.old and not self.new:
return DELETE
if not self.old and self.new:
return ADD
if self.old != self.new:
return MODIFY
return UNCHANGED
def __bool__(self):
return self.typ != UNCHANGED
@dataclass
class DiffResult:
added: List[Change] = field(default_factory=list, compare=True)
modified: List[Change] = field(default_factory=list, compare=True)
deleted: List[Change] = field(default_factory=list, compare=True)
unchanged: List[Change] = field(default_factory=list, compare=True)
def __bool__(self):
return bool(self.added or self.modified or self.deleted)
ROOT = ("",)
def diff(
old: Optional["HashFile"], new: Optional["HashFile"], cache
) -> DiffResult:
from .objects.tree import Tree
if old is None and new is None:
return DiffResult()
def _get_keys(obj):
if not obj:
return []
return [ROOT] + (
[key for key, _, _ in obj] if isinstance(obj, Tree) else []
)
old_keys = set(_get_keys(old))
new_keys = set(_get_keys(new))
def _get(obj, key):
if not obj or key == ROOT:
return None, (obj.hash_info if obj else None)
return obj.get(key, (None, None))
def _in_cache(oid, cache):
from dvc_objects.errors import ObjectFormatError
if not oid:
return False
try:
cache.check(oid.value)
return True
except (FileNotFoundError, ObjectFormatError):
return False
ret = DiffResult()
for key in old_keys | new_keys:
old_meta, old_oid = _get(old, key)
new_meta, new_oid = _get(new, key)
change = Change(
old=TreeEntry(_in_cache(old_oid, cache), key, old_meta, old_oid),
new=TreeEntry(_in_cache(new_oid, cache), key, new_meta, new_oid),
)
if change.typ == ADD:
ret.added.append(change)
elif change.typ == MODIFY:
ret.modified.append(change)
elif change.typ == DELETE:
ret.deleted.append(change)
else:
assert change.typ == UNCHANGED
if not change.new.in_cache and not (
change.new.oid and change.new.oid.isdir
):
ret.modified.append(change)
else:
ret.unchanged.append(change)
return ret