Vihren Atlas

tree.go ×4

Code frontier

unlabeled · c_76c03ed0f0d3

2 tests · 3238 LOC · 101 files · introduces 0 tests · 13 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges13 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
721 ranges3238 lines · 101 files · Browse complete extent
All tests (intent)
2 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: 13 introduced LOC across 5 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

1477 // semantics of componentRequestLinks), so a caller staging an update doesn't
1478 // observe stale + new entries side-by-side.
1479 > func (n *Node) componentLinks(component Component) []*commonpb.Link { tree.go
1480 > var links []*commonpb.Link
1481 > pending := n.pendingRequestLinks[component]
1482 >
1483 > for _, ls := range pending {
1484 links = append(links, ls...)
1485 }
1486
1487 > if refNode, ok := n.valueToNode[component]; ok && refNode.isComponent() { tree.go
1488 > for requestID, req := range refNode.serializedNode.GetMetadata().GetComponentAttributes().GetRequests() {
1489 > if _, overridden := pending[requestID]; overridden {
1490 continue
1491 }
1494 }
1495
1496 > return links tree.go
1497 }
1498
1523 return nil, serviceerror.NewInvalidArgument("requestID is required when reading per-request links")
1524 }
1525 > if pending, ok := n.pendingRequestLinks[component]; ok { tree.go
1526 if links, ok := pending[requestID]; ok {
1527 return links, nil
go.temporal.io/server/chasm/context.go 3 introduced LOC · 1 range

Open complete file

161 }
162
163 > func (c *immutableCtx) Links(component Component) []*commonpb.Link { context.go
164 > return c.root.componentLinks(component)
165 > }
166
167 func (c *immutableCtx) RequestLinks(component Component, requestID string) ([]*commonpb.Link, error) {

Direct hierarchy

Parents

Children