test for truncation operator in indexless bolelan fts

mysys/queue.c: /* comment added */

mysql-test/r/fulltext.result

@@ -55,7 +55,7 @@ Full-text indexes	are called collections	1
 Only MyISAM tables	support collections	2
 Function MATCH ... AGAINST()	is used to do a search	0
 Full-text search in MySQL	implements vector space model	0
-select * from t1 where MATCH a AGAINST ("search" IN BOOLEAN MODE);
+select * from t1 where MATCH a AGAINST ("sear*" IN BOOLEAN MODE);
 a	b
 Full-text search in MySQL	implements vector space model
 delete from t1 where a like "MySQL%";

mysql-test/t/fulltext.test

@@ -31,7 +31,7 @@ select *, MATCH(a,b) AGAINST("support  collections" IN BOOLEAN MODE) as x from t
 
 # boolean w/o index:
 
-select * from t1 where MATCH a AGAINST ("search" IN BOOLEAN MODE);
+select * from t1 where MATCH a AGAINST ("sear*" IN BOOLEAN MODE);
 
 #update/delete with fulltext index
 

mysys/queues.c

@@ -173,7 +173,11 @@ static int queue_fix_cmp(QUEUE *queue, void **a, void **b)
 			(char*) (*b)+queue->offset_to_key);
 }
 
-	/* Fix heap when every element was changed */
+/* Fix heap when every element was changed
+   actually, it can be done in linear time,
+   not in n*log(n), but some code (myisam/ft_boolean_search.c)
+   requires a strict order here, not just a queue property
+*/
 void queue_fix(QUEUE *queue)
 {
   qsort2(queue->root+1,queue->elements, sizeof(void *),