| MySQL 5.6.14 Source Code Document
    | 
#include <fts0types.h>

| Public Attributes | |
| dict_index_t * | index | 
| ib_rbt_t * | words | 
| ib_vector_t * | doc_stats | 
| que_t ** | ins_graph | 
| que_t ** | sel_graph | 
| CHARSET_INFO * | charset | 
Since we can have multiple FTS indexes on a table, we keep a
per index cache of words etc.
Definition at line 63 of file fts0types.h.
| CHARSET_INFO* fts_index_cache_t::charset | 
charset
Definition at line 79 of file fts0types.h.
| ib_vector_t* fts_index_cache_t::doc_stats | 
Array of the fts_doc_stats_t contained in the memory buffer. Must be in sorted order (ascending). The ideal choice is an rb tree but the rb tree imposes a space overhead that we can do without
Definition at line 69 of file fts0types.h.
| dict_index_t* fts_index_cache_t::index | 
The FTS index instance
Definition at line 64 of file fts0types.h.
| que_t** fts_index_cache_t::ins_graph | 
Insert query graphs
Definition at line 76 of file fts0types.h.
| que_t** fts_index_cache_t::sel_graph | 
Select query graphs
Definition at line 78 of file fts0types.h.
| ib_rbt_t* fts_index_cache_t::words | 
Nodes; indexed by fts_string_t*, cells are fts_tokenizer_word_t*.
Definition at line 66 of file fts0types.h.