equal
deleted
inserted
replaced
545 # 'real' roots (i.e. are descended from other roots). |
545 # 'real' roots (i.e. are descended from other roots). |
546 roots = descendants.copy() |
546 roots = descendants.copy() |
547 # Our topologically sorted list of output nodes. |
547 # Our topologically sorted list of output nodes. |
548 orderedout = [] |
548 orderedout = [] |
549 # Don't start at nullid since we don't want nullid in our output list, |
549 # Don't start at nullid since we don't want nullid in our output list, |
550 # and if nullid shows up in descedents, empty parents will look like |
550 # and if nullid shows up in descendants, empty parents will look like |
551 # they're descendants. |
551 # they're descendants. |
552 for r in xrange(max(lowestrev, 0), highestrev + 1): |
552 for r in xrange(max(lowestrev, 0), highestrev + 1): |
553 n = self.node(r) |
553 n = self.node(r) |
554 isdescendant = False |
554 isdescendant = False |
555 if lowestrev == nullrev: # Everybody is a descendant of nullid |
555 if lowestrev == nullrev: # Everybody is a descendant of nullid |
1013 """internal function to add revisions to the log |
1013 """internal function to add revisions to the log |
1014 |
1014 |
1015 see addrevision for argument descriptions. |
1015 see addrevision for argument descriptions. |
1016 invariants: |
1016 invariants: |
1017 - text is optional (can be None); if not set, cachedelta must be set. |
1017 - text is optional (can be None); if not set, cachedelta must be set. |
1018 if both are set, they must correspond to eachother. |
1018 if both are set, they must correspond to each other. |
1019 """ |
1019 """ |
1020 btext = [text] |
1020 btext = [text] |
1021 def buildtext(): |
1021 def buildtext(): |
1022 if btext[0] is not None: |
1022 if btext[0] is not None: |
1023 return btext[0] |
1023 return btext[0] |