1
0
mirror of https://github.com/jesseduffield/lazygit.git synced 2025-03-03 15:02:52 +02:00
This commit is contained in:
Jesse Duffield 2021-03-21 15:17:09 +11:00
parent d2e1b35eee
commit 5bb48b51a0
2 changed files with 5 additions and 5 deletions

View File

@ -63,9 +63,9 @@ func (m *FileChangeManager) SetFiles(files []*models.File) {
func (m *FileChangeManager) SetTree() {
if m.ShowTree {
m.Tree = GetTreeFromStatusFiles(m.Files)
m.Tree = GetTreeFromFiles(m.Files)
} else {
m.Tree = GetFlatTreeFromStatusFiles(m.Files)
m.Tree = GetFlatTreeFromFiles(m.Files)
}
}

View File

@ -9,7 +9,7 @@ import (
"github.com/jesseduffield/lazygit/pkg/commands/models"
)
func GetTreeFromStatusFiles(files []*models.File) *models.FileChangeNode {
func GetTreeFromFiles(files []*models.File) *models.FileChangeNode {
root := &models.FileChangeNode{}
var curr *models.FileChangeNode
@ -49,8 +49,8 @@ func GetTreeFromStatusFiles(files []*models.File) *models.FileChangeNode {
return root
}
func GetFlatTreeFromStatusFiles(files []*models.File) *models.FileChangeNode {
rootAux := GetTreeFromStatusFiles(files)
func GetFlatTreeFromFiles(files []*models.File) *models.FileChangeNode {
rootAux := GetTreeFromFiles(files)
sortedFiles := rootAux.GetLeaves()
// Move merge conflicts to top. This is the one way in which sorting