Matching regular expressions for Chinese characters: [\U4E00-\U9FA5]
Match Double-byte characters (including Chinese characters): [^\x00-\xff]
A regular expression that matches a blank row: \n[\s|] *\r
Regular expression matching HTML tags:/< (. *) >.*<\/\1>|< (. *) \/>/
Matching a regular expression with a trailing space: (^\s*) | (\s*$)
Regular expression matching an email address: \w+ ([-+.] \w+) *@\w+ ([-.] \w+) *\.\w+ ([-.] \w+) *
A regular expression that matches URL URLs: ^[a-za-z]+://(\\w+ (-\\w+) *) (\ \\w+ (-\\w+) *)) * (\\?\\s*)? $
Match account number is legal (beginning of letter, allow 5-16 bytes, allow alphanumeric underline): ^[a-za-z][a-za-z0-9_]{4,15}$
Match domestic phone number: (\d{3}-|\d{4}-)? (\d{8}|\d{7})?
Matching Tencent QQ Number: ^[1-9]*[1-9][0-9]*$
The following table is a complete list of metacharacters and its behavior in the context of regular expressions:
\ marks the next character as a special character, or a literal character, or a back reference, or a octal escape character.
^ matches the start position of the input string. If the multiline property of the RegExp object is set, ^ also matches the position after ' \ n ' or ' \ R '.
$ matches the end position of the input string. If the multiline property of the RegExp object is set, the $ also matches the position before ' \ n ' or ' \ R '.
* Match the preceding subexpression 0 or more times.
+ matches the preceding subexpression one or more times. + is equivalent to {1,}.
? Match the preceding subexpression 0 times or once.? is equivalent to {0,1}.
{n} n is a non-negative integer that matches the determined N times.
{N,} n is a non-negative integer that matches at least n times.
{n,m} m and n are non-negative integers, where n <= m. Matches n times at least and matches up to M times. You cannot have spaces between commas and two numbers.
? When the character is immediately following any of the other qualifiers (*, +,?, {n}, {n,}, {n,m}), the matching pattern is not greedy. Non-greedy patterns match as few strings as possible, while the default greedy pattern matches as many of the searched strings as possible.
. Matches any single character except "\ n". To match any character including ' \ n ', use a pattern like ' [. \ n] '.
(pattern) matches the pattern and gets the match.
(?:p Attern) matches pattern but does not get matching results, which means that this is a non fetch match and is not stored for later use.
(? =pattern) forward lookup, matching the find string at the beginning of any string matching pattern. This is a non-fetch match, that is, the match does not need to be acquired for later use.
(?! pattern) Negative forward check, contrary to (? =pattern) Effect
X|y matches x or Y.
[XYZ] Character set combination.
[^XYZ] Negative character set combination.
[A-z] character range that matches any character within the specified range.
[^a-z] A negative character range that matches any character that is not in the specified range.
\b Matches a word boundary, which refers to the position between the word and the space.
\b Matches a non word boundary.
\CX matches the control characters indicated by X.
\d matches a numeric character. equivalent to [0-9].
\d matches a non-numeric character. equivalent to [^0-9].
\f matches a page feed character. Equivalent to \x0c and \CL.
\ n matches a newline character. Equivalent to \x0a and \CJ.
\ r matches a carriage return character. Equivalent to \x0d and \cm.
\s matches any white space character, including spaces, tabs, page breaks, and so on. equivalent to [\f\n\r\t\v].
\s matches any non-white-space character. equivalent to [^ \f\n\r\t\v].
\ t matches a tab character. Equivalent to \x09 and \ci.
\v matches a vertical tab. Equivalent to \x0b and \ck.
\w matches any word character that includes an underscore. Equivalent to ' [a-za-z0-9_] '.
\w matches any non word character. Equivalent to ' [^a-za-z0-9_] '.
\XN matches N, where n is the hexadecimal escape value. The hexadecimal escape value must be a determined two digits long.
\num matches num, where num is a positive integer. A reference to the match that was obtained.
\ n identifies a octal escape value or a back reference. N is a back reference if you have at least N obtained subexpression before. Otherwise, if n is an octal number (0-7), then N is an octal escape value.
\NM identifies a octal escape value or a back reference. NM is a \nm if at least one of the preceded by the at least NM gets the subexpression before the If there are at least N fetches before \nm, then N is a back reference followed by a literal m. If all the preceding conditions are not satisfied, if both N and M are octal digits (0-7), then \nm will match octal escape value nm.
\NML if n is an octal number (0-3) and both M and L are octal digits (0-7), then the octal escape value NML is matched.
\un matches N, where N is a Unicode character represented in four hexadecimal digits.
Matching regular expressions for Chinese characters: [U4E00-U9FA5]
Match Double-byte characters (including Chinese characters): [^x00-xff]
Application: Computes the length of the string (a double-byte character length meter 2,ascii character 1)
To decompose and transform an IP address using a regular expression:
The following is a JavaScript program that uses a regular expression to match an IP address and converts an IP address to a corresponding numeric value:
function IP2V (IP)
{
re=/(d+). (d+). (d+). (d+)/g//matching the regular expression of the IP address
if (Re.test (IP))
{
Return Regexp.$1*math.pow (255,3)) +regexp.$2*math.pow (255,2)) +regexp.$3*255+regexp.$4*1
}
Else
{
throw new Error ("not a valid IP address!")
}
}
However, if the above program does not use a regular expression, and the split function directly to decompose may be simpler, the program is as follows:
var ip= "10.100.20.168"
Ip=ip.split (".")
Alert ("IP value is:" + (IP[0]*255*255*255+IP[1]*255*255+IP[2]*255+IP[3]*1))
A regular expression that matches URL URLs: http://([w-]+.) +[w-]+ (/[w-/?%&=]*)?
An algorithmic program that uses regular expressions to remove repetitive characters from a string:
var s= "Abacabefgeeii"
var s1=s.replace (/(.). *1/g, "$")
var re=new RegExp ("[" +s1+ "]", "G")
var s2=s.replace (Re, "")
Alert (S1+S2)//Result: ABCEFGI
I used to post on the csdn to find an expression to achieve the elimination of repeated characters, and ultimately did not find, this is the simplest way I can think of implementation. The idea is to use a back reference to take out the characters that contain duplicates, and then to create a second expression with a repeating character, with a concatenation of the characters that are not repeated. This method may not apply to strings that are required for character order.
You have to use regular expressions to extract the filename from the URL address of the JavaScript program, the following result is Page1
Use regular expressions to restrict the entry of text boxes in a Web page's form:
Only Chinese can be entered with regular expression restrictions: onkeyup= "This.value=this.value.replace" (/["^u4e00-u9fa5]/g," "onbeforepaste=") Clipboarddata.setdata (' Text ', Clipboarddata.getdata (' text '). Replace (/[^u4e00-u9fa5]/g, ') "
Only full-width characters can be entered with regular expression restrictions: onkeyup= "This.value=this.value.replace" (/["^uff00-uffff]/g," "onbeforepaste=") Clipboarddata.setdata (' Text ', Clipboarddata.getdata (' text '). Replace (/[^uff00-uffff]/g, ') "
Only numbers can be entered with regular expression restrictions: onkeyup= "This.value=this.value.replace" (/["^d]/g," "Onbeforepaste=" clipboarddata.setdata (' text ') , Clipboarddata.getdata (' text '). Replace (/[^d]/g, ') "
Only numbers and English can be entered with regular expression restrictions: onkeyup= "This.value=this.value.replace (/[w]/g," "") "onbeforepaste=" Clipboarddata.setdata (' Text ', Clipboarddata.getdata (' text '). Replace (/[^d]/g, ') "
The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion;
products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the
content of the page makes you feel confusing, please write us an email, we will handle the problem
within 5 days after receiving your email.
If you find any instances of plagiarism from the community, please send an email to:
info-contact@alibabacloud.com
and provide relevant evidence. A staff member will contact you within 5 working days.