| hg-reviewers |
This will be used to check whether a branch exists or not. This will optimized
in future.
| Lint Skipped |
| Unit Tests Skipped |
| Path | Packages | |||
|---|---|---|---|---|
| M | mercurial/branchmap.py (4 lines) | |||
| M | mercurial/localrepo.py (4 lines) |
| Commit | Parents | Author | Summary | Date |
|---|---|---|---|---|
| Pulkit Goyal | Mar 18 2019, 12:31 PM |
| self.entries[key] = value | self.entries[key] = value | ||||
| def __getitem__(self, key): | def __getitem__(self, key): | ||||
| return self.entries[key] | return self.entries[key] | ||||
| def iteritems(self): | def iteritems(self): | ||||
| return self.entries.iteritems() | return self.entries.iteritems() | ||||
| def hasbranch(self, label): | |||||
| """ checks whether a branch of this name exists or not """ | |||||
| return label in self.entries | |||||
| @classmethod | @classmethod | ||||
| def fromfile(cls, repo): | def fromfile(cls, repo): | ||||
| f = None | f = None | ||||
| try: | try: | ||||
| f = repo.cachevfs(cls._filename(repo)) | f = repo.cachevfs(cls._filename(repo)) | ||||
| lineiter = iter(f) | lineiter = iter(f) | ||||
| cachekey = next(lineiter).rstrip('\n').split(" ", 2) | cachekey = next(lineiter).rstrip('\n').split(" ", 2) | ||||
| last, lrev = cachekey[:2] | last, lrev = cachekey[:2] | ||||
| raise error.RepoLookupError(_("unknown branch '%s'") % branch) | raise error.RepoLookupError(_("unknown branch '%s'") % branch) | ||||
| else: | else: | ||||
| pass | pass | ||||
| def lookup(self, key): | def lookup(self, key): | ||||
| return scmutil.revsymbol(self, key).node() | return scmutil.revsymbol(self, key).node() | ||||
| def lookupbranch(self, key): | def lookupbranch(self, key): | ||||
| if key in self.branchmap().entries: | if self.branchmap().hasbranch(key): | ||||
| return key | return key | ||||
| return scmutil.revsymbol(self, key).branch() | return scmutil.revsymbol(self, key).branch() | ||||
| def known(self, nodes): | def known(self, nodes): | ||||
| cl = self.changelog | cl = self.changelog | ||||
| nm = cl.nodemap | nm = cl.nodemap | ||||
| filtered = cl.filteredrevs | filtered = cl.filteredrevs | ||||
| Heads are returned in topological order, from newest to oldest. | Heads are returned in topological order, from newest to oldest. | ||||
| If branch is None, use the dirstate branch. | If branch is None, use the dirstate branch. | ||||
| If start is not None, return only heads reachable from start. | If start is not None, return only heads reachable from start. | ||||
| If closed is True, return heads that are marked as closed as well. | If closed is True, return heads that are marked as closed as well. | ||||
| ''' | ''' | ||||
| if branch is None: | if branch is None: | ||||
| branch = self[None].branch() | branch = self[None].branch() | ||||
| branches = self.branchmap() | branches = self.branchmap() | ||||
| if branch not in branches.entries: | if not branches.hasbranch(branch): | ||||
| return [] | return [] | ||||
| # the cache returns heads ordered lowest to highest | # the cache returns heads ordered lowest to highest | ||||
| bheads = list(reversed(branches.branchheads(branch, closed=closed))) | bheads = list(reversed(branches.branchheads(branch, closed=closed))) | ||||
| if start is not None: | if start is not None: | ||||
| # filter out the heads that cannot be reached from startrev | # filter out the heads that cannot be reached from startrev | ||||
| fbheads = set(self.changelog.nodesbetween([start], bheads)[2]) | fbheads = set(self.changelog.nodesbetween([start], bheads)[2]) | ||||
| bheads = [h for h in bheads if h in fbheads] | bheads = [h for h in bheads if h in fbheads] | ||||
| return bheads | return bheads | ||||