tree.go ×6

Frontier kind: Code frontier

unlabeled · c_19109392b208

14 tests · 2325 LOC · 89 files · introduces 0 tests · 17 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges17 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
406 ranges2325 lines · 89 files · Browse complete extent
All tests (intent)
14 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: 17 introduced LOC across 6 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/chasm/tree.go 17 introduced LOC · 6 ranges

Open complete file

2978 }
2979
2980 > func (n *Node) delete(isSystemDelete bool) error { tree.go
2981 > for _, childNode := range n.children {
2982 if err := childNode.delete(isSystemDelete); err != nil {
2983 return err
2986
2987 // If a parent is about to be removed, it must not have any children.
2988 > softassert.That(n.logger, len(n.children) == 0, "children must be empty when node is removed") tree.go
2989 >
2990 > if n.parent != nil {
2991 > delete(n.parent.children, n.nodeName)
2992 > }
2993
2994 // Set value to nil which also deletes the value from valueToNode map.
2995 > n.setValue(nil) tree.go
2996 >
2997 > encodedPath, err := n.getEncodedPath()
2998 > if err != nil {
2999 return err
3000 }
3012 // first with a deletion only mutation for tombstone nodes, and then an
3013 // update only mutation.
3014 > if n.serializedNode.GetMetadata().GetLastUpdateVersionedTransition() != nil { tree.go
3015 if isSystemDelete {
3016 n.systemMutation.DeletedNodes[encodedPath] = struct{}{}
3020 }
3021
3022 > n.cleanupCachedTasks() tree.go
3023 >
3024 > return nil
3025 }
3026
3027 > func (n *Node) cleanupCachedTasks() { tree.go
3028 > if !n.isComponent() {
3029 return
3030 }