@@ -77,8 +77,8 @@ void run_search(char *needle){

 	choices_available = 0;

 	int i;

 	for(i = 0; i < choices_n; i++){

-		choices_score[i] = match(needle, choices[i]);

-		if(choices_score[i] >= 0.0){

+		if(has_match(needle, choices[i])){

+			choices_score[i] = match(needle, choices[i]);

 			choices_sorted[choices_available++] = i;

 		}

 	}

@@ -1,6 +1,7 @@

 #ifndef FZY_H

 #define FZY_H FZY_H

+int has_match(const char *needle, const char *haystack);

 double match_positions(const char *needle, const char *haystack, size_t *positions);

 double match(const char *needle, const char *haystack);

@@ -7,7 +7,7 @@

 #define SCORE_MIN -1

-static int is_subset(const char *needle, const char *haystack){

+int has_match(const char *needle, const char *haystack){

 	while(*needle){

 		if(!*haystack)

 			return 0;

@@ -115,7 +115,7 @@ double calculate_score(const char *needle, const char *haystack, size_t *positio

 double match_positions(const char *needle, const char *haystack, size_t *positions){

 	if(!*needle){

 		return 1.0;

-	}else if(!is_subset(needle, haystack)){

+	}else if(!has_match(needle, haystack)){

 		return SCORE_MIN;

 	}else if(!strcasecmp(needle, haystack)){

 		if(positions){