summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--myisam/ft_boolean_search.c29
-rw-r--r--myisam/ft_parser.c9
-rw-r--r--myisam/ftdefs.h5
-rw-r--r--mysql-test/r/fulltext.result3
-rw-r--r--mysql-test/t/fulltext.test1
5 files changed, 25 insertions, 22 deletions
diff --git a/myisam/ft_boolean_search.c b/myisam/ft_boolean_search.c
index dfefaf621c9..104acf02324 100644
--- a/myisam/ft_boolean_search.c
+++ b/myisam/ft_boolean_search.c
@@ -391,25 +391,34 @@ FT_INFO * ft_init_boolean_search(MI_INFO *info, uint keynr, byte *query,
}
-/* returns 1 if str0 contain str1 */
+/* returns 1 if str0 ~= /\<str1\>/ */
static int _ftb_strstr(const byte *s0, const byte *e0,
const byte *s1, const byte *e1,
CHARSET_INFO *cs)
{
- const byte *p;
+ const byte *p0, *p1;
+ my_bool s_after, e_before;
- while (s0 < e0)
+ s_after=true_word_char(cs, s1[0]);
+ e_before=true_word_char(cs, e1[-1]);
+ p0=s0;
+
+ while (p0 < e0)
{
- while (s0 < e0 && cs->to_upper[(uint) (uchar) *s0++] !=
+ while (p0 < e0 && cs->to_upper[(uint) (uchar) *p0++] !=
cs->to_upper[(uint) (uchar) *s1])
/* no-op */;
- if (s0 >= e0)
+ if (p0 >= e0)
return 0;
- p=s1+1;
- while (s0 < e0 && p < e1 && cs->to_upper[(uint) (uchar) *s0] ==
- cs->to_upper[(uint) (uchar) *p])
- s0++, p++;
- if (p >= e1)
+
+ if (s_after && p0-1 > s0 && true_word_char(cs, p0[-2]))
+ continue;
+
+ p1=s1+1;
+ while (p0 < e0 && p1 < e1 && cs->to_upper[(uint) (uchar) *p0] ==
+ cs->to_upper[(uint) (uchar) *p1])
+ p0++, p1++;
+ if (p1 == e1 && (!e_before || p0 == e0 || !true_word_char(cs, p0[0])))
return 1;
}
return 0;
diff --git a/myisam/ft_parser.c b/myisam/ft_parser.c
index 14c67333734..57b379cfac0 100644
--- a/myisam/ft_parser.c
+++ b/myisam/ft_parser.c
@@ -73,15 +73,6 @@ FT_WORD * ft_linearize(TREE *wtree)
DBUG_RETURN(wlist);
}
-#define true_word_char(s,X) (my_isalnum(s,X) || (X)=='_')
-#ifdef HYPHEN_IS_DELIM
-#define misc_word_char(X) ((X)=='\'')
-#else
-#define misc_word_char(X) ((X)=='\'' || (X)=='-')
-#endif
-#define word_char(s,X) (true_word_char(s,X) || misc_word_char(X))
-
-
/* returns:
* 0 - eof
* 1 - word found
diff --git a/myisam/ftdefs.h b/myisam/ftdefs.h
index 88d7e79937b..c0a19262dcf 100644
--- a/myisam/ftdefs.h
+++ b/myisam/ftdefs.h
@@ -22,8 +22,9 @@
#include <m_ctype.h>
#include <my_tree.h>
-#define HYPHEN_IS_DELIM
-#define HYPHEN_IS_CONCAT /* not used for now */
+#define true_word_char(s,X) (my_isalnum(s,X) || (X)=='_')
+#define misc_word_char(X) ((X)=='\'')
+#define word_char(s,X) (true_word_char(s,X) || misc_word_char(X))
#define COMPILE_STOPWORDS_IN
diff --git a/mysql-test/r/fulltext.result b/mysql-test/r/fulltext.result
index e2d35973383..83c77949e2c 100644
--- a/mysql-test/r/fulltext.result
+++ b/mysql-test/r/fulltext.result
@@ -119,7 +119,8 @@ a b
MySQL has now support for full-text search
select * from t1 where MATCH a,b AGAINST ('"text i"' IN BOOLEAN MODE);
a b
-Full-text indexes are called collections
+select * from t1 where MATCH a,b AGAINST ('"xt indexes"' IN BOOLEAN MODE);
+a b
select * from t1 where MATCH a AGAINST ("search" IN BOOLEAN MODE);
a b
Full-text search in MySQL implements vector space model
diff --git a/mysql-test/t/fulltext.test b/mysql-test/t/fulltext.test
index 8c6bb97edf1..5e5d64ced82 100644
--- a/mysql-test/t/fulltext.test
+++ b/mysql-test/t/fulltext.test
@@ -58,6 +58,7 @@ select * from t1 where MATCH a,b AGAINST ('"text search" "now support"' IN BOOL
select * from t1 where MATCH a,b AGAINST ('"text search" -"now support"' IN BOOLEAN MODE);
select * from t1 where MATCH a,b AGAINST ('"text search" +"now support"' IN BOOLEAN MODE);
select * from t1 where MATCH a,b AGAINST ('"text i"' IN BOOLEAN MODE);
+select * from t1 where MATCH a,b AGAINST ('"xt indexes"' IN BOOLEAN MODE);
# boolean w/o index: