The C++ Programming Language最全版.ppt

Design a generic algorithm (cont.) Function Objects Adaptor – Brings more flexibility Binder adaptor – bind the parameter of function object to certain value, thus transform the binary function object to unary function object bind1st(lessint, 10) bind2nd(lessint, 10) Negator adaptor – negate the return value of function object not1( bind2nd(lessint, 10) ) – unary not2(lessint) – binary C++ 11? * yrty Design a generic algorithm (cont.) Second solution: Using function objects to replace pointer to function Using generic find_if() to replace container-related addressing vectorint filter_ver2(const vectorint vec, int threshold, lessint lt) { vectorint nvec; vectorint::const_iterator it = vec.begin(); while ((it = find_if(it, vec.end(), bind2nd(lt, threshold))) != vec.end()) { nvec.push_back(*it); it++; } return nvec; } * yrty Design a generic algorithm (cont.) Final solution: Make it more generic, independent with container and type templatetypename InputIter, typename OutputIter, typename ElemType, typename Comp OutputIter filter(InputIter first, InputIter last, OutputIter at, const ElemType thres, Comp pred) { while ((first = find_if( first, last, bind2nd( pred, thres ) )) != last) { *at++ = *first++; } return at; } The filter() is a complete generic algorithm now! * yrty Supplement * yrty Iterator Inserters Imaging the calling of previous filter() int main { int iSize = 8; int ia[ iSize ] = {12, 8, 4, 13, 65, 3, 0, 20}; vectorint ivec(ia, ia + iSize); int ia2[ iSize ]; vectorint ivec2; filter(ia, ia+iSize, ia2, 10, lessint()); filter(ivec.begin(), ivec.end(), ivec2.begin(), 10, greaterint()); } Ok, because the array is assigned space Will cause runtime error, because iterator will point to an illegal position Does this mean we always need to prepare a container of enough size? * yrty Ite