task_v1.go ×5

Frontier kind: Code frontier

unlabeled · c_b88b6c81eb08

29 tests · 3219 LOC · 157 files · introduces 0 tests · 38 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
5 ranges38 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
510 ranges3219 lines · 157 files · Browse complete extent
All tests (intent)
29 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: 38 introduced LOC across 5 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

go.temporal.io/server/common/persistence/sql/task_v1.go 38 introduced LOC · 5 ranges

Open complete file

45 ctx context.Context,
46 request *persistence.InternalCreateTasksRequest,
47 > ) (*persistence.CreateTasksResponse, error) { task_v1.go
48 > nidBytes, err := primitives.ParseUUID(request.NamespaceID)
49 > if err != nil {
50 return nil, serviceerror.NewUnavailable(err.Error())
51 }
52
53 // cache by subqueue to minimize calls to taskQueueIdAndHash
54 > type pair struct { task_v1.go
55 > id []byte
56 > hash uint32
57 > }
58 > cache := make(map[int]pair)
59 > idAndHash := func(subqueue int) ([]byte, uint32) {
60 > if pair, ok := cache[subqueue]; ok {
61 > return pair.id, pair.hash
62 > }
63 > id, hash := taskQueueIdAndHash(nidBytes, request.TaskQueue, request.TaskType, subqueue)
64 > cache[subqueue] = pair{id: id, hash: hash}
65 > return id, hash
66 }
67
68 > tasksRows := make([]sqlplugin.TasksRow, len(request.Tasks)) task_v1.go
69 > for i, v := range request.Tasks {
70 > tqId, tqHash := idAndHash(v.Subqueue)
71 > tasksRows[i] = sqlplugin.TasksRow{
72 > RangeHash: tqHash,
73 > TaskQueueID: tqId,
74 > TaskID: v.TaskId,
75 > Data: v.Task.Data,
76 > DataEncoding: v.Task.EncodingType.String(),
77 > }
78 > }
79 > var resp *persistence.CreateTasksResponse
80 > err = m.SqlStore.txExecute(ctx, "CreateTasks", func(tx sqlplugin.Tx) error {
81 > if _, err1 := tx.InsertIntoTasks(ctx, tasksRows); err1 != nil {
82 return err1
83 }
84 // Lock task queue before committing.
85 > tqId, tqHash := idAndHash(persistence.SubqueueZero) task_v1.go
86 > if err := lockTaskQueue(ctx,
87 > tx,
88 > tqHash,
89 > tqId,
90 > request.RangeID,
91 > sqlplugin.MatchingTaskVersion1,
92 > ); err != nil {
93 return err
94 }
96 return nil
97 })
98 > return resp, err task_v1.go
99 }
100