Lines Matching defs:fts_query_t

78 struct fts_query_t {  struct
79 	mem_heap_t*	heap;		/*!< Heap to use for allocations */
81 	trx_t*		trx;		/*!< The query transaction */
83 	dict_index_t*	index;		/*!< The FTS index to search */
86 	fts_table_t	fts_common_table;
88 	fts_table_t	fts_index_table;/*!< FTS auxiliary index table def */
90 	ulint		total_size;	/*!< total memory size used by query */
92 	fts_doc_ids_t*	deleted;	/*!< Deleted doc ids that need to be
95 	fts_ast_node_t*	root;		/*!< Abstract syntax tree */
97 	fts_ast_node_t* cur_node;	/*!< Current tree node */
99 	ib_rbt_t*	word_map;	/*!< Matched word map for
102 	word_vector_t*	word_vector;	/*!< Matched word vector for
105 	ib_rbt_t*       doc_ids;	/*!< The current set of matching
109 	ib_rbt_t*	intersection;	/*!< The doc ids that were found in
116 	que_t*		read_nodes_graph;
118 	fts_ast_oper_t	oper;		/*!< Current boolean mode operator */
122 	ibool		collect_positions;
124 	ulint		flags;		/*!< Specify the full text search type,
128 	ulint		distance;	/*!< The proximity distance of a
135 	doc_id_t	lower_doc_id;	/*!< Lowest doc id in doc_ids */
137 	doc_id_t	upper_doc_id;	/*!< Highest doc id in doc_ids */
139 	bool		boolean_mode;	/*!< TRUE if boolean mode query */
141 	ib_vector_t*	matched;	/*!< Array of matching documents
144 	ib_vector_t**	match_array;	/*!< Used for proximity search, contains
148 	ib_uint64_t	total_docs;	/*!< The total number of documents */
150 	ulint		total_words;	/*!< The total number of words */
152 	dberr_t		error;		/*!< Error code if any, that is
155 	ib_rbt_t*	word_freqs;	/*!< RB tree of word frequencies per
159 	ib_rbt_t*	wildcard_words;	/*!< words with wildcard */
161 	bool		multi_exist;	/*!< multiple FTS_EXIST oper */
163 	st_mysql_ftparser*	parser;	/*!< fts plugin parser */
166 	ulonglong		limit;
170 	ulonglong		n_docs;
172 	ulint		nested_exp_count; /*!< number of nested sub expression