Home
last modified time | relevance | path

Searched refs:long (Results 1 – 13 of 13) sorted by relevance

/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DGUI_Thread.rst13 must not get bogged down in long computations.
24 responsive to user requests even while the application has long
26 "cancel" button to stop the long running computation. If the GUI
27 thread takes part in the long running computation, it will not be
106 // User requested a long computation. Delegate it to another thread.
135 The GUI thread processes long computations as follows:
147 When a worker finishes the long computation, it pushes the result
166 Do long computation
167 Foo x = result of long computation
195 If two long computations are in flight, there is a chance that the
H A DAgglomeration.rst114 Also consider vectorization. Blocks that contain long contiguous
/oneTBB/doc/main/tbb_userguide/
H A DAdvanced_Example.rst14 long SerialMinIndexFoo( const float a[], size_t n ) {
16 long index_of_min = -1;
47 long index_of_min;
90 long ParallelMinIndexFoo( float a[], size_t n ) {
H A DWhen_Task-Based_Programming_Is_Inappropriate.rst14 while waiting for I/O or mutexes for long periods. If threads hold
15 mutexes for long periods, your code is not likely to perform well
H A DMutex_Flavors.rst34 performance. On long waits, an |full_name|
40 typically long.
57 the ``mutex`` *blocks* on long waits that makes it
78 acquire the same lock, as long as there are no "conflicts" that may
H A DContainers.rst26 by locking only those portions they really need to lock. As long as
H A Dconcurrent_vector_ug.rst44 ``concurrent_vector`` is being grown, as long as the iterators never go
H A DWorking_on_the_Assembly_Line_pipeline.rst53 quickly, you can transform each of the ``n`` chunks in parallel, as long
264 long x = strtol( p, &p, 10 );
268 long y = x*x;
H A Dappendix_A.rst43 it is now going to hold it for at least as long as it takes for its next
H A Dconcurrent_hash_map.rst92 access. As long as it points to an element, all other attempts to look
H A DTask-Based_Programming.rst71 those threads. As long as you break your program into enough small
/oneTBB/
H A Dthird-party-programs.txt194 …You may make, run and propagate covered works that you do not convey, without conditions so long a…
221 …anied by a written offer, valid for at least three years and valid for as long as you offer spare …
223 …onding Source, you remain obligated to ensure that it is available for as long as needed to satisf…
/oneTBB/doc/
H A DDoxyfile.in178 # support long names like on DOS, Mac, or CD-ROM.