Vihren Atlas

tree.go ×2

Code frontier

unlabeled · c_e92e9ee3d02e

232 tests · 2164 LOC · 81 files · introduces 0 tests · 18 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
3 ranges18 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
362 ranges2164 lines · 81 files · Browse complete extent
All tests (intent)
232 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: 18 introduced LOC across 3 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/chasm/tree.go 16 introduced LOC · 2 ranges

Open complete file

1147 fieldValue := internal.value()
1148 if internal.node == nil && fieldValue != nil {
1149 > fieldType := internal.fieldType() tree.go
1150 >
1151 > // Field is not empty but tree node is not set. It means this is a new field, and a node must be created.
1152 > childNode := newNode(n.nodeBase, n, fieldN)
1153 > childNode.initSerializedNode(fieldType)
1154 > childNode.setValueState(valueStateNeedSerialize)
1155 >
1156 > // set node value after validation
1157 > switch fieldType {
1158 case fieldTypeComponent:
1159 if err = assertStructPointer(reflect.TypeOf(fieldValue)); err != nil {
1193 return
1194 }
1195 > childNode.setValue(fieldValue) tree.go
1196 >
1197 > n.children[fieldN] = childNode
1198 > internal.node = childNode
1199 >
1200 > updatedFieldV = reflect.New(fieldV.Type()).Elem()
1201 > updatedFieldV.FieldByName(internalFieldName).Set(reflect.ValueOf(internal))
1202 }
1203
go.temporal.io/server/chasm/field_internal.go 2 introduced LOC · 1 range

Open complete file

51 // resolution.
52 if fi.node == nil || fi.ft == fieldTypeDeferredPointer {
53 > return fi.ft field_internal.go
54 > }
55 return fi.node.fieldType()
56 }

Direct hierarchy

Parents

Children