Ò׽ؽØÍ¼Èí¼þ¡¢µ¥Îļþ¡¢Ãâ°²×°¡¢´¿ÂÌÉ«¡¢½ö160KB

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 °üÎļþÃû¡£


ÒýÓÃ


Ïà¹ØÎÊ´ð£º

ѧϰÌÖÂÛ C/C++ QQȺ - C/C++ / ·Ç¼¼ÊõÇø

QQȺ 29152388
ÓÑÇéUP

°ï¶¥

up

°ïup

up Ö§³Ö£¡

up jf

...ÄѵÀÓзÖ..?

up up up
Ï£ÍûÓеüӷ֣¬¹þ¹þ¡£

Ö§³Ö£¬ÎÒ¼ÓÁË£¬Ï£ÍûÂ¥Ö÷ÄܼÓÎÒ£¬¹²Í¬Ñ§Ï°¹þ

¼ÓÁË¡£

¶¥ÉÏ£¬Ã¿ÌìÊÕ»ñÒ»µã£¬Ö§³Ö ......

C#ÌîÍøÒ³±íµ¥µÄÎÊÌâ - .NET¼¼Êõ / C#

ÎÒÕâÀïÓÐÒ»¸öµÇ½WIFIÍøÂçµÄÒ³Ãæ¡£ÓÉÓÚWIFI¾­³£¶ÏÏߣ¬ËùÒÔÒª·´¸´µØÔÚÕâ¸öÍøÒ³Éϵǽ£¬Ã»·¨ÎÞÈËÖµÊØ¡£
ËùÒÔ£¬ÎÒÏë×öÒ»¸öC#³ÌÐò£¬·ÅÒ»¸öwebbrowser¿Ø¼þ£¬×Ô¶¯Ìî±í²¢×Ô¶¯µã»÷Ìá½»°´Å¥¡£
ÎÊÌâÒ»£º
»ù±¾ÕÕÍøÉÏÕҵijÌÐò ......

°ïæ¿´¿´Õ⼸¸öC - C/C++ / CÓïÑÔ

°ï°ï棬лл~
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 ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ