>>>Ok, instead of
>>>
>>> n = Occurs(....)
>>> for I = 1 to n
>>> xx = At(...., I)
>>> end
>>>
>>>
>>>Consider writing an overload of Occurs which returns a List< int > with all the indexes where there's a match. That way you wouldn't need At() any more
>>
>>Thanks
>
>
>Even better with an Enumerator - and ignoreCase if needed
>
>
> public static class StringMethods
> {
> public static IEnumerable<int> EnumAt(string searchIn, string searchFor, int startIndex, StringComparison comparison)
> {
> int offset = startIndex;
>
> while ((offset = searchIn.IndexOf(searchFor, offset, comparison)) != -1)
> {
> yield return offset;
> offset += searchFor.Length;
> }
> }
> }
>>
>sample
>
>
> public static class MyClass
> {
> static string htmlSample = @"
> <!DOCTYPE html>
>
> <html lang=""en-GB"">
> <head>
> <meta charset=""utf-8"">
> <title>Example of an inline image</title>
> </head>
> <body>
> <imG src=""balconyview.jpg"">
> <Img Src = 'balconyview.jpg' alt='View from my balcony, showing a row of houses, trees and a castle'>
> <iMg src='http://example.com/brokenlink/sunset.gif' alt='Beautiful Sunset' />
>
> </body>
> </html>
> ";
>
> public static void Main()
> {
> foreach (int index in StringMethods.EnumAt(htmlSample, "<img", 0, StringComparison.InvariantCultureIgnoreCase))
> {
> Console.WriteLine("{0} {1}", index, htmlSample.Substring(index, 4));
> }
> Console.ReadLine();
> }
> }
>Very neat !!
