Vihren Atlas

tree.go ×4

Code frontier

unlabeled · c_25ea8db026fa

148 tests · 3098 LOC · 98 files · introduces 0 tests · 20 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
4 ranges20 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
671 ranges3098 lines · 98 files · Browse complete extent
All tests (intent)
148 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: 20 introduced LOC across 4 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

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

Open complete file

1676 rt, ok := n.registry.taskFor(task)
1677 if ok && rt.isPureTask && taskAttributes.IsImmediate() {
1678 > // Those tasks will be executed in the current transaction. tree.go
1679 > n.immediatePureTasks[component] = append(n.immediatePureTasks[component], taskWithAttributes{
1680 > task: task,
1681 > attributes: taskAttributes,
1682 > })
1683 > return
1684 > }
1685
1686 n.newTasks[component] = append(n.newTasks[component], taskWithAttributes{
1754
1755 for len(n.immediatePureTasks) != 0 {
1756 > // Create a map in case more immediate pure tasks get tree.go
1757 > // added while existing ones are executed.
1758 > immediatePureTasks := n.immediatePureTasks
1759 > n.immediatePureTasks = make(map[any][]taskWithAttributes)
1760 >
1761 > for component, pureTasks := range immediatePureTasks {
1762 > for _, task := range pureTasks {
1763 > if syncStructure {
1764 > if err := n.syncSubComponents(); err != nil {
1765 return err
1766 }
1772 // 2. Previous pure task for the node deleted the node itself via a (parent) pointer.
1773 // This is also why this check is done in the inner for loop.
1774 > taskNode, ok := n.valueToNode[component] tree.go
1775 > if !ok {
1776 break
1777 }
1778
1779 // Only syncStructure on next iteration if task is executed (the first return value).
1780 > syncStructure, err = taskNode.ExecutePureTask(context.Background(), task.attributes, task.task) tree.go
1781 > if err != nil {
1782 return err
1783 }

Direct hierarchy

Parents

Children