Vihren Atlas

fair_task_writer.go ×5

Code frontier

unlabeled · c_3e58dbe3c1aa

6 tests · 7235 LOC · 204 files · introduces 0 tests · 10 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges10 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
1562 ranges7235 lines · 204 files · Browse complete extent
All tests (intent)
6 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: 10 introduced LOC across 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/service/matching/fair_task_writer.go 10 introduced LOC · 5 ranges

Open complete file

103 for i := range reqs {
104 if w.taskIDBlock.start > w.taskIDBlock.end {
105 > // we ran out of current allocation block fair_task_writer.go
106 > newBlock, err := w.allocTaskIDBlock(w.taskIDBlock.end)
107 > if err != nil {
108 return err
109 }
110 > w.taskIDBlock = newBlock fair_task_writer.go
111 }
112 reqs[i].id = w.taskIDBlock.start
245 }
246
247 > func (w *fairTaskWriter) allocTaskIDBlock(prevBlockEnd int64) (taskIDBlock, error) { fair_task_writer.go
248 > currBlock := rangeIDToTaskIDBlock(w.db.RangeID(), w.config.RangeSize)
249 > if currBlock.end != prevBlockEnd {
250 return taskIDBlock{}, errNonContiguousBlocks
251 }
252 > state, err := w.renewLeaseWithRetry(persistenceOperationRetryPolicy, common.IsPersistenceTransientError) fair_task_writer.go
253 > if err != nil {
254 if w.backlogMgr.signalIfFatal(err) {
255 return taskIDBlock{}, errShutdown
257 return taskIDBlock{}, err
258 }
259 > return rangeIDToTaskIDBlock(state.rangeID, w.config.RangeSize), nil fair_task_writer.go
260 }
261

Direct hierarchy

Parents

Children