-
Notifications
You must be signed in to change notification settings - Fork 1
/
bucket.go
62 lines (49 loc) · 2.43 KB
/
bucket.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/* Copyright (c) 2016 Jason Mansfield
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*/
// bucket captures objects below a certain age, decides which ones should be deleted, and deletes them.
package bucket
import (
"sort"
"time"
"github.com/AgentZombie/agerotate"
)
// bucket is a container for Object(s) and is intended to hold those objects younger than the Age of the Range but older than younger buckets.
type bucket struct {
agerotate.Range
objects []agerotate.Object
}
func newBucket(r agerotate.Range) *bucket {
return &bucket{
r,
[]agerotate.Object{},
}
}
func (b *bucket) Add(o agerotate.Object) {
b.objects = append(b.objects, o)
}
func (b bucket) Age() time.Duration {
return b.Range.Age
}
// Cleanup sorts the objects in the bucket by Age then deletes objects according to the Interval. The first object in the bucket is always retained. For each object thereafter, if the age of the object is less than the age of the last retained object plus Interval, the newer object is deleted. If the next object is older than the age of the last retained object plus Interval, the newer object is retained and processing continues.
func (b *bucket) Cleanup() error {
if len(b.objects) < 2 {
return nil
}
sort.Sort(agerotate.ObjectsByAge{b.objects})
baseAge := b.objects[0].Age()
for _, o := range b.objects[1:] {
oAge := o.Age()
if oAge-baseAge < b.Range.Interval {
err := o.Delete()
if err != nil {
return err
}
} else {
baseAge = oAge
}
}
return nil
}