Is there a function I can use that will find the variation of a determined word with any combination uppercase/ lowercase letters?
eg: If I look for the word "rat" i also want to find the variations: RAT, Rat, RAt, raT, RaT and rAt
I am currently using strstr but it only returns TRUE when the word found is in the exact same format as the word it's looking for.
before you strcmp() the words, run them all through tolower()
yup that works... thanks=)
How's it going to work when one of the strings is a string constant, which isn't writable? What if you don't want to ruin the string by changing its case?Originally Posted by doia
Code://try //{ if (a) do { f( b); } while(1); else do { f(!b); } while(1); //}
You may have stricmp().
@brewbuck: fortunately my strings are not constant
@nonoob: YES I do, exactly what I wanted! merci
now only one more thing for my code. I also want to find abbreviations:
for example if I look for "Vertical Stability" I want to find all instances of "vert. stability","vert stab", "vertical stblity". I guess it'd be something like: if a certain percentage of the letters match then I want it to return true, I really have no idea how to implement that. any help is appreciated!
Last edited by doia; 07-15-2010 at 03:41 PM.
I bet brewbuck intended his statement "just in case" and "for future extending". You may simply convert the string to lower case and it may work for now, but it may not work in tthe future. Stricmp would. But I advise you to write on yourself first...
In my opinion, you should only use functions that you can write yourself, so you understand them thoroughly. (Okay, honestly, I couldn't write printf because I don't know all details of format strings, but I know enough to write them to support anything I ever use in it).
Then you'll have to write your own "stricmp" function... starting after every space to compare the word with your library of words... but counting how many letters match. Then picking the best match.
Could copy them into a temp variable before you compare.
It doesn't matter if they're constant or not. You can still run tolower on them as you compare each letter.Quzah.Code:while( *s1 && *s2 && tolower( *s1++ ) == tolower( *s2++ ) );
Hope is the first step on the road to disappointment.
