| components.conf |
|
460 |
| data |
|
|
| fts3_porter.c |
2006 September 30
*
* The author disclaims copyright to this source code. In place of
* a legal notice, here is a blessing:
*
* May you do good and not evil.
* May you find forgiveness for yourself and forgive others.
* May you share freely, never taking more than you give.
*
************************************************************************
* Implementation of the full-text-search tokenizer that implements
* a Porter stemmer.
*
|
41380 |
| fts3_tokenizer.h |
2006 July 10
*
* The author disclaims copyright to this source code.
*
************************************************************************
* Defines the interface to tokenizers used by fulltext-search. There
* are three basic components:
*
* sqlite3_tokenizer_module is a singleton defining the tokenizer
* interface functions. This is essentially the class structure for
* tokenizers.
*
* sqlite3_tokenizer is used to define a particular tokenizer, perhaps
* including customization information defined at creation time.
*
* sqlite3_tokenizer_cursor is generated by a tokenizer to generate
* tokens from a particular input.
|
6020 |
| moz.build |
|
527 |
| Normalize.c |
THIS FILE IS GENERATED BY generate_table.py. DON'T EDIT THIS |
95645 |
| nsFts3Tokenizer.cpp |
|
1970 |
| nsFts3Tokenizer.h |
|
665 |
| nsGlodaRankerFunction.cpp |
Our ranking function basically just multiplies the weight of the column
against the number of (saturating) matches.
The original code is a SQLite example ranking function, although somewhat
rather modified at this point. All SQLite code is public domain, so we are
subsuming it to MPL1.1/LGPL2/GPL2.
|
3736 |
| nsGlodaRankerFunction.h |
Basically a port of the example FTS3 ranking function to mozStorage's
view of the universe. This might get fancier at some point.
|
686 |
| nsIFts3Tokenizer.idl |
|
657 |
| README.mozilla |
fts3_porter.c code is from SQLite3. |
202 |