mirror of
https://github.com/hanzoai/tasks.git
synced 2026-10-04 02:04:03 +00:00
Alex ShtinandGitHub
8e8f1b0f7c
## What changed?
<!-- Describe what has changed in this PR -->
Remove license header from every file. Because it is really hard to
follow in this PR here is the summary:
1. License header is removed from all `.go` and `.proto` files
:fireworks::fireworks:🎆.
2. `LICENSE` file in the root directory has only Temporal and Uber
copyrights.
3. 5 other `LICENSE` files added to the packages which have copyrights
different from Temporal and Uber: Datadog, Xargin, "Mat Ryer, Tyler
Bunnell and contributors".
4. `license_file` flag is removed from all code generation tools.
5. `copyright_file` flag is removed from `go:generate mockgen`
directive.
6. All copyright related targets are removed from `Makefile`.
7. Updated Temporal copyright year to 2025 everywhere.
## Why?
<!-- Tell your future self why have you made these changes -->
I double checked with legal department that it is not needed to have
license header in every file. One file per repo is enough. I put all
copyrights to the root `LICENSE` file and removed header from all other
files. Also updated tools and `Makefile`.
61 lines
1.4 KiB
Go
61 lines
1.4 KiB
Go
package matching
|
|
|
|
import (
|
|
"time"
|
|
|
|
"github.com/emirpasic/gods/maps/treemap"
|
|
godsutils "github.com/emirpasic/gods/utils"
|
|
"go.temporal.io/server/common/util"
|
|
"google.golang.org/protobuf/types/known/timestamppb"
|
|
)
|
|
|
|
const emptyBacklogAge time.Duration = -1
|
|
|
|
// backlogAgeTracker is not safe for concurrent use
|
|
type backlogAgeTracker struct {
|
|
tree treemap.Map // unix nano as int64 -> int (count)
|
|
}
|
|
|
|
func newBacklogAgeTracker() backlogAgeTracker {
|
|
return backlogAgeTracker{tree: *treemap.NewWith(godsutils.Int64Comparator)}
|
|
}
|
|
|
|
// record adds or removes a task from the tracker.
|
|
func (b backlogAgeTracker) record(ts *timestamppb.Timestamp, delta int) {
|
|
if ts == nil {
|
|
return
|
|
}
|
|
|
|
createTime := ts.AsTime().UnixNano()
|
|
count := delta
|
|
if prev, ok := b.tree.Get(createTime); ok {
|
|
count += prev.(int) // nolint:revive
|
|
}
|
|
if count = max(0, count); count == 0 {
|
|
b.tree.Remove(createTime)
|
|
} else {
|
|
b.tree.Put(createTime, count)
|
|
}
|
|
}
|
|
|
|
// oldestTime returns the time of the oldest task in this backlog, or
|
|
// the zero Time if empty.
|
|
func (b backlogAgeTracker) oldestTime() time.Time {
|
|
if b.tree.Empty() {
|
|
return time.Time{}
|
|
}
|
|
k, _ := b.tree.Min()
|
|
return time.Unix(0, k.(int64)) // nolint:revive
|
|
}
|
|
|
|
// minNonZeroTime returns the minimum time of a and b, ignoring zero times.
|
|
// If both a and b are zero, it returns zero.
|
|
func minNonZeroTime(a, b time.Time) time.Time {
|
|
if a.IsZero() {
|
|
return b
|
|
} else if b.IsZero() {
|
|
return a
|
|
}
|
|
return util.MinTime(a, b)
|
|
}
|