>>My point was that in C# since there is no way to do a case insensitive search you have to do in effect three searches (yes, I realize there would be other possible combinations of upper and lower but these are in fact the three most likely )
>
>There is actually. But you'll need to write a method that uses String.IndexOf() in a loop
http://msdn.microsoft.com/en-us/library/ms224424.aspx>You can pass an offset where the search starts in the string and StringComparison
>
Sorry, I'm being a little thick. I'm looking at the link and I see how IndexOf finds the first occurrence of a string but beyond that I'm not getting how it finds a string wtihout regard to case?? and even moreso, how it counts the number of occurrences in that larger string ?
Could you point to and example of the kind of method you are talking about ?
TIA
>
>>You were saying that in VFP the case insensitive search would take longer than the case sensitive search which is true. But to get the same outcome, one needs to do as I did in C# - search three times ( sensitively ). So, while each pass may be faster than the one insensitive pass, the cumulative time is still greater. No?
Charles Hankey
Though a good deal is too strange to be believed, nothing is too strange to have happened.
- Thomas Hardy
Half the harm that is done in this world is due to people who want to feel important. They don't mean to do harm-- but the harm does not interest them. Or they do not see it, or they justify it because they are absorbed in the endless struggle to think well of themselves.
-- T. S. Eliot
Democracy is two wolves and a sheep voting on what to have for lunch.
Liberty is a well-armed sheep contesting the vote.
- Ben Franklin
Pardon him, Theodotus. He is a barbarian, and thinks that the customs of his tribe and island are the laws of nature.
