Vihren Atlas

execution_mutable_state.go ×8

Code frontier

unlabeled · c_89c248430162

77 tests · 4559 LOC · 166 files · introduces 0 tests · 43 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
8 ranges43 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
843 ranges4559 lines · 166 files · Browse complete extent
All tests (intent)
77 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.

1 file ranked by introduced lines: 43 introduced LOC across 8 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/common/persistence/tests/execution_mutable_state.go 43 introduced LOC · 8 ranges

Open complete file

2785
2786 for _, mutation := range mutations {
2787 > s.Equal(dbRecordVersion, mutation.DBRecordVersion-1) execution_mutable_state.go
2788 > dbRecordVersion = mutation.DBRecordVersion
2789 >
2790 > mutableState.ExecutionInfo = mutation.ExecutionInfo
2791 > mutableState.ExecutionState = mutation.ExecutionState
2792 >
2793 > mutableState.NextEventId = mutation.NextEventID
2794 >
2795 > // activity infos
2796 > maps.Copy(mutableState.ActivityInfos, mutation.UpsertActivityInfos)
2797 > for key := range mutation.DeleteActivityInfos {
2798 > delete(mutableState.ActivityInfos, key)
2799 > }
2800
2801 // timer infos
2802 > maps.Copy(mutableState.TimerInfos, mutation.UpsertTimerInfos) execution_mutable_state.go
2803 > for key := range mutation.DeleteTimerInfos {
2804 > delete(mutableState.TimerInfos, key)
2805 > }
2806
2807 // child workflow infos
2808 > maps.Copy(mutableState.ChildExecutionInfos, mutation.UpsertChildExecutionInfos) execution_mutable_state.go
2809 > for key := range mutation.DeleteChildExecutionInfos {
2810 > delete(mutableState.ChildExecutionInfos, key)
2811 > }
2812
2813 // request cancel infos
2814 > maps.Copy(mutableState.RequestCancelInfos, mutation.UpsertRequestCancelInfos) execution_mutable_state.go
2815 > for key := range mutation.DeleteRequestCancelInfos {
2816 > delete(mutableState.RequestCancelInfos, key)
2817 > }
2818
2819 // signal infos
2820 > maps.Copy(mutableState.SignalInfos, mutation.UpsertSignalInfos) execution_mutable_state.go
2821 > for key := range mutation.DeleteSignalInfos {
2822 > delete(mutableState.SignalInfos, key)
2823 > }
2824
2825 // signal request IDs
2826 > signalRequestIDs := convert.StringSliceToSet(mutableState.SignalRequestedIds) execution_mutable_state.go
2827 > maps.Copy(signalRequestIDs, mutation.UpsertSignalRequestedIDs)
2828 > for key := range mutation.DeleteSignalRequestedIDs {
2829 > delete(signalRequestIDs, key)
2830 > }
2831 > mutableState.SignalRequestedIds = convert.StringSetToSlice(signalRequestIDs)
2832 >
2833 > // chasm nodes
2834 > maps.Copy(mutableState.ChasmNodes, mutation.UpsertChasmNodes)
2835 > for key := range mutation.DeleteChasmNodes {
2836 > delete(mutableState.ChasmNodes, key)
2837 > }
2838
2839 // buffered events
2840 > if mutation.ClearBufferedEvents { execution_mutable_state.go
2841 mutableState.BufferedEvents = nil
2842 > } else if mutation.NewBufferedEvents != nil { execution_mutable_state.go
2843 mutableState.BufferedEvents = append(mutableState.BufferedEvents, mutation.NewBufferedEvents...)
2844 }

Direct hierarchy

Parents

Children