Frontier kind: Code frontier
unlabeled · c_6a540a20c158
2 tests · 3805 LOC · 126 files · introduces 0 tests · 52 LOC · 1 file
The orange circle is the focus. Violet and green circles are every ancestor and descendant, broader and narrower, at any distance; blue squares and pink diamonds are the introduced files and exact introduced tests of every visible concept, not only the focus's. Arrows point from broader to narrower concepts and bridge only concepts omitted from this view. Undirected links show source or test introduction. Concept and file size follows LOC; exact test nodes use test-count units.
Introduced files, introduced tests, and structurally relevant concept specialization
In the embedded map, ordinary wheel input scrolls the page; use the visible controls to zoom and drag to pan. Open the full-screen map for canvas navigation: wheel pans, Ctrl/Command plus wheel zooms, and arrow keys pan when this region is focused. On touch screens, open the full-screen map to pan or pinch. If JavaScript or WebGL is unavailable, use the native relationship evidence on this page.
Graph controls are ready.
Interactive rendering requires JavaScript and WebGL. Use the native relationship evidence on this page while the interactive map is unavailable.
Every exact file and test below is linked only from the concept that introduces it.
go.temporal.io/server/common/persistence/client/TestQuotasSuite/TestAPITypeCallOriginPriorityOverrideMappinggo.temporal.io/server/common/persistence/client/TestQuotasSuite/TestBackgroundTypeAPIPriorityOverrideMappinggo.temporal.io/server/common/persistence/client/TestQuotasSuite/TestCallerTypeDefaultPriorityMappinggo.temporal.io/server/common/persistence/client/TestQuotasSuite/TestRequestPrioritiesOrderedEvery collected test enters the hierarchy at exactly one concept.
No tests are introduced at this concept. Its intent tests are introduced by other concepts.
Every collected source range enters the hierarchy at exactly one concept.
1 file ranked by introduced lines: 52 introduced LOC across 15 ranges. Expand a file to inspect source; the > gutter marks introduced lines.
s.State.LastProcessedTime = timestamppb.New(lastAction)
} else {
}
// handle signals after processing time range that just elapsed
scheduleChanged := s.processSignals()
}
s.State.OngoingBackfills = append(s.State.OngoingBackfills, common.CloneProto(bfr))
// Old version: process whole backfill synchronously
s.processTimeRange(
timestamp.TimeValue(bfr.GetStartTime()),
timestamp.TimeValue(bfr.GetEndTime()),
bfr.GetOverlapPolicy(),
true,
nil,
)
}
}
}
// we populate the map sequentially, if after is not in the map, it means we either exhausted
// all items, or we jumped through time (forward or backward), in either case, refresh the cache
next, ok := s.nextTimeCacheV1[after]
if ok {
return next
}
s.nextTimeCacheV1 = nil
// Run this logic in a SideEffect so that we can fix bugs there without breaking
// existing schedule workflows.
panicIfErr(workflow.SideEffect(s.ctx, func(ctx workflow.Context) any {
results := make(map[time.Time]GetNextTimeResult)
for t := after; !t.IsZero() && len(results) < nextTimeCacheV1Size; {
return results
}).Get(&s.nextTimeCacheV1))
}
}
// Try as json value
if val.Get(&jsonVal) != nil || jsonVal.Start.IsZero() {
panic("could not decode next time cache as proto or json")
}
Version: int64(jsonVal.Version),
StartTime: timestamppb.New(jsonVal.Start),
NextTimes: make([]int64, len(jsonVal.Results)),
NominalTimes: make([]int64, len(jsonVal.Results)),
Completed: jsonVal.Completed,
}
for i, res := range jsonVal.Results {
s.nextTimeCacheV2.NextTimes[i] = int64(res.Next.Sub(jsonVal.Start))
s.nextTimeCacheV2.NominalTimes[i] = int64(res.Nominal.Sub(jsonVal.Start))
}
}
return s.getNextTimeV2(after, after)
} else if s.hasMinVersion(BatchAndCacheTimeQueries) {
}
// Run this logic in a SideEffect so that we can fix bugs there without breaking
// existing schedule workflows.
panicIfErr(workflow.SideEffect(s.ctx, func(ctx workflow.Context) any {
res, _ := s.cspec.GetNextTime(s.jitterSeed(), after)
return res
}).Get(&next))
}
for next = s.getNextTime(start); !(next.Next.IsZero() || next.Next.After(end)); next = s.getNextTime(next.Next) {
if !s.hasMinVersion(BatchAndCacheTimeQueries) && !s.canTakeScheduledAction(manual, false) {
}
if !manual && s.Info.UpdateTime.AsTime().After(next.Next) {
s.currentTimer = nil
})
tmr := workflow.NewTimer(s.ctx, sleepTime)
sel.AddFuture(tmr, func(_ workflow.Future) {})
}
}
sel.Select(s.ctx)
for sel.HasPending() {
}
}
return s.tweakables.DefaultCatchupWindow
} else if cw.AsDuration() < s.tweakables.MinCatchupWindow {
} else {
return cw.AsDuration()
s.startLongPollWatcher(s.Info.RunningWorkflows[0])
} else {
}
}
return fmt.Sprintf("%s-%s", s.State.NamespaceId, s.State.ScheduleId)
}
}