Vihren Atlas

task_queue_id.go ×3

Code frontier

unlabeled · c_5fc83ee31f8b

23 tests · 4620 LOC · 177 files · introduces 0 tests · 14 LOC · 4 files

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges14 lines · 4 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
881 ranges4620 lines · 177 files · Browse complete extent
All tests (intent)
23 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.

4 files ranked by introduced lines: 14 introduced LOC across 6 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/common/tqid/task_queue_id.go 8 introduced LOC · 3 ranges

Open complete file

306 }
307
308 > func (s *StickyPartition) IsChild() bool { task_queue_id.go
309 > return false
310 > }
311
312 > func (s *StickyPartition) PersistenceTTL() time.Duration { return 24 * time.Hour } task_queue_id.go
313 func (s *StickyPartition) SupportsFairness() bool { return false }
314 func (s *StickyPartition) SupportsVersioning() bool { return false }
332 }
333
334 > func (s *StickyPartition) GradualChangeKey() []byte { task_queue_id.go
335 > key := fmt.Sprintf("%s:%s:%d", s.NamespaceId(), s.RpcName(), s.TaskType())
336 > return []byte(key)
337 > }
338
339 func (w *WorkerCommandsPartition) TaskType() enumspb.TaskQueueType {
go.temporal.io/server/service/matching/db.go 2 introduced LOC · 1 range

Open complete file

816 func (db *taskQueueDB) expiryTime() *timestamppb.Timestamp {
817 if ttl := db.queue.Partition().PersistenceTTL(); ttl > 0 {
818 > return timestamppb.New(time.Now().Add(ttl)) db.go
819 > }
820 return nil
821 }
go.temporal.io/server/service/matching/physical_task_queue_key.go 2 introduced LOC · 1 range

Open complete file

116 func (q *PhysicalTaskQueueKey) PersistenceName() string {
117 switch p := q.Partition().(type) {
118 > case *tqid.StickyPartition: physical_task_queue_key.go
119 > return p.StickyName()
120 case *tqid.WorkerCommandsPartition:
121 return p.TaskQueue().Name()
go.temporal.io/server/service/matching/task_queue_partition_manager.go 2 introduced LOC · 1 range

Open complete file

359 normal, ok := pm.partition.(*tqid.NormalPartition)
360 if !ok {
361 > return nil // only normal partitions do dynamic scaling task_queue_partition_manager.go
362 > }
363 id := normal.PartitionId()
364

Direct hierarchy

Parents

Children