<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[石头的专栏]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/elite7</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; elite7]]></copyright><item><title><![CDATA[C# 析构函数解析（译）]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/7495941</link><guid>https://blog.youkuaiyun.com/elite7/article/details/7495941</guid><author>elite7</author><pubDate>Tue, 24 Apr 2012 23:07:49 +0800</pubDate><description><![CDATA[C# 析构函数解析（译）
 
Chandra Hundigam
2002-06-18
原文地址：
http://www.c-sharpcorner.com/UploadFile/chandrahundigam/UnderstandingDestructors11192005021208AM/UnderstandingDestructors.aspx
 
这篇文章谈了如何理解C#的析构]]></description><category></category></item><item><title><![CDATA[Google C++ 编程风格指南（中文翻译）-2]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6266180</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6266180</guid><author>elite7</author><pubDate>Mon, 21 Mar 2011 21:36:00 +0800</pubDate><description><![CDATA[类，未完，待续。]]></description><category></category></item><item><title><![CDATA[Google C++ 编程风格指南（中文翻译）-1]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6252227</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6252227</guid><author>elite7</author><pubDate>Wed, 16 Mar 2011 00:02:00 +0800</pubDate><description><![CDATA[个人感觉总结的很好，正在试图翻译，待续...
原文：http://google-styleguide.googlecode.com/svn/trunk/cppguide.xml]]></description><category></category></item><item><title><![CDATA[RTTI]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6249366</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6249366</guid><author>elite7</author><pubDate>Mon, 14 Mar 2011 21:43:00 +0800</pubDate><description><![CDATA[RTTI（Run-Time Type Identification，通过运行时类型识别）程序能够使用基类的指针或引用来检查这些指针或引用所指的对象的实际派生类型。]]></description><category></category></item><item><title><![CDATA[STL_Algorithm: heap]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6125892</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6125892</guid><author>elite7</author><pubDate>Sun, 09 Jan 2011 22:32:00 +0800</pubDate><description><![CDATA[只能用于数组，vector, deque
std::make_heap( v.begin(), v.end() ); //建堆
std::sort_heap( v.begin(), v.end() ); //对堆进行排序

std::push_heap( v.begin(), v.end() ); //在堆中加一新值
std::pop_heap( v.begin(), v.end() - index ); //删除堆顶元素， 进行元素位置改变，pop出的值放入v.end() - index处，这样]]></description><category></category></item><item><title><![CDATA[STL_Algorithm: lower_bound, upper_bound, equal_range]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6125776</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6125776</guid><author>elite7</author><pubDate>Sun, 09 Jan 2011 21:29:00 +0800</pubDate><description><![CDATA[std::lower_bound( v.begin(), v.end(), value ); // 第一个value的位置
std::upper_bound( v.begin(), v.end(), value ); //最后一个vlaue的位置
std::pair iterator, std::vector iterator > eq_range = 
std::equal_range( v.begin(), v.end(), value ); //value的第一个和最后位置]]></description><category></category></item><item><title><![CDATA[STL_Algorithm10: Set--集合操作]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6121360</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6121360</guid><author>elite7</author><pubDate>Thu, 06 Jan 2011 22:31:00 +0800</pubDate><description><![CDATA[std::includes( a1, a1 + SIZE1, a2， a2 + SIZE2 ); //包含关系，a1是否包含a2.
std::set_difference( a1, a1 + SIZE1, a2， a2 + SIZE2, a3 ); //a1中不在a2中的元素
std::set_intersection( a1, a1 + SIZE1, a2， a2 + SIZE2，a3 ); //交集
std::set_sysmmetric_difference( a1, a1 + SIZE, a2]]></description><category></category></item><item><title><![CDATA[STL_Algorithm9: inplace_merge, unique_copy, reverse_copy]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6119070</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6119070</guid><author>elite7</author><pubDate>Wed, 05 Jan 2011 23:07:00 +0800</pubDate><description><![CDATA[std::inplace_merge( c1.begin(), c1.begin() + mid, c1.end() ); //把c1内部的两个有序段merge
std::unique_copy( c1.begin(), c1.end(), std::back_inserter( c2 ) ); //把c1的所有唯一元素copy到c2
std::reverse_copy( c1.begin(), c1.end(), std::back_inserter( c2 ) ); //把c1的元素颠倒copy到c]]></description><category></category></item><item><title><![CDATA[STL_Algorithm8: copy_backward, merge, unique, reverse]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6118971</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6118971</guid><author>elite7</author><pubDate>Wed, 05 Jan 2011 22:31:00 +0800</pubDate><description><![CDATA[std::copy_backward( c1.begin(), c1.end(), c2.end() ); //从后往前copy
std::merge( c1.begin(), c1.end(), c2.begin(), c2.end(), c3.begin() ); //把两个升序容器(c1, c2)合并为另一升序容器c3；
std::merge( c1.begin(), c1.end(), c2.begin(), c2.end(), std::back_insert( c3 ) );
std::u]]></description><category></category></item><item><title><![CDATA[STL_Algorithm7: swap]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6114443</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6114443</guid><author>elite7</author><pubDate>Mon, 03 Jan 2011 22:50:00 +0800</pubDate><description><![CDATA[std::swap( a[0], a[1] ); //交换数组中的两个值
std::iter_swap( &a[0], &a[1] );
std::ranges( a, a+5, a+5 );//交换两个范围内的值，可用于交换不同数组]]></description><category></category></item><item><title><![CDATA[STL_Algorithm6--find, find_if, sort, binary_search]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6114386</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6114386</guid><author>elite7</author><pubDate>Mon, 03 Jan 2011 22:20:00 +0800</pubDate><description><![CDATA[std::find( v.begin(), v.end(), value );
std::find_if( v.begin(), v.end(), greater10 );
std::sort( v.begin(), v.end() ); //要求随机访问迭代器
std::binary_search( v.begin(), v.end(), value );//已经按升序排列]]></description><category></category></item><item><title><![CDATA[STL_Algorithm5-math: random_shuffle, count, count_if, min_element, max_element, accumulate, for_each, transform]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097626</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097626</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 12:09:00 +0800</pubDate><description><![CDATA[STL_Algorithm5-math: random_shuffle, count, count_if, min_element, max_element, accumulate, for_each, transformmin

random_shuffle: 对v.begin()到v.end()之间的元素进行随机排序。
count: 统计v.begin()到v.end()之间值为value的元素个数。
count_if: 统计v.begin()到v.end()之间，满足判定条件的元素个数。
m]]></description><category></category></item><item><title><![CDATA[STL_Algorithm4: Replace, replace_if, replace copy, replace_copy_if]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097585</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097585</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 11:41:00 +0800</pubDate><description><![CDATA[STL_Algorithm4: Replace, replace_if, replace copy, replace_copy_if]]></description><category></category></item><item><title><![CDATA[STL Container7: muiltiset]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097547</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097547</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 11:10:00 +0800</pubDate><description><![CDATA[STL container multiset]]></description><category></category></item><item><title><![CDATA[STL Container6: Set]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097545</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097545</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 11:08:00 +0800</pubDate><description><![CDATA[STL associate container: set]]></description><category></category></item><item><title><![CDATA[STL Container5: MultiMap]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097534</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097534</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 11:00:00 +0800</pubDate><description><![CDATA[STL associate container: multimap]]></description><category></category></item><item><title><![CDATA[STL Container4: Map]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097532</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097532</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 10:58:00 +0800</pubDate><description><![CDATA[STL Container: Associate container: Map]]></description><category></category></item><item><title><![CDATA[STL Container3: Deque]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097528</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097528</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 10:56:00 +0800</pubDate><description><![CDATA[STL Container: Deque]]></description><category></category></item><item><title><![CDATA[STL Container2: List]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097525</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097525</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 10:54:00 +0800</pubDate><description><![CDATA[STL Container List]]></description><category></category></item><item><title><![CDATA[STL Container1: Vector]]></title><link>https://blog.youkuaiyun.com/elite7/article/details/6097522</link><guid>https://blog.youkuaiyun.com/elite7/article/details/6097522</guid><author>elite7</author><pubDate>Sat, 25 Dec 2010 10:52:00 +0800</pubDate><description><![CDATA[STL Container, Vector]]></description><category></category></item></channel></rss>