changeset 5441:2bfd0cc1b04c

evolve: minor fixes in stablesort documentation
author Sushil khanchi <sushilkhanchi97@gmail.com>
date Fri, 24 Jul 2020 11:04:07 +0530
parents 5b1011a5c824
children 25b746aea135
files hgext3rd/evolve/stablesort.py
diffstat 1 files changed, 2 insertions(+), 2 deletions(-) [+]
line wrap: on
line diff
--- a/hgext3rd/evolve/stablesort.py	Tue Jul 21 12:52:52 2020 +0800
+++ b/hgext3rd/evolve/stablesort.py	Fri Jul 24 11:04:07 2020 +0530
@@ -61,7 +61,7 @@
     pl = stablemin(parents(m))
     ph = stablemax(parents(m))
     stablesort(::m) == stablesort(pl)
-                       + [i for in in stablesort(ph) if in ph % pl]
+                       + [i for i in stablesort(ph) if i in ph % pl]
                        + m
 
 This is visible in the example above:
@@ -113,7 +113,7 @@
   stablesort(::F) = [A, B, C, E, F]
   stablesort(::G) - ::F = [A, B, C, D, E, G] - [A, B, C, E, F] = [D, G]
 
-In this order, we reuse all of `stablesort(::H)`, but the subset of
+In this order, we reuse all of `stablesort(::F)`, but the subset of
 `stablesort(::G)` we reuse is not contiguous, we had to skip over 'E' that is
 already contained inside ::F.