C:\¼ÓÔØÒ»¸öÀà
Èç¹ûÔÚ C:\ ÏÂÃæÓÐÒ»¸ö Findme.class µÄ»°£¬ÊDz»ÊÇÓ¦¸ÃÈçÏÂʹÓÃÄØ£¿ ºóÃæµÄ²ÎÊýÊÇÊ²Ã´ÄØ classForname("C:\\Findme.class") Ϊʲôµ÷ÊÔµÄʱºò×ÜÊÇû¼ÓÔØ³É¹¦ÄØ£¬¶¼ÊÇ null °¡ Java code: public class PlanLoader extends ClassLoader { /** * @param args */ public static void main(String[] args) { // TODO Auto-generated method stub PlanLoader pl = new PlanLoader(); Class c = pl.loadClass("C:\\Findme", true); } public Class loadClass(String name, boolean resolve ) { Class clas = null; clas = this.findLoadedClass(name); if( clas != null ) { System.out.println(name); return clas; } }
·¹ý£¬°ï¶¥¡£ classpathÀïÃæ°ÑC:\\Findme.class¼Ó½øÈ¥¾ÃÍêÁË¡£ ÉèÖû·¾³±äÁ¿ classpath=".;C:\Findme" ¾Í¿ÉÒÔÁË¡£ ×Ô¼ºÊµÏÖÀà¼ÓÔØÆ÷£¿ ×Ô¼ºÊµÏÖÀà¼ÓÔØÆ÷µÄ»°£¬ÄãÊ×ÏÈÒªÀí½âÀà¼ÓÔØÆ÷µÄ¹¤×÷ÔÀí¡£ ¾ßÌåʵÏֱȽϸ´ÔÓ£¬²»ÊÇÏñÄãÏëµÄÄÇô¼òµ¥£¬²»¹ý»¹ÊǺÜÈÝÒ×ÕÆÎյġ£ ²»ÊÇÕâô¼ÓÔØµÄ£¬Òª¿´ API Îĵµ£¬Ëü˵ loadClass() µÚÒ»¸ö²ÎÊýÊÇÀàÃû£¬²»ÊÇÎļþλÖᣠjava -classpath C:\ PlanLoader Àà·¾¶ÊÇÎļþ¼Ð»ò jar/zip °üÎļþÃû¡£ ÒýÓÃ
Ïà¹ØÎÊ´ð£º
ÇëÎÊVFPÖÐÈçºÎµ÷ÓÃC/C++º¯Êý£¿ ÄãÒªµ÷ÓÃʲô¹¦Äܵĺ¯Êý£¿Òª¿´¿´VFPÖÐÓÐûÓжÔÓ¦µÄº¯Êý£¬Èç¹ûÓоÍÊ¡×ÅÔÙµ÷ÓÃÁË¡£Èç¹ûûÓУ¬¿ÉÒÔ½«C/C++º¯Êýд¸öDLL»òFLL£¬È»ºóÔÚVFPµ÷Óü´¿É¡£ Ê®¶¹Èý ÀÏʦ£¬Ôõô²ÅÄÜÐÞ¸Ä×Ô¼ºµÄ ......
SHIFT¼ÓF10ÓëÄǸö¼üÓÒctrl±ßÉϵÄÄǸö¼ü¹¦ÄÜÒ»Ñù£¬ÏëÆÁÕâ¸ö µ«²»ÖªÒªÔõôдÄǸö×éºÏ¼ü£¡ ÓÐûÄĸö´óÏÀ·ÅÒ»¶ÎÕâ¸öµÄ´úÂë»òдһ¶Î http://topic.csdn.net/u/20090609/15/7dc9fb70-243f-4070-9cfd-34e48b66e6c6.html
......
¸÷λ´óÏÀ£º ÓÐûÓÐÖªµÀÈçºÎÔÚCÓïÑÔÖÐʹÓóÖÐø¼¯³É¡£´Ó³õ²½µÄµ÷²éÀ´¿´£¬Ã²ËÆÊ¹ÓÃCruiseControlµÄÈ˺ܶ࣬µ«ÊǸÿªÔ´¹¤¾ß¶ÔCÓïÑÔµÄÖ§³ÖÃ²ËÆºÜÓÐÏÞ£¬±àÒëºÍ²âÊÔ½á¹û¿ÉÄÜÐèÒª×Ô¼º´¦Àí£¬Éú³ÉCruiseControlÄܹ»´¦ÀíµÄXMLÎ ......
°ï°ï棬лл~ 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 ......
ÇëÎÊC++ÀïµÄÓÃCInternetSession Ä£ÄâHTTP·¢ËÍÇëÇóºó£¬ ÈçºÎ»ñµÃ·þÎñÆ÷ÔÚä¯ÀÀÆ÷ÀïÏìÓ¦µÄURL´®°¡£¿ ¾ÍÊÇ ·þÎñÆ÷»á·µ»ØÒ»¸ö Ò³Ãæ¸øÎÒÁË ¶ø´Ëʱä¯ÀÀÆ÷µÄURLµØÖ·Ò²¾ÍÏ൱ÊÇ·þÎñ ......