Vihren Atlas

tree.go ×11

Code frontier

unlabeled · c_58f6ee2b5192

281 tests · 2002 LOC · 80 files · introduces 0 tests · 35 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
11 ranges35 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
312 ranges2002 lines · 80 files · Browse complete extent
All tests (intent)
281 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: 35 introduced LOC across 11 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/chasm/tree.go 35 introduced LOC · 11 ranges

Open complete file

1692 // CloseTransaction is used by MutableState to close the transaction and
1693 // track changes made in the current transaction.
1694 > func (n *Node) CloseTransaction() (NodesMutation, error) { tree.go
1695 > defer n.cleanupTransaction()
1696 >
1697 > if err := n.executeImmediatePureTasks(); err != nil {
1698 return NodesMutation{}, err
1699 }
1700
1701 > if err := n.syncSubComponents(); err != nil { tree.go
1702 return NodesMutation{}, err
1703 }
1704
1705 > if n.needsPointerResolution { tree.go
1706 if err := n.resolveDeferredPointers(); err != nil {
1707 return NodesMutation{}, err
1745 }
1746
1747 > func (n *Node) executeImmediatePureTasks() error { tree.go
1748 >
1749 > // We must sync structure before running any tasks here because,
1750 > // those tasks might be for a newly created component which doesn't even have a node yet.
1751 > // And we want to make sure we only run tasks for components that are still part of the tree.
1752 > syncStructure := true
1753 > var err error
1754 >
1755 > for len(n.immediatePureTasks) != 0 {
1756 // Create a map in case more immediate pure tasks get
1757 // added while existing ones are executed.
1786 }
1787
1788 > return nil tree.go
1789 }
1790
2469 }
2470
2471 > func (n *Node) cleanupTransaction() { tree.go
2472 > n.mutation = NodesMutation{
2473 > UpdatedNodes: make(map[string]*persistencespb.ChasmNode),
2474 > DeletedNodes: make(map[string]struct{}),
2475 > }
2476 >
2477 > // System mutation are most likely to be empty, so we reuse existing ones if possible.
2478 > if len(n.systemMutation.UpdatedNodes) != 0 {
2479 n.systemMutation.UpdatedNodes = make(map[string]*persistencespb.ChasmNode)
2480 }
2481 > if len(n.systemMutation.DeletedNodes) != 0 { tree.go
2482 n.systemMutation.DeletedNodes = make(map[string]struct{})
2483 }
2484
2485 > n.newTasks = make(map[any][]taskWithAttributes) tree.go
2486 > if len(n.immediatePureTasks) != 0 {
2487 // n.immediatePureTasks should already be empty after executeImmediatePureTasks()
2488 // unless there's an error.
2490 }
2491
2492 > if len(n.pendingRequestLinks) != 0 { tree.go
2493 n.pendingRequestLinks = make(map[any]map[string][]*commonpb.Link)
2494 }
2495 > if len(n.pendingUserMetadata) != 0 { tree.go
2496 n.pendingUserMetadata = make(map[any]*sdkpb.UserMetadata)
2497 }
2498
2499 > n.needsPointerResolution = false tree.go
2500 >
2501 > // Reset per-node subtreeIsDirty on all nodes in the tree.
2502 > for _, node := range n.andAllChildren() {
2503 > node.subtreeIsDirty = false
2504 > }
2505 }
2506

Direct hierarchy

Parents

Children