Searched refs:middle (Results 1 – 6 of 6) sorted by relevance
209 NumberType middle = r.my_begin + (r.my_end - r.my_begin + r.my_stride - 1) / 2; in SieveRange() local210 middle = middle / my_stride * my_stride; in SieveRange()211 my_begin = middle; in SieveRange()212 r.my_end = middle; in SieveRange()
122 Value middle = r.my_begin + (r.my_end - r.my_begin) / 2u; in __TBB_requires() local123 r.my_end = middle; in __TBB_requires()124 return middle; in __TBB_requires()
56 to the middle filter, and thus be parallel.133 might be a problem where the unordered filter in the middle keeps135 typically leads to undesirable resource consumption by the middle196 The middle filter operates on purely local data. Thus any number of239 The functor for the middle filter is similar, but a bit more complex. It
86 middle is the sweet spot for affinity. Hence ``affinity_partitioner``
18 the middle nodes. As it receives each value, it adds it to a running sum
112 size_t middle = r.my_begin + (r.my_end - r.my_begin) / 2u; in RangeBase() local113 r.my_end = my_begin = middle; in RangeBase()