| /oneTBB/doc/main/tbb_userguide/Migration_Guide/ |
| H A D | Task_API.rst | 21 .. code:: cpp
45 .. code:: cpp
62 .. code:: cpp
76 .. code:: cpp
98 .. code:: cpp
145 .. code:: cpp
170 .. code:: cpp
200 .. code:: cpp
232 .. code:: cpp
265 .. code:: cpp
[all …]
|
| H A D | Task_Scheduler_Init.rst | 45 .. code:: cpp
76 .. code:: cpp
122 .. code:: cpp
147 .. code:: cpp
|
| /oneTBB/doc/GSG/ |
| H A D | next_steps.rst | 36 …#. Copy and paste the code below. It is a typical example of a |short_name| algorithm. The sample …
38 .. code::
67 .. code-block::
87 …#. Copy and paste the code below. It is a typical example of a |short_name| algorithm. The sample …
89 .. code::
111 #. Compile the code using oneTBB. For example,
113 .. code-block::
120 .. code-block::
153 * For Linux* OS, only the source code is provided and binaries should be built.
|
| H A D | integrate.rst | 11 * Link oneTBB with the project's source code.
29 .. code-block::
46 .. code-block::
54 .. code-block::
61 .. code-block::
|
| /oneTBB/doc/main/tbb_userguide/design_patterns/ |
| H A D | Design_Patterns.rst | 29 Variations and examples are sometimes discussed. The code examples are
30 intended to emphasize key points and are not full-fledged code. Examples
39 For brevity, some of the code examples use C++11 lambda expressions. It
41 expressions into equivalent C++03 code.
|
| H A D | Fenced_Data_Transfer.rst | 33 following code:
56 Two key assumptions of the code are:
152 Another mistake is to assume that conditionally executed code cannot
154 hardware may speculatively hoist the conditional code above the
|
| H A D | Divide_and_Conquer.rst | 83 provides a simple way to parallelize it. The parallel code is shown
102 …cient. The following variation, does sorts of less than 500 elements using the earlier serial code.
136 following code shows a serial solution that walks the tree. It
205 code.
|
| /oneTBB/doc/main/reference/scalable_memory_pools/ |
| H A D | fixed_pool_cls.rst | 28 .. code:: cpp
35 .. code:: cpp
65 The code below provides a simple example of allocation from a fixed pool.
67 .. code:: cpp
|
| H A D | memory_pool_cls.rst | 34 .. code:: cpp
41 .. code:: cpp
71 The code below provides a simple example of allocation from an extensible memory pool.
73 .. code:: cpp
|
| H A D | memory_pool_allocator_cls.rst | 29 .. code:: cpp
36 .. code:: cpp
108 The code below provides a simple example of container construction with the use of a memory pool.
110 .. code:: cpp
|
| /oneTBB/doc/main/reference/ |
| H A D | follows_and_precedes_functions.rst | 40 .. code:: cpp
47 .. code:: cpp
69 .. code-block:: cpp
75 .. code-block:: cpp
|
| H A D | parallel_sort_ranges_extension.rst | 23 .. code:: cpp
30 .. code:: cpp
59 .. code:: cpp
|
| H A D | make_edges_function.rst | 31 .. code:: cpp
38 .. code:: cpp
56 .. code:: cpp
|
| H A D | make_node_set_function.rst | 25 .. code:: cpp
32 .. code:: cpp
|
| H A D | type_specified_message_keys.rst | 26 .. code:: cpp
37 .. code:: cpp
45 .. code:: cpp
|
| H A D | custom_mutex_chmap.rst | 26 .. code:: cpp
33 .. code:: cpp
70 .. code:: cpp
|
| H A D | constructors_for_nodes.rst | 27 .. code:: cpp
34 .. code:: cpp
|
| /oneTBB/doc/main/tbb_userguide/ |
| H A D | Mutual_Exclusion.rst | 8 region of code. In |full_name|, mutual
17 instructions. For example, the following code uses a mutex
94 to maintainers which code is protected by the lock.
119 type of the lock later without having to edit the rest of the code.
121 ``typedef queuing_mutex FreeListMutexType``, and the code would still
|
| H A D | Windows_C_Dynamic_Memory_Interface_Replacement.rst | 34 - Add the following header to a source code of any binary which is
48 For 32-bit code (note the triple underscore):
57 For 64-bit code (note the double underscore):
|
| H A D | Constraints.rst | 14 .. code:: cpp
29 The code that violates named requirements but compiles successfully until C++20,
|
| H A D | Debug_Versus_Release_Libraries.rst | 26 - Use with code that is compiled with the macro ``TBB_USE_DEBUG`` set to 1.
32 - Use with code compiled with ``TBB_USE_DEBUG`` undefined or set to zero.
|
| H A D | std_invoke.rst | 18 .. code::
52 // implement the code based on your requirements
72 .. code::
96 .. code::
129 .. code::
171 .. code::
|
| H A D | Bandwidth_and_Cache_Affinity_os.rst | 37 The following code shows how to use ``affinity_partitioner``.
61 The example code gets the lifetime of the partitioner right by declaring
82 see quite this much variation in your code. The graph shows not much
|
| /oneTBB/examples/parallel_for/tachyon/ |
| H A D | README.md | 6 …code was parallelized by speculating that each pixel could be rendered in parallel. The resulting …
|
| /oneTBB/ |
| H A D | third-party-programs.txt | 21 1. Redistributions of source code must retain the above copyright
72 1. Redistributions of source code must retain the above copyright
104 * Redistributions of source code must retain the above copyright
179 …The "source code" for a work means the preferred form of the work for making modifications to it. …
185 …code form means all the source code needed to generate, install, and (for an executable work) run …
189 The Corresponding Source for a work in source code form is that same work.
222 …code with a copy of the written offer to provide the Corresponding Source. This alternative is all…
223 …code by offering access from a designated place (gratis or for a charge), and offer equivalent acc…
224 …e) Convey the object code using peer-to-peer transmission, provided you inform other peers where t…
225 … object code, whose source code is excluded from the Corresponding Source as a System Library, nee…
[all …]
|