Having faster access to null is cute… but limited. We want to speedup access
to more useful revision, like .. We start with turning the fast path for
null into something more generic.
| Automatic diff as part of commit; lint not applicable. |
| Automatic diff as part of commit; unit tests not applicable. |
| Path | Packages | |||
|---|---|---|---|---|
| M | mercurial/localrepo.py (19 lines) |
| Status | Author | Revision | |
|---|---|---|---|
| Abandoned | marmoute | ||
| Abandoned | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Abandoned | marmoute | ||
| Abandoned | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Abandoned | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Abandoned | marmoute | ||
| Abandoned | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute | ||
| Closed | marmoute |
| return matchmod.intersectmatchers(match, nm) | return matchmod.intersectmatchers(match, nm) | ||||
| return matchmod.intersectmatchers(match, self._narrowmatch) | return matchmod.intersectmatchers(match, self._narrowmatch) | ||||
| return self._narrowmatch | return self._narrowmatch | ||||
| def setnarrowpats(self, newincludes, newexcludes): | def setnarrowpats(self, newincludes, newexcludes): | ||||
| narrowspec.save(self, newincludes, newexcludes) | narrowspec.save(self, newincludes, newexcludes) | ||||
| self.invalidate(clearfilecache=True) | self.invalidate(clearfilecache=True) | ||||
| @util.propertycache | |||||
| def _quick_access_changeid(self): | |||||
| """an helper dictionnary for __getitem__ calls | |||||
| This contains a list of symbol we can recognise right away without | |||||
| further processing. | |||||
| """ | |||||
| return { | |||||
| b'null': (nullrev, nullid), | |||||
| nullrev: (nullrev, nullid), | |||||
| nullid: (nullrev, nullid), | |||||
| } | |||||
| def __getitem__(self, changeid): | def __getitem__(self, changeid): | ||||
| # dealing with special cases | # dealing with special cases | ||||
| if changeid is None: | if changeid is None: | ||||
| return context.workingctx(self) | return context.workingctx(self) | ||||
| if isinstance(changeid, context.basectx): | if isinstance(changeid, context.basectx): | ||||
| return changeid | return changeid | ||||
| # dealing with multiple revisions | # dealing with multiple revisions | ||||
| if isinstance(changeid, slice): | if isinstance(changeid, slice): | ||||
| # wdirrev isn't contiguous so the slice shouldn't include it | # wdirrev isn't contiguous so the slice shouldn't include it | ||||
| return [ | return [ | ||||
| self[i] | self[i] | ||||
| for i in pycompat.xrange(*changeid.indices(len(self))) | for i in pycompat.xrange(*changeid.indices(len(self))) | ||||
| if i not in self.changelog.filteredrevs | if i not in self.changelog.filteredrevs | ||||
| ] | ] | ||||
| # dealing with some special values | # dealing with some special values | ||||
| if changeid == b'null' or changeid == nullrev or changeid == nullid: | quick_access = self._quick_access_changeid.get(changeid) | ||||
| return context.changectx(self, nullrev, nullid, maybe_filtered=False) | if quick_access is not None: | ||||
| rev, node = quick_access | |||||
| return context.changectx(self, rev, node, maybe_filtered=False) | |||||
| if changeid == b'tip': | if changeid == b'tip': | ||||
| node = self.changelog.tip() | node = self.changelog.tip() | ||||
| rev = self.changelog.rev(node) | rev = self.changelog.rev(node) | ||||
| return context.changectx(self, rev, node) | return context.changectx(self, rev, node) | ||||
| # dealing with arbitrary values | # dealing with arbitrary values | ||||
| try: | try: | ||||
| if isinstance(changeid, int): | if isinstance(changeid, int): | ||||