<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[vearne的代码世界]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/iteye_19330</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; iteye_19330]]></copyright><item><title><![CDATA[将博客搬至优快云]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82450719</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82450719</guid><author>iteye_19330</author><pubDate>Sat, 22 Dec 2012 21:35:59 +0800</pubDate><description><![CDATA[
此博客即将废弃，所有内容将迁往优快云
以下是新地址
http://blog.youkuaiyun.com/woshiaotian
 
博客有了新站
http://vearne.cc/
]]></description><category></category></item><item><title><![CDATA[linux线程同步--条件变量练习(2)]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82397216</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82397216</guid><author>iteye_19330</author><pubDate>Tue, 07 Aug 2012 18:00:03 +0800</pubDate><description><![CDATA[ 注意：消息是由主线程产生的，而消息这时候在堆中，两个线程通过全局变量获取访问消息。


#include &amp;lt;pthread.h&amp;gt;
#include &amp;lt;stdlib.h&amp;gt;
#include &amp;lt;stdio.h&amp;gt;

struct msg {
	int data;
	struct msg *m_next;
	/* ... more stuff her...]]></description><category></category></item><item><title><![CDATA[linux线程同步--条件变量练习(1)]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82396837</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82396837</guid><author>iteye_19330</author><pubDate>Mon, 06 Aug 2012 23:27:24 +0800</pubDate><description><![CDATA[注意：消息是由主线程产生的，而消息这时候在栈中，两个线程通过全局变量获取访问消息。Unix环境高级编程P288进程的所有信息对该进程的所有线程都是共享的，包括可执行的程序文本、程序的全局变量和堆内存、栈以及文件描述符。
 


#include &amp;lt;pthread.h&amp;gt;
#include &amp;lt;stdio.h&amp;gt;

struct msg {
	int data;
	...]]></description><category></category></item><item><title><![CDATA[使用linux函数模拟HTTP 请求过程]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82395102</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82395102</guid><author>iteye_19330</author><pubDate>Wed, 01 Aug 2012 21:50:36 +0800</pubDate><description><![CDATA[非常好的参考资料
1.HTTP 协议资料
http://www.w3.org/Protocols/rfc2616/rfc2616-sec14.html#sec14.2
2.使用telnet模拟浏览器访问网页
http://pcwanli.blog.163.com/blog/static/4531561120091115105240732/
 
 
#include &quot;apue.h&quot;...]]></description><category></category></item><item><title><![CDATA[重复删除指针]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82376824</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82376824</guid><author>iteye_19330</author><pubDate>Fri, 27 Jul 2012 22:10:14 +0800</pubDate><description><![CDATA[

#include &amp;lt;iostream&amp;gt;
using namespace std;
class Base{
public:
	void f(){
		cout&amp;lt;&amp;lt;&quot;base&quot;&amp;lt;&amp;lt;endl;
	}
private:
	int a;
};
int main(){
	Base* b = new Base;
	delete b;
	dele...]]></description><category></category></item><item><title><![CDATA[继承关系中的早绑定]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82376375</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82376375</guid><author>iteye_19330</author><pubDate>Fri, 27 Jul 2012 09:00:48 +0800</pubDate><description><![CDATA[

#include &amp;lt;iostream&amp;gt;
using namespace std;
class Base{
public:
	void f(){
		cout&amp;lt;&amp;lt;&quot;base&quot;&amp;lt;&amp;lt;endl;
	}
};
class Derived:public Base{
public:
	void f(){
		cout&amp;lt;&amp;lt;&quot;derived...]]></description><category></category></item><item><title><![CDATA[关于僵尸进程的练习。]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82372892</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82372892</guid><author>iteye_19330</author><pubDate>Thu, 19 Jul 2012 10:17:40 +0800</pubDate><description><![CDATA[请参考linux c一站式学习，此节内容
http://learn.akae.cn/media/ch30s03.html#id2867242
可以设置父进程忽略SIGCHLD信号，或者在SIGCHLD信号的处理函数中调用wait函数，即可获取子进程的退出状态，且销毁僵尸进程。
1）调用wait函数
 
#include &amp;lt;unistd.h&amp;gt;
#include &amp;lt;std...]]></description><category></category></item><item><title><![CDATA[has virtual functions but non-virtual destructor]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82370639</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82370639</guid><author>iteye_19330</author><pubDate>Sat, 14 Jul 2012 13:36:47 +0800</pubDate><description><![CDATA[ 
#include &amp;lt;iostream&amp;gt;
using namespace std;
class based{
public:
	based(){
	}
	~based(){
		 cout&amp;lt;&amp;lt;&quot;flag 1&quot;&amp;lt;&amp;lt;endl;
	}
	virtual void f(){
		cout&amp;lt;&amp;lt;&quot;ok1&quot;&amp;lt;&amp;lt;endl;]]></description><category></category></item><item><title><![CDATA[二叉树的中序遍历]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82370067</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82370067</guid><author>iteye_19330</author><pubDate>Fri, 13 Jul 2012 10:04:51 +0800</pubDate><description><![CDATA[ 
#include &amp;lt;iostream&amp;gt;
#include &amp;lt;stack&amp;gt;
using namespace std;
struct node{
int data;
struct node* lchild;
struct node* rchild;
};
typedef struct node Node;
void inOrderTraverse(Nod...]]></description><category></category></item><item><title><![CDATA[两个有序数组求中位数的O(logn)算法]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82369953</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82369953</guid><author>iteye_19330</author><pubDate>Fri, 13 Jul 2012 00:16:55 +0800</pubDate><description><![CDATA[

#include &amp;lt;iostream&amp;gt;
using namespace std;
int get_median(int a[],int begin1,int end1,int b[],int begin2,int end2,int k){
	if(begin1&amp;gt;end1){ //在数组A中无法找到
		return get_median(b,begin2,end2,...]]></description><category></category></item><item><title><![CDATA[智能指针的简易实现]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82369724</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82369724</guid><author>iteye_19330</author><pubDate>Thu, 12 Jul 2012 16:26:52 +0800</pubDate><description><![CDATA[ 
#include &amp;lt;iostream&amp;gt;
using namespace std;
class smart_count{
private:
	int use_count;
public:
	smart_count(int c=0):use_count(c){
	
	}
	~smart_count(){}
	int addref(){
		return ++us...]]></description><category></category></item><item><title><![CDATA[C++中把多维数组传递给函数可使用模版的办法]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82369300</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82369300</guid><author>iteye_19330</author><pubDate>Wed, 11 Jul 2012 23:30:53 +0800</pubDate><description><![CDATA[

#include &amp;lt;iostream&amp;gt;
using namespace std;
template&amp;lt;int m,int n&amp;gt;
void print(int a[m][n]){
	for(int i=0;i&amp;lt;m;i++){
		for(int j=0;j&amp;lt;n;j++){
			cout&amp;lt;&amp;lt;a[i][j]&amp;lt;&amp;lt;&quot; &quot;;
		...]]></description><category></category></item><item><title><![CDATA[图的广度深度遍历（邻接矩阵）]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82369299</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82369299</guid><author>iteye_19330</author><pubDate>Wed, 11 Jul 2012 23:25:41 +0800</pubDate><description><![CDATA[

#include &amp;lt;iostream&amp;gt;
#include &amp;lt;queue&amp;gt;
#include &amp;lt;algorithm&amp;gt;
#include &amp;lt;stack&amp;gt;
using namespace std;
int a[5][5]={{0,1,0,1,0},{1,0,1,0,1},{0,1,0,1,1},{1,0,1,0,0},{1,0,1,0,0}...]]></description><category></category></item><item><title><![CDATA[堆排序代码实现]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82362938</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82362938</guid><author>iteye_19330</author><pubDate>Sun, 01 Jul 2012 23:37:42 +0800</pubDate><description><![CDATA[ 
void heap_adjust(int a[],int i,int size){
	int temp;
	int j = i*2 +1;
	if(i&amp;lt;=size/2-1){ //保证其为非叶子节点----这里请注意
		if(j+1&amp;lt;size&amp;amp;&amp;amp;a[j]&amp;lt;a[j+1]){
			//找出子节点中值最大的
			j++;
		}
		if(a...]]></description><category></category></item><item><title><![CDATA[java中两种有趣的匿名类实现]]></title><link>https://blog.youkuaiyun.com/iteye_19330/article/details/82196038</link><guid>https://blog.youkuaiyun.com/iteye_19330/article/details/82196038</guid><author>iteye_19330</author><pubDate>Sun, 30 Oct 2011 14:52:09 +0800</pubDate><description><![CDATA[java中的匿名类除了还有两种有趣的用法
 
/**
 * TODO Comment of AnonymousTest
 * 
 * @author aotian.zhuw
 */
class EntryInterface {

    public void print() {
        System.out.println(&quot;hello world&quot;);

   ...]]></description><category></category></item></channel></rss>