Vihren Atlas

db.go ×6

Code frontier

unlabeled · c_1337213ac756

366 tests · 3127 LOC · 147 files · introduces 0 tests · 26 LOC · 2 files

Introduces — evidence that enters the hierarchy at this concept

Code
7 ranges26 lines · 2 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
489 ranges3127 lines · 147 files · Browse complete extent
All tests (intent)
366 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.

2 files ranked by introduced lines: 26 introduced LOC across 7 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/service/matching/db.go 22 introduced LOC · 6 ranges

Open complete file

870 }
871
872 > var totalLag int64 db.go
873 > var oldestTime time.Time
874 > counts := make(map[int32]int64)
875 > for _, s := range db.subqueues {
876 > counts[s.Key.Priority] += s.ApproximateBacklogCount
877 > oldestTime = minNonZeroTime(oldestTime, s.oldestTime)
878 > // note: this metric is only an estimation for the lag.
879 > // taskID in DB may not be continuous, especially when task list ownership changes.
880 > if s.FairMaxReadLevel != nil && s.FairAckLevel != nil {
881 // TODO(fairness): this is not a good estimate of anything, we should probably just
882 // get rid of this metric.
883 totalLag += s.FairMaxReadLevel.TaskId - s.FairAckLevel.TaskId
884 > } else { db.go
885 totalLag += s.maxReadLevel - s.AckLevel
886 }
887 }
888
889 > backlogCountGauge := metrics.ApproximateBacklogCount db.go
890 > backlogAgeGauge := metrics.ApproximateBacklogAgeSeconds
891 > if attributionEnabled {
892 > backlogCountGauge = metrics.PhysicalApproximateBacklogCount
893 > backlogAgeGauge = metrics.PhysicalApproximateBacklogAgeSeconds
894 > }
895
896 > for priority, count := range counts { db.go
897 > backlogCountGauge.With(db.metricsHandler).Record(float64(count), metrics.MatchingTaskPriorityTag(priority))
898 > }
899 > if oldestTime.IsZero() {
900 backlogAgeGauge.With(db.metricsHandler).Record(0)
901 > } else { db.go
902 backlogAgeGauge.With(db.metricsHandler).Record(time.Since(oldestTime).Seconds())
903 }
904 > metrics.TaskLagPerTaskQueueGauge.With(db.metricsHandler).Record(float64(totalLag)) db.go
905 }
906
go.temporal.io/server/service/matching/backlog_age_tracker.go 4 introduced LOC · 1 range

Open complete file

51 // minNonZeroTime returns the minimum time of a and b, ignoring zero times.
52 // If both a and b are zero, it returns zero.
53 > func minNonZeroTime(a, b time.Time) time.Time { backlog_age_tracker.go
54 > if a.IsZero() {
55 > return b
56 > } else if b.IsZero() {
57 return a
58 }

Direct hierarchy

Parents

Children