美日韩免费视频,国产精品扒开腿做爽爽爽视频 ,日韩激情网站

写给c/c++

Sat, 08 May 2010 11:30:00 GMT

写给c/c++的新同行门，CTO门把你们的宝�늻�验拿出来吧，让这个帖对大伙有�?/h5>
1、越�?

　��界是最难查的，注意memcpy strcpy,strncpy�q�些函数使用前一定要��查边�?

　特别是你提供函数�l�别人用�Ӟ��你的函数中用��C��q�些东西�Q�一定要��查别��Z��l�你的指针的
　边界

2、变量初始化

　�q�种问题要养成好习惯�Q�否则出来偶然性问题，非常难查

3、多�U�程指针��理

　在多�U�程环境下��用指针时�Q�最好采用引用计敎ͼ�让最后一个放充引用计数时�Q�指针删除，避免一个线�E�在使用指针�Q�另外线�E�删除掉

4、多�U�程锁的��理

　多线�E�锁要粒度要适中�Q�尽量减��　一个函数　�q�入多个锁，避免一个大函数一个大锁媄响性能�Q�可学习数据库的表��Q�行�U�锁

　��量不要在回调函��C��N��Q�易　引�v死锁

做到�U�程安全函数单向调用�Q�上层往下层调用�Q�下屋向上层采用事�g驱动反馈�Q�避免调用栈

　�q�深�Q�易引�v死锁　
�Q?
5、多�U�程对象生存期管�?

　��量当多�U�程�׃�n对象　��量不要直接删除�Q�徏议采用状态机形式来管理，其它�U�程讄��状�?

　�׃��个线�E�统一按状态管理生存期

6、构造函�?

函造函��C��不要放虚函数�Q�绝对不要在构造函��C��开�U�程�Q��ƈ且线�E�调用自��q��成员

7、内�?
　
　　虚函��C��要内�?

8、多�U�程创徏办法

如果用C�q�行库函敎ͼ�要注意用C�q�行库的�Ҏ��

9�Q�内存管�?

��采用内存池管�?

10、线�E�生存期��理

�U�程中尽量不要调用同步函敎ͼ�不要��杀�U�程�Q�要让线�E�不断��@环，�{�待��M��信号自己退�?/p>

华梦�?/a> 2010-05-08 19:30 发表评论

Mon, 08 Mar 2010 03:07:00 GMT

int **p1; //指向指针的指�?br />     int *p2;    //指向指针的变�?nbsp; 其中所存储的��gؓ变量的地址�Q�或者变量的地址的地址
    int i=3;
    p2=&i;
    p1=&p2;
printf("Hello World!\n");
printf("%d\n",i); //3
printf("%d\n",**p1); //3
printf("%d\n",*p2); //3
printf("%d\n",&i); //1245044
printf("%d\n",*p1); //1245044
printf("%d\n",p2);   //1245044
printf("%d\n",p1);   //1245048
printf("%d\n",&p2); //1245048
printf("%d\n",&p1); //1245052
return 0;

华梦�?/a> 2010-03-08 11:07 发表评论

The Zen of Python / Python之禅

Thu, 05 Nov 2009 02:54:00 GMT

在python中import this��׃��展示出The Zen of Python如下�Q?

The Zen of Python, by Tim Peters

Beautiful is better than ugly.
Explicit is better than implicit.
Simple is better than complex.
Complex is better than complicated.
Flat is better than nested.
Sparse is better than dense.
Readability counts.
Special cases aren't special enough to break the rules.
Although practicality beats purity.
Errors should never pass silently.
Unless explicitly silenced.
In the face of ambiguity, refuse the temptation to guess.
There should be one-- and preferably only one --obvious way to do it.
Although that way may not be obvious at first unless you're Dutch.
Now is better than never.
Although never is often better than *right* now.
If the implementation is hard to explain, it's a bad idea.
If the implementation is easy to explain, it may be a good idea.
Namespaces are one honking great idea -- let's do more of those!

从网上搜��M��一下，�q�被�U�Cؓpython之禅�Q�以下是��译

Python之禅
赖勇��翻�?/p>

优美胜于丑陋�Q�Python 以编写优��的代码为目标）
明了胜于晦�ӆ�Q�优��的代码应当是明了的�Q�命名规范，风格�怼��Q?
��z�胜于复杂（优美的代码应当是��z�的�Q�不要有复杂的内部实玎ͼ�
复杂胜于凌�ؕ�Q�如果复杂不可避免，那代码间也不能有难懂的关�p�，要保持接口简�z�）
扁��^胜于嵌套�Q�优��的代码应当是扁�q�的�Q�不能有太多的嵌套）
间隔胜于紧凑�Q�优��的代码有适当的间隔，不要奢望一行代码解决问题）
可读性很重要�Q�优��的代码是可�ȝ��Q?
即便假借特例的实用性之名，也不可违背这些规则（�q�些规则至高无上�Q?
不要包容所有错误，除非你确定需要这样做�Q�精准地捕获异常�Q�不�?except:pass 风格的代码）
当存在多�U�可能，不要��试�ȝ��?
而是��量找一�U�，最好是唯一一�U�明昄��解决�Ҏ��Q�如果不��定�Q�就用穷举法�Q?
虽然�q��ƈ不容易，因�ؓ你不�?Python 之父�Q�这里的 Dutch 是指 Guido �Q?
做也许好�q�不做，但不假思烦��动手还不如不做�Q�动手之前要�l�思量�Q?
如果你无法向人描�q�C��的方案，那肯定不是一个好�Ҏ��Q�反之亦�Ӟ��Ҏ��评标准�Q?
命名�I�间是一�U�绝妙的理念�Q�我们应当多加利用（倡导与号召）

The Zen of Python,
蛇宗三字�l?

作者：Tim Peters
��译�Q�元�?

Beautiful is better than ugly.
��胜�?
Explicit is better than implicit.
明胜�?
Simple is better than complex.
��胜复
Complex is better than complicated.
复胜�?
Flat is better than nested.
��胜�?
Sparse is better than dense.
疏胜�?
Readability counts.
辞达�?
Special cases aren't special enough to break the rules.
不逄��
Although practicality beats purity.
弃至�?
Errors should never pass silently.
无阴�?
Unless explicitly silenced.
有阳�?
In the face of ambiguity, refuse the temptation to guess.
拒疑�?
There should be one-- and preferably only one --obvious way to do it.
求完一
Although that way may not be obvious at first unless you're Dutch.
虽不臻I��向往�?
Now is better than never.
敏于�?
Although never is often better than *right* now.
戒莽�?
If the implementation is hard to explain, it's a bad idea.
差难�a�
If the implementation is easy to explain, it may be a good idea.
好易�?
Namespaces are one honking great idea -- let's do more of those!
每师出，多有�?/p>

比较恶搞的是�Q�其�?this 模块的代码完全违背了�q�些原则�Q��ؓ了方便你查看它的代码�Q�我把它贴出来：
s = """Gur Mra bs Clguba, ol Gvz Crgref

Ornhgvshy vf orggre guna htyl.
Rkcyvpvg vf orggre guna vzcyvpvg.
Fvzcyr vf orggre guna pbzcyrk.
Pbzcyrk vf orggre guna pbzcyvpngrq.
Syng vf orggre guna arfgrq.
Fcnefr vf orggre guna qrafr.
Ernqnovyvgl pbhagf.
Fcrpvny pnfrf nera'g fcrpvny rabhtu gb oernx gur ehyrf.
Nygubhtu cenpgvpnyvgl orngf chevgl.
Reebef fubhyq arire cnff fvyragyl.
Hayrff rkcyvpvgyl fvyraprq.
Va gur snpr bs nzovthvgl, ershfr gur grzcgngvba gb thrff.
Gurer fubhyq or bar-- naq cersrenoyl bayl bar --boivbhf jnl gb qb vg.
Nygubhtu gung jnl znl abg or boivbhf ng svefg hayrff lbh'er Qhgpu.
Abj vf orggre guna arire.
Nygubhtu arire vf bsgra orggre guna *evtug* abj.
Vs gur vzcyrzragngvba vf uneq gb rkcynva, vg'f n onq vqrn.
Vs gur vzcyrzragngvba vf rnfl gb rkcynva, vg znl or n tbbq vqrn.
Anzrfcnprf ner bar ubaxvat terng vqrn -- yrg'f qb zber bs gubfr!"""

d = {}
for c in (65, 97):
for i in range(26):
d[chr(i+c)] = chr((i+13) % 26 + c)

print "".join([d.get(c, c) for c in s])

�q�段晦�ӆ、复杂、凌��q��代码�Q�莫非是 Tim Peters 提供的反例？

华梦�?/a> 2009-11-05 10:54 发表评论

发现一个不错的�ȝ��|�站 �ȝ��之道 www.yszd.org

Fri, 25 Sep 2009 14:25:00 GMT

发现一个不错的�ȝ��|�站 �ȝ��之道 www.yszd.org �Q�希望大家喜�Ƣ�?img src ="http://www.aygfsteel.com/huamengxing/aggbug/296473.html" width = "1" height = "1" />

华梦�?/a> 2009-09-25 22:25 发表评论

Thu, 26 Mar 2009 14:15:00 GMT

#define WINVER 0x0050
#define WINVER 0x0500�Q�这个表�C�是为Windows 2000�~�译�Q�不保证Windows 98/NT4可以正常�q�行

Windows Server 2003
WINVER>=0x0502

Windows XP
WINVER>=0x0501

Windows 2000
WINVER>=0x0500

Windows NT 4.0
WINVER>=0x0400

Windows Me
WINVER>=0x0500

Windows 98
WINVER>=0x0410

Windows 95
WINVER>=0x0400

华梦�?/a> 2009-03-26 22:15 发表评论

划线

Tue, 24 Mar 2009 08:25:00 GMT

// TODO: Add your message handler code here and/or call default
/*HDC hdc;
hdc=::GetDC(m_hWnd);
MoveToEx(hdc,m_ptOrigin.x,m_ptOrigin.y,NULL);
LineTo(hdc,point.x,point.y);
::ReleaseDC(m_hWnd,hdc);*/
/*CDC *pDC=GetDC();
pDC->MoveTo(m_ptOrigin);
pDC->LineTo(point);
ReleaseDC(pDC);*/

//CClientDC dc(this);
/*CClientDC dc(GetParent());
dc.MoveTo(m_ptOrigin);
dc.LineTo(point);*/

//CWindowDC dc(this);
//CWindowDC dc(GetParent());
/*CWindowDC dc(GetDesktopWindow());
dc.MoveTo(m_ptOrigin);
dc.LineTo(point);*/
/*CPen pen(PS_DOT,1,RGB(0,255,0));
CClientDC dc(this);
CPen *pOldPen=dc.SelectObject(&pen);
dc.MoveTo(m_ptOrigin);
dc.LineTo(point);
dc.SelectObject(pOldPen);*/
// CBrush brush(RGB(255,0,0));

/*CBitmap bitmap;
bitmap.LoadBitmap(IDB_BITMAP1);
CBrush brush(&bitmap);*/
/*CClientDC dc(this);
//dc.FillRect(CRect(m_ptOrigin,point),&brush);
CBrush *pBrush=CBrush::FromHandle((HBRUSH)GetStockObject(NULL_BRUSH));
CBrush *pOldBrush=dc.SelectObject(pBrush);
dc.Rectangle(CRect(m_ptOrigin,point));
dc.SelectObject(pOldBrush);*/
m_bDraw=FALSE;
CView::OnLButtonUp(nFlags, point);

华梦�?/a> 2009-03-24 16:25 发表评论

C�q�制转换

Thu, 19 Mar 2009 08:37:00 GMT

#include
#include
char* strToBinary(int x);
char* strToHex(int i);
char* transToGKB(char *t);

int main ()

{
char *p=strToBinary(233);
//cout<

//cout<cout<return 0;
}
char* transToGKB(char *t){
int res=0;
   int intlen;
   intlen=strlen(t);
   if(intlen>1){
    char *result=new char[5];
   int i=0;
if(0>t[0]){
    res=256+t[0];
}
char *p1=strToHex(res);
if(0>t[1]){
  res=256+t[1];
}
char *p2=strToHex(res);
result=p1;
result[2]=p2[0];
result[3]=p2[1];
result[4]='\0';
return result;
}
   else{
    //if(t[0]>64)
    char * p=new char[3];
    p=strToHex(t[0]);
    p[2]='\0';
    return p;
   }

}

//数字转�ؓ二进�Ӟ��255以内的正敎ͼ�
char* strToBinary(int i){
char *result=new   char[9];
int n=1;
int m;
int c=0;
int j=8;
for(c=0;c<8;c++){
  m=i%2;
  j=j-1;
  i=n=i/2;
  if(n>=0){
   if (m>0){
    result[j]='1';
   }else
   {
    result[j]='0';
   }
  }

}
result[8]='\0';

// cout< return result;
}
//数字转�ؓ十六�q�制�Q?55以内的正敎ͼ�
char* strToHex(int i){
char *result=new   char[3];
int n=1;
int m;
int c=0;
int j=2;
for(c=0;c<2;c++){
  m=i%16;
  j=j-1;
  i=n=i/16;
  if(n>=0){
   if (m>0){
    if (m==1){
                  result[j]='1';
    }
    else if (m==2){
     result[j]='2';
    }
    else if (m==3){
     result[j]='3';
    }
    else if (m==4){
     result[j]='4';
    }
    else if (m==5){
     result[j]='5';
    }
    else if (m==6){
     result[j]='6';
    }
    else if (m==7){
     result[j]='7';
    }
    else if (m==8){
     result[j]='8';
    }
    else if (m==9){
     result[j]='9';
    }
    else if (m==10){
     result[j]='A';
    }
    else if (m==11){
     result[j]='B';
    }
    else if (m==12){
     result[j]='C';
    }
    else if (m==13){
     result[j]='D';
    }
    else if (m==14){
     result[j]='E';
    }
    else if (m==15){
     result[j]='F';
    }
   }else
   {
    result[j]='0';
   }
  }
}
result[2]='\0';
return result;
}

华梦�?/a> 2009-03-19 16:37 发表评论

C �q�制转换

Tue, 17 Mar 2009 09:47:00 GMT

#include

#include
void yihuo(char *t,int n, int m);
void myToBinary();
void transToGKB(char *t);
void myToHex();
int main(){
//cout<<"GOOD";
int i=122;
int j=233;
int m=j^i;
char t[128]={0xC9,0xCC,0xC9,0xCC,0xC9,0xCC,'\0',0xC9,0xCC,0xC9,0xCC};
yihuo(t,0, 2);
// transToGKB(t);
//cout<//yihuo(2, 3);
//myToHex();
// myToBinary();
cout<return 0;
}
//�q�制之间的�{�?br /> // 字符串传�?6�q�制
void myToHex(){
char c[] = "CC";
unsigned long tt= strtoul(c, NULL, 16);
cout<

}

// 字符串传�?6�q�制
void myToBinary(){
char c[] = "10000000";
// unsigned long tt= strtoul(c, NULL, 2);
cout<

}
//汉字的�{换， 16�q�制转换为汉�?br />void transToGKB(char *t){

// char *t="商户";
// CharN
//如果是负敎ͼ�则�{为正整数
// if(0>t[0]){
// res=256+t[0];
// }
int j=t[0];
cout<

}

void yihuo(char *t,int n, int m) {

char *tt="商户说的��?;
//转成数字�q�且保存到数�l�，然后求异�?/p>

//求的长度
const int mylen=strlen(tt)+1;
char mysplit[1000];
//循环对这个整形数�l�进行赋�?br />int i=0;
for(i<0;i if (tt[i]<0){
mysplit[i]=256+tt[i];
}else
{
mysplit[i]=tt[i];
}
}
int result=mysplit[n-1];
int j;
for(j=n;j result=result^mysplit[n];
cout<<"L"<cout< cout<<"M"<

}

//�q�行遍历求异�?br />mysplit[mylen-1]='\0';
cout<

cout<<"ee";
if(result<0)
result=256+result;
cout< //int j=t[0];
// cout<

}

华梦�?/a> 2009-03-17 17:47 发表评论

activex

Wed, 11 Mar 2009 14:27:00 GMT

Private Sub UserControl_ReadProperties(PropBag As PropertyBag)

Text1.Text = PropBag.ReadProperty("RecordSource", _
m_def_recordSource)
Text2.Text = PropBag.ReadProperty _
("ConnectionString", m_def_connectionString)

End Sub

华梦�?/a> 2009-03-11 22:27 发表评论

指针处理

Tue, 10 Mar 2009 13:45:00 GMT

int main(void)
{
   int m=4;
   int nn;
   int *n;
   int *s;
   int *p;
   int *q;
   n=&m;

nn=n;
   q=n;
s=nn;
   printf("%08x",*s);

return 0;
}

华梦�?/a> 2009-03-10 21:45 发表评论

三个�Ҏ��的硬件地址

Tue, 10 Mar 2009 08:51:00 GMT

0xFFFFFF20 数据输入�~�冲�?br />0xFFFFFF24 输出数据�~�冲区 �?br />0xFFFFFF28 控制寄存�?/p>

华梦�?/a> 2009-03-10 16:51 发表评论

Tue, 10 Mar 2009 07:40:00 GMT

1.�E�序�D?/font>:�E�序�D��ؓ�E�序代码在内存中的映��?一个程序可以在内存中多有个副本.

2.初始化过的数�?/font>:在程序运行值初已经对变量进行初始化�?/div>

3.未初始化�q�的数据:在程序运行初未对变量�q�行初始化的数据

4.�?stack):存储局�?临时变量,在程序块开始时自动分配内存,�l�束时自动释攑ֆ��?存储函数的返回指�?

5.�?heap):存储动态内存分�?需要程序员手工分配,手工释放.

# include <stdio.h> int g1=0, g2=0, g3=0; intmax(int i) { int m1=0,m2,m3=0,*p_max; static n1_max=0,n2_max,n3_max=0; p_max =(int*)malloc(10); printf("打印max�E�序地址\n"); printf("in max: 0x%08x\n\n",max); printf("打印max传入参数地址\n"); printf("in max: 0x%08x\n\n",&i); printf("打印max函数中静态变量地址\n"); printf("0x%08x\n",&n1_max);//打印各本地变量的内存地址 printf("0x%08x\n",&n2_max); printf("0x%08x\n\n",&n3_max); printf("打印max函数中局部变量地址\n"); printf("0x%08x\n",&m1);//打印各本地变量的内存地址 printf("0x%08x\n",&m2); printf("0x%08x\n\n",&m3); printf("打印max函数中malloc分配地址\n"); printf("0x%08x\n\n",p_max);//打印各本地变量的内存地址 if(i)return 1; elsereturn 0; } int main(int argc,char**argv) { staticint s1=0, s2, s3=0; int v1=0, v2, v3=0; int*p; p =(int*)malloc(10); printf("打印各全局变量(已初始化)的内存地址\n"); printf("0x%08x\n",&g1);//打印各全局变量的内存地址 printf("0x%08x\n",&g2); printf("0x%08x\n\n",&g3); printf("======================\n"); printf("打印�E�序初始�E�序main地址\n"); printf("main: 0x%08x\n\n", main); printf("打印��d��地址\n"); printf("argv: 0x%08x\n\n",argv); printf("打印各静态变量的内存地址\n"); printf("0x%08x\n",&s1);//打印各静态变量的内存地址 printf("0x%08x\n",&s2); printf("0x%08x\n\n",&s3); printf("打印各局部变量的内存地址\n"); printf("0x%08x\n",&v1);//打印各本地变量的内存地址 printf("0x%08x\n",&v2); printf("0x%08x\n\n",&v3); printf("打印malloc分配的堆地址\n"); printf("malloc: 0x%08x\n\n",p); printf("======================\n"); max(v1); printf("======================\n"); printf("打印子函数�v始地址\n"); printf("max: 0x%08x\n\n",max); return 0; }

�q�个�E�序可以大致查看整个�E�序在内存中的分配情�? 可以看出,传入的参�?局部变�?都是在栈��分�?随着子函数的增多而向下增�? 函数的调用地址(函数�q�行代码),全局变量,静态变量都是在分配内存的低部存�?而malloc分配的堆则存在于�q�些内存之上,�q�向上生�?/font>

华梦�?/a> 2009-03-10 15:40 发表评论