-
Notifications
You must be signed in to change notification settings - Fork 189
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
3 changed files
with
106 additions
and
113 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,45 @@ | ||
| package svc | ||
|
|
||
| import ( | ||
| libregraph "github.com/owncloud/libre-graph-api-go" | ||
| ) | ||
|
|
||
| type spacesSlice []*libregraph.Drive | ||
|
|
||
| // Len is the number of elements in the collection. | ||
| func (d spacesSlice) Len() int { return len(d) } | ||
|
|
||
| // Swap swaps the elements with indexes i and j. | ||
| func (d spacesSlice) Swap(i, j int) { d[i], d[j] = d[j], d[i] } | ||
|
|
||
| type spacesByName struct { | ||
| spacesSlice | ||
| } | ||
| type spacesByLastModifiedDateTime struct { | ||
| spacesSlice | ||
| } | ||
|
|
||
| // Less reports whether the element with index i | ||
| // must sort before the element with index j. | ||
| func (s spacesByName) Less(i, j int) bool { | ||
| return *s.spacesSlice[i].Name > *s.spacesSlice[j].Name | ||
| } | ||
|
|
||
| // Less reports whether the element with index i | ||
| // must sort before the element with index j. | ||
| func (s spacesByLastModifiedDateTime) Less(i, j int) bool { | ||
| // compare the items when both dates are set | ||
| if s.spacesSlice[i].LastModifiedDateTime != nil && s.spacesSlice[j].LastModifiedDateTime != nil { | ||
| return s.spacesSlice[i].LastModifiedDateTime.After(*s.spacesSlice[j].LastModifiedDateTime) | ||
| } | ||
| // move left item down if it has no value | ||
| if s.spacesSlice[i].LastModifiedDateTime == nil && s.spacesSlice[j].LastModifiedDateTime != nil { | ||
| return false | ||
| } | ||
| // move right item down if it has no value | ||
| if s.spacesSlice[i].LastModifiedDateTime != nil && s.spacesSlice[j].LastModifiedDateTime == nil { | ||
| return true | ||
| } | ||
| // fallback to name if no dateTime is set on both items | ||
| return *s.spacesSlice[i].Name > *s.spacesSlice[j].Name | ||
| } |