Vihren Atlas

concurrent_tx_map.go ×6

Joint frontier

unlabeled · c_8069a4d7c4ce

1 test · 76 LOC · 2 files · introduces 1 test · 22 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges22 lines · 1 files
Tests
1 test

Contains — complete concept membership

All code (extent)
17 ranges76 lines · 2 files · Browse complete extent
All tests (intent)
1 testBrowse 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.

Introduced files, introduced tests, and structurally relevant concept specializationconcurrent_tx_map.go ×1 · 10 introduced LOCconcurrent_tx_map.go ×1concurrent_tx_map.go ×1 · 10 introduced LOCconcurrent_tx_map.go ×1util.go ×2 · 3 introduced LOCutil.go ×2util.go ×2 · 4 introduced LOCutil.go ×2concurrent_tx_map.go ×1 · 3 introduced LOCconcurrent_tx_map.go ×1concurrent_tx_map.go ×1 · 10 introduced LOCconcurrent_tx_map.go ×1concurrent_tx_map.go ×1 · 4 introduced LOCconcurrent_tx_map.go ×1concurrent_tx_map.go ×1 · 4 introduced LOCconcurrent_tx_map.go ×1concurrent_tx_map.go ×1 · 6 introduced LOCconcurrent_tx_map.go ×1TestOperatorServiceMetadata, TestWorkflowServiceMetadata · 0 introduced LOCTestOperatorServiceMetad…go.temporal.io/server/common/collection/concurrent_tx_map.go · 233 LOCcollection/concurrent_tx…go.temporal.io/server/common/collection/util.go · 25 LOCcollection/util.goTestOperatorServiceMetadata · introduced test · go.temporal.io/server/common/api/TestOperatorServiceMetadataTestOperatorServiceMetad…TestWorkflowServiceMetadata · introduced test · go.temporal.io/server/common/api/TestWorkflowServiceMetadataTestWorkflowServiceMetad…TestGetAfterPut · introduced test · go.temporal.io/server/common/collection/TestConcurrentTxMapSuite/TestGetAfterPutTestGetAfterPutFocused concept · concurrent_tx_map.go ×6 · 22 introduced LOCconcurrent_tx_map.go ×6

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.

1 test introduced at this concept.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

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

go.temporal.io/server/common/collection/concurrent_tx_map.go 22 introduced LOC · 6 ranges

Open complete file

178
179 // Close closes the iterator
180 > func (it *mapIteratorImpl) Close() { concurrent_tx_map.go
181 > close(it.stopCh)
182 > }
183
184 // Entries returns a channel of map entries
185 > func (it *mapIteratorImpl) Entries() <-chan *MapEntry { concurrent_tx_map.go
186 > return it.dataCh
187 > }
188
189 // Iter returns an iterator to the map. This map
190 // does not use re-entrant locks, so access or modification
191 // to the map during iteration can cause a dead lock.
192 > func (cmap *ShardedConcurrentTxMap) Iter() MapIterator { concurrent_tx_map.go
193 >
194 > iterator := new(mapIteratorImpl)
195 > iterator.dataCh = make(chan *MapEntry, 8)
196 > iterator.stopCh = make(chan struct{})
197 >
198 > go func(iterator *mapIteratorImpl) {
199 > for i := range nShards {
200 > cmap.shards[i].RLock()
201 > for k, v := range cmap.shards[i].items {
202 > entry := &MapEntry{Key: k, Value: v}
203 > select {
204 > case iterator.dataCh <- entry:
205 case <-iterator.stopCh:
206 cmap.shards[i].RUnlock()

Direct hierarchy

Children