where to put merged sequence
| 26 | Iterator begin2, end2; // [begin2,end2) is 2nd sequence to be merged |
| 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 | } |
no outgoing calls