¹ØÓÚAndroid C´úÂë ±äÁ¿²ð·Ö×éºÏµÄÎÊÌâ
Hi,
ÔÚAndroidÉÏÓÐЩÔËËãÓÐÎÊÌâ(C´úÂë)
4×Ö½Úx2×é³É8×Ö½Ú ÕâÀïÓÐÁ½ÖÖ×ö·¨£º
1. ½«8×Ö½Ú±äÁ¿µ±×öÒ»¸öint[2]È»ºó¸÷×Ô¸³Öµ
2. ½«¸ß4×Ö½Ú<<32 È»ºóÔÙ | µÍ4×Ö½Ú
ÕâÀ·½·¨2ûÓÐÎÊÌâ¡£¶ø·½·¨Ò»½á¹ûÓÐÎó
ÇëÎʿɷñÓÐʲô·½·¨½â¾öÕâ¸öÎÊÌ⣿
Thanks
C/C++ code:
//·½·¨1
unsigned int HIGH_INT(unsigned long long d)
{
unsigned long long dcopy = d;
return ((unsigned int*)&dcopy)[1];
}
unsigned long long MAKE_DBLINT(unsigned int high, unsigned int low)
{
unsigned long long build = low;
((unsigned int*)&build)[1] = high;
return build;
}
void printInt(unsigned long long l) {
unsigned int high = HIGH_INT(l),low = (unsigned int)l;
LOGV("high=%X low=%X",high,low);
}
//·½·¨2
unsigned int HIGH_INT2(unsigned long long d)
{
unsigned long long dcopy = d;
return (unsigned int)(dcopy>>32);
}
unsigned long long MAKE_DBLINT2(unsigned int high, unsigned int low)
{
unsigned long long build = low;
unsigned long long build2 = high;
build2 = build2 << 32;
build = build | build2;
return build;
}
void printInt2(unsign
Ïà¹ØÎÊ´ð£º
ÎÒÕâÀïÓÐÒ»¸öµÇ½WIFIÍøÂçµÄÒ³Ãæ¡£ÓÉÓÚWIFI¾³£¶ÏÏߣ¬ËùÒÔÒª·´¸´µØÔÚÕâ¸öÍøÒ³Éϵǽ£¬Ã»·¨ÎÞÈËÖµÊØ¡£
ËùÒÔ£¬ÎÒÏë×öÒ»¸öC#³ÌÐò£¬·ÅÒ»¸öwebbrowser¿Ø¼þ£¬×Ô¶¯Ìî±í²¢×Ô¶¯µã»÷Ìá½»°´Å¥¡£
ÎÊÌâÒ»£º
»ù±¾ÕÕÍøÉÏÕҵijÌÐò ......
±¾ÈËÕýÔÚÓÃJava×öÒ»¸öC/S¼Ü¹¹µÄÏîÄ¿£¬
¿ÉÊÇÓÉÓÚÏîÄ¿±È½Ï´ó£¬Ç°ÆÚ¶Ô¼Ü¹¹µÄÉè¼ÆÓÈÆäÖØÒª£¬ÒòΪºóÆÚ¿ÉÄÜËæÊ±»á¼Ó¸ö¹¦ÄÜ»òÕßÈ¥µôijЩ¹¦ÄÜ¡£
ËùÒÔÌØµØÑ°ÇóÈçºÎÉè¼ÆC/SµÄ¼Ü¹¹Ê¹³ÌÐò¸ü¼ÓÃæÏò¶ÔÏó¸ü¼ÓÒ×ÓÚά ......
´ó¼ÒºÃ£º
ÎÒÏëʵÏÖ¼ì²âµ½²åÈëSD¿¨ºó×Ô¶¯½«SD¿¨¸ñʽ»¯µÄ¹¦ÄÜ£¬²»ÖªC/C++ÖÐÓÐûÓиñʽ»¯UÅ̵ĺ¯Êý£¿
ÁíÍ⣬ÎÒ²»ÏëʹÓÃSHFormatDrive£¬ÒòΪÕâ¸öº¯Êý»áµ¯³öÊÇ·ñÒª¸ñʽ»¯µÄÌáʾ¿ò£¬ÎÒÐèÒªµÄÊÇϵͳ×Ô¶¯¸ñʽ»¯£¬¶ø²Ù×÷Õß² ......
°ï°ï棬лл~
1. Write a program to perform a topological sort on a graph.
2. Write a program to solve the single‐source shortest‐path problem (Dijkstra
algorithm).
3. Write a program ......
ÎÒÏÖÔÚÏë×öÒ»¸ö»ùÓÚTCPµÄ C/SµÄÁÄÌì³ÌÐò£¬Ôõô²ÅÄÜʵÏÖÓû§ÐÅÏ¢µÄÈÏÖ¤µÇ¼£¬
socketͨÐŽ¨Á¢Á¬½Óǰ£¬ÏÈ·¢ËÍÓû§Ãû£¬ÃÜÂëµÈ£¬ÈÏÖ¤
Äǽ¨Á¢µÄÊÇTCP ±ØÐëÒªÁ¬½Óºó²ÅÄÜ·¢ËÍѽ
ÒýÓÃ
Äǽ¨Á¢µÄÊÇTCP ±ØÐëÒªÁ¬½Óºó²ÅÄ ......