1846
}
1847
1848
>
func subtractStats(into *taskqueuepb.TaskQueueStats, sub *taskqueuepb.TaskQueueStats) {
task_queue_partition_manager.go
1849
>
if into == nil || sub == nil {
1850
return
1851
}
1852
>
into.ApproximateBacklogCount = max(0, into.GetApproximateBacklogCount()-sub.GetApproximateBacklogCount())
task_queue_partition_manager.go
1853
>
into.TasksAddRate = max(0, into.GetTasksAddRate()-sub.GetTasksAddRate())
1854
>
into.TasksDispatchRate = max(0, into.GetTasksDispatchRate()-sub.GetTasksDispatchRate())
1855
>
1856
>
// Rather than splitting the backlog age, we set it to the oldest backlog age for both the current and the ramping shares.
1857
>
// However, if the backlog count is zero, we set the backlog age to zero.
1858
>
if into.GetApproximateBacklogCount() == 0 || into.GetApproximateBacklogAge() == nil {
1859
into.ApproximateBacklogAge = durationpb.New(0)
1860
}
1861
}
1862
1863
>
func subtractStatsByPriority(into, sub map[int32]*taskqueuepb.TaskQueueStats) {
task_queue_partition_manager.go
1864
>
if len(sub) == 0 || len(into) == 0 {
1865
return
1866
}
1868
>
if s == nil {
1869
continue
1870
}
1872
>
if !ok || existing == nil {
1873
continue
1874
}
1876
}
1877
}