Show More
@@ -1353,6 +1353,8 b' def only(repo, subset, x):' | |||||
1353 | exclude = getset(repo, fullreposet(repo), args[1]) |
|
1353 | exclude = getset(repo, fullreposet(repo), args[1]) | |
1354 |
|
1354 | |||
1355 | results = set(cl.findmissingrevs(common=exclude, heads=include)) |
|
1355 | results = set(cl.findmissingrevs(common=exclude, heads=include)) | |
|
1356 | # XXX we should turn this into a baseset instead of a set, smartset may do | |||
|
1357 | # some optimisations from the fact this is a baseset. | |||
1356 | return subset & results |
|
1358 | return subset & results | |
1357 |
|
1359 | |||
1358 | def origin(repo, subset, x): |
|
1360 | def origin(repo, subset, x): | |
@@ -1382,6 +1384,8 b' def origin(repo, subset, x):' | |||||
1382 |
|
1384 | |||
1383 | o = set([_firstsrc(r) for r in dests]) |
|
1385 | o = set([_firstsrc(r) for r in dests]) | |
1384 | o -= set([None]) |
|
1386 | o -= set([None]) | |
|
1387 | # XXX we should turn this into a baseset instead of a set, smartset may do | |||
|
1388 | # some optimisations from the fact this is a baseset. | |||
1385 | return subset & o |
|
1389 | return subset & o | |
1386 |
|
1390 | |||
1387 | def outgoing(repo, subset, x): |
|
1391 | def outgoing(repo, subset, x): | |
@@ -1424,6 +1428,8 b' def p1(repo, subset, x):' | |||||
1424 | for r in getset(repo, fullreposet(repo), x): |
|
1428 | for r in getset(repo, fullreposet(repo), x): | |
1425 | ps.add(cl.parentrevs(r)[0]) |
|
1429 | ps.add(cl.parentrevs(r)[0]) | |
1426 | ps -= set([node.nullrev]) |
|
1430 | ps -= set([node.nullrev]) | |
|
1431 | # XXX we should turn this into a baseset instead of a set, smartset may do | |||
|
1432 | # some optimisations from the fact this is a baseset. | |||
1427 | return subset & ps |
|
1433 | return subset & ps | |
1428 |
|
1434 | |||
1429 | def p2(repo, subset, x): |
|
1435 | def p2(repo, subset, x): | |
@@ -1445,6 +1451,8 b' def p2(repo, subset, x):' | |||||
1445 | for r in getset(repo, fullreposet(repo), x): |
|
1451 | for r in getset(repo, fullreposet(repo), x): | |
1446 | ps.add(cl.parentrevs(r)[1]) |
|
1452 | ps.add(cl.parentrevs(r)[1]) | |
1447 | ps -= set([node.nullrev]) |
|
1453 | ps -= set([node.nullrev]) | |
|
1454 | # XXX we should turn this into a baseset instead of a set, smartset may do | |||
|
1455 | # some optimisations from the fact this is a baseset. | |||
1448 | return subset & ps |
|
1456 | return subset & ps | |
1449 |
|
1457 | |||
1450 | def parents(repo, subset, x): |
|
1458 | def parents(repo, subset, x): | |
@@ -1507,6 +1515,8 b' def _notpublic(repo, subset, x):' | |||||
1507 | s = set() |
|
1515 | s = set() | |
1508 | for u in repo._phasecache._phasesets[1:]: |
|
1516 | for u in repo._phasecache._phasesets[1:]: | |
1509 | s.update(u) |
|
1517 | s.update(u) | |
|
1518 | # XXX we should turn this into a baseset instead of a set, smartset may | |||
|
1519 | # do some optimisations from the fact this is a baseset. | |||
1510 | return subset & s |
|
1520 | return subset & s | |
1511 | else: |
|
1521 | else: | |
1512 | phase = repo._phasecache.phase |
|
1522 | phase = repo._phasecache.phase |
General Comments 0
You need to be logged in to leave comments.
Login now