regex

[ohmmega]

hy,

i've got a simple question (for somebody who already knows the answer)
about regex:
i've a string like bla@bla@bla or bla@@bla
i like to check the @'s, but couldn't figure it out how to set zero or
more char's. (zero or one was easy).

thank's
rené

[Nicholas Paldino [.NET/C# MVP]]

rene,

Are you sure that a regular expression is the best option here? Why not
just call the Split method, passing the '@' character as the delimiter?
--
- Nicholas Paldino [.NET/C# MVP]
- mv*@spam.guard. caspershouse.co m

"ohmmega" <sh****@gmx.atw rote in message
news:11******** **************@ b79g2000hse.goo glegroups.com.. .
hy,

i've got a simple question (for somebody who already knows the answer)
about regex:
i've a string like bla@bla@bla or bla@@bla
i like to check the @'s, but couldn't figure it out how to set zero or
more char's. (zero or one was easy).

thank's
rené

[Jesse Houwing]

Hello ohmmega,

hy,

i've got a simple question (for somebody who already knows the answer)
about regex:
i've a string like bla@bla@bla or bla@@bla
i like to check the @'s, but couldn't figure it out how to set zero or
more char's. (zero or one was easy).
thank's
rené

What do you mean by 'I like to check the @'s'

Going from the fact that the rest of that sentence continues about soemthing
that sounds like a quantifier here's a short overview of the different quantifiers
available:
- ? - Zero or One
- * - Zero or More
- + - One or more
- {0,n} - Zero to n
- {n,} - n or more
- {n,m} - n to m

Take your pick ;)

Other than this being a question about regular expressions, you've not explained
what you wan to do with the end result. Regex is a pretty expensive tool
to use in terms of cpu power and in some scenario's memory consumption. Are
you sure it's the tool for the job? If you could explain a little about what
you're trying to achieve, we could potentially help you with a better solution.

Jesse

[Ignacio Machin \( .NET/ C# MVP \)]

Hi,

I'm not sure what you mean with "check", what do you want to do when you
find a @ ?

"ohmmega" <sh****@gmx.atw rote in message
news:11******** **************@ b79g2000hse.goo glegroups.com.. .
hy,

i've got a simple question (for somebody who already knows the answer)
about regex:
i've a string like bla@bla@bla or bla@@bla
i like to check the @'s, but couldn't figure it out how to set zero or
more char's. (zero or one was easy).

thank's
rené

[ajk]

On Mon, 06 Aug 2007 13:49:32 -0000, ohmmega <sh****@gmx.atw rote:

>hy,

i've got a simple question (for somebody who already knows the answer)
about regex:
i've a string like bla@bla@bla or bla@@bla
i like to check the @'s, but couldn't figure it out how to set zero or
more char's. (zero or one was easy).

thank's
rené

this may help

http://sourceforge.net/projects/regulator/

[ohmmega]

i need to know if there are exactly 5 @'s with or without text in
beetween.
i thought compiled regex would be faster than splitting and .length.
nethertheless, if you guy's say "OH NO!!!", i've no reason to demand
on it.

[Jon Skeet [C# MVP]]

On Aug 7, 9:23 am, ohmmega <[e-mail] rote:

i need to know if there are exactly 5 @'s with or without text in
beetween.
i thought compiled regex would be faster than splitting and .length.
nethertheless, if you guy's say "OH NO!!!", i've no reason to demand
on it.

How much do you care about performance in this case? How often are you
likely to call this? Have you measured the performance of Split and
found that it doesn't meet your requirements?

Jon

[ohmmega]

On 7 Aug., 11:00, "Jon Skeet [C# MVP]" <[e-mail] mwrote:

On Aug 7, 9:23 am, ohmmega <[e-mail] rote:

i need to know if there are exactly 5 @'s with or without text in
beetween.
i thought compiled regex would be faster than splitting and .length.
nethertheless, if you guy's say "OH NO!!!", i've no reason to demand
on it.

How much do you care about performance in this case? How often are you
likely to call this? Have you measured the performance of Split and
found that it doesn't meet your requirements?

Jon

i need this about 200 times in a time critical application, so i just
want to have the best option.
i've not measured the time yet, but that's a good point - i will try
this next.

thanks so far
rené

[Jesse Houwing]

Hello ohmmega,

On 7 Aug., 11:00, "Jon Skeet [C# MVP]" <[e-mail] mwrote:

>On Aug 7, 9:23 am, ohmmega <[e-mail] rote:

>>i need to know if there are exactly 5 @'s with or without text in
beetween.
i thought compiled regex would be faster than splitting and .length.
nethertheless , if you guy's say "OH NO!!!", i've no reason to demand
on it.

How much do you care about performance in this case? How often are
you likely to call this? Have you measured the performance of Split
and found that it doesn't meet your requirements?

Jon

i need this about 200 times in a time critical application, so i just
want to have the best option.
i've not measured the time yet, but that's a good point - i will try
this next.
thanks so far
rené

If you still want to go the regex way, you basically have two options:

See if you can find a match for this:
^[^@]*(@[^@]*){5}$

Or do a Regex.Replace and replace everything that't not a @ with nothing
and measure the length of the text afterwards:

Regex.Replace(i nputstring, "[^@]", "").Length 5

When using a regular expression, make sure you're usign a static instance
with the option RegexOption.Com piled set for performance reasons.

Like this

private static Regex rx = new Regex(pattern, RegexOptions.Co mpiled);

then reference this instance when using the expression.

Also add a static constructor to the class which calls rx.Match("");, that
way your performance needy code will not suffer the recompilation of the
regex.
You can also use a tool like The Regulator to generate an Assembly with the
compiled regex in there. This would give you the performance boost of not
having the regex compiled from the executable at all.

Even though this is a nice excercise in Regular expressions, I think that
simple string manupulations would be much faster...

public bool HasFiveAts(stri ng input)
{
int count = 0;
foreach(char c in inputstring)
{
if (c == '@') { count++; }
// might even test for if (count 5) {return false;}, but you'd have
to test that for performance
}
return count == 5
}

[Kevin Spencer]

A string is an array of char. I believe the fastedst way would be to loop
through the chars in the string, and count the '@' chars. Once you reach 5,
you return true. If you reach the end of the string without reaching 5, you
return false.

--
HTH,

Kevin Spencer
Microsoft MVP

Printing Components, Email Components,
FTP Client Classes, Enhanced Data Controls, much more.
DSI PrintManager, Miradyne Component Libraries:
http://www.miradyne.net

"ohmmega" <sh****@gmx.atw rote in message
news:11******** **************@ r34g2000hsd.goo glegroups.com.. .

i need to know if there are exactly 5 @'s with or without text in
beetween.
i thought compiled regex would be faster than splitting and .length.
nethertheless, if you guy's say "OH NO!!!", i've no reason to demand
on it.