equal
deleted
inserted
replaced
184 # XXX need filtering too |
184 # XXX need filtering too |
185 self.rev(self.node(0)) |
185 self.rev(self.node(0)) |
186 return self._nodecache |
186 return self._nodecache |
187 |
187 |
188 def reachableroots(self, minroot, heads, roots, includepath=False): |
188 def reachableroots(self, minroot, heads, roots, includepath=False): |
189 reachable = self.index.reachableroots(minroot, heads, roots, |
189 return revset.baseset(sorted( |
190 includepath) |
190 self.index.reachableroots(minroot, heads, roots, includepath))) |
191 if reachable is None: |
|
192 # The C code hasn't been able to initialize a list, something went |
|
193 # really wrong, let's rely on the pure implementation in that case |
|
194 raise AttributeError() |
|
195 else: |
|
196 return revset.baseset(sorted(reachable)) |
|
197 |
191 |
198 def headrevs(self): |
192 def headrevs(self): |
199 if self.filteredrevs: |
193 if self.filteredrevs: |
200 try: |
194 try: |
201 return self.index.headrevsfiltered(self.filteredrevs) |
195 return self.index.headrevsfiltered(self.filteredrevs) |