linux C¶àÏ̳߳ÌÐòÎÊÌâ
linux C ÀïÃæµÄthread_create()º¯ÊýÔÚ´´½¨Ò»¸öеÄÏ̵߳ÄʱºòÖ»ÔÊÐí´«µÝÒ»¸övoid*¸ñʽµÄ²ÎÊýarg ¸øÏ̵߳Ästart_route£¬ÄÇÈç¹ûÎÒд´½¨µÄÏß³ÌÒª´¦Àí¶à¸ö²ÎÊý¡£Ôõô°ìÄØ£¿ÎÒÏëÁ˼¸¸ö°ì·¨ÈçÏ£¬Çå¸÷λָµãһϣº
1¡¢´´½¨Ò»¸ö½á¹¹Ìå°Ñ²ÎÊý¶¼´ò°ü×°½øÈ¥£¬ÔÙ´«µÝ¸østart_route£¬²»ÖªµÀÐв»ÐеÄͨ¡£
2¡¢°ÑÒª´¦ÀíµÄ²ÎÊýÔÚmain()º¯ÊýÍâÃæÉùÃ÷³ÉÈ«¾Ö±äÁ¿¡£
ÕâЩ¶¼ÊÇÎҵIJÂÏ룬²»ÖªµÀͨÓõĻòÕ߹淶µÄ×ö·¨ÊÇÔõÑùµÄ°¢£¬»¹Íû¸÷λָµã£¡
1 ·½·¨Ó¦¸ÃºÜ³£Óðɡ£±ÈÈçwindows ½¨Á¢´°¿Úʱºò£¬createWindow º¯ÊýµÄlpParam¾ÍÀàËÆ£¬Ò²ÊÇÒª´«µÝÒ»¸ö½á¹¹Ì司´°¿Úº¯Êý£¬µ«lpParam ±¾Éí¾ÍÊǸövoid*Ö¸Õë
1.µ±È»¿ÉÒÔ
2.Ïß³ÌÓë½ø³ÌµÄÒ»´ó²»Í¬¾ÍÊǹ²ÏíÈ«¾Ö£¬ÕâÒ²ÊÇÑ¡ÔñÏ̶߳ø²»Êǽø³ÌµÄÖØÒª²Î¿¼
t-bag˵µÄºÃ£¡»Ø¸´ÄÚÈÝÌ«¶ÌÁË
È«¾Ö±äÁ¿°É£¬²»¹ý×¢Òâ¼Óvolatile
´´½¨½á¹¹Ì壬°Ñ½á¹¹Ìåµ±³É²ÎÊý¡£Õâ¸ö°ì·¨¿ÉÐУ¬ÎÒʵÑé¹ý¡£
ÍÆ¼öʹÓ÷½·¨1°É£¬ÎÒÒ»°ã¶¼ÊÇÓýṹÌå
ÎÒ¾õµÃ»¹ÊǸù¾ÝÄãµÄ³ÌÐò¹¦ÄÜÀ´×ö£¬
Èç¹ûÄã´«µÝµÄ²ÎÊýÊÇÒ»´ÎÐԵģ¬ÒÔºó²»ÔÙÓõ½£¬ÄǾÍÓýṹ
Èç¹ûÔÚ³ÌÐòÔËÐйý³ÌÖУ¬ÕâЩ²ÎÊýÒª±ä»¯£¬ÓëÆäËüÏ߳̽»»¥£¬ÔòÓÃÈ«¾Ö±äÁ¿
²»Í¬µÄ·½·¨ºÏÊʲ»Í¬µÄÐèÇó
¡°´´½¨Ò»¸ö½á¹¹Ìå°Ñ²ÎÊý¶¼´ò°ü×°½øÈ¥£¬ÔÙ´«µÝ¸østart_route¡± Ò»°ã¶¼ÊÇÕâôÓõÄ
ѧϰÀ².
Á½ÖÖ¶¼µÃʵÑéÏÂ.
È«¾ÖºÍ½á¹¹Ìå¶¼¿ÉÒÔ£¬½¨Òé½á¹¹Ìå
ÓýṹÌåºÃ£¬±È½Ï·´¸ÐÈ«¾Ö±äÁ¿
²»¶ÌÁË
Ïà¹ØÎÊ´ð£º
×ÉѯQQ£º269562808
bzip2recover
¹¦ÄÜ˵Ã÷£ºÓÃÀ´ÐÞ¸´Ë𻵵Ä.bz2Îļþ¡£
Óï·¨£ºbzip2recover[.bz2ѹËõÎļþ]
²¹³ä˵Ã÷£ºbzip2ÊÇÒÔÇø¿éµÄ·½Ê½À´Ñ¹ËõÎļþ£¬Ã¿¸öÇø¿éÊÓΪ¶ÀÁ¢µÄµ¥Î»¡£Òò´Ë£¬µ±Ä³Ò»Çø
¿éËð»µÊ±£¬±ã¿ÉÀû ......
´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......
ÏÖÔÚÐèÒªÔÚÒ»¸öǶÈëʽϵͳÖÐʵÏÖʱ¼äº¯Êý£¬±àÒëÆ÷δÌṩtime¿âº¯Êý£¬ÇëÎÊ´ó¼ÒÈçºÎÓÃcÓïÑÔʵÏÖʱ¼äº¯Êý°¡£¿
ÄêÔÂÈÕʱ·ÖÃë µ½ ÕûÊýÃ루´Ó1970Ä꿪ʼ£© Ö®¼äµÄÏà¹Ø×ª»»°¡
ÀàËÆmktime ºÍlocaltimeµÄ¹¦ÄÜ£¬Ð»Ð»
mktime ......
°ï°ï棬лл~
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 ......