>>

>> /// <summary>
>>      /// Occurs function
>>      /// </summary>
>>      /// <param name="source"></param>
>>      /// <param name="pattern"></param>
>>      /// <returns></returns>
>>      public static Int32 Occurs(this String source, char pattern)
>>      {
>>         return source.Split(pattern).Length - 1;
>>      }
>>
>>      public static Int32 Occurs(this String source, String pattern)
>>      {
>>         return (source.Length - source.Replace(pattern, "").Length)/pattern.Length;
>>      }

From the link you provided this was supposed to be fasted for char matching:

int length = testchars.Length;
>for (int n = length-1; n >= 0; n--)
>{
>    if (testchars[n] == '/')
>        count++;
>}

Right, but I think the conclusion is that the speed difference is negligible unless running in a loop. I don't plan (for now) to run it in a loop.