Vihren Atlas

reader.go ×8

Code frontier

unlabeled · c_f192bb1d11ad

13 tests · 2844 LOC · 143 files · introduces 0 tests · 31 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
8 ranges31 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
436 ranges2844 lines · 143 files · Browse complete extent
All tests (intent)
13 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: 31 introduced LOC across 8 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/service/history/queues/reader.go 31 introduced LOC · 8 ranges

Open complete file

228 }
229
230 > func (r *ReaderImpl) MergeSlices(incomingSlices ...Slice) { reader.go
231 > if len(incomingSlices) == 0 {
232 return
233 }
234
235 > validateSlicesOrderedDisjoint(incomingSlices) reader.go
236 >
237 > r.Lock()
238 > defer r.Unlock()
239 >
240 > mergedSlices := list.New()
241 >
242 > currentSliceElement := r.slices.Front()
243 > incomingSliceIdx := 0
244 >
245 > for currentSliceElement != nil && incomingSliceIdx < len(incomingSlices) {
246 currentSlice := currentSliceElement.Value.(Slice)
247 incomingSlice := incomingSlices[incomingSliceIdx]
256 }
257
258 > for ; currentSliceElement != nil; currentSliceElement = currentSliceElement.Next() { reader.go
259 mergeOrAppendSlice(mergedSlices, currentSliceElement.Value.(Slice))
260 }
261 > for _, slice := range incomingSlices[incomingSliceIdx:] { reader.go
262 > mergeOrAppendSlice(mergedSlices, slice)
263 > }
264
265 // clear existing list
266 > r.slices.Init() reader.go
267 > r.slices = mergedSlices
268 >
269 > r.resetNextReadSliceLocked()
270 > r.monitor.SetSliceCount(r.readerID, r.slices.Len())
271 }
272
535 slices *list.List,
536 incomingSlice Slice,
537 > ) { reader.go
538 > if scope := incomingSlice.Scope(); scope.IsEmpty() {
539 return
540 }
541
542 > if slices.Len() == 0 { reader.go
543 > slices.PushBack(incomingSlice)
544 > return
545 > }
546
547 > lastElement := slices.Back() reader.go
548 > lastSlice := lastElement.Value.(Slice)
549 > if !lastSlice.CanMergeWithSlice(incomingSlice) {
550 slices.PushBack(incomingSlice)
551 return

Direct hierarchy

Parents

Children