# HG changeset patch # User Martin von Zweigbergk # Date 2019-05-22 20:58:05 # Node ID c4b8f8637d7a2dde1575d47b7ca9e26eb4a49eff # Parent 3293086ff66326d423e124a5f9ea7076fb0b685d match: de-flake test-doctest.py by not depending on util.dirs() order util.dirs() yields directories in arbitrary order, which has made test-doctest.py flaky. I think they have been flaky since d8e55c0c642c (util: make util.dirs() and util.finddirs() include root directory (API), 2017-05-16). Before that commit, I think util.dirs() would return at most one entry, so there was only one iteration order. This patch fixes the problem by making _rootsdirsandparents() return a set (whose __str__() is defined to be in sorted order, I believe). The only caller wanted a set anyway. Differential Revision: https://phab.mercurial-scm.org/D6432 diff --git a/mercurial/match.py b/mercurial/match.py --- a/mercurial/match.py +++ b/mercurial/match.py @@ -614,7 +614,7 @@ class includematcher(basematcher): self._dirs = set(dirs) # parents are directories which are non-recursively included because # they are needed to get to items in _dirs or _roots. - self._parents = set(parents) + self._parents = parents def visitdir(self, dir): dir = normalizerootdir(dir, 'visitdir') @@ -1384,26 +1384,26 @@ def _rootsdirsandparents(kindpats): >>> _rootsdirsandparents( ... [(b'glob', b'g/h/*', b''), (b'glob', b'g/h', b''), ... (b'glob', b'g*', b'')]) - (['g/h', 'g/h', ''], [], ['', 'g']) + (['g/h', 'g/h', ''], [], set(['', 'g'])) >>> _rootsdirsandparents( ... [(b'rootfilesin', b'g/h', b''), (b'rootfilesin', b'', b'')]) - ([], ['g/h', ''], ['', 'g']) + ([], ['g/h', ''], set(['', 'g'])) >>> _rootsdirsandparents( ... [(b'relpath', b'r', b''), (b'path', b'p/p', b''), ... (b'path', b'', b'')]) - (['r', 'p/p', ''], [], ['', 'p']) + (['r', 'p/p', ''], [], set(['', 'p'])) >>> _rootsdirsandparents( ... [(b'relglob', b'rg*', b''), (b're', b're/', b''), ... (b'relre', b'rr', b'')]) - (['', '', ''], [], ['']) + (['', '', ''], [], set([''])) ''' r, d = _patternrootsanddirs(kindpats) - p = [] - # Append the parents as non-recursive/exact directories, since they must be + p = set() + # Add the parents as non-recursive/exact directories, since they must be # scanned to get to either the roots or the other exact directories. - p.extend(util.dirs(d)) - p.extend(util.dirs(r)) + p.update(util.dirs(d)) + p.update(util.dirs(r)) # FIXME: all uses of this function convert these to sets, do so before # returning.