v9.0.0
This commit is contained in:
174
pkg/cloudapi/disks/sorting.go
Normal file
174
pkg/cloudapi/disks/sorting.go
Normal file
@@ -0,0 +1,174 @@
|
||||
package disks
|
||||
|
||||
import "sort"
|
||||
|
||||
// SortByCreatedTime sorts ListDisks by the CreatedTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (ld ListDisks) SortByCreatedTime(inverse bool) ListDisks {
|
||||
if len(ld.Data) < 2 {
|
||||
return ld
|
||||
}
|
||||
|
||||
sort.Slice(ld.Data, func(i, j int) bool {
|
||||
if inverse {
|
||||
return ld.Data[i].CreatedTime > ld.Data[j].CreatedTime
|
||||
}
|
||||
|
||||
return ld.Data[i].CreatedTime < ld.Data[j].CreatedTime
|
||||
})
|
||||
|
||||
return ld
|
||||
}
|
||||
|
||||
// SortByDestructionTime sorts ListDisks by the DestructionTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (ld ListDisks) SortByDestructionTime(inverse bool) ListDisks {
|
||||
if len(ld.Data) < 2 {
|
||||
return ld
|
||||
}
|
||||
|
||||
sort.Slice(ld.Data, func(i, j int) bool {
|
||||
if inverse {
|
||||
return ld.Data[i].DestructionTime > ld.Data[j].DestructionTime
|
||||
}
|
||||
|
||||
return ld.Data[i].DestructionTime < ld.Data[j].DestructionTime
|
||||
})
|
||||
|
||||
return ld
|
||||
}
|
||||
|
||||
// SortByDeletedTime sorts ListDisks by the DeletedTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (ld ListDisks) SortByDeletedTime(inverse bool) ListDisks {
|
||||
if len(ld.Data) < 2 {
|
||||
return ld
|
||||
}
|
||||
|
||||
sort.Slice(ld.Data, func(i, j int) bool {
|
||||
if inverse {
|
||||
return ld.Data[i].DeletedTime > ld.Data[j].DeletedTime
|
||||
}
|
||||
|
||||
return ld.Data[i].DeletedTime < ld.Data[j].DeletedTime
|
||||
})
|
||||
|
||||
return ld
|
||||
}
|
||||
|
||||
// SortByCreatedTime sorts ListSearchDisks by the CreatedTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (ld ListSearchDisks) SortByCreatedTime(inverse bool) ListSearchDisks {
|
||||
if len(ld) < 2 {
|
||||
return ld
|
||||
}
|
||||
|
||||
sort.Slice(ld, func(i, j int) bool {
|
||||
if inverse {
|
||||
return ld[i].CreatedTime > ld[j].CreatedTime
|
||||
}
|
||||
|
||||
return ld[i].CreatedTime < ld[j].CreatedTime
|
||||
})
|
||||
|
||||
return ld
|
||||
}
|
||||
|
||||
// SortByDestructionTime sorts ListSearchDisks by the DestructionTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (ld ListSearchDisks) SortByDestructionTime(inverse bool) ListSearchDisks {
|
||||
if len(ld) < 2 {
|
||||
return ld
|
||||
}
|
||||
|
||||
sort.Slice(ld, func(i, j int) bool {
|
||||
if inverse {
|
||||
return ld[i].DestructionTime > ld[j].DestructionTime
|
||||
}
|
||||
|
||||
return ld[i].DestructionTime < ld[j].DestructionTime
|
||||
})
|
||||
|
||||
return ld
|
||||
}
|
||||
|
||||
// SortByDeletedTime sorts ListSearchDisks by the DeletedTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (ld ListSearchDisks) SortByDeletedTime(inverse bool) ListSearchDisks {
|
||||
if len(ld) < 2 {
|
||||
return ld
|
||||
}
|
||||
|
||||
sort.Slice(ld, func(i, j int) bool {
|
||||
if inverse {
|
||||
return ld[i].DeletedTime > ld[j].DeletedTime
|
||||
}
|
||||
|
||||
return ld[i].DeletedTime < ld[j].DeletedTime
|
||||
})
|
||||
|
||||
return ld
|
||||
}
|
||||
|
||||
// SortByCreatedTime sorts ListDisksUnattached by the CreatedTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (lu ListDisksUnattached) SortByCreatedTime(inverse bool) ListDisksUnattached {
|
||||
if len(lu.Data) < 2 {
|
||||
return lu
|
||||
}
|
||||
|
||||
sort.Slice(lu.Data, func(i, j int) bool {
|
||||
if inverse {
|
||||
return lu.Data[i].CreatedTime > lu.Data[j].CreatedTime
|
||||
}
|
||||
|
||||
return lu.Data[i].CreatedTime < lu.Data[j].CreatedTime
|
||||
})
|
||||
|
||||
return lu
|
||||
}
|
||||
|
||||
// SortByDestructionTime sorts ListDisksUnattached by the DestructionTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (lu ListDisksUnattached) SortByDestructionTime(inverse bool) ListDisksUnattached {
|
||||
if len(lu.Data) < 2 {
|
||||
return lu
|
||||
}
|
||||
|
||||
sort.Slice(lu.Data, func(i, j int) bool {
|
||||
if inverse {
|
||||
return lu.Data[i].DestructionTime > lu.Data[j].DestructionTime
|
||||
}
|
||||
|
||||
return lu.Data[i].DestructionTime < lu.Data[j].DestructionTime
|
||||
})
|
||||
|
||||
return lu
|
||||
}
|
||||
|
||||
// SortByDeletedTime sorts ListDisksUnattached by the DeletedTime field in ascending order.
|
||||
//
|
||||
// If inverse param is set to true, the order is reversed.
|
||||
func (lu ListDisksUnattached) SortByDeletedTime(inverse bool) ListDisksUnattached {
|
||||
if len(lu.Data) < 2 {
|
||||
return lu
|
||||
}
|
||||
|
||||
sort.Slice(lu.Data, func(i, j int) bool {
|
||||
if inverse {
|
||||
return lu.Data[i].DeletedTime > lu.Data[j].DeletedTime
|
||||
}
|
||||
|
||||
return lu.Data[i].DeletedTime < lu.Data[j].DeletedTime
|
||||
})
|
||||
|
||||
return lu
|
||||
}
|
||||
Reference in New Issue
Block a user