| /oneTBB/examples/concurrent_hash_map/count_strings/ |
| H A D | count_strings.cpp | 94 static MyString* Data; variable
100 oneapi::tbb::parallel_for(oneapi::tbb::blocked_range<MyString*>(Data, Data + N, 1000), in CountOccurrences()
223 Data[i] = GetLetters(type++, 0); in CreateData()
225 Data[i] += GetLetters(type++, 1); in CreateData()
226 Data[i] += GetLetters(type, 2); in CreateData()
228 MyString planet = Data[12]; in CreateData()
230 MyString helloworld = Data[0]; in CreateData()
232 helloworld += ", " + Data[1] + " " + Data[2] + " " + Data[3] + " " + Data[4] + " " + Data[5]; in CreateData()
263 Data = new MyString[N]; in main()
290 delete[] Data; in main()
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Cancellation_Without_An_Exception.rst | 24 vector<int> Data;
29 if( i<Data.size() ) {
30 ++Data[i];
42 Data.resize(1000);
|
| H A D | Exceptions_and_Cancellation.rst | 47 vector<int> Data;
53 Data.at(i) += 1;
59 Data.resize(1000);
70 with only 1000 elements. Hence the expression ``Data.at(i)`` sometimes
|
| H A D | Data_Flow_Graph.rst | 3 Data Flow Graph
28 Simple Data Flow Graph
37 The following code snippet shows an implementation of the **Simple Data
81 node F from **Simple Data Flow Graph** above is implemented as a loop
107 the **Simple Data Flow Graph** above, is to introduce an ``input_node``. An
142 need to create body that will act like the body of the loop in the **Simple Data Flow Graph**
190 **Simple Data Flow Graph** above. In this simple example, there is not
|
| H A D | Cancellation_and_Nested_Parallelism.rst | 96 bool Data[1000][1000];
106 Data[i][j] = true;
123 Hence when the program completes, each row of ``Data`` may be different,
129 the inner loop. In that case, a row of ``Data`` might end up with both
|
| H A D | concurrent_hash_map.rst | 15 string occurs in the array ``Data``.
67 string Data[N];
76 parallel_for( blocked_range<string*>( Data, Data+N, 1000 ),
|
| H A D | Flow_Graph.rst | 3 Parallelizing Data Flow and Dependence Graphs
|
| H A D | Graph_Main_Categories.rst | 10 - **Data flow graphs.** In this type of graph, data is passed along the
|
| H A D | Parallelizing_Flow_Graph.rst | 3 Parallelizing Data Flow and Dependency Graphs
37 **Simple Data Flow Graph**
|
| H A D | avoiding_data_races.rst | 3 Avoiding Data Races
|
| H A D | Bandwidth_and_Cache_Affinity_os.rst | 75 Benefit of Affinity Determined by Relative Size of Data Set and Cache
|
| H A D | Working_on_the_Assembly_Line_pipeline.rst | 8 manufacturing assembly line. Data flows through a series of pipeline
|
| /oneTBB/test/tbb/ |
| H A D | test_intrusive_list.cpp | 39 int Data() const { return m_Data; } in Data() function
56 int Data() const { return m_Data; } in Data() function
89 REQUIRE_MESSAGE(it->Data() == i, "Unexpected node value while iterating forward"); in check_list_nodes()
97 REQUIRE_MESSAGE(it->Data() == i, "Unexpected node value while iterating backward"); in check_list_nodes()
|
| H A D | test_tbb_fork.cpp | 55 struct Data { struct
59 typedef tbb::concurrent_hash_map<DWORD, Data> TidTableType; argument
|
| /oneTBB/doc/main/tbb_userguide/Migration_Guide/ |
| H A D | Task_API.rst | 206 std::shared_ptr<Data> m_shared_data;
220 // Assuming Data is defined.
221 std::shared_ptr<Data> data = std::make_shared<Data>(/*params*/);
238 std::shared_ptr<Data> m_shared_data;
252 // Assuming Data is defined.
253 std::shared_ptr<Data> data = std::make_shared<Data>(/*params*/);
|
| /oneTBB/doc/main/intro/ |
| H A D | testing_approach.rst | 10 * Data race
|
| H A D | Benefits.rst | 54 Data-parallel programming scales well to larger numbers of processors
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Reference_Counting.rst | 141 A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures"
|
| H A D | Fenced_Data_Transfer.rst | 3 Fenced Data Transfer
|
| H A D | Wavefront.rst | 106 Data dependences for longest common substring calculation.
|