fssort.go 2.4 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586
  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. }
  55. results := []string{}
  56. for _, sortedFile := range parsedFilelist {
  57. results = append(results, sortedFile.Filepath)
  58. }
  59. return results
  60. }
  61. func SortModeIsSupported(sortMode string) bool {
  62. if !contains(sortMode, []string{"default", "reverse", "smallToLarge", "largeToSmall", "mostRecent", "leastRecent"}) {
  63. return false
  64. }
  65. return true
  66. }
  67. func contains(item string, slice []string) bool {
  68. set := make(map[string]struct{}, len(slice))
  69. for _, s := range slice {
  70. set[s] = struct{}{}
  71. }
  72. _, ok := set[item]
  73. return ok
  74. }