Open timint opened 2 months ago
Sorting multi-level nested structures is not as easy as it might seem. No, I think there is no need to complicate the source code due to habits in some other applications.
Is it possible that you overcomplicated this in your code? I dunno what language you are doing this in. I'm a PHP developer and it's a 2 min job for me. Basically it's a condition before your alphabetic sort.
uasort($files, function($a, $b){
if (is_tracked($a) == is_tracked($b)) {
return ($a < $b) ? -1 : 1; // Return alphabetic
}
return is_tracked($a) ? -1 : 1;
});
Hi, love the software. Truly awesome work!
I'm coming from Sourcetree. The brain is just too used to the Sourcetree way of listing unstaged files by tracked before untracked. I find that very efficient and thought I would add it as a feature request. That could make it easier to migrate from SourceTree without heating the brain. 😉