Hi,
I'm getting into a tangle with Regex in C#.

If I had an expression like abc[1].def[2].ghi[3] etc.

How do I count how many instances there are of "[ ]" and "."

Thanks a lot!

TH

(E-Mail Removed) wrote:

> If I had an expression like abc[1].def[2].ghi[3] etc.
>
> How do I count how many instances there are of "[ ]" and "."

Use the regex @" \[ \s* \d+ \s* \] " with the IgnorePatternWhitespace
option; call Matches; and read the Count property.

--

..NET 2.0 for Delphi Programmers
www.midnightbeach.com/.net

Jon Shemitz wrote:
> (E-Mail Removed) wrote:
>
> > If I had an expression like abc[1].def[2].ghi[3] etc.
> >
> > How do I count how many instances there are of "[ ]" and "."
>
> Use the regex @" \[ \s* \d+ \s* \] " with the IgnorePatternWhitespace
> option; call Matches; and read the Count property.
>
> --
>
> .NET 2.0 for Delphi Programmers
> www.midnightbeach.com/.net

Could I do it like this?

// Assume Key is of the form a.b.c.d.e.f

Match n = Regex.Match( key, @"\." );

int noOfMatches = n.Count;

(E-Mail Removed) wrote:

> Could I do it like this?
>
> // Assume Key is of the form a.b.c.d.e.f
>
> Match n = Regex.Match( key, @"\." );
>
> int noOfMatches = n.Count;

Not quite - the Match object represents a single match, and doesn't
have a Count property. You want the Matches method, not the Match
method:

int NumberOfDots = Regex.Matches(Key, @"\.").Count;

--

..NET 2.0 for Delphi Programmers
www.midnightbeach.com/.net