Use stable sort for sorting coins (#235)

cointop-sh · Oct 18, 2021 · 30fa30c · 30fa30c
1 parent 73a0058
commit 30fa30c
Show file tree

Hide file tree

Showing 3 changed files with 3 additions and 3 deletions.
diff --git a/cointop/favorites.go b/cointop/favorites.go
@@ -64,7 +64,7 @@ func (ct *Cointop) GetFavoritesSlice() []*Coin {
 		}
 	}
 
-	sort.Slice(sliced, func(i, j int) bool {
+	sort.SliceStable(sliced, func(i, j int) bool {
 		return sliced[i].MarketCap > sliced[j].MarketCap
 	})
 

diff --git a/cointop/portfolio.go b/cointop/portfolio.go
@@ -574,7 +574,7 @@ func (ct *Cointop) GetPortfolioSlice() []*Coin {
 		sliced = append(sliced, coin)
 	}
 
-	sort.Slice(sliced, func(i, j int) bool {
+	sort.SliceStable(sliced, func(i, j int) bool {
 		return sliced[i].Balance > sliced[j].Balance
 	})
 

diff --git a/cointop/sort.go b/cointop/sort.go
@@ -23,7 +23,7 @@ func (ct *Cointop) Sort(sortBy string, desc bool, list []*Coin, renderHeaders bo
 	if len(list) < 2 {
 		return
 	}
-	sort.Slice(list[:], func(i, j int) bool {
+	sort.SliceStable(list[:], func(i, j int) bool {
 		if ct.State.sortDesc {
 			i, j = j, i
 		}