a********y
发帖数: 31 | 1 怎么实现？
{for (int i=c.begin()；i<=c.end();i++)
fn;}
对吗？觉得有些不对!
implement the Reduce function using templates.
The Reduce fn applies a function of two arguments cumulatively
to the items of an STL container, from begin() to end(), so as
to reduce the sequence to a single value. For example,
Reduce(, std::plus())
should calculate ((((1+2)+3)+4)+5).
class NotEnoughElements {};
template
| x***y
发帖数: 633 | 2 typedef typename Container::iterator Citerator;
typedef typename Container::value_type Vtype;
if(c.size()==0)
return Vtype();
Vtype finalValue=*c.begin();
for(Citerator iter=c.begin()+1; iter!=C.end(); iter++){
fn(finalValue, *iter);
}
return finalValue;
【在 a********y 的大作中提到】
: 怎么实现？
: {for (int i=c.begin()；i<=c.end();i++)
: fn;}
: 对吗？觉得有些不对!
:
: implement the Reduce function using templates.
: The Reduce fn applies a function of two arguments cumulatively
: to the items of an STL container, from begin() to end(), so as
: to reduce the sequence to a single value. For example,
: Reduce(, std::plus())
|
|
