Question on regular expressions

[Logan 2]

Hello,
I try to use a regular expression to check a name entered in a JTextArea. I would allow only the letters of the alphabet (uppercase and lowercase, with or without accents), numbers and a few more characters (space "" dashes "-" and "_" and dot "."). The problem is that I will not understand much about regular expressions. Here is my code

try
{
	if(! name.equals(""))
	{
		Matcher mt;
Pattern pat = Pattern.compiles("[0-9A-Za-z_ (1)]);
= pat mt.mt(name);
System.out.System.out.println(mt.group());
		if(mt.GroupCount() != 1)
			ok = false;
	}
	else
		ok = false;
}
catch(Exception e)
{
	System.out.System.out.println(e);
}

[NetworkeR]

Hello,
The regular expression that you should use is:

[0-9a-zA-Z _. --]

To test match, you can simply use:

String s = "test" ;
Boolean ok = string.games("[0-9a-zA-Z _.-]") ;

If you need more information on this you can visit the official site of sun , there you can find the api on java.

[Logan 2]

Hello,
Thank you for the answer, but it does not work completely, unfortunately. In fact it works for a string of one character, and there it is exactly what I want, except for the accents who do not.
So there are two possibilities:
- Either workaround and looping over the length of the word test, and do the same test as there are character (solution quite reasonable given that my application is a personal work)
- Whether there is an expression more complicated words, which manages more than one letter
If you have answers for this then please let me know.

[SoftWore]

Hello,
You can use the following expression for a number of characters

^[0-9\ \ p{L} _.-]*$

Or you can use this

^[0-9\ \ p{L} _.-]+$

to have at least one character

^[0-9\ \ p{L} _.-]{n, m}$

Hope you will use the above in the code and try to run the program.

[HardWeaR]

Hello,
Just have a look at the following code

import java.util.regex.Matcher;
import java.util.regex.Pattern;
 
Public class Test {
	Public static void hand(String args[]) {
		try {
			String str ="testing";
			boolean k =false;
			if (! str.equals("")) {
				Matcher matcher;
Pattern pat = Pattern.compiles("^[\\p (L) 0-9_ .-]*$");
= pat matcher.matcher(str);
System.out.System.out.println("k ="+ matcher.find());
				/ * System.out.println (matcher.group ());
if (matcher.groupCount ()! = 1)
k = false * /
			} else
				k = false;
		} catch (Exception e) {
			System.out.System.out.println(e);
		}
	}
}

[NetworkeR]

Hello,
I am new to this concept in java, but still I have some part of code for you. I do not know that this is what you what, still have a look at it and if it is useful to you then you can use it.

StringBuffer strbuf = new StringBuffer();
mat = myPattern.matcher("subject");
while (mat.find()) {
  if (checkIfThisMatchShouldBeReplaced()) {
    mat.appendReplacement(strbuf, computeReplacementString());
  }
}
mat.appendTail(strbuf);