国产精品久久亚洲不卡动漫,996久久国产精品线观看,久久国产亚洲精品麻豆

brent — Wed, 27 Aug 2008 04:01:00 GMT

有个控�g叫CTreeListCtrl�Q�我用了好久了，暗爽了很久，最作者是��来��敬仰啊

最�q�无意中发现�Q�作者TigerX原来�p�d��球村中国�Ӟ��Ƨ耶�?br>地址�Q�http://www.codeproject.com/KB/tree/ctreelistctrl.aspx

�q�以为codeproject上没其它中国土�h呢，华�h倒是知道有好几个�?br>
��Z��在codeproject发了��文章，讲xml序列化复杂对象模型的�Q�门可罗雀啊�?br>http://www.codeproject.com/KB/cs/xmlable.aspx

嗯，很有差别�?br>

brent 2008-08-27 12:01 发表评论

coding hall of shame

brent — Fri, 15 Aug 2008 08:55:00 GMT

http://www.codeproject.com/Lounge.aspx?msg=2679158#xx2679158xx
Although recently I was working on an embedded system, and saw revision dates going back more than ten years. I was quite surprised at how well-structured and commented the code was. Very easy to modify. One of my co-workers told me that was mainly because of the team leader, who held regular code walk-thrus, and kept a "coding hall of shame" on an internal web site.

brent 2008-08-15 16:55 发表评论

Platform Wars

brent — Wed, 14 May 2008 06:10:00 GMT

http://www.sandhill.com/opinion/editorial.php?id=188

brent 2008-05-14 14:10 发表评论

软�g观念革命:交互设计�_�N��

brent — Tue, 29 Apr 2008 06:19:00 GMT

http://ebook.00083.com/2006/200608/20060820221551.html

brent 2008-04-29 14:19 发表评论

msdn code; visualwebgui

brent — Wed, 02 Apr 2008 03:05:00 GMT

http://code.msdn.microsoft.com/

http://www.visualwebgui.com/
how did they do that?

brent 2008-04-02 11:05 发表评论

book note

brent — Fri, 28 Mar 2008 02:53:00 GMT

Windows用户态程序高效排�?br>http://www.china-pub.com/37008
看了��L��Q�没觉得哪里体现�?#8220;高效”2字，只是他排错的环境实在是恶劣，其实��试人员应该比开发�h员牛逼才对，代码��Z�h会写�Q�排错不是�h��做的�Q�需要的知识储备比光写写代码需要的多得多了�?br>��L��里�D的工人分金条的例子题目是错的�Q�还看到一个错别字...但俺对这�U�授��Z��渔的写法很有好感�?br>

brent 2008-03-28 10:53 发表评论

numerical computation

brent — Mon, 17 Mar 2008 07:39:00 GMT

http://www.r-project.org/
http://www.scilab.org/

brent 2008-03-17 15:39 发表评论

SQLite; .Net<- InterProcess ->MFC; Windows Services in Action; a 2D CAD application;

brent — Wed, 05 Mar 2008 02:22:00 GMT

Are you tired of using Access?
SQLite is a software library that implements a self-contained, serverless, zero-configuration, transactional SQL database engine.
http://www.sqlite.org/
Light, Free, Fast, Cross platform.
witten in C, and there are a lot of wrappers, find what you need here: http://www.sqlite.org/cvstrac/wiki?p=SqliteWrappers

http://www.codeproject.com/KB/cpp/SQLite_Server.aspx
Implementing Server/Client architecture for that great SQLite! with visual studio C++ 2005

http://www.codeproject.com/KB/cs/InterprocessCommunicator.aspx
Interprocess Communication Between .NET and MFC using WM_COPYDATA

http://www.codeproject.com/KB/cs/WindowsServicesInAction1.aspx
http://www.codeproject.com/KB/cs/WindowsServicesInAction2.aspx
Windows Services in Action
Windows Services Hand by Hand...

http://www.codeproject.com/KB/cs/OpenS-CAD.aspx
OpenS-CAD, a simple 2D CAD application. <-- just so so

http://www.codeproject.com/KB/cs/DiskAnalyzer.aspx
I don't care about disk, i do care about the pie chart and tree gird view.

brent 2008-03-05 10:22 发表评论

firefox

brent — Mon, 04 Feb 2008 06:51:00 GMT

1)http://developer.mozilla.org/en/docs/Build_Documentation#Configuring_build_options
2)http://cs.senecac.on.ca/~david.humphrey/writing/debugging-firefox.html

brent 2008-02-04 14:51 发表评论

ui patterns

brent — Fri, 01 Feb 2008 06:24:00 GMT

http://ui-patterns.com/

brent 2008-02-01 14:24 发表评论

HTML document in vc6.0

brent — Fri, 07 Sep 2007 06:00:00 GMT

http://www.codeproject.com/internet/htmlimagecapture.asp
simple way to capture whole html as an image

http://codeguru.earthweb.com/cpp/i-n/ieprogram/displayinginformation/article.php/c7273/
HTML Editor for VC++ 6.0

brent 2007-09-07 14:00 发表评论

gpc url

brent — Mon, 20 Aug 2007 09:29:00 GMT

http://davis.wpi.edu/~matt/courses/clipping/

http://www.cs.man.ac.uk/~toby/alan/software/

brent 2007-08-20 17:29 发表评论

reading note 2006-12

brent — Sat, 02 Dec 2006 16:28:00 GMT

如何获取汉字的拼�?
http://blog.csdn.net/cpu88/archive/2004/11/26/195315.aspx
步骤�Q?
//得到拼音�Q�包括多韻I��
A:   用输入法生成�?win2000)"C:\Program Files\Windows NT\Accessories\Imegen.exe"
       逆�{换拼韌��入法文�gC:\WINNT\SYSTEM32\WINPY.MB
      会生成一个C:\WINNT\SYSTEM32\WINPY.txt文�g(��U?WINPY.txt文�g)
B:   WINPY.txt文�g里面是  �?汉字拼音列表5万多�?除去词组有汉�?万多个（含多韻I��
C:   汉字可以转换成某中编码可以自己构造编码方�?保证一个汉字对应一个编�?��U�编码方法）
      �?byte[] uniCode = new String(temp).getBytes(“GB2312�?;
      ��WINPY.txt里面所有的汉字变成�~�码。得到汉字编�?拼音对应表（��U�汉字编码表�Q?br />        XXXX0,a    //XXXX0是某个汉字的�~�码
        XXYX2,o    //XXYX2是某个汉字的�~�码
D: 汉字�~�码表按�~�码排序�Q�编码表按编码大��排序�?br />      �~�码表分�l�（方便查询 �Q?而且得到分组的标志�?br /> E: 查询汉字拼音 ��汉字进行编码（按自��q��~�码�Ҏ��Q��?br />      用编码在�~�码表中查询��可以得到拼韻I��查询时在�~�码表中的某个分�l�中查询�Q�而不是在所有编码中查询。速度很快�?br />//得到首字�W?�?北京' 得到 'bj'            '呆子'得到 'd[a]z ' //多音
//排序有了拼音 ��可以按一些常见的排序�Ҏ��排序

如何在C++中集成Lua脚本(LuaPlus��?:
http://ly4cn.teeta.com/blog/data/44939.html
据说无法调用虚函数。有�Ҏ��。有�I�再看看�?br />http://luaplus.org/

字符串到其他格式的�{�?
CString timestr = "2000�q?4�?5�?;
int a,b,c ;
sscanf(timestr.GetBuffer(timestr.GetLength()),"%d�q?d�?d�?,&a,&b,&c);
CTime time(a,b,c,0,0,0);
ANSI兼容�Q�我太孤陋寡��M��...

RMI for c++?:
http://www.codeproject.com/threads/RMI_For_Cpp.asp
反正目前没这个需要�?br />
声音引擎�Q�audiere�Q�支持跨�q�_��:
��g��Z��错�?br />http://www.shnenglu.com/gogoplayer/archive/2006/11/29/15763.html
http://sourceforge.net/projects/audiere/
wxWidget的wxSound支持windows和unix�?br />其它关于sound:
http://www.opensound.com/oss.html
http://www.libsdl.org/

Why You Should Turn Down That Job Offer
http://www.computerworld.com/action/article.do?command=viewArticleBasic&articleId=9005602&pageNumber=1
You will be the fifth person to have held the job in the past three years.
Why is this job vacant?
Is the turnover rate high for this position?
What's typically the next career step for those with this job?
You will clash with the corporate culture.
You will be bored -- or overwhelmed -- in the role.
You will not be able to move forward.

may not be reason enough to turn down a job:
You will earn less than you did before.
You will be in the car for two hours each day.
You will receive a “demotion�?in title.

计算Int最大最��?br />http://www.shnenglu.com/Winux32/archive/2006/12/01/15853.html
通常我们会��用CRT提供�l�我们的一个头文�g中预定义宏INT_MAX, INT_MIN, UINT_MAX来定义int的最大最��g��边给出由计算得出�q�些值的�Ҏ��Q�其他数据类型同�?br />unsigned int GetUnsignedIntMax()
{
     return   ~ 0 ;
}

signed int GetSignedIntMax()
{
     return (static_cast < unsigned int > ( ~ 0 )) >>   1 ;
}

signed int GetSignedIntMin()
{
    signed int i =   - 1 ;
    if (i &   1 )
        return   - ( (static_cast < unsigned int > ( ~ 0 )) >>   1 ) -   1 ;
    else
        return   - ( (static_cast < unsigned int > ( ~ 0 )) >>   1 );
}
�E�微解释一下，前两个没有什么好说的�Q�最后一个要考虑是two complement�q�是one complement
如果是前者，有这样一个计��公式，~X + 1= -X�Q�即一个数取反加一表示�q�个数所对应的负�?br />

How Skype & Co. get round firewalls
cool..
http://www.heise-security.co.uk/articles/82481
先Copy�q�来再说.

The hole trick

How Skype & Co. get round firewalls

Peer-to-peer software applications are a network administrator's nightmare. In order to be able to exchange packets with their counterpart as directly as possible they use subtle tricks to punch holes in firewalls, which shouldn't actually be letting in packets from the outside world.

Increasingly, computers are positioned behind firewalls to protect systems from internet threats. Ideally, the firewall function will be performed by a router, which also translates the PC's local network address to the public IP address (Network Address Translation, or NAT). This means an attacker cannot directly adress the PC from the outside - connections have to be established from the inside.

This is of course a problem when two computers behind NAT firewalls require to talk directly to each other - if, for example, their users want to call each other using Voice over IP (VoIP). The dilemma is clear - whichever party calls the other, the recipient's firewall will decline the apparent attack and will simply discard the data packets. The telephone call doesn't happen. Or at least that's what a network administrator would expect.

Punched

But anyone who has used the popular internet telephony software Skype knows that it works as smoothly behind a NAT firewall as it does if the PC is connected directly to the internet. The reason for this is that the inventors of Skype and similar software have come up with a solution.

Naturally every firewall must also let packets through into the local network - after all the user wants to view websites, read e-mails, etc. The firewall must therefore forward the relevant data packets from outside, to the workstation computer on the LAN. However it only does so, when it is convinced that a packet represents the response to an outgoing data packet. A NAT router therefore keeps tables of which internal computer has communicated with which external computer and which ports the two have used.

The trick used by VoIP software consists of persuading the firewall that a connection has been established, to which it should allocate subsequent incoming data packets. The fact that audio data for VoIP is sent using the connectionless UDP protocol acts to Skype's advantage. In contrast to TCP, which includes additional connection information in each packet, with UDP, a firewall sees only the addresses and ports of the source and destination systems. If, for an incoming UDP packet, these match an NAT table entry, it will pass the packet on to an internal computer with a clear conscience.

Switching

The switching server, with which both ends of a call are in constant contact, plays an important role when establishing a connection using Skype. This occurs via a TCP connection, which the clients themselves establish. The Skype server therefore always knows under what address a Skype user is currently available on the internet. Where possible the actual telephone connections do not run via the Skype server; rather, the clients exchange data directly.

Let's assume that Alice wants to call her friend Bob. Her Skype client tells the Skype server that she wants to do so. The Skype server already knows a bit about Alice. From the incoming query it sees that Alice is currently registered at the IP address 1.1.1.1 and a quick test reveals that her audio data always comes from UDP port 1414. The Skype server passes this information on to Bob's Skype client, which, according to its database, is currently registered at the IP address 2.2.2.2 and which, by preference uses UDP port 2828.

Bob's Skype program then punches a hole in its own network firewall: It sends a UDP packet to 1.1.1.1 port 1414. This is discarded by Alice's firewall, but Bob's firewall doesn't know that. It now thinks that anything which comes from 1.1.1.1 port 1414 and is addressed to Bob's IP address 2.2.2.2 and port 2828 is legitimate - it must be the response to the query which has just been sent.

Now the Skype server passes Bob's coordinates on to Alice, whose Skype application attempts to contact Bob at 2.2.2.2:2828. Bob's firewall sees the recognised sender address and passes the apparent response on to Bob's PC - and his Skype phone rings.

Doing the rounds

This description is of course somewhat simplified - the details depend on the specific properties of the firewalls used. But it corresponds in principle to our observations of the process of establishing a connection between two Skype clients, each of which was behind a Linux firewall. The firewalls were configured with NAT for a LAN and permitted outgoing UDP traffic.

Linux' NAT functions have the VoIP friendly property of, at least initially, not changing the ports of outgoing packets. The NAT router merely replaces the private, local IP address with its own address - the UDP source port selected by Skype is retained. Only when multiple clients on the local network use the same source port does the NAT router stick its oar in and reset the port to a previously unused value. This is because each set of two IP addresses and ports must be able to be unambiguously assigned to a connection between two computers at all times. The router will subsequently have to reconstruct the internal IP address of the original sender from the response packet's destination port.

Other NAT routers will try to assign ports in a specific range, for example ports from 30,000 onwards, and translate UDP port 1414, if possible, to 31414. This is, of course, no problem for Skype - the procedure described above continues to work in a similar manner without limitations.

It becomes a little more complicated if a firewall simply assigns ports in sequence, like Check Point's FireWall-1: the first connection is assigned 30001, the next 30002, etc. The Skype server knows that Bob is talking to it from port 31234, but the connection to Alice will run via a different port. But even here Skype is able to outwit the firewall. It simply runs through the ports above 31234 in sequence, hoping at some point to stumble on the right one. But if this doesn't work first go, Skype doesn't give up. Bob's Skype opens a new connection to the Skype server, the source port of which is then used for a further sequence of probes.

Nevertheless, in very active networks Alice may not find the correct, open port. The same also applies for a particular type of firewall, which assigns every new connection to a random source port. The Skype server is then unable to tell Alice where to look for a suitable hole in Bob's firewall.

However, even then, Skype doesn't give up. In such cases a Skype server is then used as a relay. It accepts incoming connections from both Alice and Bob and relays the packets onwards. This solution is always possible, as long as the firewall permits outgoing UDP traffic. It involves, however, an additional load on the infrastructure, because all audio data has to run through Skype's servers. The extended packet transmission times can also result in an unpleasant delay.

Use of the procedure described above is not limited to Skype and is known as "UDP hole punching". Other network services such as the Hamachi gaming VPN application, which relies on peer-to-peer communication between computers behind firewalls, use similar procedures. A more developed form has even made it to the rank of a standard - RFC 3489 "Simple Traversal of UDP through NAT" (STUN) describes a protocol which with two STUN clients can get around the restrictions of NAT with the help of a STUN server in many cases. The draft Traversal Using Relay NAT (TURN) protocol describes a possible standard for relay servers.

DIY hole punching

With a few small utilities, you can try out UDP hole punching for yourself. The tools required, hping2 and netcat, can be found in most Linux distributions. Local is a computer behind a Linux firewall (local-fw) with a stateful firewall which only permits outgoing (UDP) connections. For simplicity, in our test the test computer remote was connected directly to the internet with no firewall.

Firstly start a UDP listener on UDP port 14141 on the local/1 console behind the firewall:

local/1# nc -u -l -p 14141

An external computer "remote" then attempts to contact it.

remote# echo "hello" | nc -p 53 -u local-fw 14141

However, as expected nothing is received on local/1 and, thanks to the firewall, nothing is returned to remote. Now on a second console, local/2, hping2, our universal tool for generating IP packets, punches a hole in the firewall:

local/2# hping2 -c 1 -2 -s 14141 -p 53 remote

As long as remote is behaving itself, it will send back a "port unreachable" response via ICMP - however this is of no consequence. On the second attempt

remote# echo "hello" | nc -p 53 -u local-fw 14141

the netcat listener on console local/1 then coughs up a "hello" - the UDP packet from outside has passed through the firewall and arrived at the computer behind it.

Network administrators who do not appreciate this sort of hole in their firewall and are worried about abuse, are left with only one option - they have to block outgoing UDP traffic, or limit it to essential individual cases. UDP is not required for normal internet communication anyway - the web, e-mail and suchlike all use TCP. Streaming protocols may, however, encounter problems, as they often use UDP because of the reduced overhead.

Astonishingly, hole punching also works with TCP. After an outgoing SYN packet the firewall / NAT router will forward incoming packets with suitable IP addresses and ports to the LAN even if they fail to confirm, or confirm the wrong sequence number (ACK). Linux firewalls at least, clearly fail to evaluate this information consistently. Establishing a TCP connection in this way is, however, not quite so simple, because Alice does not have the sequence number sent in Bob's first packet. The packet containing this information was discarded by her firewall.

HashCode推荐��法
《Effective Java�?br />1,int result = 17;
2,�Ҏ��个重要数据成�?Equals中用到的)�Q�计��int c:
boolean : c = f?0:1;
byte,int,char,short : c = (int)f
long c = (int)(f^(f>>>32));
float : c = Float.floatToIntBits(f);
double : long l = (int)(f^(f>>>32));c = (int)(l^(l>>>32));
其它reference : c = f.hashCode();
3,result = 37*result+c;

正则表达式语�?br />��遍了MSDN2002中关于正则表辑ּ�的文章，居然找不到正则表辑ּ�语法�Q�气��L��了�?br />贴过来。�{载自某�h的�{载的转蝲的�{�?...

　　正则表达�?regular expression)描述了一�U�字�W�串匚w��的模式，可以用来��查一个串是否含有某种子串、将匚w��的子串做替换或者从某个串中取出�W�合某个条�g的子串等�?br /> 　　列目录时�Q�　dir *.txt或ls *.txt中的*.txt��?ins>�?/ins>是一个正则表辑ּ�,因�ؓ�q�里*与正则式�?的含义是不同的�?

　　��Z��于理解和记忆�Q�先从一些概念入手，所有特�D�字�W�或字符�l�合有一个总表在后面，最后一些例子供理解相应的概��c�?/p>

正则表达�?/h3>
　　是由普通字�W�（例如字符 a �?z�Q�以及特�D�字�W�（�U�Cؓ元字�W�）�l�成的文字模式。正则表辑ּ�作�ؓ一个模板，��某个字�W�模式与所搜烦的字�W�串�q�行匚w��?br /> 　　可以通过在一对分隔符之间攑օ�表达式模式的各种�l��g来构造一个正则表辑ּ��Q�即/expression/

普通字�W?/h3>
　　由所有那些未昑ּ�指定为元字符的打印和非打印字�W�组成。这包括所有的大写和小写字母字�W�，所有数字，所有标点符号以及一些符受��?

非打印字�W?/h3>
字符含义
\cx 匚w��由x指明的控制字�W�。例如， \cM 匚w��一�?Control-M 或回车符。x 的值必��Mؓ A-Z �?a-z 之一。否则，��?c 视�ؓ一个原义的 'c' 字符�?/td>
\f 匚w��一个换��늬�。等价于 \x0c �?\cL�?/td>
\n 匚w��一个换行符。等价于 \x0a �?\cJ�?/td>
\r 匚w��一个回车符。等价于 \x0d �?\cM�?/td>
\s 匚w��M��I�白字符�Q�包括空根{��制表符、换��늬��{�等。等价于 [ \f\n\r\t\v]�?/td>
\S 匚w��M��非空白字�W�。等价于 [^ \f\n\r\t\v]�?/td>
\t 匚w��一个制表符。等价于 \x09 �?\cI�?/td>
\v 匚w��一个垂直制表符。等价于 \x0b �?\cK�?/td>

�Ҏ��字符

　　所谓特�D�字�W�，��是一些有�Ҏ��含义的字�W�，如上面说�?*.txt"中的*�Q�简单的说就是表�C�Z�Q何字�W�串的意思。如果要查找文�g名中有＊的文�Ӟ��则需要对�Q�进行�{义，卛_��其前加一个\。ls \*.txt。正则表辑ּ�有以下特�D�字�W��?br />

特别字符	说明
$	匚w��输入字符串的�l�尾位置。如果设�\|�了 RegExp 对象�?Multiline 属性，�?$ 也匹�?'\n' �?'\r'。要匚w�� $ 字符本��n�Q�请使用 \$�?/td>
( )	标记一个子表达式的开始和�l�束位置。子表达式可以获取供以后使用。要匚w��q�些字符�Q�请使用 $ �?$�?/td>
*	匚w��前面的子表达式零�ơ或多次。要匚w�� * 字符�Q�请使用 \*�?/td>
+	匚w��前面的子表达式一�ơ或多次。要匚w�� + 字符�Q�请使用 \+�?/td>
.	匚w��除换行符 \n之外的�Q何单字符。要匚w�� .�Q�请使用 \�?/td>
[	标记一个中括号表达式的开始。要匚w�� [�Q�请使用 \[�?/td>
?	匚w��前面的子表达式零�ơ或一�ơ，或指明一个非贪婪限定�W�。要匚w�� ? 字符�Q�请使用 \?�?/td>
\
^	匚w��输入字符串的开始位�\|�，除非在方括号表达式中使用�Q�此时它表示不接受该字符集合。要匚w�� ^ 字符本��n�Q�请使用 \^�?/td>
{	标记限定�W�表辑ּ�的开始。要匚w�� {�Q�请使用 \{�?/td>
\|	指明两项之间的一个选择。要匚w�� \|�Q�请使用 \\|�?/td>

　　构造正则表辑ּ�的方法和创徏数学表达式的�Ҏ��一栗��也��是用多�U�元字符与操作符��小的表辑ּ��l�合在一��h��创徏更大的表辑ּ�。正则表辑ּ�的组件可以是单个的字�W�、字�W�集合、字�W�范围、字�W�间的选择或者所有这些组件的��L��l�合�?/strong>

限定�W?/h3>
　　限定�W�用来指定正则表辑ּ�的一个给定组件必��要出现多少�ơ才能满��_��配。有�?�?或{n}或{n,}或{n,m}�?�U��?br /> �?�?限定�W�都是贪婪的�Q�因为它们会��可能多的匹配文字，只有在它们的后面加上一�?��可以实现非贪婪或最��匹配�?br /> 　　正则表达式的限定�W�有�Q?br />
字符描述
* 匚w��前面的子表达式零�ơ或多次。例如，zo* 能匹�?"z" 以及 "zoo"�? �{��h于{0,}�?/td>
+
?
{n} n 是一个非负整数。匹配确定的 n �ơ。例如，'o{2}' 不能匚w�� "Bob" 中的 'o'�Q�但是能匚w�� "food" 中的两个 o�?/td>
{n,} n 是一个非负整数。至��匹配n �ơ。例如，'o{2,}' 不能匚w�� "Bob" 中的 'o'�Q�但能匹�?"foooood" 中的所�?o�?o{1,}' �{��h�?'o+'�?o{0,}' 则等价于 'o'�?/td>
{n,m} m �?n 均�ؓ非负整数�Q�其中n <= m。最��匹�?n �ơ且最多匹�?m �ơ。例如，"o{1,3}" ��匹�?"fooooood" 中的前三�?o�?o{0,1}' �{��h�?'o?'。请注意在逗号和两个数之间不能有空根{�?/td>
定位�W?/h3>
　　用来描述字符串或单词的边界，^�?分别指字�W�串的开始与�l�束�Q�\b描述单词的前或后边界�Q�\B表示非单词边界�?ins>不能对定位符使用限定�W��?/ins>
选择

　　用圆括号��所有选择��Ҏ��h��Q�相�ȝ��选择��之间用|分隔。但用圆括号会有一个副作用�Q�是相关的匹配会被缓存，此时可用?:攑֜��W�一个选项前来消除�q�种副作用�?br /> 　　其中?:是非捕获元之一�Q�还有两个非捕获元是?=�?!�Q�这两个�q�有更多的含义，前者�ؓ正向预查�Q�在��M��开始匹配圆括号内的正则表达式模式的位置来匹配搜索字�W�串�Q�后者�ؓ负向预查�Q�在��M��开始不匚w��该正则表辑ּ�模式的位�|�来匚w��搜烦字符丌Ӏ?
后向引用

　　对一个正则表辑ּ�模式或部分模式两�Ҏ��加圆括号��导致相兛_��配存储到一个��时缓冲区中，所捕获的每个子匚w��都按照在正则表达式模式中从左臛_��所遇到�? 内容存储。存储子匚w��的缓冲区�~�号�?1 开始，�q�箋�~�号直至最�?99 个子表达式。每个缓冲区都可以��?'\n' 讉K��Q�其�?n ��Z��个标识特定缓冲区的一位或两位十进制数�?br /> 　　可以使用非捕获元字符 '?:', '?=', or '?!' 来忽略对相关匚w��的保存�?
各种操作�W�的�q�算优先�U?/h3>
　　相同优先�U�的从左到右�q�行�q�算�Q�不同优先��的运��先高后低。各�U�操作符的优先��从高��C��如下�Q?br />
操作�W? 描述
\ 转义�W?/td>
(), (?:), (?=), [] 圆括号和�Ҏ��?/td>
, +, ?, {n}, {n,}, {n,m} 限定�W?/td>
^, $, \anymetacharacter 位置和顺�?/td>
| “或”操�?/td>
全部�W�号解释

字符描述
\
^ 匚w��输入字符串的开始位�|�。如果设�|�了 RegExp 对象�?Multiline 属性，^ 也匹�?'\n' �?'\r' 之后的位�|��?/td>
$ 匚w��输入字符串的�l�束位置。如果设�|�了RegExp 对象�?Multiline 属性，$ 也匹�?'\n' �?'\r' 之前的位�|��?/td>
* 匚w��前面的子表达式零�ơ或多次。例如，zo* 能匹�?"z" 以及 "zoo"�? �{��h于{0,}�?/td>
+
?
{n} n 是一个非负整数。匹配确定的 n �ơ。例如，'o{2}' 不能匚w�� "Bob" 中的 'o'�Q�但是能匚w�� "food" 中的两个 o�?/td>
{n,} n 是一个非负整数。至��匹配n �ơ。例如，'o{2,}' 不能匚w�� "Bob" 中的 'o'�Q�但能匹�?"foooood" 中的所�?o�?o{1,}' �{��h�?'o+'�?o{0,}' 则等价于 'o'�?/td>
{n,m} m �?n 均�ؓ非负整数�Q�其中n <= m。最��匹�?n �ơ且最多匹�?m �ơ。例如，"o{1,3}" ��匹�?"fooooood" 中的前三�?o�?o{0,1}' �{��h�?'o?'。请注意在逗号和两个数之间不能有空根{�?/td>
? �? 该字�W�紧跟在��M��一个其他限制符 (, +, ?, {n}, {n,}, {n,m}) 后面�Ӟ��匚w��模式是非贪婪的。非贪婪模式��可能少的匹配所搜烦的字�W�串�Q�而默认的贪婪模式则尽可能多的匚w��所搜烦的字�W�串。例如，对于字符�? "oooo"�Q?o+?' ��匹配单�?"o"�Q��?'o+' ��匹配所�?'o'�?/td>
.
(pattern) 匚w�� pattern �q�获取这一匚w��。所获取的匹配可以从产生�?Matches 集合得到�Q�在VBScript 中��?SubMatches 集合�Q�在JScript 中则使用 $0�?9 属性。要匚w��圆括号字�W�，请��?'$' �?'$'�?/td>
(?:pattern) �? �?pattern 但不获取匚w��l�果�Q�也��是说这是一个非获取匚w��Q�不�q�行存储供以后��用。这在��?"�? 字符 (|) 来组合一个模式的各个部分是很有用。例如， 'industr(?:y|ies) ��是一个比 'industry|industries' 更简略的表达式�?/td>
(?=pattern) �? 向预查，在�Q何匹�?pattern 的字�W�串开始处匚w��查找字符丌Ӏ�这是一个非获取匚w��Q�也��是��_��该匹配不需要获取供以后使用。例如，'Windows (?=95|98|NT|2000)' 能匹�?"Windows 2000" 中的 "Windows" �Q�但不能匚w�� "Windows 3.1" 中的 "Windows"。预查不消耗字�W�，也就是说�Q�在一个匹配发生后�Q�在最后一�ơ匹配之后立卛_��始下一�ơ匹配的搜烦�Q�而不是从包含预查的字�W�之后开始�?/td>
(?!pattern) �? 向预查，在�Q何不匚w�� pattern 的字�W�串开始处匚w��查找字符丌Ӏ�这是一个非获取匚w��Q�也��是��_��该匹配不需要获取供以后使用。例�?Windows (?!95|98|NT|2000)' 能匹�?"Windows 3.1" 中的 "Windows"�Q�但不能匚w�� "Windows 2000" 中的 "Windows"。预查不消耗字�W�，也就是说�Q�在一个匹配发生后�Q�在最后一�ơ匹配之后立卛_��始下一�ơ匹配的搜烦�Q�而不是从包含预查的字�W�之后开�?/td>
x|y 匚w�� x �?y。例如，'z|food' 能匹�?"z" �?"food"�?(z|f)ood' 则匹�?"zood" �?"food"�?/td>
[xyz]
[^xyz]
[a-z]
[^a-z]
\b
\B
\cx 匚w��?x 指明的控制字�W�。例如， \cM 匚w��一�?Control-M 或回车符。x 的值必��Mؓ A-Z �?a-z 之一。否则，��?c 视�ؓ一个原义的 'c' 字符�?/td>
\d 匚w��一个数字字�W�。等价于 [0-9]�?/td>
\D 匚w��一个非数字字符。等价于 [^0-9]�?/td>
\f 匚w��一个换��늬�。等价于 \x0c �?\cL�?/td>
\n 匚w��一个换行符。等价于 \x0a �?\cJ�?/td>
\r 匚w��一个回车符。等价于 \x0d �?\cM�?/td>
\s 匚w��M��I�白字符�Q�包括空根{��制表符、换��늬��{�等。等价于 [ \f\n\r\t\v]�?/td>
\S 匚w��M��非空白字�W�。等价于 [^ \f\n\r\t\v]�?/td>
\t 匚w��一个制表符。等价于 \x09 �?\cI�?/td>
\v 匚w��一个垂直制表符。等价于 \x0b �?\cK�?/td>
\w
\W
\xn 匚w�� n�Q�其�?n 为十六进制�{义倹{��十六进制�{义值必��Mؓ��定的两个数字长。例如，'\x41' 匚w�� "A"�?\x041' 则等价于 '\x04' & "1"。正则表辑ּ�中可以��?ASCII �~�码�?
\num 匚w�� num�Q�其�?num 是一个正整数。对所获取的匹配的引用。例如，'(.)\1' 匚w��两个�q�箋的相同字�W��?/td>
\n 标识一个八�q�制转义值或一个向后引用。如�?\n 之前臛_�� n 个获取的子表辑ּ��Q�则 n 为向后引用。否则，如果 n 为八�q�制数字 (0-7)�Q�则 n ��Z��个八�q�制转义倹{�?/td>
\nm �? 识一个八�q�制转义值或一个向后引用。如�?\nm 之前臛_��?nm 个获得子表达式，�?nm 为向后引用。如�?\nm 之前臛_��?n 个获取，�?n ��Z��个后跟文�?m 的向后引用。如果前面的条�g都不满��Q�若 n �?m 均�ؓ八进制数�?(0-7)�Q�则 \nm ��匹配八�q�制转义�?nm�?/td>
\nml 如果 n 为八�q�制数字 (0-3)�Q�且 m �?l 均�ؓ八进制数�?(0-7)�Q�则匚w��八进制�{义�?nml�?/td>
\un 匚w�� n�Q�其�?n 是一个用四个十六�q�制数字表示�?Unicode 字符。例如， \u00A9 匚w��版权�W�号 (?)�?/td>
部分例子

正则表达�?/td> 说明
/\b([a-z]+) \1\b/gi 一个单词连�l�出现的位置
/(\w+):\/\/([^/:]+)(:\d)?([^# ])/ ��一个URL解析为协议、域、端口及相对路径
/^(?:Chapter|Section) [1-9][0-9]{0,1}$/ 定位章节的位�|?/td>
/[-a-z]/ A至z�?6个字母再加一�?受��?/td>
/ter\b/ 可匹配chapter�Q�而不能terminal
/\Bapt/ 可匹配chapter�Q�而不能aptitude
/Windows(?=95 |98 |NT )/ 可匹配Windows95或Windows98或WindowsNT,当找��C��个匹配后�Q�从Windows后面开始进行下一�ơ的��索匹配�?/td>

brent 2006-12-03 00:28 发表评论

字符	含义
\cx	匚w��由x指明的控制字�W�。例如， \cM 匚w��一�?Control-M 或回车符。x 的值必��Mؓ A-Z �?a-z 之一。否则，��?c 视�ؓ一个原义的 'c' 字符�?/td>
\f	匚w��一个换��늬�。等价于 \x0c �?\cL�?/td>
\n	匚w��一个换行符。等价于 \x0a �?\cJ�?/td>
\r	匚w��一个回车符。等价于 \x0d �?\cM�?/td>
\s	匚w��M��I�白字符�Q�包括空根{��制表符、换��늬��{�等。等价于 [ \f\n\r\t\v]�?/td>
\S	匚w��M��非空白字�W�。等价于 [^ \f\n\r\t\v]�?/td>
\t	匚w��一个制表符。等价于 \x09 �?\cI�?/td>
\v	匚w��一个垂直制表符。等价于 \x0b �?\cK�?/td>

字符	描述
*	匚w��前面的子表达式零�ơ或多次。例如，zo* 能匹�?"z" 以及 "zoo"�? �{��h于{0,}�?/td>
+
?
{n}	n 是一个非负整数。匹配确定的 n �ơ。例如，'o{2}' 不能匚w�� "Bob" 中的 'o'�Q�但是能匚w�� "food" 中的两个 o�?/td>
{n,}	n 是一个非负整数。至��匹配n �ơ。例如，'o{2,}' 不能匚w�� "Bob" 中的 'o'�Q�但能匹�?"foooood" 中的所�?o�?o{1,}' �{��h�?'o+'�?o{0,}' 则等价于 'o*'�?/td>
{n,m}	m �?n 均�ؓ非负整数�Q�其中n <= m。最��匹�?n �ơ且最多匹�?m �ơ。例如，"o{1,3}" ��匹�?"fooooood" 中的前三�?o�?o{0,1}' �{��h�?'o?'。请注意在逗号和两个数之间不能有空根{�?/td>

操作�W?	描述
\	转义�W?/td>
(), (?:), (?=), []	圆括号和�Ҏ��?/td>
*, +, ?, {n}, {n,}, {n,m}	限定�W?/td>
^, $, \anymetacharacter	位置和顺�?/td>
\|	“或”操�?/td>

字符	描述
\
^	匚w��输入字符串的开始位�\|�。如果设�\|�了 RegExp 对象�?Multiline 属性，^ 也匹�?'\n' �?'\r' 之后的位�\|��?/td>
$	匚w��输入字符串的�l�束位置。如果设�\|�了RegExp 对象�?Multiline 属性，$ 也匹�?'\n' �?'\r' 之前的位�\|��?/td>
*	匚w��前面的子表达式零�ơ或多次。例如，zo* 能匹�?"z" 以及 "zoo"�? �{��h于{0,}�?/td>
+
?
{n}	n 是一个非负整数。匹配确定的 n �ơ。例如，'o{2}' 不能匚w�� "Bob" 中的 'o'�Q�但是能匚w�� "food" 中的两个 o�?/td>
{n,}	n 是一个非负整数。至��匹配n �ơ。例如，'o{2,}' 不能匚w�� "Bob" 中的 'o'�Q�但能匹�?"foooood" 中的所�?o�?o{1,}' �{��h�?'o+'�?o{0,}' 则等价于 'o*'�?/td>
{n,m}	m �?n 均�ؓ非负整数�Q�其中n <= m。最��匹�?n �ơ且最多匹�?m �ơ。例如，"o{1,3}" ��匹�?"fooooood" 中的前三�?o�?o{0,1}' �{��h�?'o?'。请注意在逗号和两个数之间不能有空根{�?/td>
?	�? 该字�W�紧跟在��M��一个其他限制符 (*, +, ?, {n}, {n,}, {n,m}) 后面�Ӟ��匚w��模式是非贪婪的。非贪婪模式��可能少的匹配所搜烦的字�W�串�Q�而默认的贪婪模式则尽可能多的匚w��所搜烦的字�W�串。例如，对于字符�? "oooo"�Q?o+?' ��匹配单�?"o"�Q��?'o+' ��匹配所�?'o'�?/td>
.
(pattern)	匚w�� pattern �q�获取这一匚w��。所获取的匹配可以从产生�?Matches 集合得到�Q�在VBScript 中��?SubMatches 集合�Q�在JScript 中则使用 $0�?9 属性。要匚w��圆括号字�W�，请��?'\(' �?'\)'�?/td>
(?:pattern)	�? �?pattern 但不获取匚w��l�果�Q�也��是说这是一个非获取匚w��Q�不�q�行存储供以后��用。这在��?"�? 字符 (\|) 来组合一个模式的各个部分是很有用。例如， 'industr(?:y\|ies) ��是一个比 'industry\|industries' 更简略的表达式�?/td>
(?=pattern)	�? 向预查，在�Q何匹�?pattern 的字�W�串开始处匚w��查找字符丌Ӏ�这是一个非获取匚w��Q�也��是��_��该匹配不需要获取供以后使用。例如，'Windows (?=95\|98\|NT\|2000)' 能匹�?"Windows 2000" 中的 "Windows" �Q�但不能匚w�� "Windows 3.1" 中的 "Windows"。预查不消耗字�W�，也就是说�Q�在一个匹配发生后�Q�在最后一�ơ匹配之后立卛_��始下一�ơ匹配的搜烦�Q�而不是从包含预查的字�W�之后开始�?/td>
(?!pattern)	�? 向预查，在�Q何不匚w�� pattern 的字�W�串开始处匚w��查找字符丌Ӏ�这是一个非获取匚w��Q�也��是��_��该匹配不需要获取供以后使用。例�?Windows (?!95\|98\|NT\|2000)' 能匹�?"Windows 3.1" 中的 "Windows"�Q�但不能匚w�� "Windows 2000" 中的 "Windows"。预查不消耗字�W�，也就是说�Q�在一个匹配发生后�Q�在最后一�ơ匹配之后立卛_��始下一�ơ匹配的搜烦�Q�而不是从包含预查的字�W�之后开�?/td>
x\|y	匚w�� x �?y。例如，'z\|food' 能匹�?"z" �?"food"�?(z\|f)ood' 则匹�?"zood" �?"food"�?/td>
[xyz]
[^xyz]
[a-z]
[^a-z]
\b
\B
\cx	匚w��?x 指明的控制字�W�。例如， \cM 匚w��一�?Control-M 或回车符。x 的值必��Mؓ A-Z �?a-z 之一。否则，��?c 视�ؓ一个原义的 'c' 字符�?/td>
\d	匚w��一个数字字�W�。等价于 [0-9]�?/td>
\D	匚w��一个非数字字符。等价于 [^0-9]�?/td>
\f	匚w��一个换��늬�。等价于 \x0c �?\cL�?/td>
\n	匚w��一个换行符。等价于 \x0a �?\cJ�?/td>
\r	匚w��一个回车符。等价于 \x0d �?\cM�?/td>
\s	匚w��M��I�白字符�Q�包括空根{��制表符、换��늬��{�等。等价于 [ \f\n\r\t\v]�?/td>
\S	匚w��M��非空白字�W�。等价于 [^ \f\n\r\t\v]�?/td>
\t	匚w��一个制表符。等价于 \x09 �?\cI�?/td>
\v	匚w��一个垂直制表符。等价于 \x0b �?\cK�?/td>
\w
\W
\xn	匚w�� n�Q�其�?n 为十六进制�{义倹{��十六进制�{义值必��Mؓ��定的两个数字长。例如，'\x41' 匚w�� "A"�?\x041' 则等价于 '\x04' & "1"。正则表辑ּ�中可以��?ASCII �~�码�?
\num	匚w�� num�Q�其�?num 是一个正整数。对所获取的匹配的引用。例如，'(.)\1' 匚w��两个�q�箋的相同字�W��?/td>
\n	标识一个八�q�制转义值或一个向后引用。如�?\n 之前臛_�� n 个获取的子表辑ּ��Q�则 n 为向后引用。否则，如果 n 为八�q�制数字 (0-7)�Q�则 n ��Z��个八�q�制转义倹{�?/td>
\nm	�? 识一个八�q�制转义值或一个向后引用。如�?\nm 之前臛_��?nm 个获得子表达式，�?nm 为向后引用。如�?\nm 之前臛_��?n 个获取，�?n ��Z��个后跟文�?m 的向后引用。如果前面的条�g都不满��Q�若 n �?m 均�ؓ八进制数�?(0-7)�Q�则 \nm ��匹配八�q�制转义�?nm�?/td>
\nml	如果 n 为八�q�制数字 (0-3)�Q�且 m �?l 均�ؓ八进制数�?(0-7)�Q�则匚w��八进制�{义�?nml�?/td>
\un	匚w�� n�Q�其�?n 是一个用四个十六�q�制数字表示�?Unicode 字符。例如， \u00A9 匚w��版权�W�号 (?)�?/td>

正则表达�?/td>	说明
/\b([a-z]+) \1\b/gi	一个单词连�l�出现的位置
/(\w+):\/\/([^/:]+)(:\d)?([^# ])/	��一个URL解析为协议、域、端口及相对路径
/^(?:Chapter\|Section) [1-9][0-9]{0,1}$/	定位章节的位�\|?/td>
/[-a-z]/	A至z�?6个字母再加一�?受��?/td>
/ter\b/	可匹配chapter�Q�而不能terminal
/\Bapt/	可匹配chapter�Q�而不能aptitude
/Windows(?=95 \|98 \|NT )/	可匹配Windows95或Windows98或WindowsNT,当找��C��个匹配后�Q�从Windows后面开始进行下一�ơ的��索匹配�?/td>