*
* This program is a free software; you can redistribute it
* and/or modify it under the terms of the GNU General Public
- * License (version 3) as published by the FSF - Free Software
+ * License (version 2) as published by the FSF - Free Software
* Foundation
*/
{
if(str == NULL)
return(FALSE);
-
+
while(*str != '\0')
{
if(!_IsD(*str))
return(FALSE); /* 0 */
- str++;
+ str++;
}
return(TRUE);
/** int OS_StrHowClosedMatch(char *str1, char *str2) v0.1
* Returns the number of characters that both strings
- * have in similar.
+ * have in similar.
*/
int OS_StrHowClosedMatch(char *str1, char *str2)
{
int count = 0;
-
+
/* They don't match if any of them is null */
if(!str1 || !str2)
{
count++;
}while((str1[count] != '\0') && (str2[count] != '\0'));
-
+
return(count);
}
* Verifies if a string starts with the provided pattern.
* Returns 1 on success or 0 on failure.
*/
-#define startswith(x,y) (strncmp(x,y,strlen(y)) == 0?1:0)
-#define OS_StrStartsWith startswith
+#define startswith(x,y) (strncmp(x,y,strlen(y)) == 0?1:0)
+#define OS_StrStartsWith startswith
/* EOF */