- 博客(13)
- 收藏
- 关注
RSS订阅转载 MIT OpenCourse
<br />http://www.myoops.org/cocw/mit/index.htm<br /> <br />For example, you can study Java use<br />http://www.myoops.org/cocw/mit/Electrical-Engineering-and-Computer-Science/6-092January--IAP--2006/LectureNotes/index.htm
2010-06-25 15:58:00
1542
原创 About QEMU
<br /> <br />QEMU is a generic and open source machine emulator and virtualizer. <br /> <br />http://www.qemu.org
2010-06-04 17:39:00
532
原创 alloca()与malloc的区别
void* realloc(void* ptr, unsigned newsize); void* malloc(unsigned size); void* alloca(unsigned size); void* calloc(size_t numElements, size_t sizeOfElement); 都在stdlib.h函数库内 alloca 和malloc 的 区别我是alloca是在栈上申请
2010-06-04 11:03:00
2252
转载 Size of an array
<br />Q: I want to know how many elements are in an array, but sizeof yields the size in bytes. <br />A: Simply divide the size of the entire array by the size of one element: int array[] = {1, 2, 3};<br /> int narray = sizeof(array) / sizeof(arr
2010-06-03 16:53:00
566
转载 Low Level Operators and Bit Fields
<br /> From Dave Marshall<br />1/5/1999<br />http://www.cs.cf.ac.uk/Dave/C/node13.html#SECTION001321000000000000000<br /> Low Level Operators and Bit Fields<br /> We have seen how pointers give us control over low level memory operations. <br /> Many
2010-06-03 13:31:00
616
转载 How can I determine the byte offset of a field within a structure?
#define offsetof(type, f) ((size_t) / ((char *)&((type *)0)->f - (char *)(type *)0))
2010-06-03 11:09:00
641
转载 Swapping variables.
http://www.azillionmonkeys.com/qed/case3.html#define swap(a,b) { / (a) ^= (b); / (b) ^= (a); / (a) ^= (b); / }#define swap(a,b) { / (a) += (b); / (b) = (a) - (b); / (a) -= (b); / }
2010-06-03 10:48:00
551
转载 递归算法学习系列之八皇后问题
<br />转自<br />http://www.cnblogs.com/jillzhang/archive/2007/10/21/922830.html<br /> <br />1.引子<br /> 中国有一句古话，叫做“不撞南墙不回头"，生动的说明了一个人的固执，有点贬义，但是在软件编程中，这种思路确是一种解决问题最简单的算法，它通过一种类 似于蛮干的思路，一步一步地往前走，每走一步都更靠近目标结果一些，直到遇到障碍物，我们才考虑往回走。然后再继续尝试向前。通过这样的波浪式前进方法， 最终达到
2010-06-02 17:10:00
585
原创 判断一个数是否为2的幂?
<br />http://www.cppblog.com/converse/archive/2006/07/10/9664.html<br /> <br /><br /><br />bool Is2Power(int nNum)<br />{<br /> return nNum > 0 ? ((nNum & (~nNum + 1)) == nNum ? true : false) : false;<br />}<br /><br />或者<br /><br />#define IS_POWER_OF
2010-06-02 16:17:00
541
原创 求一个Byte 的字节数据中， 二进制数1的个数
查表法int countTable[256] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 };int Count(int v) { return countTable[v & 0x0F] + countTable[v >> 4]; }
2010-06-02 15:58:00
1155
原创 big endian and little endian
<br />unsignedchar test_bigendian(void) <br />{ <br /> int test_var =1; <br /> unsignedchar test_endian*=(unsignedchar*)&test_var; <br /> <br /> return(test_endian[0]== NULL); <br />} <br /><br />int little_endian_to_big_endian(int i)<br />{<br />
2010-06-02 15:54:00
580
原创 UnrepeatingNunbers
Problem Statement:<br /> 如果一个数字十进制表达时，不存在连续两位数字相等，则称之为“不重复数”。例如，105，1234和12121都是“不重复数”，而11，100和1225不算。给定一个long类型数字A，返回大于A的最小“不重复数”。 Definition:<br /> Class: UnrepeatingNumbers <br /> Method: next <br /> Parameters: long <br /> Returns: long
2010-06-01 14:52:00
476
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人