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

[³ÏÐÄÇó½Ì]ÈçºÎÓÃC#½«AFM3ÖеÄAsObjectת»»³ÉC#ʵÌåÀà

×î½üÔÚÑо¿ÓÃAS3 Socket + AFM3 + C# Socket×öͨÐÅ
ĿǰÁ¬½Ó,·¢ËÍÏûÏ¢Ò»Çж¼Õý³£,¾ÍÊǵ±flex¶Ë½«Ñ¹ËõºóµÄ¶þ½øÖÆÊý¾Ý·¢Ë͵½·þÎñ¶Ëʱ²»ÖªµÀ¸ÄÈçºÎ½«½âѹËõºóµÄAsObject¶ÔÏóת»¯³ÉÌØ¶¨µÄC#ʵÌåÀà.

´úÂë˵Ã÷ÈçÏÂ
flex¶ËÎÞÒì³£
JScript code:

private function onConnect( event:Event ):void {
//Á¬ÉÏ·þÎñ¶ËºóѹËõµ¥Ìå¶ÔÏó·¢Ë͵½·þÎñ¶Ë
textField.text = "ÒÑÁ¬½ÓÉÏ·þÎñÆ÷,ÏÂÃæ·¢ËÍÏûÏ¢...";
var param: Object = {Id: '1', Name: 'ÕÔ¹û', Address: 'ÖйúÕã½­'};
var _bytes:ByteArray = new ByteArray();
_bytes.writeObject(param);
_bytes.compress();
socket.writeBytes(_bytes);
socket.flush();
}

private function onData( event:ProgressEvent ):void {
//½ÓÊÕµ½·þÎñ¶ËµÄÏûÏ¢½âѹËõºóÄÚÈÝÒ²ÄÜÕý³£ÏÔʾ
var _bytes:ByteArray = new ByteArray();
while(socket.bytesAvailable > 0){
socket.readBytes(_bytes);
}
_bytes.uncompress();
var tmp:Object = _bytes.readObject();
textField.text = tmp.Id + ',' + tmp.Name + ',' + tmp.Address;
}



ÎÊÌâ³öÔÚ·þÎñ¶Ë
C# code:

private void onReceive(ICourageService server, object target)
{
.......
SocketAsyncEventArgs _eventArgs = target as SocketAsyncEventArgs;
byte[] _bytes = _eventArgs.Buffer;//·þÎñ


Ïà¹ØÎÊ´ð£º

¼±ÇóASP¡£NETC#¹ºÎï³µ´úÂë

×î½üÔÚ×ö¸öÍøÉÏÉ̳ǣ¬¹ºÎﳵģ¿é£¬Ã»ÓÐ×ö¹ý£¬Âé·³¸÷λ°ïæ˵Ï´óÖÂ˵ÏÂ˼·£¬ÄÜ·¢Ò»·ÝÔ´Âë¸üºÃ¡£Ð¡µÜÏÈл¹ý¸÷λÁË£»
QQ£º413763818£»
eamil:swebook@126.com
ÍøÉÏÒ»´ó¶Ñ£¡

www.51aspx.com

ȥϠ......

C# DataSetµ¼³öxml Åú´¦Àí(Ñ­»·)µÃÔõô´¦Àí

DataSetµ¼³öxml Åú´¦Àí(Ñ­»·)µÃÔõô´¦Àí
XMLÎļþ
<A>
      <B>
        <C>
        </C>
  &nb ......

sqlССµÄÒÉÎÊ - .NET¼¼Êõ / C#

¿ÉÄÜÒòΪ¹¤×÷µÄÔ­Òò ½Ó´¥Êý¾Ý¿âÕâ¿é±È½ÏÉÙ£¬Ö®Ç°¶¼ÊÇ×ö³ÌÐòÕâ¿é£¬Êý¾Ý¿âÕâ¿é¶¼ÓÐרÃŵÄÈËÀ´×ö ·Ö¹¤¶¼ºÜÃ÷ϸ ËùÒÔ¶ÔÊý¾Ý¿âÕâÒ»¿éÍêÈ«²»Á˽⡣ǰ¶Îʱ¼ä È¥ÃæÊÔÁ˼¸¼Ò¹«Ë¾ ¼¸ºõ¶¼ÊÇÔÚÊý¾Ý¿âÕâ¿é¹ÒµôµÄ Á¬¸ö¼òµ¥µÄSQ ......

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