comparison mercurial/revset.py @ 20718:d7b7ec0459c6

revset: fixed sorting issue with spanset When a spanset was being sorted it didn't take into account it's current state (ascending or descending) and it reversed itself everytime the reverse parameter was True. This is not yet used but it will be as soon as the sort revset is changed to directly use the structures sort method.
author Lucas Moscovicz <lmoscovicz@fb.com>
date Thu, 13 Mar 2014 17:16:58 -0700
parents fa1ac5faa7c4
children cce8fbedc82a
comparison
equal deleted inserted replaced
20717:da3124178fbb 20718:d7b7ec0459c6
2528 # Basic implementation to be changed in future patches. 2528 # Basic implementation to be changed in future patches.
2529 l = baseset([r for r in self]) 2529 l = baseset([r for r in self])
2530 return l[x] 2530 return l[x]
2531 2531
2532 def sort(self, reverse=False): 2532 def sort(self, reverse=False):
2533 # Basic implementation to be changed in future patches. 2533 if bool(reverse) != (self._start > self._end):
2534 if reverse:
2535 self.reverse() 2534 self.reverse()
2536 2535
2537 def reverse(self): 2536 def reverse(self):
2538 if self._start <= self._end: 2537 if self._start <= self._end:
2539 self._start, self._end = self._end - 1, self._start - 1 2538 self._start, self._end = self._end - 1, self._start - 1