Vihren Atlas

tree.go ×5

Code frontier

unlabeled · c_c74f4a0d3bbc

41 tests · 2137 LOC · 85 files · introduces 0 tests · 12 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges12 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
351 ranges2137 lines · 85 files · Browse complete extent
All tests (intent)
41 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 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

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

Open complete file

2510 func (n *Node) Snapshot(
2511 exclusiveMinVT *persistencespb.VersionedTransition,
2512 > ) NodesSnapshot { tree.go
2513 > if !softassert.That(n.logger, n.parent == nil, "chasm.Snapshot() should only be called on the root node") {
2514 panic(fmt.Sprintf("chasm.Snapshot() called on child node: %+v", n))
2515 }
2517 // TODO: add assertion on IsDirty() once implemented
2518
2519 > nodes := make(map[string]*persistencespb.ChasmNode) tree.go
2520 > n.snapshotInternal(exclusiveMinVT, nodes)
2521 >
2522 > return NodesSnapshot{
2523 > Nodes: nodes,
2524 > }
2525 }
2526
2528 exclusiveMinVT *persistencespb.VersionedTransition,
2529 nodes map[string]*persistencespb.ChasmNode,
2530 > ) { tree.go
2531 > if n == nil {
2532 return
2533 }
2534
2535 > if transitionhistory.Compare(n.serializedNode.Metadata.LastUpdateVersionedTransition, exclusiveMinVT) > 0 { tree.go
2536 encodedPath, err := n.getEncodedPath()
2537 if !softassert.That(n.logger, err == nil, "chasm path encoding should always succeed on clean tree") {
2541 }
2542
2543 > for _, childNode := range n.children { tree.go
2544 childNode.snapshotInternal(
2545 exclusiveMinVT,

Direct hierarchy

Parents

Children