<rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>老李 - STL 学习笔记</title><link>http://blog.csdn.net/hoya5121/category/325315.aspx</link><description>标准模版库的学习</description><dc:language>zh-CN</dc:language><lastUpdateTime>Sat, 26 Apr 2008 13:33:00 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>老李</dc:creator><title>用STL流操作文件</title><link>http://blog.csdn.net/hoya5121/archive/2007/08/08/1730998.aspx</link><pubDate>Wed, 08 Aug 2007 09:08:00 GMT</pubDate><guid>http://blog.csdn.net/hoya5121/archive/2007/08/08/1730998.aspx</guid><wfw:comment>http://blog.csdn.net/hoya5121/comments/1730998.aspx</wfw:comment><comments>http://blog.csdn.net/hoya5121/archive/2007/08/08/1730998.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hoya5121/comments/commentRss/1730998.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1730998</trackback:ping><description>Prin这个类是定义输出操作的函数对象,或者叫类函数,具体怎么叫我也不清楚

istream_iterator be = f;   //将文件流赋值到一个输入流的迭代器

istream_iterator en; 

vector v(be, en);           //将流输入到vector中

这里有个值得注意的地方,上面这一句不能写成:

vector v(istream_iterator be(f), istream_iterator());

因为编译器会把上面一句理解成这样

int v( int n(), int m());   //定义一个函数v
&lt;img src ="http://blog.csdn.net/hoya5121/aggbug/1730998.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>老李</dc:creator><title>STL algorithm之count、find、binary_search、lower_bound、upper_bound和equal_range的区别</title><link>http://blog.csdn.net/hoya5121/archive/2007/08/06/1728290.aspx</link><pubDate>Mon, 06 Aug 2007 12:00:00 GMT</pubDate><guid>http://blog.csdn.net/hoya5121/archive/2007/08/06/1728290.aspx</guid><wfw:comment>http://blog.csdn.net/hoya5121/comments/1728290.aspx</wfw:comment><comments>http://blog.csdn.net/hoya5121/archive/2007/08/06/1728290.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hoya5121/comments/commentRss/1728290.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1728290</trackback:ping><description>你要寻找什么，而且你有一个容器或者你有一个由迭代器划分出来的区间——你要找的东西就在里面。你箭袋中的箭有这些：count、count_if、find、find_if、binary_search、lower_bound、upper_bound和equal_range。要选择搜索策略，必须依赖于你的迭代器是否定义了一个有序区间。如果迭代器并没有划分一个有序区间，你就只能用线性时间的算法count、count_if、find和find_if。在下文中，我会忽略掉count和find是否有_if的不同，就像我会忽略掉binary_search、lower_bound、upper_bound和equal_range是否带有判断式的不同。&lt;img src ="http://blog.csdn.net/hoya5121/aggbug/1728290.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>老李</dc:creator><title>STL  algorithm之adjacent_find</title><link>http://blog.csdn.net/hoya5121/archive/2007/08/06/1728138.aspx</link><pubDate>Mon, 06 Aug 2007 10:59:00 GMT</pubDate><guid>http://blog.csdn.net/hoya5121/archive/2007/08/06/1728138.aspx</guid><wfw:comment>http://blog.csdn.net/hoya5121/comments/1728138.aspx</wfw:comment><comments>http://blog.csdn.net/hoya5121/archive/2007/08/06/1728138.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/hoya5121/comments/commentRss/1728138.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1728138</trackback:ping><description>adjacent_find&lt;img src ="http://blog.csdn.net/hoya5121/aggbug/1728138.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>