Alternative to using MatchCollections

[TheReckter]

The following method does not seem to work because MatchCollections are
read only, does anyone know another way I could accomplish a simillar
thing, this would be greatly appreciated, thankyou.

char[] RandSymbols = new char[] { '!', '@', '#', '$', '%', '^',
'&', '*', ':', ';' };

private void FuncRand()
{
Random R = new Random();
Regex RegSymbol = new Regex(@"\[s\]");
string main = Main.Text;
int[] Buff = new int[50];
int x = 0;
int i = 0;

switch (x)
{
case 0:
MatchCollection SymReg =
RegSymbol.Matches(main);
i = 0;
while (i < 50)
{
Buff[i] = R.Next(0, 10);
i++;
}
i = 0;
foreach (Match Match in SymReg)
{
Match.Value.Replace("[s]",
Buff[i].ToString());
i++;
}
textBox1.Text = main;
break;
}
i = 0;

x++;
}
}

[Marc Gravell]

If I understand the intent correctly, could you use (in a loop,
"Matches" times):
main = RegSymbol.Replace(main, Buff[i++].ToString(),1);

Not terribly efficient for long strings (multiple matches), but may
work.

Marc

[TheReckter]

Thankyou very much, exactly what I was looking for

[Kevin Spencer]

Use the Regex.Replace overload that takes a MatchEvaluator delegate to do
this (no loop necessary). See

http://msdn2.microsoft.com/en-us/library/cft8645c.aspx

--
HTH,

Kevin Spencer
Microsoft MVP
Computer Control Freak
http://unclechutney.blogspot.com

A man, a plan, a canal, a palindrome that has.. oh, never mind.

<Th********@gmail.comwrote in message
news:11**********************@h48g2000cwc.googlegr oups.com...

The following method does not seem to work because MatchCollections are
read only, does anyone know another way I could accomplish a simillar
thing, this would be greatly appreciated, thankyou.

char[] RandSymbols = new char[] { '!', '@', '#', '$', '%', '^',
'&', '*', ':', ';' };

private void FuncRand()
{
Random R = new Random();
Regex RegSymbol = new Regex(@"\[s\]");
string main = Main.Text;
int[] Buff = new int[50];
int x = 0;
int i = 0;

switch (x)
{
case 0:
MatchCollection SymReg =
RegSymbol.Matches(main);
i = 0;
while (i < 50)
{
Buff[i] = R.Next(0, 10);
i++;
}
i = 0;
foreach (Match Match in SymReg)
{
Match.Value.Replace("[s]",
Buff[i].ToString());
i++;
}
textBox1.Text = main;
break;
}
i = 0;

x++;
}
}

[Marc Gravell]

Cheers Kevin; something new every day ;-p

Marc

[Kevin Spencer]

Same here, Marc!

--
:-D

Kevin Spencer
Microsoft MVP
Computer Control Freak
http://unclechutney.blogspot.com

A man, a plan, a canal, a palindrome that has.. oh, never mind.

"Marc Gravell" <ma**********@gmail.comwrote in message
news:11**********************@b28g2000cwb.googlegr oups.com...

Cheers Kevin; something new every day ;-p

Marc