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

ÇóÖú£ºEL±í´ïʽc:outµÄÎÊÌâ

ÔÚjspÒ³ÃæÖ®¼ä´«µÝ²ÎÊý£¬µÚÒ»¸öÒ³Ãæ´«¹ýÈ¥µÄ¼ÙÈçÊÇ£º
http://localhost:8080/index.action?aaa=111&bbb=222&ccc=333&ddd=444
ÔÚµÚ¶þ¸öÒ³ÃæÊ¹ÓÃ<c:out value="param"/>¿ÉÒԵõ½
{aaa=111, bbb=222, ccc=333, ddd=444}
ÎÒµÄÎÊÌâÊÇÈçºÎ»ñÈ¡<c:out value="param"/>²ÎÊýµÄ´óС£¬ÒÔ¼°»ñȡÿ¸ö²ÎÊýµÈºÅÇ°ÃækeyÒÔ¼°ºóÃævalue£¿

ÒòÎªÒ³ÃæÉϵIJÎÊý¸öÊý²»È·¶¨ÒÔ¼°²ÎÊýµÄÃû³Æ²»È·¶¨£¬ËùÒÔÏëͨ¹ý·½·¨»ñÈ¡param²ÎÊý¸öÊýÒÔ¼°Ã¿¸ö²ÎÊýµÄÖµ¡¾keyºÍvalue¡¿

ÒòΪparamÊÇMapÀ࣬ËùÒÔÎÒʹÓÃ<c:out value="param.size()"/>µ«ÊDZ¨´í¡£
ERROR Message£ºThe function size must be used with a prefix when a default namespace is not specified

ÏëÇëÎÊһϴó¼ÒÓÐʲô·½·¨£¬Ð»Ð»¡£
JSTL ÀïÓÐÒ»×éfn£¨º¯Êý£©±êÇ© £º

JSTL 1.1 ÐÂÔöº¯Êý(functions)±êÇ©¿â£¬Ö÷ÒªÌṩһЩºÃÓõÄ×Ö·û´®´¦Àíº¯Êý£¬ÀýÈ磺 
fn:contains¡¢fn:containsIgnoreCase¡¢fn:endsWith¡¢fn:indexOf¡¢fn:join¡¢fn:length¡¢
fn:replace¡¢fn:split¡¢fn:startsWithºÍ fn:substring µÈµÈ¡£ 

ÄãʹÓÃc:out ±êÇ© ÅäºÏfn±êÇ© ¾ÍÐÐÁË£¬ÆäËûµÄ×Ô¼ºgoogleÏÂ

²»·Ï»°ÁË
 



${param.aaa}

³¤¶ÈҪôÓÃ<%=%>Ëã³öÀ´,Òª²»¾ÍÓÃstruts»òÕß±ðµÄ±êÇ©...


ѧϰ Ê̡ܽ£¡£¡£¡£

ÒýÓÃ

HTML code
<%
Enumeration enum = request.getParameterNames();
while(enum.hasMoreElements()){
String key = (String)enum.nextElement();
String[] paramValues = request.getPa


Ïà¹ØÎÊ´ð£º

¸ÕѧC£¬ÓÃCʵÏÖ±àÂë - C/C++ / CÓïÑÔ

#include"stdio.h"
#include"stdlib.h"
void ContrTwo(char i)
{
char str1[8];
itoa(i,str1,2);
printf("%s",str1);
}
unsigned char leftRot(char str,int i);
unsign ......

¸ß·ÖÇó!×îºÃÊÇC/C++ - C/C++ / CÓïÑÔ

·Ö±ðÓýṹ»¯·½·¨ºÍÃæÏò¶ÔÏó·½·¨±à³ÌʵÏÖÏÂÃæÒªÇó£º
¶ÔCircleºÍRectangleʵÏÖÒÔϹ¦ÄÜCenter,Move,Rotate,Print.
×Ô¼ºÏȶ©ÒÔÏ£¬ÕâÊÇÒ»¸ö¸Õѧϰ¼ÆËã»úµÄÈËÎÊÎÒµÄ


ѧϰ£¬¿´¿´

¼ÌÐø¶¥Å¶

ѧϰÁË¡£

go o ......

C/C++/MFCȺ - C/C++ / ·Ç¼¼ÊõÇø

´ó¼ÒºÃ£¬ÕâÊÇÒ»¸öÖ÷ÒªÃæÏòc/c++/mfcµÄȺ£¬×î½ü½øÐÐÁËÒ»´Î´óÇåÀí£¬»¶Ó­¸÷λ¸ßÊÖ¼ÓÈ룬ºÃѧ°®ÎʵÄÐÂÊÖ£¬Ò²¿ÉÒÔÉêÇëµÄ£¬ÉêÇë¸ñʽ Ö°Òµ£¨c/c++/mfc ÈÎѡһ»òÕ߶ࣩ ¹¤×÷ÄêÏÞ£¨Ñ§ÉúÖ±½Óд´ó¼¸£©¾ÍÐÐÁË£¬ÈëȺµÄÒªÇó¾ÍÊÇÒª» ......

°ïæ¿´¿´Õ⼸¸ö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 ......

c¾²Ì¬±àÒëÁíÒ»¸öÎļþ¼ÐµÄ¿âº¯Êý - C/C++ / CÓïÑÔ

ÔÚ¸ùĿ¼/libÖдæ·ÅÒ»¸ölog.c£¬log.h£¬²¢ÓÃÏÂÃæµÄÓï¾ä£º
gcc -c log.c
ar crv liblog.a log.o
±àÒë³öÒ»¸öliblog.a¾²Ì¬¿â£¬È»ºóÔÚÎļþ¼Ð£º/testfileÖд´½¨Ò»¸ötest.cºÍtestc.c£¬test.cÖÐÒýÓÃÁËtestc.cÖж¨ÒåµÄ·½·¨ ......
© 2009 ej38.com All Rights Reserved. ¹ØÓÚE½¡ÍøÁªÏµÎÒÃÇ | Õ¾µãµØÍ¼ | ¸ÓICP±¸09004571ºÅ