fssort.go 2.5 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788
  1. package fssort
  2. import (
  3. "os"
  4. "path/filepath"
  5. "sort"
  6. "strings"
  7. )
  8. type sortBufferedStructure struct {
  9. Filename string
  10. Filepath string
  11. Filesize int64
  12. ModTime int64
  13. }
  14. /*
  15. Quick utilties to sort file list according to different modes
  16. */
  17. func SortFileList(filelistRealpath []string, sortMode string) []string {
  18. //Build a filelist with information based on the given filelist
  19. parsedFilelist := []*sortBufferedStructure{}
  20. for _, file := range filelistRealpath {
  21. thisFileInfo := sortBufferedStructure{
  22. Filename: filepath.Base(file),
  23. Filepath: file,
  24. }
  25. //Get Filesize
  26. fi, err := os.Stat(file)
  27. if err != nil {
  28. thisFileInfo.Filesize = 0
  29. } else {
  30. thisFileInfo.Filesize = fi.Size()
  31. thisFileInfo.ModTime = fi.ModTime().Unix()
  32. }
  33. parsedFilelist = append(parsedFilelist, &thisFileInfo)
  34. }
  35. //Sort the filelist
  36. if sortMode == "default" {
  37. //Sort by name, convert filename to window sorting methods
  38. sort.Slice(parsedFilelist, func(i, j int) bool {
  39. return strings.ToLower(parsedFilelist[i].Filename) < strings.ToLower(parsedFilelist[j].Filename)
  40. })
  41. } else if sortMode == "reverse" {
  42. //Sort by reverse name
  43. sort.Slice(parsedFilelist, func(i, j int) bool {
  44. return strings.ToLower(parsedFilelist[i].Filename) > strings.ToLower(parsedFilelist[j].Filename)
  45. })
  46. } else if sortMode == "smallToLarge" {
  47. sort.Slice(parsedFilelist, func(i, j int) bool { return parsedFilelist[i].Filesize < parsedFilelist[j].Filesize })
  48. } else if sortMode == "largeToSmall" {
  49. sort.Slice(parsedFilelist, func(i, j int) bool { return parsedFilelist[i].Filesize > parsedFilelist[j].Filesize })
  50. } else if sortMode == "mostRecent" {
  51. sort.Slice(parsedFilelist, func(i, j int) bool { return parsedFilelist[i].ModTime > parsedFilelist[j].ModTime })
  52. } else if sortMode == "leastRecent" {
  53. sort.Slice(parsedFilelist, func(i, j int) bool { return parsedFilelist[i].ModTime < parsedFilelist[j].ModTime })
  54. } else if sortMode == "smart" {
  55. parsedFilelist = SortNaturalFilelist(parsedFilelist)
  56. }
  57. results := []string{}
  58. for _, sortedFile := range parsedFilelist {
  59. results = append(results, sortedFile.Filepath)
  60. }
  61. return results
  62. }
  63. func SortModeIsSupported(sortMode string) bool {
  64. if !contains(sortMode, []string{"default", "reverse", "smallToLarge", "largeToSmall", "mostRecent", "leastRecent", "smart"}) {
  65. return false
  66. }
  67. return true
  68. }
  69. func contains(item string, slice []string) bool {
  70. set := make(map[string]struct{}, len(slice))
  71. for _, s := range slice {
  72. set[s] = struct{}{}
  73. }
  74. _, ok := set[item]
  75. return ok
  76. }