Vihren Atlas

version_sets.go ×6

Code frontier

unlabeled · c_820c0621a958

34 tests · 2673 LOC · 136 files · introduces 0 tests · 15 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges15 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
409 ranges2673 lines · 136 files · Browse complete extent
All tests (intent)
34 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: 15 introduced LOC across 6 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/service/matching/version_sets.go 15 introduced LOC · 6 ranges

Open complete file

167 //
168 // Update may fail with FailedPrecondition if it would cause exceeding the supplied limits.
169 > func UpdateVersionSets(clock *hlc.Clock, data *persistencespb.VersioningData, req *workflowservice.UpdateWorkerBuildIdCompatibilityRequest, maxSets, maxBuildIds int) (*persistencespb.VersioningData, error) { version_sets.go
170 > if data == nil {
171 data = &persistencespb.VersioningData{VersionSets: make([]*persistencespb.CompatibleVersionSet, 0)}
172 > } else { version_sets.go
173 data = common.CloneProto(data)
174 }
175 > data, err := updateVersionSetImpl(clock, data, req) version_sets.go
176 > if err != nil {
177 return nil, err
178 }
181
182 //nolint:revive // cyclomatic complexity
183 > func updateVersionSetImpl(timestamp *hlc.Clock, data *persistencespb.VersioningData, req *workflowservice.UpdateWorkerBuildIdCompatibilityRequest) (*persistencespb.VersioningData, error) { version_sets.go
184 > // First find if the targeted version is already in the sets
185 > targetedVersion := extractTargetedVersion(req)
186 > targetSetIdx, versionInSetIdx := worker_versioning.FindBuildId(data, targetedVersion)
187 > numExistingSets := len(data.GetVersionSets())
188 >
189 > if req.GetAddNewBuildIdInNewDefaultSet() != "" {
190 targetIsInDefaultSet := targetSetIdx == numExistingSets-1
191 targetIsOnlyBuildIdInSet := versionInSetIdx == 0 && len(data.VersionSets[numExistingSets-1].BuildIds) == 1
283 }
284
285 > func extractTargetedVersion(req *workflowservice.UpdateWorkerBuildIdCompatibilityRequest) string { version_sets.go
286 > if req.GetAddNewCompatibleBuildId() != nil {
287 return req.GetAddNewCompatibleBuildId().GetNewBuildId()
288 > } else if req.GetPromoteSetByBuildId() != "" { version_sets.go
289 return req.GetPromoteSetByBuildId()
290 } else if req.GetPromoteBuildIdWithinSet() != "" {

Direct hierarchy

Parents

Children