Validating a phone number

Print pagePDF pageEmail page

Take few business cards or perhaps advertisements and see how they have shown the phone number. Here are some variants.

+94-11-2906788
+(94)11.2.906788
94-11-2-906788
94112906788
011-2906788
011-2-906788
00112906788
000000112906788

Now, say you have an application that is expecting a ‘proper’ phone number; may be to send a text message automatically or something. Do you see the problem? Users type the number using all kinds of formats, even when you give instructions, it is up to the programmer to clean the number. Let’s see how we do this with some javascript magic.

The process

A proper phone number has 10 digits; and the first digit must not be a zero.

Let’s get our hands dirty, we know that the phone number can have ONLY numbers. So the first step is to remove all non digit items. Once we do that we take the last 10 digits. Now all we need to do is to check the first digit for zero. Here’s the simplified logic diagram.

logic-phoneNumberValidation

Code

A regular expression (RegEx) is really just a sequence or pattern of characters that is matched against a string of text when performing searches and replacements. A simple regular expression consists of a character or set of characters that matches itself. The regular expression is normally delimited by forward slashes; for example, /abc/.

Like Perl, JavaScript provides a large variety of regular expression metacharacters to control the way a pattern is found. The metacharacters are used to control the search pattern; you can look for strings containing only digits, only alphas, a digit at the beginning of the line followed by any number of alphas, a line ending with a digit, and so on. When searching for a pattern of characters, the possibilities of fine-tuning your search are endless.

I decided to use the power of the string object with RegEx. The replace() method from the string object is used to search for a string and replace the string with another string. First we need to create the pattern to match. So the line

Creates a variable named ‘regex1’. [^0–9], matches a non-digit (same as \D), ‘^’ means, negate, ie: NOT in set. The ‘I’ modifier is used to turn off case sensitivity and the ‘g’ modifier makes the replacement global; that is, all occurrences of the found pattern are replaced with the new string.

Executes the replace method of the string object. What we are saying is to look for the pattern from regex1 and replace them with nothing, or essentially remove them!

Now we need to get the last 10 digits. In order to do that, first we need to find the length of the string. We do this in two steps:

Conclusion

Although I used Javascript here, it will not be difficult to port this code to any other language. Just step through the algorithm and you will be fine.

Downloads

HTML with javascript source code

You can test the code here.

Share

Leave a Reply

Your email address will not be published. Required fields are marked *