Vihren Atlas

matcher_data.go ×4

Code frontier

unlabeled · c_1b35335dd01c

49 tests · 3248 LOC · 147 files · introduces 0 tests · 14 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
4 ranges14 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
503 ranges3248 lines · 147 files · Browse complete extent
All tests (intent)
49 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: 14 introduced LOC across 4 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/service/matching/matcher_data.go 14 introduced LOC · 4 ranges

Open complete file

183 // ForEachTask calls pred on each non-forwarder task. If pred returns true, calls post
184 // and removes the task. pred and post must not call back into taskBTree.
185 > func (b *taskBTree) ForEachTask(pred func(*internalTask) bool, post func(*internalTask)) { matcher_data.go
186 > // Collect first, then delete: we must not mutate the tree mid-iteration.
187 > var toRemove []*internalTask
188 > b.tree.Scan(func(task *internalTask) bool {
189 if !task.isPollForwarder() && pred(task) {
190 toRemove = append(toRemove, task)
192 return true
193 })
194 > for _, task := range toRemove { matcher_data.go
195 b.tree.Delete(task)
196 task.matchHeapIndex = invalidHeapIndex
392 }
393
394 > func (d *matcherData) ReprocessTasks(pred func(*internalTask) bool) []*internalTask { matcher_data.go
395 > d.lock.Lock()
396 > defer d.lock.Unlock()
397 >
398 > reprocess := make([]*internalTask, 0, d.tasks.Len())
399 > d.tasks.ForEachTask(
400 > pred,
401 > func(task *internalTask) {
402 // for sync tasks: wake up waiters with a fake context error
403 // for backlog tasks: the caller should call finish()

Direct hierarchy

Parents

Children