| 27 | Iterator out; // where to put merged sequence |
| 28 | bool empty() const {return (end1-begin1)+(end2-begin2)==0;} |
| 29 | bool is_divisible() const { |
| 30 | return (std::min)( end1-begin1, end2-begin2 ) > grainsize; |
| 31 | } |
| 32 | ParallelMergeRange( ParallelMergeRange& r, split ) { |
| 33 | if( r.end1-r.begin1 < r.end2-r.begin2 ) { |
| 34 | std::swap(r.begin1,r.begin2); |
nothing calls this directly
no outgoing calls
no test coverage detected