Vihren Atlas

mutable_state_impl.go ×4

Code frontier

unlabeled · c_99755db37923

8 tests · 4844 LOC · 198 files · introduces 0 tests · 23 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges23 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
780 ranges4844 lines · 198 files · Browse complete extent
All tests (intent)
8 testsBrowse complete intent

Neighbourhood graph

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.

Native relationship evidence

Every exact file and test below is linked only from the concept that introduces it.

Introduced tests

Every collected test enters the hierarchy at exactly one concept.

No tests are introduced at this concept. Its intent tests are introduced by other concepts.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

2 files ranked by introduced lines: 23 introduced LOC across 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/service/history/workflow/mutable_state_impl.go 20 introduced LOC · 4 ranges

Open complete file

6794
6795 // check workflow rules
6796 > if !ai.Paused { mutable_state_impl.go
6797 > ActivityMatchWorkflowRules(ms, ms.timeSource, ms.logger, ai)
6798 > }
6799
6800 // if activity is paused
6801 > if ai.Paused { mutable_state_impl.go
6802 // need to update activity
6803 if err := ms.UpdateActivity(ai.ScheduledEventId, func(activityInfo *persistencespb.ActivityInfo, _ historyi.MutableState) error {
6818 }
6819
6820 > retryMaxInterval := ai.RetryMaximumInterval mutable_state_impl.go
6821 > // if a delay is specified by the application it should override the maximum interval set by the retry policy.
6822 > delay := nextRetryDelayFrom(activityFailure)
6823 > if delay != nil {
6824 retryMaxInterval = durationpb.New(*delay)
6825 }
6826
6827 > now := ms.timeSource.Now().In(time.UTC) mutable_state_impl.go
6828 > retryBackoff, retryState := nextBackoffInterval(
6829 > ms.timeSource.Now().In(time.UTC),
6830 > ai.Attempt,
6831 > ai.RetryMaximumAttempts,
6832 > ai.RetryInitialInterval,
6833 > retryMaxInterval,
6834 > ai.RetryExpirationTime,
6835 > ai.RetryBackoffCoefficient,
6836 > backoff.MakeBackoffAlgorithm(delay),
6837 > )
6838 > if retryState != enumspb.RETRY_STATE_IN_PROGRESS {
6839 return retryState, nil
6840 }
go.temporal.io/server/common/backoff/retry.go 3 introduced LOC · 1 range

Open complete file

184 // MakeBackoffAlgorithm creates a BackoffCalculatorAlgorithmFunc that returns a fixed delay if requestedDelay is non-nil,
185 // otherwise falls back to exponential backoff algorithm.
186 > func MakeBackoffAlgorithm(requestedDelay *time.Duration) BackoffCalculatorAlgorithmFunc { retry.go
187 > return func(duration *durationpb.Duration, coefficient float64, currentAttempt int32) time.Duration {
188 > if requestedDelay != nil {
189 return *requestedDelay
190 }

Direct hierarchy

Parents

Children