Vihren Atlas

tree.go ×10

Code frontier

unlabeled · c_4158b37da6ca

11 tests · 2672 LOC · 96 files · introduces 0 tests · 24 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
10 ranges24 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
519 ranges2672 lines · 96 files · Browse complete extent
All tests (intent)
11 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: 24 introduced LOC across 10 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/chasm/tree.go 24 introduced LOC · 10 ranges

Open complete file

440 }
441
442 > func (n *Node) clearAncestorNodeValues(parent *Node) { tree.go
443 > for node := parent; node != nil; node = node.parent {
444 if node.serializedNode == nil || !node.isComponent() || node.value == nil {
445 continue
2685 func (n *Node) ApplyMutation(
2686 mutation NodesMutation,
2687 > ) error { tree.go
2688 > if err := n.applyDeletions(mutation.DeletedNodes, false); err != nil {
2689 return err
2690 }
2691
2692 > if err := n.applyUpdates(mutation.UpdatedNodes, false); err != nil { tree.go
2693 return err
2694 }
2704 // TODO: combine this with the logic in CloseTransactionForceUpdateVisibility
2705 // right that force update logic only applies to the active cluster.
2706 > immutableContext := NewContext(context.TODO(), n) tree.go
2707 > rootComponent, err := n.root().Component(immutableContext, ComponentRef{})
2708 > if err != nil {
2709 return err
2710 }
2711 > saProvider, ok := rootComponent.(VisibilitySearchAttributesProvider) tree.go
2712 > if ok {
2713 > saSlice := saProvider.SearchAttributes(immutableContext)
2714 > n.currentSA = searchAttributeKeyValuesToMap(saSlice)
2715 > }
2716 > memoProvider, ok := rootComponent.(VisibilityMemoProvider)
2717 > if ok {
2718 > n.currentMemo = proto.Clone(memoProvider.Memo(immutableContext))
2719 > }
2720
2721 > return nil tree.go
2722 }
2723
2768 deletedNodes map[string]struct{},
2769 isSystemUpdates bool,
2770 > ) error { tree.go
2771 > for encodedPath := range deletedNodes {
2772 path, err := n.pathEncoder.Decode(encodedPath)
2773 if err != nil {
2814 }
2815
2816 > return nil tree.go
2817 }
2818
2820 updatedNodes map[string]*persistencespb.ChasmNode,
2821 isSystemUpdates bool,
2822 > ) error { tree.go
2823 > for encodedPath, updatedNode := range updatedNodes {
2824 path, err := n.pathEncoder.Decode(encodedPath)
2825 if err != nil {
2878 }
2879
2880 > return nil tree.go
2881 }
2882

Direct hierarchy

Parents

Children