Using system;
Namespace regexlib {
// /// Class1's summary description.
PUBLIC CLASS regexlib {
Public regexlib () {
// // TODO: Add constructor logic here
}
/ / Search input strings and return all href = "..." values
String Dumphrefs (String InputString) {
Regex R;
Match m;
R = New Regex ("HREF // S * = // s * (?: /" (? <1> [^ / "] *) /" | (? <1> // s )) ",
Regexoptions.ignorecase | RegexOptions.comPiled;
FOR (M = R.Match (InputString);
M.success; m = m.nextmatch ()) {
Return ("Found Href" M.Groups [1]);
}
}
// Verify the email address
Bool isvalidemail (String Strin) {
// Return True if Strin is in Valid E-mail format.
Return Regex.ismatch (Strin, @ "^ ([/ w - /.] ) @ (/ [[0-9] {1,3} /. [0-9] {1,3} /. 0-9] {1,3} /.) | ([/ W -] /.) )) ([A-ZA-Z] {2, 4} | [0-9] {1,3 }) (/]?) $ ");
}
// DD-MM-YY date is in place of the date form of MM / DD / YY.
String mDytodmy (string infut) {
Return Regex.replace (Input, "// b (?
// D {1, 2}) / (?
// D {1, 2}) / (?
// D {2,4} // b "" $ {day} - $ {month} - $ {year});
}
// Verify that it is a decimal
Bool isvaliddecimal (string strin) {
Return Regex.ismatch (Strin, @ "[0] ./ D {1, 2} | [1]");
}
/ / Verify that whether it is a phone number
Bool isvalidtel (String Strin) {
Return Regex.ismatch (Strin, @ "(/ D - -)? (/ d {4} -? / d {7} | / d {3} -? / d {8} | ^ / d {7,8} (- / d )? ");
}
// Verification Year and Moon
Bool isvaliddate (string strin) {
Return regex.ismatch (strin, @ "^ 2 / d {3} - (?: 0? [1-9] | 1 [0-2]) - (?: 0? [1-9] | [1- 2] / d | 3 [0-1]) (?: 0? [1-9] | 1 / d | 2 [0-3]) :( ?: 0? [1-9] | [1-5 ] / d) :( ?: 0? [1-9] | [1-5] / d) $ ");
}
// Verify the name of the suffix
Bool isvalidPostfix (String Strin) {
Return Regex.ismatch (STRIN, @ "/. (? i: gif | jpg) $");
}
// Verify that the character is between 4 and 12
Bool isvalidbyte (String Strin) {
Return Regex.ismatch (Strin, @ "^ [a-z] {4, 12} $");
}
// Verify IP
Bool isvalidip (String Strin) {
Return Regex.ismatch (Strin, @ "^ (/ d {1, 2} | 1 / d / d | 2 [0-4] / d | 25 [0-5]) /. (/ d {1, 2 } | 1 / d / d | 2 [0-4] / d | 25 [0-5]) /. (/ D {1, 2} | 1 / d / d | 2 [0-4] / d | 25 [0-5]) /. (/ D {1, 2} | 1 / d / d | 2 [0-4] / d | 25 [0-5]) $ ");}
}
}
Regular expression syntax selection from the BLOG of IE8
Here are some regular expressions that may be encountered: Visual Basic VBScript Match Scripting Edition / ^ / [/ T * $ / "^ / [/ t] * $" matches a blank line. // D {2} - / d {5} / "/ d {2} - / d {5}" verifies whether an ID number consists of a 2-bit word, a hyphen, and a 5-digit. /< (.*)>. (*)>. * "matches an HTML tag. The following table is a full list of metammatics and its behavior in the regular expression context: Character Description / Tags the next character as a special character, or a primary character, or a backward reference, or an octal escape symbol. For example, 'n' matches characters "n". '/ N' matches a newline. Sequence '//' match "/" "/ (" matches "(". ^ Match the input string of the start position. If the multiline property of the regexp object is set, ^ also matches '/ n' or '/ r' The next location. $ Match the end position of the input string. If the multiline property of the regexp object is set, $ also matches the position before '/ n' or '/ r'. * Match the previous sub-expression zero or multiple times For example, ZO * can match "Z" and "ZOO". * Equivalent {0,}. Match the previous sub-expression once or more. For example, 'ZO ' can match "ZO" and "ZOO" ", But do not match" Z ". Equivalent to {1,}. • Match the previous sub-expression zero or once. For example," Do (es) can match "do" or "does" "do". Is equivalent to {0,1}. {n} n is a non-negative integer. Match the N times. For example, 'o {2}' does not match 'O' in "Bob", but Match two O. {n,} n is a non-negative integer. For example, 'o {2,}' does not match "bob", but can match "at least N times. For example, 'o {2,}' does not match" Bob ". All O.'o {1,} 'in "fooood" is equivalent to' o 'o {0,}', equivalent to 'o *'. {n, m} m and n are non-negative Integer, where n <= m. Minimize n times and matched M times. Liu, "O {1, 3}" will match the top three O. 'o {0, 1}' in "foooood". Value 'o?'. Please note that there is no space between commas and two numbers? When this character is tight in any other restriction (*, ,?, {N}, {n,}, {n When M}), the matching mode is non-greedy. Non-greedy mode matches the search string as possible, and the default greed mode is as many as possible to match the search string. For example, for strings "OOOO", 'o ?' will match a single "O", and 'o ' will match all 'o'. Match any single character other than "/ n". To match the '/ n' Any character, please use the pattern of '[./n]'.
(Pattern) Match Pattern and get this match. The acquired matches can be obtained from the generated Matches, using the Submatches collection in VBScript, using $ 0 ... $ 9 properties in Visual Basic Scripting Edition. To match the bracket characters, use '/ (' or '/)'. (?: Pattern) Match Pattern but does not acquire matching results, that is, this is a non-acquired match, not for storage. This is useful to use the "or" character (|) to combine a pattern. For example, 'industr (?: Y | iES) is a smale of' Industry | Industries'. (? = Pattern) Positive to check, match the lookup string at any string of Pattern. This is a non-acquisition match, that is, the match does not need to be used later. For example, 'Windows (? = 95 | 98 | NT | 2000) can match "Windows" in "Windows 2000", but cannot match "Windows" in "Windows3 .1". The forecast does not consume characters, that is, after a match occurs, start the next matching search immediately after the last match, not starting from the character containing the pre-check. (?! Pattern) negotiation, match the lookup string at any string of any mismatch at any Point WHERE A STRING NOT MATCHING POINT WHERE A STRING NOT MATCHING PATTERN. This is a non-acquired match, that is, the match does not need to be used later. For example, 'Windows (?! 95 | 98 | NT | 2000) "can match" Windows "in Windows 3.1, but cannot match" Windows "in" Windows 2000 ". The forecast does not consume characters, that is, after a match occurs, immediately start the next matching search immediately after the last match, instead of the X | Y, the X | Y is matched after the queue containing the pre-examined character. For example, 'Z | Food' can match "z" or "food". '(Z | f) OOD' matches "Zood" or "Food". [XYZ] Character collection. Match any of the included characters. For example, '[abc]' can match 'a' in "Plain". [^ XYZ] Negative character set. Match any of the characters that are not included. For example, '[^ ABC]' can match 'P' in "Plain". [A-Z] character range. Match any of the characters within the specified range. For example, '[a-z]' can match any lowercase letters character in the 'A' to 'Z' range. [^ A-z] Negative character range. Match any of any characters that are not within the specified range. For example, '[^ a-z]' can match any of any characters that are not in the 'A' to 'Z'. / B Match a word boundary, that is, the location of the words and spaces.
