<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[pbzhang_csdn的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/pbzhang_csdn</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; pbzhang_csdn]]></copyright><item><title><![CDATA[unordered_map hash函数2种写法]]></title><link>https://blog.youkuaiyun.com/pbzhang_csdn/article/details/103222158</link><guid>https://blog.youkuaiyun.com/pbzhang_csdn/article/details/103222158</guid><author>pbzhang_csdn</author><pubDate>Sun, 24 Nov 2019 10:39:42 +0800</pubDate><description><![CDATA[```cpp
//#include "stdafx.h"
#include &lt;iostream&gt;
#include &lt;cstdio&gt;
#include &lt;typeinfo&gt;
#include &lt;unordered_map&gt;
#include &lt;iterator&gt;
#include &lt;functional&gt;
#include ...]]></description><category></category></item><item><title><![CDATA[C++ 11 生产者消费者模式]]></title><link>https://blog.youkuaiyun.com/pbzhang_csdn/article/details/102651674</link><guid>https://blog.youkuaiyun.com/pbzhang_csdn/article/details/102651674</guid><author>pbzhang_csdn</author><pubDate>Sun, 20 Oct 2019 18:14:18 +0800</pubDate><description><![CDATA[单生产者单消费者模式,假设生产者每次产量等于与消费者每次消耗量
C++ 11 使用unique_lock 和 condition_variable 实现
//#include "stdafx.h"
#include &lt;iostream&gt;
#include &lt;string&gt;
#include &lt;vector&gt;
#include &lt;list&gt;
#incl...]]></description><category></category></item><item><title><![CDATA[冒泡排序法及其优化]]></title><link>https://blog.youkuaiyun.com/pbzhang_csdn/article/details/94389413</link><guid>https://blog.youkuaiyun.com/pbzhang_csdn/article/details/94389413</guid><author>pbzhang_csdn</author><pubDate>Mon, 01 Jul 2019 14:16:27 +0800</pubDate><description><![CDATA[冒泡排序法及其优化， C/C++ 版. 如有错误，欢迎指正。
注：本人非计算机专业，纯属业余，欢迎拍砖。呵呵。
直接上代码：
#include 
#include 
#include 
#include 
using std::cout;
using std::endl;
//冒泡排序法
std::pair&lt;int, int&gt; bubbleSort(int[], const int);...]]></description><category></category></item></channel></rss>