diff options
| author | Michael Muré <batolettre@gmail.com> | 2020-07-28 20:39:07 +0200 |
|---|---|---|
| committer | Michael Muré <batolettre@gmail.com> | 2020-07-28 20:39:07 +0200 |
| commit | 92a59eceee0393b19479616f7531e6e8dba2a371 (patch) | |
| tree | 0448c2a69119939062c528137b7485eb15c7220b /cache/bug_excerpt.go | |
| parent | 51c887ff9dd4f2a5f65d2d3de57f8a7729b1010d (diff) | |
| download | git-bug-92a59eceee0393b19479616f7531e6e8dba2a371.tar.gz | |
cache: fix BugExcerpt's timestamp not properly stored
fix #426
Diffstat (limited to 'cache/bug_excerpt.go')
| -rw-r--r-- | cache/bug_excerpt.go | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/cache/bug_excerpt.go b/cache/bug_excerpt.go index e9d5863f..14201c6a 100644 --- a/cache/bug_excerpt.go +++ b/cache/bug_excerpt.go @@ -23,8 +23,8 @@ type BugExcerpt struct { CreateLamportTime lamport.Time EditLamportTime lamport.Time - createUnixTime int64 - editUnixTime int64 + CreateUnixTime int64 + EditUnixTime int64 Status bug.Status Labels []bug.Label @@ -80,8 +80,8 @@ func NewBugExcerpt(b bug.Interface, snap *bug.Snapshot) *BugExcerpt { Id: b.Id(), CreateLamportTime: b.CreateLamportTime(), EditLamportTime: b.EditLamportTime(), - createUnixTime: b.FirstOp().Time().Unix(), - editUnixTime: snap.EditTime().Unix(), + CreateUnixTime: b.FirstOp().Time().Unix(), + EditUnixTime: snap.EditTime().Unix(), Status: snap.Status, Labels: snap.Labels, Actors: actorsIds, @@ -107,11 +107,11 @@ func NewBugExcerpt(b bug.Interface, snap *bug.Snapshot) *BugExcerpt { } func (b *BugExcerpt) CreateTime() time.Time { - return time.Unix(b.createUnixTime, 0) + return time.Unix(b.CreateUnixTime, 0) } func (b *BugExcerpt) EditTime() time.Time { - return time.Unix(b.editUnixTime, 0) + return time.Unix(b.EditUnixTime, 0) } /* @@ -153,7 +153,7 @@ func (b BugsByCreationTime) Less(i, j int) bool { // by the first sorting using the logical clock. That means that if users // synchronize their bugs regularly, the timestamp will rarely be used, and // should still provide a kinda accurate sorting when needed. - return b[i].createUnixTime < b[j].createUnixTime + return b[i].CreateUnixTime < b[j].CreateUnixTime } func (b BugsByCreationTime) Swap(i, j int) { @@ -181,7 +181,7 @@ func (b BugsByEditTime) Less(i, j int) bool { // by the first sorting using the logical clock. That means that if users // synchronize their bugs regularly, the timestamp will rarely be used, and // should still provide a kinda accurate sorting when needed. - return b[i].editUnixTime < b[j].editUnixTime + return b[i].EditUnixTime < b[j].EditUnixTime } func (b BugsByEditTime) Swap(i, j int) { |