25     Iterator begin1, end1; // [begin1,end1) is 1st sequence to be merged  member
28     bool empty()   const {return (end1-begin1)+(end2-begin2)==0;}  in empty()
30         return (std::min)( end1-begin1, end2-begin2 ) > grainsize;  in is_divisible()
33         if( r.end1-r.begin1 < r.end2-r.begin2 ) {  in ParallelMergeRange()
34             std::swap(r.begin1,r.begin2);  in ParallelMergeRange()
37         Iterator m1 = r.begin1 + (r.end1-r.begin1)/2;  in ParallelMergeRange()
39         begin1 = m1;  in ParallelMergeRange()
43         out = r.out + (m1-r.begin1) + (m2-r.begin2);  in ParallelMergeRange()
50         begin1(begin1_), end1(end1_),  in ParallelMergeRange()
61         std::merge( r.begin1, r.end1, r.begin2, r.end2, r.out );  in operator ()()
66 void ParallelMerge( Iterator begin1, Iterator end1, Iterator begin2, Iterator end2, Iterator out ) {  in ParallelMerge()  argument
68        ParallelMergeRange<Iterator>(begin1,end1,begin2,end2,out),  in ParallelMerge()