Vihren Atlas

tree.go ×4

Code frontier

unlabeled · c_8297f526f9d1

23 tests · 2328 LOC · 88 files · introduces 0 tests · 14 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges14 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
427 ranges2328 lines · 88 files · Browse complete extent
All tests (intent)
23 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: 14 introduced LOC across 6 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

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

Open complete file

635 chasmContext Context,
636 valueT reflect.Type,
637 > ) error { tree.go
638 > metadata := n.serializedNode.Metadata
639 > dataAttr := metadata.GetDataAttributes()
640 > if dataAttr == nil {
641 return softassert.UnexpectedInternalErr(
642 n.logger,
645 }
646
647 > if n.valueState == valueStateNeedDeserialize { tree.go
648 if err := n.deserialize(valueT); err != nil {
649 return fmt.Errorf("failed to deserialize data: %w", err)
653 // For now, we assume if a node is accessed with a MutableContext,
654 // its value will be mutated and no longer in sync with the serializedNode.
655 > _, componentCanBeMutated := chasmContext.(MutableContext) tree.go
656 > if componentCanBeMutated {
657 > n.setValueState(valueStateNeedSerialize)
658 > }
659
660 > return nil tree.go
661 }
662
go.temporal.io/server/chasm/field.go 4 introduced LOC · 2 ranges

Open complete file

104 }
105 nodeValue = f.Internal.node.value
106 > case fieldTypeData: field.go
107 > // For data fields, T is always a concrete type.
108 > if err := f.Internal.node.prepareDataValue(chasmContext, reflect.TypeFor[T]()); err != nil {
109 // nolint:forbidigo // Panic is intended here for framework error handling.
110 panic(err)
111 }
112 > nodeValue = f.Internal.node.value field.go
113 case fieldTypePointer:
114 if err := f.Internal.node.preparePointerValue(); err != nil {

Direct hierarchy

Parents

Children