Vihren Atlas

tree.go ×4

Code frontier

unlabeled · c_a50c30aebd8c

261 tests · 2252 LOC · 83 files · introduces 0 tests · 12 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
4 ranges12 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
409 ranges2252 lines · 83 files · Browse complete extent
All tests (intent)
261 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: 12 introduced LOC across 4 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/chasm/tree.go 12 introduced LOC · 4 ranges

Open complete file

1943 }
1944
1945 > encodedPath, err := node.getEncodedPath() tree.go
1946 > if err != nil {
1947 return err
1948 }
1952 // prevData captures the pre-serialize blob pointer; serialize() allocates a new
1953 // blob, leaving prevData pointing at the original for comparison.
1954 > prevVersionedTransition := common.CloneProto( tree.go
1955 > node.serializedNode.GetMetadata().GetLastUpdateVersionedTransition(),
1956 > )
1957 > skipIfClean := (node.isComponent() || node.isData() || node.isMap()) &&
1958 > prevVersionedTransition != nil &&
1959 > !node.hasNewTransactionSideEffects()
1960 > var prevData *commonpb.DataBlob
1961 > if skipIfClean {
1962 prevData = node.serializedNode.Data
1963 }
1964
1965 > if err := node.serialize(); err != nil { tree.go
1966 return err
1967 }
1968
1969 // Data bytes unchanged: revert the versioned transition bump and skip persistence.
1970 > if skipIfClean && bytes.Equal(prevData.GetData(), node.serializedNode.Data.GetData()) { tree.go
1971 node.serializedNode.GetMetadata().LastUpdateVersionedTransition = prevVersionedTransition
1972 continue

Direct hierarchy

Parents

Children