Show More
@@ -21,6 +21,13 b' def computeunserved(repo):' | |||
|
21 | 21 | |
|
22 | 22 | # function to compute filtered set |
|
23 | 23 | filtertable = {'unserved': computeunserved} |
|
24 | ### Nearest subset relation | |
|
25 | # Nearest subset of filter X is a filter Y so that: | |
|
26 | # * Y is included in X, | |
|
27 | # * X - Y is as small as possible. | |
|
28 | # This create and ordering used for branchmap purpose. | |
|
29 | # the ordering may be partial | |
|
30 | subsettable = {None: 'unserved'} | |
|
24 | 31 | |
|
25 | 32 | def filteredrevs(repo, filtername): |
|
26 | 33 | """returns set of filtered revision for this filter name""" |
General Comments 0
You need to be logged in to leave comments.
Login now