need a REGEX pattern to match

Question

0.00/5 (No votes)

See more:

need help with validating a 9-digit number.
CANNOT BE -----------
000000000
111111111
222222222
333333333
444444444
555555555
666666666
777777777
888888888
999999999

4-5 position(s) CANNOT BE 00 --
123001234

6-9 position(s) CANNOT BE 00 --
234550000

The nine numbers CANNOT BE sequential -- but only the following 4 four below, for the time being --
012345678
123456789
987654321
098765432

I had just managed to get the first piece done --
"^(?:(?!0+|1+|2+|3+|4+))\d{9}$"

Thanks a TON for the help friends.

Posted 17-Mar-11 10:07am

ssircar1971

Add a Solution

2 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

TheyCallMeMrJames · Answer 1 · 2011-03-17T10:41:00

Why bust your walnuts on a Regex when you can do this in a few lines of code that would arguably be better optimized and much easier to read?

For example:

C#

if (input.Substring(3, 2) == "00") digitsValid = false;
if (input.Substring(5, 4) == "0000") digitsValid = false;

You need that, a list for invalids, a list for valids and a sequential number check.

For your lists, you could use something like:

C#

List<string> alwaysValid = new List<string> { "012345678", "123456789", "987654321", "098765432" };

You will thank me when you come back in six months and have to modify it, and so will everyone else who would've had to otherwise maintain your code.

Regexes are beautiful but they are not swiss army knives. Whenever you have more than two validation requirements, you're probably best to explore another approach. For instance, Regex is good for your first requirement that you've solved. Great! Use it to prove that out and move on.

Cheers.

OriginalGriff · Answer 2 · 2011-03-17T10:42:00

I wouldn't use a regex for that, I'd use code.
You could do it with a regular expression, but it would be horribly complex, and very difficult to test and maintain.
The code would be a lot clearer:

Dim digits As String = "012325678"
If ValidString(digits) Then
	Console.WriteLine("OK")
Else
	Console.WriteLine("Invalid")
End If

Private Shared Function ValidString(digits As String) As Boolean
	If digits.Length = 9 Then
		If Not AllSameDigit(digits) Then
			If digits(3) <> "0"C AndAlso digits(4) <> "0"C Then
				If digits(5) <> "0"C AndAlso digits(6) <> "0"C AndAlso digits(7) <> "0"C AndAlso digits(8) <> "0"C Then
					If Not IsSequential(digits) Then
						Return True
					End If
				End If
			End If
		End If
	End If
	Return False
End Function
Private Shared Function IsSequential(digits As String) As Boolean
	Select Case digits
		Case "012345678", "123456789", "987654321", "098765432"
			Return True
	End Select
	Return False
End Function
Private Shared Function AllSameDigit(digits As String) As Boolean
	Dim previous As Char = digits(0)
	For Each c As Char In digits
		If c <> previous Then
			Return False
		End If
	Next
	Return True
End Function

Note that this is untested. But to go from "just these four" to a proper test is a simple mater of changing a single function.

need a REGEX pattern to match

2 solutions

Solution 1

Solution 2

Add your solution here

Preview 0