ferret 0.9.0 → 0.9.1
Sign up to get free protection for your applications and to get access to all the features.
- data/Rakefile +23 -5
- data/TODO +2 -1
- data/ext/analysis.c +838 -177
- data/ext/analysis.h +55 -7
- data/ext/api.c +69 -0
- data/ext/api.h +27 -0
- data/ext/array.c +8 -5
- data/ext/compound_io.c +132 -96
- data/ext/document.c +58 -28
- data/ext/except.c +59 -0
- data/ext/except.h +88 -0
- data/ext/ferret.c +47 -3
- data/ext/ferret.h +3 -0
- data/ext/field.c +15 -9
- data/ext/filter.c +1 -1
- data/ext/fs_store.c +215 -34
- data/ext/global.c +72 -3
- data/ext/global.h +4 -3
- data/ext/hash.c +44 -3
- data/ext/hash.h +9 -0
- data/ext/header.h +58 -0
- data/ext/inc/except.h +88 -0
- data/ext/inc/lang.h +23 -13
- data/ext/ind.c +16 -10
- data/ext/index.h +2 -22
- data/ext/index_io.c +3 -11
- data/ext/index_rw.c +245 -193
- data/ext/lang.h +23 -13
- data/ext/libstemmer.c +92 -0
- data/ext/libstemmer.h +79 -0
- data/ext/modules.h +162 -0
- data/ext/q_boolean.c +34 -21
- data/ext/q_const_score.c +6 -12
- data/ext/q_filtered_query.c +206 -0
- data/ext/q_fuzzy.c +18 -15
- data/ext/q_match_all.c +3 -7
- data/ext/q_multi_phrase.c +10 -14
- data/ext/q_parser.c +29 -2
- data/ext/q_phrase.c +14 -21
- data/ext/q_prefix.c +15 -12
- data/ext/q_range.c +30 -28
- data/ext/q_span.c +13 -21
- data/ext/q_term.c +17 -26
- data/ext/r_analysis.c +693 -21
- data/ext/r_doc.c +11 -12
- data/ext/r_index_io.c +4 -1
- data/ext/r_qparser.c +21 -2
- data/ext/r_search.c +285 -18
- data/ext/ram_store.c +5 -2
- data/ext/search.c +11 -17
- data/ext/search.h +21 -45
- data/ext/similarity.h +67 -0
- data/ext/sort.c +30 -25
- data/ext/stem_ISO_8859_1_danish.c +338 -0
- data/ext/stem_ISO_8859_1_danish.h +16 -0
- data/ext/stem_ISO_8859_1_dutch.c +635 -0
- data/ext/stem_ISO_8859_1_dutch.h +16 -0
- data/ext/stem_ISO_8859_1_english.c +1156 -0
- data/ext/stem_ISO_8859_1_english.h +16 -0
- data/ext/stem_ISO_8859_1_finnish.c +792 -0
- data/ext/stem_ISO_8859_1_finnish.h +16 -0
- data/ext/stem_ISO_8859_1_french.c +1276 -0
- data/ext/stem_ISO_8859_1_french.h +16 -0
- data/ext/stem_ISO_8859_1_german.c +512 -0
- data/ext/stem_ISO_8859_1_german.h +16 -0
- data/ext/stem_ISO_8859_1_italian.c +1091 -0
- data/ext/stem_ISO_8859_1_italian.h +16 -0
- data/ext/stem_ISO_8859_1_norwegian.c +296 -0
- data/ext/stem_ISO_8859_1_norwegian.h +16 -0
- data/ext/stem_ISO_8859_1_porter.c +776 -0
- data/ext/stem_ISO_8859_1_porter.h +16 -0
- data/ext/stem_ISO_8859_1_portuguese.c +1035 -0
- data/ext/stem_ISO_8859_1_portuguese.h +16 -0
- data/ext/stem_ISO_8859_1_spanish.c +1119 -0
- data/ext/stem_ISO_8859_1_spanish.h +16 -0
- data/ext/stem_ISO_8859_1_swedish.c +307 -0
- data/ext/stem_ISO_8859_1_swedish.h +16 -0
- data/ext/stem_KOI8_R_russian.c +701 -0
- data/ext/stem_KOI8_R_russian.h +16 -0
- data/ext/stem_UTF_8_danish.c +344 -0
- data/ext/stem_UTF_8_danish.h +16 -0
- data/ext/stem_UTF_8_dutch.c +653 -0
- data/ext/stem_UTF_8_dutch.h +16 -0
- data/ext/stem_UTF_8_english.c +1176 -0
- data/ext/stem_UTF_8_english.h +16 -0
- data/ext/stem_UTF_8_finnish.c +808 -0
- data/ext/stem_UTF_8_finnish.h +16 -0
- data/ext/stem_UTF_8_french.c +1296 -0
- data/ext/stem_UTF_8_french.h +16 -0
- data/ext/stem_UTF_8_german.c +526 -0
- data/ext/stem_UTF_8_german.h +16 -0
- data/ext/stem_UTF_8_italian.c +1113 -0
- data/ext/stem_UTF_8_italian.h +16 -0
- data/ext/stem_UTF_8_norwegian.c +302 -0
- data/ext/stem_UTF_8_norwegian.h +16 -0
- data/ext/stem_UTF_8_porter.c +794 -0
- data/ext/stem_UTF_8_porter.h +16 -0
- data/ext/stem_UTF_8_portuguese.c +1055 -0
- data/ext/stem_UTF_8_portuguese.h +16 -0
- data/ext/stem_UTF_8_russian.c +709 -0
- data/ext/stem_UTF_8_russian.h +16 -0
- data/ext/stem_UTF_8_spanish.c +1137 -0
- data/ext/stem_UTF_8_spanish.h +16 -0
- data/ext/stem_UTF_8_swedish.c +313 -0
- data/ext/stem_UTF_8_swedish.h +16 -0
- data/ext/stopwords.c +325 -0
- data/ext/store.c +34 -2
- data/ext/tags +2953 -0
- data/ext/term.c +21 -15
- data/ext/termdocs.c +5 -3
- data/ext/utilities.c +446 -0
- data/ext/vector.c +27 -13
- data/lib/ferret/document/document.rb +1 -1
- data/lib/ferret/index/index.rb +44 -6
- data/lib/ferret/query_parser/query_parser.tab.rb +7 -3
- data/lib/rferret.rb +2 -1
- data/test/test_helper.rb +2 -2
- data/test/unit/analysis/ctc_analyzer.rb +401 -0
- data/test/unit/analysis/ctc_tokenstream.rb +423 -0
- data/test/unit/analysis/{tc_letter_tokenizer.rb → rtc_letter_tokenizer.rb} +0 -0
- data/test/unit/analysis/{tc_lower_case_filter.rb → rtc_lower_case_filter.rb} +0 -0
- data/test/unit/analysis/{tc_lower_case_tokenizer.rb → rtc_lower_case_tokenizer.rb} +0 -0
- data/test/unit/analysis/{tc_per_field_analyzer_wrapper.rb → rtc_per_field_analyzer_wrapper.rb} +0 -0
- data/test/unit/analysis/{tc_porter_stem_filter.rb → rtc_porter_stem_filter.rb} +0 -0
- data/test/unit/analysis/{tc_standard_analyzer.rb → rtc_standard_analyzer.rb} +0 -0
- data/test/unit/analysis/{tc_standard_tokenizer.rb → rtc_standard_tokenizer.rb} +0 -0
- data/test/unit/analysis/{tc_stop_analyzer.rb → rtc_stop_analyzer.rb} +0 -0
- data/test/unit/analysis/{tc_stop_filter.rb → rtc_stop_filter.rb} +0 -0
- data/test/unit/analysis/{tc_white_space_analyzer.rb → rtc_white_space_analyzer.rb} +0 -0
- data/test/unit/analysis/{tc_white_space_tokenizer.rb → rtc_white_space_tokenizer.rb} +0 -0
- data/test/unit/analysis/{tc_word_list_loader.rb → rtc_word_list_loader.rb} +0 -0
- data/test/unit/analysis/tc_analyzer.rb +1 -2
- data/test/unit/analysis/{c_token.rb → tc_token.rb} +0 -0
- data/test/unit/document/rtc_field.rb +28 -0
- data/test/unit/document/{c_document.rb → tc_document.rb} +0 -0
- data/test/unit/document/tc_field.rb +82 -12
- data/test/unit/index/{tc_compound_file_io.rb → rtc_compound_file_io.rb} +0 -0
- data/test/unit/index/{tc_field_infos.rb → rtc_field_infos.rb} +0 -0
- data/test/unit/index/{tc_fields_io.rb → rtc_fields_io.rb} +0 -0
- data/test/unit/index/{tc_multiple_term_doc_pos_enum.rb → rtc_multiple_term_doc_pos_enum.rb} +0 -0
- data/test/unit/index/{tc_segment_infos.rb → rtc_segment_infos.rb} +0 -0
- data/test/unit/index/{tc_segment_term_docs.rb → rtc_segment_term_docs.rb} +0 -0
- data/test/unit/index/{tc_segment_term_enum.rb → rtc_segment_term_enum.rb} +0 -0
- data/test/unit/index/{tc_segment_term_vector.rb → rtc_segment_term_vector.rb} +0 -0
- data/test/unit/index/{tc_term_buffer.rb → rtc_term_buffer.rb} +0 -0
- data/test/unit/index/{tc_term_info.rb → rtc_term_info.rb} +0 -0
- data/test/unit/index/{tc_term_infos_io.rb → rtc_term_infos_io.rb} +0 -0
- data/test/unit/index/{tc_term_vectors_io.rb → rtc_term_vectors_io.rb} +0 -0
- data/test/unit/index/{c_index.rb → tc_index.rb} +26 -6
- data/test/unit/index/{c_index_reader.rb → tc_index_reader.rb} +0 -0
- data/test/unit/index/{c_index_writer.rb → tc_index_writer.rb} +0 -0
- data/test/unit/index/{c_term.rb → tc_term.rb} +0 -0
- data/test/unit/index/{c_term_voi.rb → tc_term_voi.rb} +0 -0
- data/test/unit/query_parser/{c_query_parser.rb → rtc_query_parser.rb} +14 -14
- data/test/unit/query_parser/tc_query_parser.rb +24 -16
- data/test/unit/search/{tc_similarity.rb → rtc_similarity.rb} +0 -0
- data/test/unit/search/rtc_sort_field.rb +14 -0
- data/test/unit/search/{c_filter.rb → tc_filter.rb} +11 -11
- data/test/unit/search/{c_fuzzy_query.rb → tc_fuzzy_query.rb} +0 -0
- data/test/unit/search/{c_index_searcher.rb → tc_index_searcher.rb} +0 -0
- data/test/unit/search/{c_search_and_sort.rb → tc_search_and_sort.rb} +0 -0
- data/test/unit/search/{c_sort.rb → tc_sort.rb} +0 -0
- data/test/unit/search/tc_sort_field.rb +20 -7
- data/test/unit/search/{c_spans.rb → tc_spans.rb} +0 -0
- data/test/unit/store/rtc_fs_store.rb +62 -0
- data/test/unit/store/rtc_ram_store.rb +15 -0
- data/test/unit/store/rtm_store.rb +150 -0
- data/test/unit/store/rtm_store_lock.rb +2 -0
- data/test/unit/store/tc_fs_store.rb +54 -40
- data/test/unit/store/tc_ram_store.rb +20 -0
- data/test/unit/store/tm_store.rb +30 -146
- data/test/unit/store/tm_store_lock.rb +66 -0
- data/test/unit/utils/{tc_bit_vector.rb → rtc_bit_vector.rb} +0 -0
- data/test/unit/utils/{tc_date_tools.rb → rtc_date_tools.rb} +0 -0
- data/test/unit/utils/{tc_number_tools.rb → rtc_number_tools.rb} +0 -0
- data/test/unit/utils/{tc_parameter.rb → rtc_parameter.rb} +0 -0
- data/test/unit/utils/{tc_priority_queue.rb → rtc_priority_queue.rb} +0 -0
- data/test/unit/utils/{tc_string_helper.rb → rtc_string_helper.rb} +0 -0
- data/test/unit/utils/{tc_thread.rb → rtc_thread.rb} +0 -0
- data/test/unit/utils/{tc_weak_key_hash.rb → rtc_weak_key_hash.rb} +0 -0
- metadata +360 -289
- data/test/unit/document/c_field.rb +0 -98
- data/test/unit/search/c_sort_field.rb +0 -27
- data/test/unit/store/c_fs_store.rb +0 -76
- data/test/unit/store/c_ram_store.rb +0 -35
- data/test/unit/store/m_store.rb +0 -34
- data/test/unit/store/m_store_lock.rb +0 -68
data/ext/store.c
CHANGED
@@ -1,24 +1,53 @@
|
|
1
1
|
#include "store.h"
|
2
2
|
|
3
|
+
static char * const COULD_NOT_OBTAIN_LOCK = "Could not obtain lock";
|
4
|
+
|
5
|
+
/**
|
6
|
+
* Call the function +func+ with the +lock+ locked. The argument +arg+ will be
|
7
|
+
* passed to +func+. If you need to pass more than one argument you should use
|
8
|
+
* a struct. When the function is finished, release the lock.
|
9
|
+
*
|
10
|
+
* @param lock lock to be locked while func is called
|
11
|
+
* @param func function to call with the lock locked
|
12
|
+
* @param arg argument to pass to the function
|
13
|
+
* @throws IO_ERROR if the lock is already locked
|
14
|
+
* @see with_lock_name
|
15
|
+
*/
|
3
16
|
void with_lock(Lock *lock, void (*func)(void *arg), void *arg)
|
4
17
|
{
|
5
18
|
if (!lock->obtain(lock))
|
6
|
-
|
19
|
+
RAISE(IO_ERROR, COULD_NOT_OBTAIN_LOCK);
|
7
20
|
func(arg);
|
8
21
|
lock->release(lock);
|
9
22
|
}
|
10
23
|
|
24
|
+
/**
|
25
|
+
* Create a lock in the +store+ with the name +lock_name+. Call the function
|
26
|
+
* +func+ with the lock locked. The argument +arg+ will be passed to +func+.
|
27
|
+
* If you need to pass more than one argument you should use a struct. When
|
28
|
+
* the function is finished, release and destroy the lock.
|
29
|
+
*
|
30
|
+
* @param store store to open the lock in
|
31
|
+
* @param lock_name name of the lock to open
|
32
|
+
* @param func function to call with the lock locked
|
33
|
+
* @param arg argument to pass to the function
|
34
|
+
* @throws IO_ERROR if the lock is already locked
|
35
|
+
* @see with_lock
|
36
|
+
*/
|
11
37
|
void with_lock_name(Store *store, char *lock_name,
|
12
38
|
void (*func)(void *arg), void *arg)
|
13
39
|
{
|
14
40
|
Lock *lock = store->open_lock(store, lock_name);
|
15
41
|
if (!lock->obtain(lock))
|
16
|
-
|
42
|
+
RAISE(IO_ERROR, COULD_NOT_OBTAIN_LOCK);
|
17
43
|
func(arg);
|
18
44
|
lock->release(lock);
|
19
45
|
store->close_lock(lock);
|
20
46
|
}
|
21
47
|
|
48
|
+
/**
|
49
|
+
* Create a store struct initializing the mutex.
|
50
|
+
*/
|
22
51
|
Store *store_create()
|
23
52
|
{
|
24
53
|
Store *store = ALLOC(Store);
|
@@ -27,6 +56,9 @@ Store *store_create()
|
|
27
56
|
return store;
|
28
57
|
}
|
29
58
|
|
59
|
+
/**
|
60
|
+
* Destroy the store, destroying the mutex.
|
61
|
+
*/
|
30
62
|
void store_destroy(Store *store)
|
31
63
|
{
|
32
64
|
mutex_destroy(&store->mutex);
|
data/ext/tags
ADDED
@@ -0,0 +1,2953 @@
|
|
1
|
+
!_TAG_FILE_FORMAT 2 /extended format; --format=1 will not append ;" to lines/
|
2
|
+
!_TAG_FILE_SORTED 1 /0=unsorted, 1=sorted, 2=foldcase/
|
3
|
+
!_TAG_PROGRAM_AUTHOR Darren Hiebert /dhiebert@users.sourceforge.net/
|
4
|
+
!_TAG_PROGRAM_NAME Exuberant Ctags //
|
5
|
+
!_TAG_PROGRAM_URL http://ctags.sourceforge.net /official site/
|
6
|
+
!_TAG_PROGRAM_VERSION 5.5.4 //
|
7
|
+
ALLOC_AND_ZERO_N global.h 30;" d
|
8
|
+
AND q_parser.c /^ AND = 262,$/;" e enum:yytokentype file:
|
9
|
+
AND q_parser.c 70;" d file:
|
10
|
+
AR Makefile /^AR = ar$/;" m
|
11
|
+
ARG_ERROR inc/lang.h 19;" d
|
12
|
+
ARG_ERROR lang.h 19;" d
|
13
|
+
ARRAY_INIT_SIZE global.h 25;" d
|
14
|
+
AUTOFLUSH_IR ind.c 17;" d file:
|
15
|
+
AUTOFLUSH_IW ind.c 20;" d file:
|
16
|
+
Analyzer analysis.h /^typedef struct Analyzer {$/;" s
|
17
|
+
Analyzer analysis.h /^} Analyzer;$/;" t
|
18
|
+
Array array.h /^typedef struct Array {$/;" s
|
19
|
+
Array array.h /^} Array;$/;" t
|
20
|
+
BC_MUST search.h /^ BC_MUST,$/;" e enum:BC_TYPE
|
21
|
+
BC_MUST_NOT search.h /^ BC_MUST_NOT$/;" e enum:BC_TYPE
|
22
|
+
BC_SHOULD search.h /^ BC_SHOULD,$/;" e enum:BC_TYPE
|
23
|
+
BC_TYPE search.h /^enum BC_TYPE {$/;" g
|
24
|
+
BOOLEAN_CLAUSES_START_CAPA search.h 317;" d
|
25
|
+
BOOLEAN_QUERY search.h /^ BOOLEAN_QUERY,$/;" e enum:QUERY_TYPE
|
26
|
+
BUFFER_SIZE store.h 7;" d
|
27
|
+
BV_INIT_CAPA bitvector.h 7;" d
|
28
|
+
BYTE_COUNTS bitvector.c /^const uchar BYTE_COUNTS[] = { \/\/ table of bits\/char$/;" v
|
29
|
+
BitVector bitvector.h /^typedef struct BitVector {$/;" s
|
30
|
+
BitVector bitvector.h /^} BitVector;$/;" t
|
31
|
+
BooleanClause search.h /^typedef struct BooleanClause {$/;" s
|
32
|
+
BooleanClause search.h /^} BooleanClause;$/;" t
|
33
|
+
BooleanQuery search.h /^typedef struct BooleanQuery {$/;" s
|
34
|
+
BooleanQuery search.h /^} BooleanQuery;$/;" t
|
35
|
+
BooleanScorer search.h /^typedef struct BooleanScorer {$/;" s
|
36
|
+
BooleanScorer search.h /^} BooleanScorer;$/;" t
|
37
|
+
BooleanWeight search.h /^typedef struct BooleanWeight {$/;" s
|
38
|
+
BooleanWeight search.h /^} BooleanWeight;$/;" t
|
39
|
+
Buffer store.h /^typedef struct Buffer {$/;" s
|
40
|
+
Buffer store.h /^} Buffer;$/;" t
|
41
|
+
CC Makefile /^CC = gcc$/;" m
|
42
|
+
CFLAGS Makefile /^CFLAGS = -fPIC -Wall -g -O2 -fPIC $/;" m
|
43
|
+
CLEANFILES Makefile /^CLEANFILES = $/;" m
|
44
|
+
CLEANLIBS Makefile /^CLEANLIBS = $(TARGET).so $(TARGET).il? $(TARGET).tds $(TARGET).map$/;" m
|
45
|
+
CLEANOBJS Makefile /^CLEANOBJS = *.o *.a *.s[ol] *.pdb *.exp *.bak$/;" m
|
46
|
+
COMMIT_LOCK_NAME index.h 837;" d
|
47
|
+
COMPOUND_EXTENSIONS index_rw.c /^const char *COMPOUND_EXTENSIONS[] = {$/;" v
|
48
|
+
CONC_WORDS search.h 996;" d
|
49
|
+
CONSTANT_QUERY search.h /^ CONSTANT_QUERY,$/;" e enum:QUERY_TYPE
|
50
|
+
COPY Makefile /^COPY = cp$/;" m
|
51
|
+
CPPFLAGS Makefile /^CPPFLAGS = -I. -I$(topdir) -I$(hdrdir) -I$(srcdir) $/;" m
|
52
|
+
CXXFLAGS Makefile /^CXXFLAGS = $(CFLAGS) $/;" m
|
53
|
+
CacheObject index.h /^typedef struct CacheObject {$/;" s
|
54
|
+
CacheObject index.h /^} CacheObject;$/;" t
|
55
|
+
Comparator sort.c /^typedef struct Comparator {$/;" s file:
|
56
|
+
Comparator sort.c /^} Comparator;$/;" t file:
|
57
|
+
CompoundInStream store.h /^struct CompoundInStream {$/;" s
|
58
|
+
CompoundInStream store.h /^typedef struct CompoundInStream CompoundInStream;$/;" t
|
59
|
+
CompoundStore store.h /^typedef struct CompoundStore {$/;" s
|
60
|
+
CompoundStore store.h /^} CompoundStore;$/;" t
|
61
|
+
CompoundWriter index.h /^typedef struct CompoundWriter {$/;" s
|
62
|
+
CompoundWriter index.h /^} CompoundWriter;$/;" t
|
63
|
+
Config index.h /^typedef struct Config {$/;" s
|
64
|
+
ConjunctionScorer search.h /^typedef struct ConjunctionScorer{$/;" s
|
65
|
+
ConjunctionScorer search.h /^} ConjunctionScorer;$/;" t
|
66
|
+
ConstantScoreScorer search.h /^typedef struct ConstantScoreScorer {$/;" s
|
67
|
+
ConstantScoreScorer search.h /^} ConstantScoreScorer;$/;" t
|
68
|
+
Coordinator search.h /^typedef struct Coordinator {$/;" s
|
69
|
+
Coordinator search.h /^} Coordinator;$/;" t
|
70
|
+
CopyFileArg ram_store.c /^struct CopyFileArg {$/;" s file:
|
71
|
+
DEFAULT_MAX_CLAUSE_COUNT search.h 316;" d
|
72
|
+
DEFFILE Makefile /^DEFFILE = $/;" m
|
73
|
+
DEF_MIN_SIM search.h 395;" d
|
74
|
+
DEF_PRE_LEN search.h 396;" d
|
75
|
+
DF_INDEX_NO document.h /^ DF_INDEX_NO = 2,$/;" e
|
76
|
+
DF_INDEX_NO_NORMS document.h /^ DF_INDEX_NO_NORMS = 3$/;" e
|
77
|
+
DF_INDEX_TOKENIZED document.h /^ DF_INDEX_TOKENIZED = 1,$/;" e
|
78
|
+
DF_INDEX_UNTOKENIZED document.h /^ DF_INDEX_UNTOKENIZED = 0,$/;" e
|
79
|
+
DF_STORE_COMPRESS document.h /^ DF_STORE_COMPRESS = 2$/;" e
|
80
|
+
DF_STORE_NO document.h /^ DF_STORE_NO = 1,$/;" e
|
81
|
+
DF_STORE_YES document.h /^ DF_STORE_YES = 0,$/;" e
|
82
|
+
DF_TERM_VECTOR_NO document.h /^ DF_TERM_VECTOR_NO = 0,$/;" e
|
83
|
+
DF_TERM_VECTOR_WITH_OFFSETS document.h /^ DF_TERM_VECTOR_WITH_OFFSETS = 3,$/;" e
|
84
|
+
DF_TERM_VECTOR_WITH_POSITIONS document.h /^ DF_TERM_VECTOR_WITH_POSITIONS = 2,$/;" e
|
85
|
+
DF_TERM_VECTOR_WITH_POSITIONS_OFFSETS document.h /^ DF_TERM_VECTOR_WITH_POSITIONS_OFFSETS = 4$/;" e
|
86
|
+
DF_TERM_VECTOR_YES document.h /^ DF_TERM_VECTOR_YES = 1,$/;" e
|
87
|
+
DIR_METHODS r_store.c 230;" d file:
|
88
|
+
DISTCLEANFILES Makefile /^DISTCLEANFILES = $/;" m
|
89
|
+
DLDFLAGS Makefile /^DLDFLAGS = $/;" m
|
90
|
+
DLLIB Makefile /^DLLIB = $(TARGET).so$/;" m
|
91
|
+
DisjunctionSumScorer search.h /^typedef struct DisjunctionSumScorer{$/;" s
|
92
|
+
DisjunctionSumScorer search.h /^} DisjunctionSumScorer;$/;" t
|
93
|
+
DocField document.h /^typedef struct DocField {$/;" s
|
94
|
+
DocField document.h /^} DocField;$/;" t
|
95
|
+
Document document.h /^typedef struct Document {$/;" s
|
96
|
+
Document document.h /^} Document;$/;" t
|
97
|
+
DocumentWriter index.h /^typedef struct DocumentWriter {$/;" s
|
98
|
+
DocumentWriter index.h /^} DocumentWriter; $/;" t
|
99
|
+
EMPTY_STRING global.c /^const char *EMPTY_STRING = "";$/;" v
|
100
|
+
ENGLISH_STOP_WORDS analysis.c /^const char *ENGLISH_STOP_WORDS[] = {$/;" v
|
101
|
+
EOF_ERROR inc/lang.h 20;" d
|
102
|
+
EOF_ERROR lang.h 20;" d
|
103
|
+
ERROR inc/lang.h 17;" d
|
104
|
+
ERROR lang.h 17;" d
|
105
|
+
EXEEXT Makefile /^EXEEXT = $/;" m
|
106
|
+
EXPLANATION_DETAILS_START_SIZE search.h 58;" d
|
107
|
+
EmptyTerm term.c /^const Term EmptyTerm = {"", ""};$/;" v
|
108
|
+
Explanation search.h /^typedef struct Explanation {$/;" s
|
109
|
+
Explanation search.h /^} Explanation;$/;" t
|
110
|
+
FERRET_EXT inc/lang.h 6;" d
|
111
|
+
FERRET_EXT lang.h 6;" d
|
112
|
+
FIELD_ARR_START_SIZE vector.c 6;" d file:
|
113
|
+
FIELD_IS_BINARY index.h 427;" d
|
114
|
+
FIELD_IS_COMPRESSED index.h 428;" d
|
115
|
+
FIELD_IS_TOKENIZED index.h 426;" d
|
116
|
+
FIELD_TYPE index.h /^enum FIELD_TYPE {$/;" g
|
117
|
+
FILTERED_QUERY search.h /^ FILTERED_QUERY,$/;" e enum:QUERY_TYPE
|
118
|
+
FIRST_TO_LAST q_phrase.c 414;" d file:
|
119
|
+
FLDS q_parser.c 158;" d file:
|
120
|
+
FORMAT index_rw.c 472;" d file:
|
121
|
+
FORMAT_SIZE index.h 365;" d
|
122
|
+
FORMAT_VERSION index.h 364;" d
|
123
|
+
FRT_ANALYSIS_H analysis.h 2;" d
|
124
|
+
FRT_ARRAY_H array.h 2;" d
|
125
|
+
FRT_BIT_VECTOR_H bitvector.h 2;" d
|
126
|
+
FRT_DOCUMENT_H document.h 2;" d
|
127
|
+
FRT_GLOBAL_H global.h 2;" d
|
128
|
+
FRT_HASHSET_H hashset.h 2;" d
|
129
|
+
FRT_HASH_H hash.h 2;" d
|
130
|
+
FRT_HELPER_H helper.h 2;" d
|
131
|
+
FRT_INDEX_H index.h 2;" d
|
132
|
+
FRT_LANG_H inc/lang.h 2;" d
|
133
|
+
FRT_LANG_H lang.h 2;" d
|
134
|
+
FRT_PRIORITYQUEUE_H priorityqueue.h 2;" d
|
135
|
+
FRT_SEARCH_H search.h 2;" d
|
136
|
+
FRT_STORE_H store.h 5;" d
|
137
|
+
FUZZY_QUERY search.h /^ FUZZY_QUERY,$/;" e enum:QUERY_TYPE
|
138
|
+
FerretConfig index.h /^} FerretConfig;$/;" t
|
139
|
+
FieldInfo index.h /^typedef struct FieldInfo {$/;" s
|
140
|
+
FieldInfo index.h /^} FieldInfo;$/;" t
|
141
|
+
FieldInfos index.h /^typedef struct FieldInfos {$/;" s
|
142
|
+
FieldInfos index.h /^} FieldInfos;$/;" t
|
143
|
+
FieldsReader index.h /^typedef struct FieldsReader {$/;" s
|
144
|
+
FieldsReader index.h /^} FieldsReader;$/;" t
|
145
|
+
FieldsWriter index.h /^typedef struct FieldsWriter {$/;" s
|
146
|
+
FieldsWriter index.h /^} FieldsWriter;$/;" t
|
147
|
+
FileEntry compound_io.c /^typedef struct FileEntry {$/;" s file:
|
148
|
+
FileEntry compound_io.c /^} FileEntry;$/;" t file:
|
149
|
+
Filter search.h /^typedef struct Filter {$/;" s
|
150
|
+
Filter search.h /^} Filter;$/;" t
|
151
|
+
FilteredQuery search.h /^typedef struct FilteredQuery {$/;" s
|
152
|
+
FilteredQuery search.h /^} FilteredQuery;$/;" t
|
153
|
+
FilteredQueryScorer q_filtered_query.c /^typedef struct FilteredQueryScorer {$/;" s file:
|
154
|
+
FilteredQueryScorer q_filtered_query.c /^} FilteredQueryScorer;$/;" t file:
|
155
|
+
Frt_Make_Struct ferret.h 45;" d
|
156
|
+
Frt_Unwrap_Struct ferret.h 55;" d
|
157
|
+
Frt_Wrap_Struct ferret.h 48;" d
|
158
|
+
FuzzyQuery search.h /^typedef struct FuzzyQuery {$/;" s
|
159
|
+
FuzzyQuery search.h /^} FuzzyQuery;$/;" t
|
160
|
+
GET_DF r_doc.c 35;" d file:
|
161
|
+
GET_DOC r_doc.c 304;" d file:
|
162
|
+
GET_EXPL r_search.c 212;" d file:
|
163
|
+
GET_F r_search.c 940;" d file:
|
164
|
+
GET_HIT r_search.c 104;" d file:
|
165
|
+
GET_IND r_search.c 1506;" d file:
|
166
|
+
GET_IR r_index_io.c 658;" d file:
|
167
|
+
GET_IW r_index_io.c 484;" d file:
|
168
|
+
GET_LOCK r_store.c 34;" d file:
|
169
|
+
GET_MPHQ q_multi_phrase.c 175;" d file:
|
170
|
+
GET_MR index_rw.c 1550;" d file:
|
171
|
+
GET_MTDPE termdocs.c 467;" d file:
|
172
|
+
GET_MTE term.c 405;" d file:
|
173
|
+
GET_PHQ q_phrase.c 157;" d file:
|
174
|
+
GET_PHSC q_phrase.c 397;" d file:
|
175
|
+
GET_Q r_search.c 254;" d file:
|
176
|
+
GET_QP r_qparser.c 122;" d file:
|
177
|
+
GET_READER index_rw.c 1551;" d file:
|
178
|
+
GET_SEA r_search.c 1260;" d file:
|
179
|
+
GET_SF r_search.c 1076;" d file:
|
180
|
+
GET_SORT r_search.c 1167;" d file:
|
181
|
+
GET_SR index_rw.c 1071;" d file:
|
182
|
+
GET_STE term.c 244;" d file:
|
183
|
+
GET_STORE r_store.c 97;" d file:
|
184
|
+
GET_TD r_search.c 144;" d file:
|
185
|
+
GET_TDE r_index_io.c 327;" d file:
|
186
|
+
GET_TE r_index_io.c 38;" d file:
|
187
|
+
GET_TERM r_term.c 33;" d file:
|
188
|
+
GET_TK r_analysis.c 44;" d file:
|
189
|
+
GET_TOP_SNE q_span.c 707;" d file:
|
190
|
+
GET_TOP_SOE q_span.c 426;" d file:
|
191
|
+
GET_TV r_index_io.c 237;" d file:
|
192
|
+
GET_TVOI r_index_io.c 103;" d file:
|
193
|
+
HASH_KEY_DOES_NOT_EXIST hash.h /^ HASH_KEY_DOES_NOT_EXIST = 0,$/;" e
|
194
|
+
HASH_KEY_EQUAL hash.h /^ HASH_KEY_EQUAL = 2$/;" e
|
195
|
+
HASH_KEY_SAME hash.h /^ HASH_KEY_SAME = 1,$/;" e
|
196
|
+
HIGH q_parser.c /^ HIGH = 265$/;" e enum:yytokentype file:
|
197
|
+
HIGH q_parser.c 73;" d file:
|
198
|
+
HS_MIN_SIZE hashset.c 3;" d file:
|
199
|
+
HashEntry hash.h /^typedef struct HashEntry {$/;" s
|
200
|
+
HashEntry hash.h /^} HashEntry;$/;" t
|
201
|
+
HashSet hashset.h /^typedef struct HashSet {$/;" s
|
202
|
+
HashSet hashset.h /^} HashSet;$/;" t
|
203
|
+
Hit search.h /^typedef struct Hit {$/;" s
|
204
|
+
Hit search.h /^} Hit;$/;" t
|
205
|
+
HshEntry hash.h /^} HshEntry;$/;" t
|
206
|
+
HshTable hash.h /^typedef struct HshTable {$/;" s
|
207
|
+
HshTable hash.h /^} HshTable;$/;" t
|
208
|
+
Hsh_MINSIZE hash.h 29;" d
|
209
|
+
ID_STRING ind.c /^static const char *ID_STRING = "id";$/;" v file:
|
210
|
+
INCONSISTANT_TYPES_MSG r_search.c 1926;" d file:
|
211
|
+
INDEX_CLOSE_READER ind.c 6;" d file:
|
212
|
+
INDEX_EXTENSIONS index_rw.c /^const char *INDEX_EXTENSIONS[] = {$/;" v
|
213
|
+
INSTALL Makefile /^INSTALL = \/usr\/bin\/install -c$/;" m
|
214
|
+
INSTALL_DATA Makefile /^INSTALL_DATA = $(INSTALL) -m 644$/;" m
|
215
|
+
INSTALL_PROG Makefile /^INSTALL_PROG = $(INSTALL) -m 0755$/;" m
|
216
|
+
IO_ERROR inc/lang.h 18;" d
|
217
|
+
IO_ERROR lang.h 18;" d
|
218
|
+
IR_ALL index.h /^ IR_ALL,$/;" e enum:FIELD_TYPE
|
219
|
+
IR_INDEXED index.h /^ IR_INDEXED,$/;" e enum:FIELD_TYPE
|
220
|
+
IR_INDEXED_NO_TERM_VECTOR index.h /^ IR_INDEXED_NO_TERM_VECTOR,$/;" e enum:FIELD_TYPE
|
221
|
+
IR_INDEXED_WITH_TERM_VECTOR index.h /^ IR_INDEXED_WITH_TERM_VECTOR,$/;" e enum:FIELD_TYPE
|
222
|
+
IR_TERM_VECTOR index.h /^ IR_TERM_VECTOR,$/;" e enum:FIELD_TYPE
|
223
|
+
IR_TERM_VECTOR_WITH_OFFSET index.h /^ IR_TERM_VECTOR_WITH_OFFSET,$/;" e enum:FIELD_TYPE
|
224
|
+
IR_TERM_VECTOR_WITH_POSITION index.h /^ IR_TERM_VECTOR_WITH_POSITION,$/;" e enum:FIELD_TYPE
|
225
|
+
IR_TERM_VECTOR_WITH_POSITION_OFFSET index.h /^ IR_TERM_VECTOR_WITH_POSITION_OFFSET$/;" e enum:FIELD_TYPE
|
226
|
+
IR_UNINDEXED index.h /^ IR_UNINDEXED,$/;" e enum:FIELD_TYPE
|
227
|
+
IS_INDEXED field.c 139;" d file:
|
228
|
+
InStream store.h /^typedef struct InStream {$/;" s
|
229
|
+
InStream store.h /^} InStream;$/;" t
|
230
|
+
Index search.h /^typedef struct Index {$/;" s
|
231
|
+
Index search.h /^} Index;$/;" t
|
232
|
+
IndexReader index.h /^struct IndexReader {$/;" s
|
233
|
+
IndexReader index.h /^typedef struct IndexReader IndexReader;$/;" t
|
234
|
+
IndexWriter index.h /^struct IndexWriter {$/;" s
|
235
|
+
IndexWriter index.h /^typedef struct IndexWriter IndexWriter;$/;" t
|
236
|
+
Init_analysis r_analysis.c /^Init_analysis(void)$/;" f
|
237
|
+
Init_dir r_store.c /^Init_dir(void)$/;" f
|
238
|
+
Init_doc r_doc.c /^Init_doc(void)$/;" f
|
239
|
+
Init_ferret_ext ferret.c /^Init_ferret_ext(void)$/;" f
|
240
|
+
Init_index_io r_index_io.c /^Init_index_io(void)$/;" f
|
241
|
+
Init_qparser r_qparser.c /^Init_qparser(void)$/;" f
|
242
|
+
Init_search r_search.c /^Init_search(void)$/;" f
|
243
|
+
Init_term r_term.c /^Init_term(void)$/;" f
|
244
|
+
Jx global.h 50;" d
|
245
|
+
LDSHARED Makefile /^LDSHARED = $(CC) -shared$/;" m
|
246
|
+
LIBPATH Makefile /^LIBPATH = -L"$(libdir)"$/;" m
|
247
|
+
LIBRUBY Makefile /^LIBRUBY = $(LIBRUBY_SO)$/;" m
|
248
|
+
LIBRUBYARG_SHARED Makefile /^LIBRUBYARG_SHARED = -l$(RUBY_SO_NAME)$/;" m
|
249
|
+
LIBRUBYARG_STATIC Makefile /^LIBRUBYARG_STATIC = -l$(RUBY_SO_NAME)-static$/;" m
|
250
|
+
LIBRUBY_A Makefile /^LIBRUBY_A = lib$(RUBY_SO_NAME)-static.a$/;" m
|
251
|
+
LIBS Makefile /^LIBS = $(LIBRUBYARG_SHARED) -lpthread -ldl -lcrypt -lm -lc$/;" m
|
252
|
+
LOCAL_LIBS Makefile /^LOCAL_LIBS = $/;" m
|
253
|
+
LOCK_OBTAIN_TIMEOUT fs_store.c 229;" d file:
|
254
|
+
LOCK_OBTAIN_TIMEOUT ram_store.c 353;" d file:
|
255
|
+
LOCK_PREFIX store.h 8;" d
|
256
|
+
LOW q_parser.c /^ LOW = 260,$/;" e enum:yytokentype file:
|
257
|
+
LOW q_parser.c 68;" d file:
|
258
|
+
Lock store.h /^struct Lock {$/;" s
|
259
|
+
Lock store.h /^typedef struct Lock Lock;$/;" t
|
260
|
+
MAKEDIRS Makefile /^MAKEDIRS = mkdir -p$/;" m
|
261
|
+
MATCH_ALL_QUERY search.h /^ MATCH_ALL_QUERY,$/;" e enum:QUERY_TYPE
|
262
|
+
MAX global.h 33;" d
|
263
|
+
MAX3 global.h 36;" d
|
264
|
+
MAX_BUFFER_SIZE global.h 24;" d
|
265
|
+
MAX_ERROR_LEN inc/lang.h 8;" d
|
266
|
+
MAX_ERROR_LEN lang.h 8;" d
|
267
|
+
MAX_FREE_HASH_TABLES hash.c 148;" d file:
|
268
|
+
MAX_FREE_HASH_TABLES hash.c 150;" d file:
|
269
|
+
MAX_PATH global.h 23;" d
|
270
|
+
MAX_WORD_SIZE global.h 22;" d
|
271
|
+
MEM_ERROR inc/lang.h 24;" d
|
272
|
+
MEM_ERROR lang.h 24;" d
|
273
|
+
MIN global.h 32;" d
|
274
|
+
MIN3 global.h 35;" d
|
275
|
+
MK_QUERY r_search.c 287;" d file:
|
276
|
+
MTDPE_POS_QUEUE_INIT_CAPA index.h 515;" d
|
277
|
+
MULTIPLIER hash.h 7;" d
|
278
|
+
MULTI_PHRASE_QUERY search.h /^ MULTI_PHRASE_QUERY,$/;" e enum:QUERY_TYPE
|
279
|
+
MUTEX_INITIALIZER inc/lang.h 28;" d
|
280
|
+
MUTEX_INITIALIZER lang.h 28;" d
|
281
|
+
MUTEX_RECURSIVE_INITIALIZER inc/lang.h 29;" d
|
282
|
+
MUTEX_RECURSIVE_INITIALIZER lang.h 29;" d
|
283
|
+
MatchAllScorer search.h /^typedef struct MatchAllScorer {$/;" s
|
284
|
+
MatchAllScorer search.h /^} MatchAllScorer;$/;" t
|
285
|
+
MultiPhraseQuery search.h /^typedef struct MultiPhraseQuery {$/;" s
|
286
|
+
MultiPhraseQuery search.h /^} MultiPhraseQuery;$/;" t
|
287
|
+
MultiReader index.h /^typedef struct MultiReader {$/;" s
|
288
|
+
MultiReader index.h /^} MultiReader;$/;" t
|
289
|
+
MultiTermDocEnum index.h /^struct MultiTermDocEnum {$/;" s
|
290
|
+
MultiTermDocEnum index.h /^typedef struct MultiTermDocEnum MultiTermDocEnum;$/;" t
|
291
|
+
MultiTermEnum index.h /^typedef struct MultiTermEnum {$/;" s
|
292
|
+
MultiTermEnum index.h /^} MultiTermEnum;$/;" t
|
293
|
+
MultipleTermDocPosEnum index.h /^} MultipleTermDocPosEnum;$/;" t
|
294
|
+
NELEMS global.h 27;" d
|
295
|
+
NOT q_parser.c /^ NOT = 263,$/;" e enum:yytokentype file:
|
296
|
+
NOT q_parser.c 71;" d file:
|
297
|
+
NUM_ENTRIES hash.h 6;" d
|
298
|
+
Norm index.h /^typedef struct Norm {$/;" s
|
299
|
+
Norm index.h /^} Norm;$/;" t
|
300
|
+
NormTester index_rw.c /^struct NormTester {$/;" s file:
|
301
|
+
OBJS Makefile /^OBJS = ferret.o lang.o r_analysis.o r_doc.o r_index_io.o r_qparser.o r_search.o r_store.o r_term.o analysis.o document.o compound_io.o index_rw.o termdocs.o vector.o field.o term.o q_parser.o q_const_score.o q_boolean.o q_match_all.o q_phrase.o q_fuzzy.o search.o ind.o q_multi_phrase.o q_wildcard.o q_range.o q_prefix.o q_span.o filter.o similarity.o sort.o q_term.o index_io.o fs_store.o ram_store.o store.o hashset.o array.o bitvector.o helper.o global.o hash.o priorityqueue.o q_filtered_query.o$/;" m
|
302
|
+
OMIT_NORMS field.c 143;" d file:
|
303
|
+
OR q_parser.c /^ OR = 261,$/;" e enum:yytokentype file:
|
304
|
+
OR q_parser.c 69;" d file:
|
305
|
+
OutStream store.h /^typedef struct OutStream {$/;" s
|
306
|
+
OutStream store.h /^} OutStream;$/;" t
|
307
|
+
PARSE_ERROR inc/lang.h 23;" d
|
308
|
+
PARSE_ERROR lang.h 23;" d
|
309
|
+
PERTURB_SHIFT hash.c 145;" d file:
|
310
|
+
PHQ_INIT_CAPA search.h 338;" d
|
311
|
+
PHRASE_CHARS q_parser.c /^static const char *PHRASE_CHARS = "<>|\\"";$/;" v file:
|
312
|
+
PHRASE_INIT_CAPA q_parser.c 132;" d file:
|
313
|
+
PHRASE_QUERY search.h /^ PHRASE_QUERY,$/;" e enum:QUERY_TYPE
|
314
|
+
PREFIX_QUERY search.h /^ PREFIX_QUERY,$/;" e enum:QUERY_TYPE
|
315
|
+
Phrase q_parser.c /^typedef struct Phrase {$/;" s file:
|
316
|
+
Phrase q_parser.c /^} Phrase;$/;" t file:
|
317
|
+
PhrasePosition search.h /^typedef struct PhrasePosition {$/;" s
|
318
|
+
PhrasePosition search.h /^} PhrasePosition;$/;" t
|
319
|
+
PhraseQuery search.h /^typedef struct PhraseQuery {$/;" s
|
320
|
+
PhraseQuery search.h /^} PhraseQuery;$/;" t
|
321
|
+
PhraseScorer search.h /^typedef struct PhraseScorer {$/;" s
|
322
|
+
PhraseScorer search.h /^} PhraseScorer;$/;" t
|
323
|
+
Posting index.h /^typedef struct Posting {$/;" s
|
324
|
+
Posting index.h /^} Posting;$/;" t
|
325
|
+
PriorityQueue priorityqueue.h /^typedef struct PriorityQueue {$/;" s
|
326
|
+
PriorityQueue priorityqueue.h /^} PriorityQueue;$/;" t
|
327
|
+
PriorityQueue2 priorityqueue.h /^typedef struct PriorityQueue2 {$/;" s
|
328
|
+
PriorityQueue2 priorityqueue.h /^} PriorityQueue2;$/;" t
|
329
|
+
QParser search.h /^typedef struct QParser {$/;" s
|
330
|
+
QParser search.h /^} QParser;$/;" t
|
331
|
+
QUERY_STRING_START_SIZE search.h 318;" d
|
332
|
+
QUERY_TYPE search.h /^enum QUERY_TYPE {$/;" g
|
333
|
+
Query search.h /^struct Query {$/;" s
|
334
|
+
Query search.h /^typedef struct Query Query;$/;" t
|
335
|
+
QueryFilter search.h /^typedef struct QueryFilter {$/;" s
|
336
|
+
QueryFilter search.h /^} QueryFilter;$/;" t
|
337
|
+
QueryUpdateArg r_search.c /^struct QueryUpdateArg {$/;" s file:
|
338
|
+
RANGE_QUERY search.h /^ RANGE_QUERY,$/;" e enum:QUERY_TYPE
|
339
|
+
RECAPA global.h 38;" d
|
340
|
+
REQ q_parser.c /^ REQ = 264,$/;" e enum:yytokentype file:
|
341
|
+
REQ q_parser.c 72;" d file:
|
342
|
+
RM Makefile /^RM = rm -f$/;" m
|
343
|
+
RTerm r_store.c /^typedef struct RTerm {$/;" s file:
|
344
|
+
RTerm r_store.c /^} RTerm;$/;" t file:
|
345
|
+
RTerm r_term.c /^typedef struct RTerm {$/;" s file:
|
346
|
+
RTerm r_term.c /^} RTerm;$/;" t file:
|
347
|
+
RToken r_analysis.c /^typedef struct RToken {$/;" s file:
|
348
|
+
RToken r_analysis.c /^} RToken;$/;" t file:
|
349
|
+
RUBY Makefile /^RUBY = $(ruby)$/;" m
|
350
|
+
RUBYARCHDIR Makefile /^RUBYARCHDIR = $(sitearchdir)$(target_prefix)$/;" m
|
351
|
+
RUBYCOMMONDIR Makefile /^RUBYCOMMONDIR = $(sitedir)$(target_prefix)$/;" m
|
352
|
+
RUBYLIBDIR Makefile /^RUBYLIBDIR = $(sitelibdir)$(target_prefix)$/;" m
|
353
|
+
RUBY_INSTALL_NAME Makefile /^RUBY_INSTALL_NAME = ruby1.8$/;" m
|
354
|
+
RUBY_SO_NAME Makefile /^RUBY_SO_NAME = ruby1.8$/;" m
|
355
|
+
RamFile ram_store.c /^typedef struct RamFile {$/;" s file:
|
356
|
+
RamFile ram_store.c /^} RamFile;$/;" t file:
|
357
|
+
Range search.h /^typedef struct Range {$/;" s
|
358
|
+
Range search.h /^} Range;$/;" t
|
359
|
+
ReqExclScorer search.h /^typedef struct ReqExclScorer {$/;" s
|
360
|
+
ReqExclScorer search.h /^} ReqExclScorer;$/;" t
|
361
|
+
ReqOptSumScorer search.h /^typedef struct ReqOptSumScorer {$/;" s
|
362
|
+
ReqOptSumScorer search.h /^} ReqOptSumScorer;$/;" t
|
363
|
+
SCORER_NULLIFY search.h 638;" d
|
364
|
+
SCORE_CACHE_SIZE search.h 663;" d
|
365
|
+
SEGMENT_FILENAME index_rw.c 473;" d file:
|
366
|
+
SEGMENT_NAME_MAX_LENGTH index.h 15;" d
|
367
|
+
SET_INT_ATTR r_index_io.c 420;" d file:
|
368
|
+
SHELL Makefile /^SHELL = \/bin\/sh$/;" m
|
369
|
+
SLOW_DOWN hash.h 30;" d
|
370
|
+
SNE_NEXT q_span.c 522;" d file:
|
371
|
+
SORT_FIELD_DOC sort.c /^SortField SORT_FIELD_DOC = {$/;" v
|
372
|
+
SORT_FIELD_DOC_REV sort.c /^SortField SORT_FIELD_DOC_REV = {$/;" v
|
373
|
+
SORT_FIELD_SCORE sort.c /^SortField SORT_FIELD_SCORE = {$/;" v
|
374
|
+
SORT_FIELD_SCORE_REV sort.c /^SortField SORT_FIELD_SCORE_REV = {$/;" v
|
375
|
+
SORT_TYPE search.h /^enum SORT_TYPE {$/;" g
|
376
|
+
SORT_TYPE_AUTO search.h /^ SORT_TYPE_AUTO$/;" e enum:SORT_TYPE
|
377
|
+
SORT_TYPE_DOC search.h /^ SORT_TYPE_DOC,$/;" e enum:SORT_TYPE
|
378
|
+
SORT_TYPE_FLOAT search.h /^ SORT_TYPE_FLOAT,$/;" e enum:SORT_TYPE
|
379
|
+
SORT_TYPE_INTEGER search.h /^ SORT_TYPE_INTEGER,$/;" e enum:SORT_TYPE
|
380
|
+
SORT_TYPE_SCORE search.h /^ SORT_TYPE_SCORE,$/;" e enum:SORT_TYPE
|
381
|
+
SORT_TYPE_STRING search.h /^ SORT_TYPE_STRING,$/;" e enum:SORT_TYPE
|
382
|
+
SPAN_FIRST_QUERY search.h /^ SPAN_FIRST_QUERY,$/;" e enum:QUERY_TYPE
|
383
|
+
SPAN_NEAR_QUERY search.h /^ SPAN_NEAR_QUERY$/;" e enum:QUERY_TYPE
|
384
|
+
SPAN_NOT_QUERY search.h /^ SPAN_NOT_QUERY,$/;" e enum:QUERY_TYPE
|
385
|
+
SPAN_OR_QUERY search.h /^ SPAN_OR_QUERY,$/;" e enum:QUERY_TYPE
|
386
|
+
SPAN_TERM_QUERY search.h /^ SPAN_TERM_QUERY,$/;" e enum:QUERY_TYPE
|
387
|
+
SRCS Makefile /^SRCS = ferret.c lang.c r_analysis.c r_doc.c r_index_io.c r_qparser.c r_search.c r_store.c r_term.c analysis.c document.c compound_io.c index_rw.c termdocs.c vector.c field.c term.c q_parser.c q_const_score.c q_boolean.c q_match_all.c q_phrase.c q_fuzzy.c search.c ind.c q_multi_phrase.c q_wildcard.c q_range.c q_prefix.c q_span.c filter.c similarity.c sort.c q_term.c index_io.c fs_store.c ram_store.c store.c hashset.c array.c bitvector.c helper.c global.c hash.c priorityqueue.c q_filtered_query.c$/;" m
|
388
|
+
STATE_ERROR inc/lang.h 22;" d
|
389
|
+
STATE_ERROR lang.h 22;" d
|
390
|
+
STATIC_LIB Makefile /^STATIC_LIB = $/;" m
|
391
|
+
STORE_OFFSET field.c 142;" d file:
|
392
|
+
STORE_OFFSET_WITH_TERMVECTOR index.h 362;" d
|
393
|
+
STORE_POS field.c 141;" d file:
|
394
|
+
STORE_POSITIONS_WITH_TERMVECTOR index.h 361;" d
|
395
|
+
STORE_TV field.c 140;" d file:
|
396
|
+
ScoredTerm q_fuzzy.c /^typedef struct ScoredTerm {$/;" s file:
|
397
|
+
ScoredTerm q_fuzzy.c /^} ScoredTerm;$/;" t file:
|
398
|
+
Scorer search.h /^struct Scorer {$/;" s
|
399
|
+
Scorer search.h /^typedef struct Scorer Scorer;$/;" t
|
400
|
+
Searcher search.h /^struct Searcher {$/;" s
|
401
|
+
Searcher search.h /^typedef struct Searcher Searcher;$/;" t
|
402
|
+
SegmentInfo index.h /^typedef struct SegmentInfo {$/;" s
|
403
|
+
SegmentInfo index.h /^} SegmentInfo;$/;" t
|
404
|
+
SegmentInfos index.h /^typedef struct SegmentInfos {$/;" s
|
405
|
+
SegmentInfos index.h /^} SegmentInfos;$/;" t
|
406
|
+
SegmentMergeInfo index.h /^typedef struct SegmentMergeInfo {$/;" s
|
407
|
+
SegmentMergeInfo index.h /^} SegmentMergeInfo;$/;" t
|
408
|
+
SegmentMerger index.h /^typedef struct SegmentMerger {$/;" s
|
409
|
+
SegmentMerger index.h /^} SegmentMerger;$/;" t
|
410
|
+
SegmentReader index.h /^struct SegmentReader {$/;" s
|
411
|
+
SegmentReader index.h /^typedef struct SegmentReader SegmentReader;$/;" t
|
412
|
+
SegmentTermDocEnum index.h /^struct SegmentTermDocEnum {$/;" s
|
413
|
+
SegmentTermDocEnum index.h /^typedef struct SegmentTermDocEnum SegmentTermDocEnum;$/;" t
|
414
|
+
SegmentTermEnum index.h /^typedef struct SegmentTermEnum {$/;" s
|
415
|
+
SegmentTermEnum index.h /^} SegmentTermEnum;$/;" t
|
416
|
+
Similarity search.h /^struct Similarity {$/;" s
|
417
|
+
Similarity search.h /^typedef struct Similarity Similarity;$/;" t
|
418
|
+
SingleMatchScorer search.h /^typedef struct SingleMatchScorer {$/;" s
|
419
|
+
SingleMatchScorer search.h /^} SingleMatchScorer;$/;" t
|
420
|
+
Sort search.h /^typedef struct Sort {$/;" s
|
421
|
+
Sort search.h /^} Sort;$/;" t
|
422
|
+
SortField search.h /^typedef struct SortField {$/;" s
|
423
|
+
SortField search.h /^} SortField;$/;" t
|
424
|
+
Sorter sort.c /^typedef struct Sorter {$/;" s file:
|
425
|
+
Sorter sort.c /^} Sorter;$/;" t file:
|
426
|
+
SpanEnum search.h /^struct SpanEnum {$/;" s
|
427
|
+
SpanEnum search.h /^typedef struct SpanEnum SpanEnum;$/;" t
|
428
|
+
SpanEnumCell search.h /^typedef struct SpanEnumCell {$/;" s
|
429
|
+
SpanEnumCell search.h /^} SpanEnumCell;$/;" t
|
430
|
+
SpanFirstQuery search.h /^typedef struct SpanFirstQuery {$/;" s
|
431
|
+
SpanFirstQuery search.h /^} SpanFirstQuery;$/;" t
|
432
|
+
SpanNearEnum search.h /^typedef struct SpanNearEnum {$/;" s
|
433
|
+
SpanNearEnum search.h /^} SpanNearEnum;$/;" t
|
434
|
+
SpanNearQuery search.h /^typedef struct SpanNearQuery {$/;" s
|
435
|
+
SpanNearQuery search.h /^} SpanNearQuery;$/;" t
|
436
|
+
SpanNotEnum search.h /^typedef struct SpanNotEnum {$/;" s
|
437
|
+
SpanNotEnum search.h /^} SpanNotEnum;$/;" t
|
438
|
+
SpanNotQuery search.h /^typedef struct SpanNotQuery {$/;" s
|
439
|
+
SpanNotQuery search.h /^} SpanNotQuery;$/;" t
|
440
|
+
SpanOrEnum search.h /^typedef struct SpanOrEnum {$/;" s
|
441
|
+
SpanOrEnum search.h /^} SpanOrEnum;$/;" t
|
442
|
+
SpanOrQuery search.h /^typedef struct SpanOrQuery {$/;" s
|
443
|
+
SpanOrQuery search.h /^} SpanOrQuery;$/;" t
|
444
|
+
SpanQuery search.h /^struct SpanQuery {$/;" s
|
445
|
+
SpanQuery search.h /^typedef struct SpanQuery SpanQuery;$/;" t
|
446
|
+
SpanScorer search.h /^typedef struct SpanScorer {$/;" s
|
447
|
+
SpanScorer search.h /^} SpanScorer;$/;" t
|
448
|
+
SpanTermEnum search.h /^struct SpanTermEnum {$/;" s
|
449
|
+
SpanTermEnum search.h /^typedef struct SpanTermEnum SpanTermEnum;$/;" t
|
450
|
+
Store store.h /^struct Store {$/;" s
|
451
|
+
Store store.h /^typedef struct Store Store;$/;" t
|
452
|
+
StringIndex sort.c /^typedef struct StringIndex {$/;" s file:
|
453
|
+
StringIndex sort.c /^} StringIndex;$/;" t file:
|
454
|
+
TARGET Makefile /^TARGET = ferret_ext$/;" m
|
455
|
+
TARGET_SO Makefile /^TARGET_SO = $(DLLIB)$/;" m
|
456
|
+
TDE_READ_SIZE search.h 664;" d
|
457
|
+
TEMPORARY_SEGMENT_FILENAME index_rw.c 474;" d file:
|
458
|
+
TERM_ARR_START_SIZE vector.c 5;" d file:
|
459
|
+
TERM_INFO_FORMAT index.h 233;" d
|
460
|
+
TERM_QUERY search.h /^ TERM_QUERY,$/;" e enum:QUERY_TYPE
|
461
|
+
TVD_EXTENSION index.h 368;" d
|
462
|
+
TVF_EXTENSION index.h 369;" d
|
463
|
+
TVField index.h /^typedef struct TVField {$/;" s
|
464
|
+
TVField index.h /^} TVField;$/;" t
|
465
|
+
TVOffsetInfo index.h /^typedef struct TVOffsetInfo {$/;" s
|
466
|
+
TVOffsetInfo index.h /^} TVOffsetInfo;$/;" t
|
467
|
+
TVTerm index.h /^typedef struct TVTerm {$/;" s
|
468
|
+
TVTerm index.h /^} TVTerm;$/;" t
|
469
|
+
TVX_EXTENSION index.h 367;" d
|
470
|
+
TYPICAL_LONGEST_WORD search.h 397;" d
|
471
|
+
Term index.h /^typedef struct Term {$/;" s
|
472
|
+
Term index.h /^} Term;$/;" t
|
473
|
+
TermBuffer index.h /^typedef struct TermBuffer {$/;" s
|
474
|
+
TermBuffer index.h /^} TermBuffer;$/;" t
|
475
|
+
TermDocEnum index.h /^struct TermDocEnum {$/;" s
|
476
|
+
TermDocEnum index.h /^typedef struct TermDocEnum TermDocEnum;$/;" t
|
477
|
+
TermEnum index.h /^struct TermEnum {$/;" s
|
478
|
+
TermEnum index.h /^typedef struct TermEnum TermEnum;$/;" t
|
479
|
+
TermEnumFilter index.h /^typedef struct TermEnumFilter TermEnumFilter;$/;" t
|
480
|
+
TermInfo index.h /^typedef struct TermInfo {$/;" s
|
481
|
+
TermInfo index.h /^} TermInfo;$/;" t
|
482
|
+
TermInfosReader index.h /^typedef struct TermInfosReader {$/;" s
|
483
|
+
TermInfosReader index.h /^} TermInfosReader;$/;" t
|
484
|
+
TermInfosWriter index.h /^typedef struct TermInfosWriter {$/;" s
|
485
|
+
TermInfosWriter index.h /^} TermInfosWriter;$/;" t
|
486
|
+
TermQuery search.h /^typedef struct TermQuery {$/;" s
|
487
|
+
TermQuery search.h /^} TermQuery;$/;" t
|
488
|
+
TermScorer search.h /^typedef struct TermScorer {$/;" s
|
489
|
+
TermScorer search.h /^} TermScorer;$/;" t
|
490
|
+
TermVector index.h /^typedef struct TermVector {$/;" s
|
491
|
+
TermVector index.h /^} TermVector;$/;" t
|
492
|
+
TermVectorsReader index.h /^typedef struct TermVectorsReader {$/;" s
|
493
|
+
TermVectorsReader index.h /^} TermVectorsReader;$/;" t
|
494
|
+
TermVectorsWriter index.h /^typedef struct TermVectorsWriter {$/;" s
|
495
|
+
TermVectorsWriter index.h /^} TermVectorsWriter;$/;" t
|
496
|
+
Token analysis.h /^typedef struct Token {$/;" s
|
497
|
+
Token analysis.h /^} Token;$/;" t
|
498
|
+
TokenStream analysis.h /^struct TokenStream {$/;" s
|
499
|
+
TokenStream analysis.h /^typedef struct TokenStream TokenStream;$/;" t
|
500
|
+
TopDocs search.h /^typedef struct TopDocs {$/;" s
|
501
|
+
TopDocs search.h /^} TopDocs;$/;" t
|
502
|
+
UNSUPPORTED_ERROR inc/lang.h 21;" d
|
503
|
+
UNSUPPORTED_ERROR lang.h 21;" d
|
504
|
+
VALGRIND global.h 11;" d
|
505
|
+
VALUES_ARRAY_START_SIZE sort.c 267;" d file:
|
506
|
+
VECTOR_EXTENSIONS index_rw.c /^const char *VECTOR_EXTENSIONS[] = {$/;" v
|
507
|
+
VINT_END store.h 11;" d
|
508
|
+
VINT_MAX_LEN store.h 10;" d
|
509
|
+
VPATH Makefile /^VPATH = $(srcdir):$(topdir):$(hdrdir)$/;" m
|
510
|
+
WFileEntry compound_io.c /^typedef struct WFileEntry {$/;" s file:
|
511
|
+
WFileEntry compound_io.c /^} WFileEntry;$/;" t file:
|
512
|
+
WILD_CARD_QUERY search.h /^ WILD_CARD_QUERY,$/;" e enum:QUERY_TYPE
|
513
|
+
WILD_CHAR search.h 384;" d
|
514
|
+
WILD_STR q_parser.c /^ WILD_STR = 259,$/;" e enum:yytokentype file:
|
515
|
+
WILD_STR q_parser.c 67;" d file:
|
516
|
+
WILD_STRING search.h 385;" d
|
517
|
+
WORD q_parser.c /^ WORD = 258,$/;" e enum:yytokentype file:
|
518
|
+
WORD q_parser.c 66;" d file:
|
519
|
+
WRITE_LOCK_NAME index.h 836;" d
|
520
|
+
Weight search.h /^struct Weight {$/;" s
|
521
|
+
Weight search.h /^typedef struct Weight Weight;$/;" t
|
522
|
+
Xj global.h 51;" d
|
523
|
+
YYABORT q_parser.c 536;" d file:
|
524
|
+
YYACCEPT q_parser.c 535;" d file:
|
525
|
+
YYBACKUP q_parser.c 548;" d file:
|
526
|
+
YYBISON q_parser.c 37;" d file:
|
527
|
+
YYCOPY q_parser.c 239;" d file:
|
528
|
+
YYCOPY q_parser.c 242;" d file:
|
529
|
+
YYDEBUG q_parser.c 96;" d file:
|
530
|
+
YYDPRINTF q_parser.c 628;" d file:
|
531
|
+
YYDPRINTF q_parser.c 706;" d file:
|
532
|
+
YYEMPTY q_parser.c 532;" d file:
|
533
|
+
YYEOF q_parser.c 533;" d file:
|
534
|
+
YYERRCODE q_parser.c 567;" d file:
|
535
|
+
YYERROR q_parser.c 537;" d file:
|
536
|
+
YYERROR_VERBOSE q_parser.c 101;" d file:
|
537
|
+
YYERROR_VERBOSE q_parser.c 102;" d file:
|
538
|
+
YYERROR_VERBOSE q_parser.c 104;" d file:
|
539
|
+
YYFAIL q_parser.c 544;" d file:
|
540
|
+
YYFINAL q_parser.c 278;" d file:
|
541
|
+
YYFPRINTF q_parser.c 625;" d file:
|
542
|
+
YYFREE q_parser.c 183;" d file:
|
543
|
+
YYINITDEPTH q_parser.c 715;" d file:
|
544
|
+
YYLAST q_parser.c 280;" d file:
|
545
|
+
YYLEX q_parser.c 615;" d file:
|
546
|
+
YYLEX q_parser.c 617;" d file:
|
547
|
+
YYLLOC_DEFAULT q_parser.c 576;" d file:
|
548
|
+
YYLSP_NEEDED q_parser.c 46;" d file:
|
549
|
+
YYMALLOC q_parser.c 186;" d file:
|
550
|
+
YYMAXDEPTH q_parser.c 726;" d file:
|
551
|
+
YYMAXUTOK q_parser.c 293;" d file:
|
552
|
+
YYNNTS q_parser.c 285;" d file:
|
553
|
+
YYNRULES q_parser.c 287;" d file:
|
554
|
+
YYNSTATES q_parser.c 289;" d file:
|
555
|
+
YYNTOKENS q_parser.c 283;" d file:
|
556
|
+
YYPACT_NINF q_parser.c 447;" d file:
|
557
|
+
YYPOPSTACK q_parser.c 935;" d file:
|
558
|
+
YYPURE q_parser.c 43;" d file:
|
559
|
+
YYRECOVERING q_parser.c 546;" d file:
|
560
|
+
YYRHSLOC q_parser.c 574;" d file:
|
561
|
+
YYSIZE_T q_parser.c 207;" d file:
|
562
|
+
YYSIZE_T q_parser.c 515;" d file:
|
563
|
+
YYSIZE_T q_parser.c 518;" d file:
|
564
|
+
YYSIZE_T q_parser.c 523;" d file:
|
565
|
+
YYSIZE_T q_parser.c 527;" d file:
|
566
|
+
YYSKELETON_NAME q_parser.c 40;" d file:
|
567
|
+
YYSTACK_ALLOC q_parser.c 194;" d file:
|
568
|
+
YYSTACK_ALLOC q_parser.c 196;" d file:
|
569
|
+
YYSTACK_ALLOC q_parser.c 209;" d file:
|
570
|
+
YYSTACK_BYTES q_parser.c 231;" d file:
|
571
|
+
YYSTACK_FREE q_parser.c 203;" d file:
|
572
|
+
YYSTACK_FREE q_parser.c 210;" d file:
|
573
|
+
YYSTACK_GAP_MAXIMUM q_parser.c 227;" d file:
|
574
|
+
YYSTACK_RELOCATE q_parser.c 1027;" d file:
|
575
|
+
YYSTACK_RELOCATE q_parser.c 258;" d file:
|
576
|
+
YYSTYPE q_parser.c /^typedef union YYSTYPE {$/;" u file:
|
577
|
+
YYSTYPE q_parser.c /^} YYSTYPE;$/;" t file:
|
578
|
+
YYSTYPE_IS_DECLARED q_parser.c 120;" d file:
|
579
|
+
YYSTYPE_IS_TRIVIAL q_parser.c 121;" d file:
|
580
|
+
YYTABLE_NINF q_parser.c 471;" d file:
|
581
|
+
YYTERROR q_parser.c 566;" d file:
|
582
|
+
YYTOKENTYPE q_parser.c 52;" d file:
|
583
|
+
YYTRANSLATE q_parser.c 295;" d file:
|
584
|
+
YYUNDEFTOK q_parser.c 292;" d file:
|
585
|
+
YY_LOCATION_PRINT q_parser.c 602;" d file:
|
586
|
+
YY_LOCATION_PRINT q_parser.c 607;" d file:
|
587
|
+
YY_REDUCE_PRINT q_parser.c 696;" d file:
|
588
|
+
YY_REDUCE_PRINT q_parser.c 709;" d file:
|
589
|
+
YY_STACK_PRINT q_parser.c 666;" d file:
|
590
|
+
YY_STACK_PRINT q_parser.c 708;" d file:
|
591
|
+
YY_SYMBOL_PRINT q_parser.c 634;" d file:
|
592
|
+
YY_SYMBOL_PRINT q_parser.c 707;" d file:
|
593
|
+
ZEROSET global.h 29;" d
|
594
|
+
__FERRET_H_ ferret.h 2;" d
|
595
|
+
a_destroy analysis.h 68;" d
|
596
|
+
a_get_ts analysis.h 69;" d
|
597
|
+
a_standard_destroy analysis.c /^void a_standard_destroy(void *p)$/;" f
|
598
|
+
a_standard_get_ts analysis.c /^TokenStream *a_standard_get_ts(Analyzer *a, char *field, char *text)$/;" f
|
599
|
+
acquire_write_lock index.h /^ void (*acquire_write_lock)(IndexReader *ir);$/;" m struct:IndexReader
|
600
|
+
add_and_cls q_parser.c /^Array *add_and_cls(Array *clauses, BooleanClause *clause)$/;" f
|
601
|
+
add_default_cls q_parser.c /^Array *add_default_cls(QParser *qp, Array *clauses, BooleanClause *clause)$/;" f
|
602
|
+
add_field q_parser.c /^HashSet *add_field(QParser *qp, char *field)$/;" f
|
603
|
+
add_or_cls q_parser.c /^Array *add_or_cls(Array *clauses, BooleanClause *clause)$/;" f
|
604
|
+
alive ram_store.c /^ bool alive;$/;" m struct:RamFile file:
|
605
|
+
all_fields search.h /^ HashSet *all_fields;$/;" m struct:QParser
|
606
|
+
allocated array.h /^ int allocated;$/;" m struct:Array
|
607
|
+
allow_any_fields search.h /^ bool allow_any_fields : 1;$/;" m struct:QParser
|
608
|
+
analyzer index.h /^ Analyzer *analyzer;$/;" m struct:DocumentWriter
|
609
|
+
analyzer index.h /^ Analyzer *analyzer;$/;" m struct:IndexWriter
|
610
|
+
analyzer search.h /^ Analyzer *analyzer;$/;" m struct:Index
|
611
|
+
analyzer search.h /^ Analyzer *analyzer;$/;" m struct:QParser
|
612
|
+
arch Makefile /^arch = i486-linux$/;" m
|
613
|
+
archdir Makefile /^archdir = $(rubylibdir)\/$(arch)$/;" m
|
614
|
+
array q_parser.c /^ Array *array;$/;" m union:YYSTYPE file:
|
615
|
+
ary_append array.c /^void ary_append(Array *ary, void *value)$/;" f
|
616
|
+
ary_create array.c /^Array *ary_create(int allocate, void (*free_elem)(void *p))$/;" f
|
617
|
+
ary_delete array.c /^void ary_delete(Array *ary, int index)$/;" f
|
618
|
+
ary_destroy array.c /^void ary_destroy(void *p)$/;" f
|
619
|
+
ary_get array.c /^void *ary_get(Array *ary, int index)$/;" f
|
620
|
+
ary_remove array.c /^void *ary_remove(Array *ary, int index)$/;" f
|
621
|
+
ary_set array.c /^void ary_set(Array *ary, int index, void *value)$/;" f
|
622
|
+
auto_flush search.h /^ bool auto_flush : 1;$/;" m struct:Index
|
623
|
+
base index.h /^ int base;$/;" m struct:MultiTermDocEnum
|
624
|
+
base index.h /^ int base;$/;" m struct:SegmentMergeInfo
|
625
|
+
base36_digitmap index_rw.c /^const char base36_digitmap[] = "0123456789abcdefghijklmnopqrstuvwxyz";$/;" v
|
626
|
+
bc_create q_boolean.c /^BooleanClause *bc_create(Query *query, unsigned int occur)$/;" f
|
627
|
+
bc_set_occur q_boolean.c /^void bc_set_occur(BooleanClause *self, unsigned int occur)$/;" f
|
628
|
+
bcls q_parser.c /^ BooleanClause *bcls;$/;" m union:YYSTYPE file:
|
629
|
+
bindir Makefile /^bindir = $(exec_prefix)\/bin$/;" m
|
630
|
+
bits bitvector.h /^ uchar *bits;$/;" m struct:BitVector
|
631
|
+
blen document.h /^ int blen; \/\/ This is used for binary fields only to store the data length$/;" m struct:DocField
|
632
|
+
bool global.h /^typedef unsigned char bool;$/;" t
|
633
|
+
boost document.h /^ float boost;$/;" m struct:DocField
|
634
|
+
boost document.h /^ float boost;$/;" m struct:Document
|
635
|
+
boost search.h /^ float boost;$/;" m struct:Query
|
636
|
+
bq_add_query q_boolean.c /^void bq_add_query(Query *self, Query *sub_query, unsigned int occur)$/;" f
|
637
|
+
bq_coord_disabled q_boolean.c /^float bq_coord_disabled(Similarity *sim, int overlap, int max_overlap)$/;" f
|
638
|
+
bq_create q_boolean.c /^Query *bq_create(bool coord_disabled)$/;" f
|
639
|
+
bq_destroy q_boolean.c /^void bq_destroy(void *p)$/;" f
|
640
|
+
bq_extract_terms q_boolean.c /^void bq_extract_terms(Query *self, Array *terms)$/;" f
|
641
|
+
bq_get_similarity q_boolean.c /^Similarity *bq_get_similarity(Query *self, Searcher *searcher)$/;" f
|
642
|
+
bq_rewrite q_boolean.c /^Query *bq_rewrite(Query *self, IndexReader *ir)$/;" f
|
643
|
+
bq_to_s q_boolean.c /^char *bq_to_s(Query *self, char *field)$/;" f
|
644
|
+
bsc_add_scorer q_boolean.c /^void bsc_add_scorer(Scorer *self, Scorer *scorer, unsigned int occur) $/;" f
|
645
|
+
bsc_create q_boolean.c /^Scorer *bsc_create(Similarity *similarity)$/;" f
|
646
|
+
bsc_destroy q_boolean.c /^void bsc_destroy(void *p)$/;" f
|
647
|
+
bsc_explain q_boolean.c /^Explanation *bsc_explain(Scorer *self, int doc_num)$/;" f
|
648
|
+
bsc_init_counting_sum_scorer q_boolean.c /^void bsc_init_counting_sum_scorer(BooleanScorer *bsc)$/;" f
|
649
|
+
bsc_next q_boolean.c /^bool bsc_next(Scorer *self)$/;" f
|
650
|
+
bsc_score q_boolean.c /^float bsc_score(Scorer *self)$/;" f
|
651
|
+
bsc_skip_to q_boolean.c /^bool bsc_skip_to(Scorer *self, int doc_num)$/;" f
|
652
|
+
buf search.h /^ char buf[CONC_WORDS][MAX_WORD_SIZE];$/;" m struct:QParser
|
653
|
+
buf store.h /^ Buffer buf;$/;" m struct:InStream
|
654
|
+
buf store.h /^ Buffer buf;$/;" m struct:OutStream
|
655
|
+
buf store.h /^ uchar buf[BUFFER_SIZE];$/;" m struct:Buffer
|
656
|
+
buf_create index_io.c /^Buffer *buf_create()$/;" f
|
657
|
+
buf_destroy index_io.c /^void buf_destroy(Buffer *buf)$/;" f
|
658
|
+
buf_index search.h /^ int buf_index;$/;" m struct:QParser
|
659
|
+
bufcnt ram_store.c /^ int bufcnt;$/;" m struct:RamFile file:
|
660
|
+
buffers ram_store.c /^ uchar **buffers;$/;" m struct:RamFile file:
|
661
|
+
bv q_filtered_query.c /^ BitVector *bv;$/;" m struct:FilteredQueryScorer file:
|
662
|
+
bv search.h /^ BitVector *bv;$/;" m struct:ConstantScoreScorer
|
663
|
+
bv_clear bitvector.c /^void bv_clear(BitVector *bv)$/;" f
|
664
|
+
bv_count bitvector.c /^int bv_count(BitVector *bv) $/;" f
|
665
|
+
bv_create bitvector.c /^BitVector *bv_create()$/;" f
|
666
|
+
bv_create_size bitvector.c /^BitVector *bv_create_size(int size)$/;" f
|
667
|
+
bv_destroy bitvector.c /^void bv_destroy(void *p)$/;" f
|
668
|
+
bv_get bitvector.c /^int bv_get(BitVector *bv, int bit)$/;" f
|
669
|
+
bv_read bitvector.c /^BitVector *bv_read(Store *store, char *name)$/;" f
|
670
|
+
bv_scan_next bitvector.c /^inline int bv_scan_next(BitVector *bv)$/;" f
|
671
|
+
bv_scan_next_from bitvector.c /^inline int bv_scan_next_from(BitVector *bv, register const int from)$/;" f
|
672
|
+
bv_scan_reset bitvector.c /^void bv_scan_reset(BitVector *bv)$/;" f
|
673
|
+
bv_set bitvector.c /^void bv_set(BitVector *bv, int bit)$/;" f
|
674
|
+
bv_unset bitvector.c /^void bv_unset(BitVector *bv, int bit)$/;" f
|
675
|
+
bv_write bitvector.c /^void bv_write(BitVector *bv, Store *store, char *name)$/;" f
|
676
|
+
bw_create q_boolean.c /^Weight *bw_create(Query *query, Searcher *searcher)$/;" f
|
677
|
+
bw_destroy q_boolean.c /^void bw_destroy(void *p)$/;" f
|
678
|
+
bw_explain q_boolean.c /^Explanation *bw_explain(Weight *self, IndexReader *ir, int doc_num)$/;" f
|
679
|
+
bw_normalize q_boolean.c /^void bw_normalize(Weight *self, float normalization_factor)$/;" f
|
680
|
+
bw_scorer q_boolean.c /^Scorer *bw_scorer(Weight *self, IndexReader *ir)$/;" f
|
681
|
+
bw_sum_of_squared_weights q_boolean.c /^float bw_sum_of_squared_weights(Weight *self)$/;" f
|
682
|
+
bw_to_s q_boolean.c /^char *bw_to_s(Weight *self)$/;" f
|
683
|
+
by_name index.h /^ HashEntry **by_name;$/;" m struct:FieldInfos
|
684
|
+
by_number index.h /^ FieldInfo **by_number;$/;" m struct:FieldInfos
|
685
|
+
byte_to_float similarity.c /^float byte_to_float(uchar b)$/;" f
|
686
|
+
bytes index.h /^ uchar *bytes;$/;" m struct:Norm
|
687
|
+
cAnalyzer r_analysis.c /^static VALUE cAnalyzer;$/;" v file:
|
688
|
+
cBCOccur r_search.c /^static VALUE cBCOccur;$/;" v file:
|
689
|
+
cBooleanClause r_search.c /^static VALUE cBooleanClause;$/;" v file:
|
690
|
+
cBooleanQuery r_search.c /^static VALUE cBooleanQuery;$/;" v file:
|
691
|
+
cConstantScoreQuery r_search.c /^static VALUE cConstantScoreQuery;$/;" v file:
|
692
|
+
cDirectory r_store.c /^VALUE cDirectory;$/;" v
|
693
|
+
cDocument r_doc.c /^VALUE cDocument;$/;" v
|
694
|
+
cExplanation r_search.c /^static VALUE cExplanation;$/;" v file:
|
695
|
+
cFSDirectory r_store.c /^VALUE cFSDirectory;$/;" v
|
696
|
+
cField r_doc.c /^VALUE cField;$/;" v
|
697
|
+
cFieldIndex r_doc.c /^VALUE cFieldIndex;$/;" v
|
698
|
+
cFieldStore r_doc.c /^VALUE cFieldStore;$/;" v
|
699
|
+
cFieldTermVector r_doc.c /^VALUE cFieldTermVector;$/;" v
|
700
|
+
cFilter r_search.c /^static VALUE cFilter;$/;" v file:
|
701
|
+
cFilteredQuery r_search.c /^static VALUE cFilteredQuery;$/;" v file:
|
702
|
+
cFuzzyQuery r_search.c /^static VALUE cFuzzyQuery;$/;" v file:
|
703
|
+
cIndex r_search.c /^static VALUE cIndex;$/;" v file:
|
704
|
+
cIndexReader r_index_io.c /^VALUE cIndexReader;$/;" v
|
705
|
+
cIndexSearcher r_search.c /^static VALUE cIndexSearcher;$/;" v file:
|
706
|
+
cIndexWriter r_index_io.c /^VALUE cIndexWriter;$/;" v
|
707
|
+
cLetterAnalyzer r_analysis.c /^static VALUE cLetterAnalyzer;$/;" v file:
|
708
|
+
cLetterTokenizer r_analysis.c /^static VALUE cLetterTokenizer;$/;" v file:
|
709
|
+
cLock r_store.c /^VALUE cLock;$/;" v
|
710
|
+
cMatchAllQuery r_search.c /^static VALUE cMatchAllQuery;$/;" v file:
|
711
|
+
cMultiPhraseQuery r_search.c /^static VALUE cMultiPhraseQuery;$/;" v file:
|
712
|
+
cPhraseQuery r_search.c /^static VALUE cPhraseQuery;$/;" v file:
|
713
|
+
cPrefixQuery r_search.c /^static VALUE cPrefixQuery;$/;" v file:
|
714
|
+
cQuery r_search.c /^static VALUE cQuery;$/;" v file:
|
715
|
+
cQueryFilter r_search.c /^static VALUE cQueryFilter;$/;" v file:
|
716
|
+
cQueryParseException r_qparser.c /^VALUE cQueryParseException;$/;" v
|
717
|
+
cQueryParser r_qparser.c /^static VALUE cQueryParser;$/;" v file:
|
718
|
+
cRAMDirectory r_store.c /^VALUE cRAMDirectory;$/;" v
|
719
|
+
cRangeFilter r_search.c /^static VALUE cRangeFilter;$/;" v file:
|
720
|
+
cRangeQuery r_search.c /^static VALUE cRangeQuery;$/;" v file:
|
721
|
+
cScoreDoc r_search.c /^static VALUE cScoreDoc;$/;" v file:
|
722
|
+
cSort r_search.c /^static VALUE cSort;$/;" v file:
|
723
|
+
cSortField r_search.c /^static VALUE cSortField;$/;" v file:
|
724
|
+
cSortType r_search.c /^static VALUE cSortType;$/;" v file:
|
725
|
+
cSpanFirstQuery r_search.c /^static VALUE cSpanFirstQuery;$/;" v file:
|
726
|
+
cSpanNearQuery r_search.c /^static VALUE cSpanNearQuery;$/;" v file:
|
727
|
+
cSpanNotQuery r_search.c /^static VALUE cSpanNotQuery;$/;" v file:
|
728
|
+
cSpanOrQuery r_search.c /^static VALUE cSpanOrQuery;$/;" v file:
|
729
|
+
cSpanTermQuery r_search.c /^static VALUE cSpanTermQuery;$/;" v file:
|
730
|
+
cStandardAnalyzer r_analysis.c /^static VALUE cStandardAnalyzer;$/;" v file:
|
731
|
+
cTVOffsetInfo r_index_io.c /^VALUE cTVOffsetInfo;$/;" v
|
732
|
+
cTerm r_term.c /^VALUE cTerm;$/;" v
|
733
|
+
cTermDocEnum r_index_io.c /^VALUE cTermDocEnum;$/;" v
|
734
|
+
cTermEnum r_index_io.c /^VALUE cTermEnum;$/;" v
|
735
|
+
cTermQuery r_search.c /^static VALUE cTermQuery;$/;" v file:
|
736
|
+
cTermVector r_index_io.c /^VALUE cTermVector;$/;" v
|
737
|
+
cToken r_analysis.c /^static VALUE cToken;$/;" v file:
|
738
|
+
cTopDocs r_search.c /^static VALUE cTopDocs;$/;" v file:
|
739
|
+
cWhiteSpaceAnalyzer r_analysis.c /^static VALUE cWhiteSpaceAnalyzer;$/;" v file:
|
740
|
+
cWildCardQuery r_search.c /^static VALUE cWildCardQuery;$/;" v file:
|
741
|
+
c_cnt search.h /^ int c_cnt;$/;" m struct:SpanNearQuery
|
742
|
+
c_cnt search.h /^ int c_cnt;$/;" m struct:SpanOrQuery
|
743
|
+
c_cnt sort.c /^ int c_cnt;$/;" m struct:Sorter file:
|
744
|
+
cache index.h /^ HshTable *cache;$/;" m struct:IndexReader
|
745
|
+
cache search.h /^ HshTable *cache;$/;" m struct:Filter
|
746
|
+
capa bitvector.h /^ int capa;$/;" m struct:BitVector
|
747
|
+
capa hashset.h /^ int capa;$/;" m struct:HashSet
|
748
|
+
capa q_parser.c /^ int capa;$/;" m struct:Phrase file:
|
749
|
+
ccsc_score q_boolean.c /^float ccsc_score(Scorer *self)$/;" f
|
750
|
+
cdssc_score q_boolean.c /^float cdssc_score(Scorer *self)$/;" f
|
751
|
+
cfs_store index.h /^ Store *cfs_store;$/;" m struct:SegmentReader
|
752
|
+
cis store.h /^ CompoundInStream *cis;$/;" m union:InStream::<anonymous>
|
753
|
+
clause_capa search.h /^ int clause_capa;$/;" m struct:BooleanQuery
|
754
|
+
clause_cnt search.h /^ int clause_cnt;$/;" m struct:BooleanQuery
|
755
|
+
clauses search.h /^ BooleanClause **clauses;$/;" m struct:BooleanQuery
|
756
|
+
clauses search.h /^ Query **clauses;$/;" m struct:SpanNearQuery
|
757
|
+
clauses search.h /^ Query **clauses;$/;" m struct:SpanOrQuery
|
758
|
+
clean_str search.h /^ bool clean_str : 1;$/;" m struct:QParser
|
759
|
+
clear store.h /^ void (*clear)(Store *store);$/;" m struct:Store
|
760
|
+
clear_all store.h /^ void (*clear_all)(Store *store);$/;" m struct:Store
|
761
|
+
clear_locks store.h /^ void (*clear_locks)(Store *store);$/;" m struct:Store
|
762
|
+
clone index.h /^ TermEnum *(*clone)(TermEnum *te);$/;" m struct:TermEnum
|
763
|
+
clone_internal store.h /^ void (*clone_internal)(struct InStream *is, struct InStream *new_index_i);$/;" m struct:InStream
|
764
|
+
close index.h /^ void (*close)(TermDocEnum *tde);$/;" m struct:TermDocEnum
|
765
|
+
close index.h /^ void (*close)(TermEnum *te);$/;" m struct:TermEnum
|
766
|
+
close search.h /^ void (*close)(Searcher *self);$/;" m struct:Searcher
|
767
|
+
close store.h /^ void (*close)(Store *store);$/;" m struct:Store
|
768
|
+
close_analyzer index.h /^ bool close_analyzer : 1;$/;" m struct:IndexWriter
|
769
|
+
close_analyzer search.h /^ bool close_analyzer : 1;$/;" m struct:Index
|
770
|
+
close_def_fields search.h /^ bool close_def_fields : 1;$/;" m struct:QParser
|
771
|
+
close_internal store.h /^ void (*close_internal)(struct InStream *is);$/;" m struct:InStream
|
772
|
+
close_internal store.h /^ void (*close_internal)(struct OutStream *os);$/;" m struct:OutStream
|
773
|
+
close_lock store.h /^ void (*close_lock)(Lock *lock);$/;" m struct:Store
|
774
|
+
close_store index.h /^ bool close_store : 1;$/;" m struct:IndexReader
|
775
|
+
close_store index.h /^ bool close_store : 1;$/;" m struct:IndexWriter
|
776
|
+
close_store search.h /^ bool close_store : 1;$/;" m struct:Index
|
777
|
+
cmpd store.h /^ CompoundStore *cmpd; \/* for compound_store only *\/$/;" m union:Store::<anonymous>
|
778
|
+
cmpd_clear compound_io.c /^void cmpd_clear(Store *store)$/;" f
|
779
|
+
cmpd_close compound_io.c /^void cmpd_close(Store *store)$/;" f
|
780
|
+
cmpd_close_lock compound_io.c /^void cmpd_close_lock(Lock *lock)$/;" f
|
781
|
+
cmpd_count compound_io.c /^int cmpd_count(Store *store)$/;" f
|
782
|
+
cmpd_create_input compound_io.c /^InStream *cmpd_create_input(InStream *sub_is, int offset, int length)$/;" f
|
783
|
+
cmpd_create_output compound_io.c /^OutStream *cmpd_create_output(Store *store, const char *filename)$/;" f
|
784
|
+
cmpd_exists compound_io.c /^int cmpd_exists(Store *store, char *filename)$/;" f
|
785
|
+
cmpd_length compound_io.c /^int cmpd_length(Store *store, char *filename)$/;" f
|
786
|
+
cmpd_open_input compound_io.c /^InStream *cmpd_open_input(Store *store, const char *filename)$/;" f
|
787
|
+
cmpd_open_lock compound_io.c /^Lock *cmpd_open_lock(Store *store, char *lockname)$/;" f
|
788
|
+
cmpd_remove compound_io.c /^int cmpd_remove(Store *store, char *filename)$/;" f
|
789
|
+
cmpd_rename compound_io.c /^int cmpd_rename(Store *store, char *from, char *to)$/;" f
|
790
|
+
cmpd_touch compound_io.c /^void cmpd_touch(Store *store, char *filename)$/;" f
|
791
|
+
cmpdi_clone_internal compound_io.c /^void cmpdi_clone_internal(InStream *is, InStream *new_is)$/;" f
|
792
|
+
cmpdi_close_internal compound_io.c /^void cmpdi_close_internal(InStream *is)$/;" f
|
793
|
+
cmpdi_length_internal compound_io.c /^int cmpdi_length_internal(InStream *is)$/;" f
|
794
|
+
cmpdi_read_internal compound_io.c /^void cmpdi_read_internal(InStream *is, uchar *b, int offset, int len)$/;" f
|
795
|
+
cmpdi_seek_internal compound_io.c /^void cmpdi_seek_internal(InStream *is, int pos) {}$/;" f
|
796
|
+
cnt q_parser.c /^ int cnt;$/;" m struct:Phrase file:
|
797
|
+
co_create index_rw.c /^CacheObject *co_create(HshTable *ref_tab1, HshTable *ref_tab2,$/;" f
|
798
|
+
co_destroy index_rw.c /^void co_destroy(void *p)$/;" f
|
799
|
+
co_eq index_rw.c /^int co_eq(const void *key1, const void *key2)$/;" f
|
800
|
+
co_hash index_rw.c /^unsigned int co_hash(const void *key)$/;" f
|
801
|
+
co_hsh_create index_rw.c /^HshTable *co_hsh_create()$/;" f
|
802
|
+
comparator_create sort.c /^Comparator *comparator_create(void *index, bool reverse,$/;" f
|
803
|
+
comparators sort.c /^ Comparator **comparators;$/;" m struct:Sorter file:
|
804
|
+
compare search.h /^ int (*compare)(void *index_ptr, Hit *hit1, Hit *hit2);$/;" m struct:SortField
|
805
|
+
compare sort.c /^ int (*compare)(void *index_ptr, Hit *hit1, Hit *hit2);$/;" m struct:Comparator file:
|
806
|
+
config index_rw.c /^FerretConfig config = {$/;" v
|
807
|
+
conjunction_scorer_create q_boolean.c /^Scorer *conjunction_scorer_create(Similarity *similarity) $/;" f
|
808
|
+
coord search.h /^ float (*coord)(Similarity *self, int overlap, int max_overlap);$/;" m struct:Similarity
|
809
|
+
coord search.h /^ int coord;$/;" m struct:ConjunctionScorer
|
810
|
+
coord_create q_boolean.c /^Coordinator *coord_create(Similarity *similarity)$/;" f
|
811
|
+
coord_disabled search.h /^ bool coord_disabled;$/;" m struct:BooleanQuery
|
812
|
+
coord_factors search.h /^ float *coord_factors;$/;" m struct:Coordinator
|
813
|
+
coord_init q_boolean.c /^Coordinator *coord_init(Coordinator *self)$/;" f
|
814
|
+
coordinator search.h /^ Coordinator *coordinator;$/;" m struct:BooleanScorer
|
815
|
+
coordinator search.h /^ Coordinator *coordinator;$/;" m struct:ConjunctionScorer
|
816
|
+
coordinator search.h /^ Coordinator *coordinator;$/;" m struct:DisjunctionSumScorer
|
817
|
+
coordinator search.h /^ Coordinator *coordinator;$/;" m struct:SingleMatchScorer
|
818
|
+
copy_files ram_store.c /^static void copy_files(char *fname, void *arg)$/;" f file:
|
819
|
+
count bitvector.h /^ int count;$/;" m struct:BitVector
|
820
|
+
count index.h /^ int count; \/\/ the number of docs for this term that we have skipped$/;" m struct:SegmentTermDocEnum
|
821
|
+
count priorityqueue.h /^ int count;$/;" m struct:PriorityQueue
|
822
|
+
count priorityqueue.h /^ int count;$/;" m struct:PriorityQueue2
|
823
|
+
count search.h /^ int count;$/;" m struct:PhrasePosition
|
824
|
+
count search.h /^ int count;$/;" m struct:SpanTermEnum
|
825
|
+
count store.h /^ int (*count)(Store *store);$/;" m struct:Store
|
826
|
+
counter index.h /^ int counter;$/;" m struct:SegmentInfos
|
827
|
+
counting_conjunction_sum_scorer_create q_boolean.c /^Scorer *counting_conjunction_sum_scorer_create(Coordinator *coordinator,$/;" f
|
828
|
+
counting_disjunction_sum_scorer_create q_boolean.c /^Scorer *counting_disjunction_sum_scorer_create(Coordinator *coordinator,$/;" f
|
829
|
+
counting_sum_scorer search.h /^ Scorer *counting_sum_scorer;$/;" m struct:BooleanScorer
|
830
|
+
counting_sum_scorer_create q_boolean.c /^Scorer *counting_sum_scorer_create(BooleanScorer *bsc)$/;" f
|
831
|
+
counting_sum_scorer_create2 q_boolean.c /^Scorer *counting_sum_scorer_create2(BooleanScorer *bsc, Scorer *req_scorer,$/;" f
|
832
|
+
counting_sum_scorer_create3 q_boolean.c /^Scorer *counting_sum_scorer_create3(BooleanScorer *bsc, Scorer *req_scorer,$/;" f
|
833
|
+
create_index search.h /^ void *(*create_index)(int size);$/;" m struct:SortField
|
834
|
+
create_output store.h /^ OutStream *(*create_output)(Store *store, const char *filename);$/;" m struct:Store
|
835
|
+
create_weight search.h /^ Weight *(*create_weight)(Searcher *self, Query *query);$/;" m struct:Searcher
|
836
|
+
create_weight search.h /^ Weight *(*create_weight)(Query *self, Searcher *searcher);$/;" m struct:Query
|
837
|
+
csc_add_scorer q_boolean.c /^void csc_add_scorer(ConjunctionScorer *csc, Scorer *scorer)$/;" f
|
838
|
+
csc_destroy q_boolean.c /^void csc_destroy(void *p)$/;" f
|
839
|
+
csc_do_next q_boolean.c /^bool csc_do_next(Scorer *self)$/;" f
|
840
|
+
csc_init q_boolean.c /^void csc_init(Scorer *self, bool init_scorers)$/;" f
|
841
|
+
csc_next q_boolean.c /^bool csc_next(Scorer *self)$/;" f
|
842
|
+
csc_score q_boolean.c /^float csc_score(Scorer *self)$/;" f
|
843
|
+
csc_skip_to q_boolean.c /^bool csc_skip_to(Scorer *self, int doc_num)$/;" f
|
844
|
+
csc_sort_scorers q_boolean.c /^void csc_sort_scorers(ConjunctionScorer *csc)$/;" f
|
845
|
+
csq_create q_const_score.c /^Query *csq_create(Filter *filter)$/;" f
|
846
|
+
csq_destroy q_const_score.c /^void csq_destroy(void *p)$/;" f
|
847
|
+
csq_to_s q_const_score.c /^char *csq_to_s(Query *self, char *field)$/;" f
|
848
|
+
cssc_create q_const_score.c /^Scorer *cssc_create(Weight *weight, IndexReader *ir)$/;" f
|
849
|
+
cssc_explain q_const_score.c /^Explanation *cssc_explain(Scorer *self, int doc_num)$/;" f
|
850
|
+
cssc_next q_const_score.c /^bool cssc_next(Scorer *self)$/;" f
|
851
|
+
cssc_score q_const_score.c /^float cssc_score(Scorer *self)$/;" f
|
852
|
+
cssc_skip_to q_const_score.c /^bool cssc_skip_to(Scorer *self, int doc_num)$/;" f
|
853
|
+
csw_create q_const_score.c /^Weight *csw_create(Query *query, Searcher *searcher)$/;" f
|
854
|
+
csw_destroy q_const_score.c /^void csw_destroy(void *p)$/;" f
|
855
|
+
csw_explain q_const_score.c /^Explanation *csw_explain(Weight *self, IndexReader *ir, int doc_num)$/;" f
|
856
|
+
csw_to_s q_const_score.c /^char *csw_to_s(Weight *self)$/;" f
|
857
|
+
cum_score search.h /^ float cum_score;$/;" m struct:DisjunctionSumScorer
|
858
|
+
curr_bit bitvector.h /^ int curr_bit;$/;" m struct:BitVector
|
859
|
+
curr_doc_pointer index.h /^ int curr_doc_pointer;$/;" m struct:TermVectorsWriter
|
860
|
+
curr_field index.h /^ TVField *curr_field;$/;" m struct:TermVectorsWriter
|
861
|
+
curr_field index.h /^ char *curr_field;$/;" m struct:TermInfosWriter
|
862
|
+
curr_field_num index.h /^ int curr_field_num;$/;" m struct:TermInfosWriter
|
863
|
+
curr_tde index.h /^ TermDocEnum *curr_tde;$/;" m struct:MultiTermDocEnum
|
864
|
+
current search.h /^ int current;$/;" m struct:SpanNearEnum
|
865
|
+
current_ts analysis.h /^ TokenStream *current_ts;$/;" m struct:Analyzer
|
866
|
+
cw_add_file compound_io.c /^void cw_add_file(CompoundWriter *cw, char *id)$/;" f
|
867
|
+
cw_close compound_io.c /^void cw_close(CompoundWriter *cw)$/;" f
|
868
|
+
cw_copy_file compound_io.c /^void cw_copy_file(CompoundWriter *cw, WFileEntry *src, OutStream *os)$/;" f
|
869
|
+
d store.h /^ } d;$/;" m struct:InStream
|
870
|
+
da search.h /^ int *da;$/;" m struct:FuzzyQuery
|
871
|
+
da_capa search.h /^ int da_capa;$/;" m struct:FuzzyQuery
|
872
|
+
data analysis.h /^ void *data;$/;" m struct:Analyzer
|
873
|
+
data analysis.h /^ void *data;$/;" m struct:TokenStream
|
874
|
+
data document.h /^ char *data;$/;" m struct:DocField
|
875
|
+
data index.h /^ void *data;$/;" m struct:IndexReader
|
876
|
+
data index.h /^ void *data;$/;" m struct:TermDocEnum
|
877
|
+
data index.h /^ void *data;$/;" m struct:TermEnum
|
878
|
+
data priorityqueue.h /^ void *data;$/;" m struct:PriorityQueue2
|
879
|
+
data search.h /^ void *data;$/;" m struct:Filter
|
880
|
+
data search.h /^ void *data;$/;" m struct:Query
|
881
|
+
data search.h /^ void *data;$/;" m struct:Scorer
|
882
|
+
data search.h /^ void *data;$/;" m struct:Similarity
|
883
|
+
data search.h /^ void *data;$/;" m struct:SpanEnum
|
884
|
+
data search.h /^ void *data;$/;" m struct:SpanQuery
|
885
|
+
data search.h /^ void *data;$/;" m struct:Weight
|
886
|
+
data_offset compound_io.c /^ int data_offset;$/;" m struct:WFileEntry file:
|
887
|
+
datadir Makefile /^datadir = $(prefix)\/share$/;" m
|
888
|
+
dbl_to_s global.c /^char *dbl_to_s(char *buf, double num)$/;" f
|
889
|
+
dcapa search.h /^ int dcapa;$/;" m struct:Explanation
|
890
|
+
dcnt search.h /^ int dcnt;$/;" m struct:Explanation
|
891
|
+
decode_norm search.h /^ float (*decode_norm)(Similarity *self, uchar b);$/;" m struct:Similarity
|
892
|
+
def_field search.h /^ char *def_field;$/;" m struct:Index
|
893
|
+
def_fields search.h /^ HashSet *def_fields;$/;" m struct:QParser
|
894
|
+
def_slop search.h /^ int def_slop;$/;" m struct:QParser
|
895
|
+
default_similarity similarity.c /^static Similarity default_similarity = {$/;" v file:
|
896
|
+
delete_files index_rw.c /^void delete_files(Array *file_names, Store *store)$/;" f
|
897
|
+
deleted_docs index.h /^ BitVector *deleted_docs;$/;" m struct:SegmentReader
|
898
|
+
deleted_docs index.h /^ BitVector *deleted_docs;$/;" m struct:SegmentTermDocEnum
|
899
|
+
deleted_docs_dirty index.h /^ bool deleted_docs_dirty : 1;$/;" m struct:SegmentReader
|
900
|
+
description search.h /^ char *description;$/;" m struct:Explanation
|
901
|
+
destroy analysis.h /^ void (*destroy)(void *p);$/;" m struct:Analyzer
|
902
|
+
destroy analysis.h /^ void (*destroy)(void *p);$/;" m struct:TokenStream
|
903
|
+
destroy index.h /^ void (*destroy)(void *p);$/;" m struct:CacheObject
|
904
|
+
destroy priorityqueue.h /^ void (*destroy)(void *p);$/;" m struct:PriorityQueue2
|
905
|
+
destroy search.h /^ void (*destroy)(void *p);$/;" m struct:Scorer
|
906
|
+
destroy search.h /^ void (*destroy)(void *p);$/;" m struct:Weight
|
907
|
+
destroy search.h /^ void (*destroy)(void *p);$/;" m struct:Query
|
908
|
+
destroy search.h /^ void (*destroy)(void *p);$/;" m struct:Filter
|
909
|
+
destroy search.h /^ void (*destroy)(void *p);$/;" m struct:Similarity
|
910
|
+
destroy search.h /^ void (*destroy)(void *p);$/;" m struct:SpanEnum
|
911
|
+
destroy_all search.h /^ bool destroy_all : 1;$/;" m struct:Query
|
912
|
+
destroy_all search.h /^ bool destroy_all : 1;$/;" m struct:Sort
|
913
|
+
destroy_func_t global.h /^typedef void (*destroy_func_t)(void *p);$/;" t
|
914
|
+
destroy_index search.h /^ void (*destroy_index)(void *p);$/;" m struct:SortField
|
915
|
+
details search.h /^ struct Explanation **details;$/;" m struct:Explanation
|
916
|
+
df_arr document.h /^ DocField **df_arr;$/;" m struct:Document
|
917
|
+
df_clone document.c /^DocField *df_clone(DocField *self)$/;" f
|
918
|
+
df_create document.c /^DocField *df_create(const char *name, char *data, int store, int index, int tv)$/;" f
|
919
|
+
df_create_binary document.c /^DocField *df_create_binary(char *name, char *data, int blen, int store)$/;" f
|
920
|
+
df_destroy document.c /^void df_destroy(void *p)$/;" f
|
921
|
+
df_destroy_data document.c /^void df_destroy_data(void *p)$/;" f
|
922
|
+
df_set document.c /^inline void df_set(DocField *df, const char *name,$/;" f
|
923
|
+
df_set_index document.c /^void df_set_index(DocField *df, int index)$/;" f
|
924
|
+
df_set_store document.c /^void df_set_store(DocField *df, int store)$/;" f
|
925
|
+
df_set_term_vector document.c /^void df_set_term_vector(DocField *df, int tv)$/;" f
|
926
|
+
df_to_s document.c /^char *df_to_s(DocField *self)$/;" f
|
927
|
+
dfcnt document.h /^ int dfcnt;$/;" m struct:Document
|
928
|
+
dir store.h /^ } dir;$/;" m struct:Store
|
929
|
+
dir_offset compound_io.c /^ int dir_offset;$/;" m struct:WFileEntry file:
|
930
|
+
disjunction_sum_scorer_create q_boolean.c /^Scorer *disjunction_sum_scorer_create(Scorer **sub_scorers, int ss_cnt,$/;" f
|
931
|
+
do_close index.h /^ void (*do_close)(IndexReader *ir);$/;" m struct:IndexReader
|
932
|
+
do_commit index.h /^ void (*do_commit)(IndexReader *ir);$/;" m struct:IndexReader
|
933
|
+
do_delete_doc index.h /^ void (*do_delete_doc)(IndexReader *ir, int doc_num);$/;" m struct:IndexReader
|
934
|
+
do_set_norm index.h /^ void (*do_set_norm)(IndexReader *ir, int doc_num, char *field, uchar val);$/;" m struct:IndexReader
|
935
|
+
do_undelete_all index.h /^ void (*do_undelete_all)(IndexReader *ir);$/;" m struct:IndexReader
|
936
|
+
doc search.h /^ int doc;$/;" m struct:Scorer
|
937
|
+
doc search.h /^ int (*doc)(SpanEnum *self);$/;" m struct:SpanEnum
|
938
|
+
doc search.h /^ int doc;$/;" m struct:Hit
|
939
|
+
doc search.h /^ int doc;$/;" m struct:PhrasePosition
|
940
|
+
doc search.h /^ int doc;$/;" m struct:SpanNearEnum
|
941
|
+
doc search.h /^ int doc;$/;" m struct:SpanTermEnum
|
942
|
+
doc_add_field document.c /^void doc_add_field(Document *doc, DocField *df)$/;" f
|
943
|
+
doc_cnt index.h /^ int doc_cnt;$/;" m struct:SegmentInfo
|
944
|
+
doc_create document.c /^Document *doc_create()$/;" f
|
945
|
+
doc_create_keep_data document.c /^Document *doc_create_keep_data()$/;" f
|
946
|
+
doc_delete_fields document.c /^bool doc_delete_fields(Document *doc, const char *fname)$/;" f
|
947
|
+
doc_destroy document.c /^void doc_destroy(void *p)$/;" f
|
948
|
+
doc_freq index.h /^ int (*doc_freq)(IndexReader *ir, Term *t);$/;" m struct:IndexReader
|
949
|
+
doc_freq index.h /^ int doc_freq; \/\/ the number of doc this term appears in$/;" m struct:SegmentTermDocEnum
|
950
|
+
doc_freq index.h /^ int doc_freq;$/;" m struct:MultiTermEnum
|
951
|
+
doc_freq index.h /^ int doc_freq;$/;" m struct:TermInfo
|
952
|
+
doc_freq search.h /^ int (*doc_freq)(Searcher *self, Term *term);$/;" m struct:Searcher
|
953
|
+
doc_freqs search.h /^ int *(*doc_freqs)(Searcher *self, Term **terms, int tcnt);$/;" m struct:Searcher
|
954
|
+
doc_get_field document.c /^DocField *doc_get_field(Document *doc, const char *fname)$/;" f
|
955
|
+
doc_get_fields document.c /^Array *doc_get_fields(Document *doc, const char *fname)$/;" f
|
956
|
+
doc_map index.h /^ int *doc_map;$/;" m struct:SegmentMergeInfo
|
957
|
+
doc_num index.h /^ int (*doc_num)(TermDocEnum *tde);$/;" m struct:TermDocEnum
|
958
|
+
doc_num index.h /^ int doc_num;$/;" m
|
959
|
+
doc_num index.h /^ int doc_num;$/;" m struct:SegmentTermDocEnum
|
960
|
+
doc_remove_field document.c /^DocField *doc_remove_field(Document *doc, const char *fname)$/;" f
|
961
|
+
doc_remove_fields document.c /^Array *doc_remove_fields(Document *doc, const char *fname)$/;" f
|
962
|
+
doc_to_s document.c /^char *doc_to_s(Document *doc)$/;" f
|
963
|
+
docs r_search.c /^ Array *docs;$/;" m struct:QueryUpdateArg file:
|
964
|
+
docs search.h /^ int docs[TDE_READ_SIZE];$/;" m struct:TermScorer
|
965
|
+
dssc_advance_after_current q_boolean.c /^bool dssc_advance_after_current(Scorer *self)$/;" f
|
966
|
+
dssc_destroy q_boolean.c /^void dssc_destroy(void *p)$/;" f
|
967
|
+
dssc_explain q_boolean.c /^Explanation *dssc_explain(Scorer *self, int doc_num)$/;" f
|
968
|
+
dssc_init_scorer_queue q_boolean.c /^void dssc_init_scorer_queue(DisjunctionSumScorer *dssc)$/;" f
|
969
|
+
dssc_next q_boolean.c /^bool dssc_next(Scorer *self)$/;" f
|
970
|
+
dssc_score q_boolean.c /^float dssc_score(Scorer *self)$/;" f
|
971
|
+
dssc_skip_to q_boolean.c /^bool dssc_skip_to(Scorer *self, int doc_num)$/;" f
|
972
|
+
dummy_free hash.c /^void dummy_free(void *p)$/;" f
|
973
|
+
dummy_key hash.c /^char *dummy_key = "";$/;" v
|
974
|
+
dw_add_doc index_rw.c /^void dw_add_doc(DocumentWriter *dw, char *segment, Document *doc)$/;" f
|
975
|
+
dw_add_position index_rw.c /^void dw_add_position(DocumentWriter *dw, char *field, char *text,$/;" f
|
976
|
+
dw_close index_rw.c /^void dw_close(DocumentWriter *dw)$/;" f
|
977
|
+
dw_invert_doc index_rw.c /^void dw_invert_doc(DocumentWriter *dw, Document *doc)$/;" f
|
978
|
+
dw_open index_rw.c /^DocumentWriter *dw_open(Store *store,$/;" f
|
979
|
+
dw_sort_posting_table index_rw.c /^Posting **dw_sort_posting_table(DocumentWriter *dw)$/;" f
|
980
|
+
dw_write_norms index_rw.c /^void dw_write_norms(DocumentWriter *dw, char *segment)$/;" f
|
981
|
+
dw_write_postings index_rw.c /^void dw_write_postings(DocumentWriter *dw, Posting **postings, char *segment)$/;" f
|
982
|
+
each store.h /^ void (*each)(Store *store, void (*func)(char *fname, void *arg), void *arg);$/;" m struct:Store
|
983
|
+
efree global.h 53;" d
|
984
|
+
elems array.h /^ void **elems;$/;" m struct:Array
|
985
|
+
elems hashset.h /^ void **elems;$/;" m struct:HashSet
|
986
|
+
emalloc global.c /^void *emalloc(size_t size)$/;" f
|
987
|
+
encode_norm search.h /^ float (*encode_norm)(Similarity *self, float f);$/;" m struct:Similarity
|
988
|
+
end analysis.h /^ int end;$/;" m struct:Token
|
989
|
+
end index.h /^ int end;$/;" m struct:TVOffsetInfo
|
990
|
+
end r_analysis.c /^ int end;$/;" m struct:RToken file:
|
991
|
+
end search.h /^ int (*end)(SpanEnum *self);$/;" m struct:SpanEnum
|
992
|
+
end search.h /^ int end;$/;" m struct:SpanFirstQuery
|
993
|
+
end search.h /^ int end;$/;" m struct:SpanNearEnum
|
994
|
+
ensure_reader_open ind.c /^inline void ensure_reader_open(Index *self)$/;" f
|
995
|
+
ensure_searcher_open ind.c /^inline void ensure_searcher_open(Index *self)$/;" f
|
996
|
+
ensure_writer_open ind.c /^inline void ensure_writer_open(Index *self)$/;" f
|
997
|
+
entries store.h /^ HshTable *entries;$/;" m struct:CompoundStore
|
998
|
+
ephsc_phrase_freq q_phrase.c /^float ephsc_phrase_freq(Scorer *self)$/;" f
|
999
|
+
eprintf inc/lang.h 9;" d
|
1000
|
+
eprintf lang.h 9;" d
|
1001
|
+
eprintf_inner global.c /^void eprintf_inner(char *file, int line_num, const char *etype, const char *fmt, ...)$/;" f
|
1002
|
+
eprintf_old global.c /^void eprintf_old(const char *fmt, ...)$/;" f
|
1003
|
+
epstrdup global.c /^char *epstrdup(const char *fmt, int len, ...)$/;" f
|
1004
|
+
eq hash.h /^ int (*eq)(const void *key1, const void *key2);$/;" m struct:HshTable
|
1005
|
+
eq_func hash.c /^typedef int (*eq_func)(const void *key1, const void *key2);$/;" t file:
|
1006
|
+
erealloc global.c /^void *erealloc(void *ptr, size_t size)$/;" f
|
1007
|
+
estrcat global.c /^char *estrcat(char *str1, char *str2)$/;" f
|
1008
|
+
estrdup global.c /^char *estrdup(const char *s)$/;" f
|
1009
|
+
exact_phrase_scorer_create q_phrase.c /^Scorer *exact_phrase_scorer_create(Weight *weight, TermDocEnum **term_pos_enum,$/;" f
|
1010
|
+
exc search.h /^ Query *exc;$/;" m struct:SpanNotQuery
|
1011
|
+
exc search.h /^ SpanEnum *exc;$/;" m struct:SpanNotEnum
|
1012
|
+
excl_scorer search.h /^ Scorer *excl_scorer;$/;" m struct:ReqExclScorer
|
1013
|
+
exec_prefix Makefile /^exec_prefix = $(prefix)$/;" m
|
1014
|
+
exists store.h /^ int (*exists)(Store *store, char *filename);$/;" m struct:Store
|
1015
|
+
expl_add_detail search.c /^Explanation *expl_add_detail(Explanation *self, Explanation *detail)$/;" f
|
1016
|
+
expl_create search.c /^Explanation *expl_create(float value, char *description)$/;" f
|
1017
|
+
expl_destoy search.c /^void expl_destoy(void *p)$/;" f
|
1018
|
+
expl_to_html search.c /^char *expl_to_html(Explanation *self)$/;" f
|
1019
|
+
expl_to_s search.c /^char *expl_to_s(Explanation *self, int depth)$/;" f
|
1020
|
+
explain search.h /^ Explanation *(*explain)(Scorer *self, int doc_num);$/;" m struct:Scorer
|
1021
|
+
explain search.h /^ Explanation *(*explain)(Searcher *self, Query *query, int doc_num);$/;" m struct:Searcher
|
1022
|
+
explain search.h /^ Explanation *(*explain)(Weight *self, IndexReader *ir, int doc_num);$/;" m struct:Weight
|
1023
|
+
ext_mutex store.h /^ mutex_t ext_mutex;$/;" m struct:Store
|
1024
|
+
extout Makefile /^extout = $/;" m
|
1025
|
+
extout_prefix Makefile /^extout_prefix = $/;" m
|
1026
|
+
extract_terms search.h /^ void (*extract_terms)(Query *self, Array *terms);$/;" m struct:Query
|
1027
|
+
fake_norms index.h /^ uchar *fake_norms;$/;" m struct:SegmentReader
|
1028
|
+
false global.h 13;" d
|
1029
|
+
fcnt document.h /^ int fcnt;$/;" m struct:Document
|
1030
|
+
fcnt index.h /^ int fcnt;$/;" m struct:FieldInfos
|
1031
|
+
fcnt index.h /^ int fcnt;$/;" m struct:TermVectorsWriter
|
1032
|
+
fi_create field.c /^FieldInfo *fi_create(char *name, int number, bool is_indexed,$/;" f
|
1033
|
+
fi_destroy field.c /^void fi_destroy(void *p)$/;" f
|
1034
|
+
fi_field_info_byte field.c /^int fi_field_info_byte(FieldInfo *fi)$/;" f
|
1035
|
+
field index.h /^ char *field;$/;" m struct:Term
|
1036
|
+
field index.h /^ char *field;$/;" m struct:TermBuffer
|
1037
|
+
field index.h /^ char *field;$/;" m struct:TermVector
|
1038
|
+
field r_store.c /^ VALUE field;$/;" m struct:RTerm file:
|
1039
|
+
field r_term.c /^ VALUE field;$/;" m struct:RTerm file:
|
1040
|
+
field search.h /^ char *field;$/;" m struct:MultiPhraseQuery
|
1041
|
+
field search.h /^ char *field;$/;" m struct:PhraseQuery
|
1042
|
+
field search.h /^ char *field;$/;" m struct:Range
|
1043
|
+
field search.h /^ char *field;$/;" m struct:SortField
|
1044
|
+
field search.h /^ char *field;$/;" m struct:SpanQuery
|
1045
|
+
field_arr document.h /^ Array **field_arr;$/;" m struct:Document
|
1046
|
+
field_boosts index.h /^ float *field_boosts;$/;" m struct:DocumentWriter
|
1047
|
+
field_cache_get_index sort.c /^void *field_cache_get_index(IndexReader *ir, SortField *sf)$/;" f
|
1048
|
+
field_lengths index.h /^ int *field_lengths;$/;" m struct:DocumentWriter
|
1049
|
+
field_num index.h /^ int field_num;$/;" m struct:Norm
|
1050
|
+
field_offsets index.h /^ int *field_offsets;$/;" m struct:DocumentWriter
|
1051
|
+
field_positions index.h /^ int *field_positions;$/;" m struct:DocumentWriter
|
1052
|
+
fields document.h /^ HshTable *fields;$/;" m struct:Document
|
1053
|
+
fields index.h /^ TVField **fields;$/;" m struct:TermVectorsWriter
|
1054
|
+
fields search.h /^ HashSet *fields;$/;" m struct:QParser
|
1055
|
+
fields_buf search.h /^ HashSet *fields_buf;$/;" m struct:QParser
|
1056
|
+
fields_in index.h /^ InStream *fields_in;$/;" m struct:FieldsReader
|
1057
|
+
fields_out index.h /^ OutStream *fields_out;$/;" m struct:FieldsWriter
|
1058
|
+
file store.h /^ void *file;$/;" m struct:InStream
|
1059
|
+
file store.h /^ void *file;$/;" m struct:OutStream
|
1060
|
+
file_entries index.h /^ Array *file_entries;$/;" m struct:CompoundWriter
|
1061
|
+
file_is_lock index_io.c /^int file_is_lock(char *filename)$/;" f
|
1062
|
+
fill hash.h /^ int fill; \/* # Active + # Dummy *\/$/;" m struct:HshTable
|
1063
|
+
filt_create filter.c /^Filter *filt_create(char *name)$/;" f
|
1064
|
+
filt_destroy filter.c /^void filt_destroy(void *p)$/;" f
|
1065
|
+
filt_get_bv filter.c /^BitVector *filt_get_bv(Filter *self, IndexReader *ir)$/;" f
|
1066
|
+
filt_to_s filter.c /^char *filt_to_s(Filter *self)$/;" f
|
1067
|
+
filter search.h /^ Filter *filter;$/;" m struct:FilteredQuery
|
1068
|
+
filter_destroy analysis.c /^void filter_destroy(void *p)$/;" f
|
1069
|
+
filter_reset analysis.c /^void filter_reset(TokenStream *ts, char *text)$/;" f
|
1070
|
+
first search.h /^ int first;$/;" m struct:ConjunctionScorer
|
1071
|
+
first_cls q_parser.c /^Array *first_cls(BooleanClause *cls)$/;" f
|
1072
|
+
first_field q_parser.c /^HashSet *first_field(QParser *qp, char *field)$/;" f
|
1073
|
+
first_time search.h /^ bool first_time : 1;$/;" m struct:ConjunctionScorer
|
1074
|
+
first_time search.h /^ bool first_time : 1;$/;" m struct:PhraseScorer
|
1075
|
+
first_time search.h /^ bool first_time : 1;$/;" m struct:SpanNearEnum
|
1076
|
+
first_time search.h /^ bool first_time : 1;$/;" m struct:SpanScorer
|
1077
|
+
first_time search.h /^ bool first_time;$/;" m struct:ReqExclScorer
|
1078
|
+
first_time search.h /^ bool first_time;$/;" m struct:SpanOrEnum
|
1079
|
+
first_time_opt search.h /^ bool first_time_opt;$/;" m struct:ReqOptSumScorer
|
1080
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:DocumentWriter
|
1081
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:FieldsReader
|
1082
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:FieldsWriter
|
1083
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:SegmentMerger
|
1084
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:SegmentReader
|
1085
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:SegmentTermEnum
|
1086
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:TermInfosWriter
|
1087
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:TermVectorsReader
|
1088
|
+
fis index.h /^ FieldInfos *fis;$/;" m struct:TermVectorsWriter
|
1089
|
+
fis_add field.c /^FieldInfo *fis_add(FieldInfos *fis,$/;" f
|
1090
|
+
fis_add_doc field.c /^FieldInfos *fis_add_doc(FieldInfos *fis, Document *doc)$/;" f
|
1091
|
+
fis_add_fields field.c /^void fis_add_fields(FieldInfos *fis,$/;" f
|
1092
|
+
fis_create field.c /^FieldInfos *fis_create()$/;" f
|
1093
|
+
fis_destroy field.c /^void fis_destroy(void *p)$/;" f
|
1094
|
+
fis_get_fi field.c /^FieldInfo *fis_get_fi(FieldInfos *fis, char *name)$/;" f
|
1095
|
+
fis_get_number field.c /^unsigned long long fis_get_number(FieldInfos *fis, char *name)$/;" f
|
1096
|
+
fis_has_vectors field.c /^bool fis_has_vectors(FieldInfos *fis)$/;" f
|
1097
|
+
fis_open field.c /^FieldInfos *fis_open(Store *store, char *filename)$/;" f
|
1098
|
+
fis_read field.c /^FieldInfos *fis_read(FieldInfos *fis, InStream *is)$/;" f
|
1099
|
+
fis_write field.c /^void fis_write(FieldInfos *fis, Store *store, char *segment, char *ext)$/;" f
|
1100
|
+
float_to_byte similarity.c /^uchar float_to_byte(float f)$/;" f
|
1101
|
+
flush_internal store.h /^ void (*flush_internal)(struct OutStream *os, uchar *buf, int len);$/;" m struct:OutStream
|
1102
|
+
format index.h /^ int format;$/;" m struct:SegmentInfos
|
1103
|
+
format index.h /^ int format;$/;" m struct:SegmentTermEnum
|
1104
|
+
format_m1skip_interval index.h /^ int format_m1skip_interval;$/;" m struct:SegmentTermEnum
|
1105
|
+
fq_create q_filtered_query.c /^Query *fq_create(Query *query, Filter *filter)$/;" f
|
1106
|
+
fq_create_weight q_filtered_query.c /^Weight *fq_create_weight(Query *self, Searcher *searcher)$/;" f
|
1107
|
+
fq_destroy q_filtered_query.c /^void fq_destroy(void *p)$/;" f
|
1108
|
+
fq_to_s q_filtered_query.c /^char *fq_to_s(Query *self, char *field)$/;" f
|
1109
|
+
fqsc_create q_filtered_query.c /^Scorer *fqsc_create(Scorer *scorer, BitVector *bv, Similarity *sim)$/;" f
|
1110
|
+
fqsc_destroy q_filtered_query.c /^void fqsc_destroy(void *p)$/;" f
|
1111
|
+
fqsc_explain q_filtered_query.c /^Explanation *fqsc_explain(Scorer *self, int doc_num)$/;" f
|
1112
|
+
fqsc_next q_filtered_query.c /^bool fqsc_next(Scorer *self)$/;" f
|
1113
|
+
fqsc_score q_filtered_query.c /^float fqsc_score(Scorer *self)$/;" f
|
1114
|
+
fqsc_skip_to q_filtered_query.c /^bool fqsc_skip_to(Scorer *self, int doc_num)$/;" f
|
1115
|
+
fqw_create q_filtered_query.c /^Weight *fqw_create(Query *query, Weight *sub_weight, Similarity *sim)$/;" f
|
1116
|
+
fqw_destroy q_filtered_query.c /^void fqw_destroy(void *p)$/;" f
|
1117
|
+
fqw_explain q_filtered_query.c /^Explanation *fqw_explain(Weight *self, IndexReader *ir, int doc_num)$/;" f
|
1118
|
+
fqw_get_value q_filtered_query.c /^float fqw_get_value(Weight *self)$/;" f
|
1119
|
+
fqw_normalize q_filtered_query.c /^void fqw_normalize(Weight *self, float normalization_factor)$/;" f
|
1120
|
+
fqw_scorer q_filtered_query.c /^Scorer *fqw_scorer(Weight *self, IndexReader *ir)$/;" f
|
1121
|
+
fqw_sum_of_squared_weights q_filtered_query.c /^float fqw_sum_of_squared_weights(Weight *self)$/;" f
|
1122
|
+
fqw_to_s q_filtered_query.c /^char *fqw_to_s(Weight *self)$/;" f
|
1123
|
+
fr index.h /^ FieldsReader *fr;$/;" m struct:SegmentReader
|
1124
|
+
fr_close field.c /^void fr_close(FieldsReader *fr)$/;" f
|
1125
|
+
fr_get_doc field.c /^Document *fr_get_doc(FieldsReader *fr, int doc_num)$/;" f
|
1126
|
+
fr_open field.c /^FieldsReader *fr_open(Store *store, char *segment, FieldInfos *fis)$/;" f
|
1127
|
+
free_data document.h /^ void (*free_data)(void *p);$/;" m struct:Document
|
1128
|
+
free_elem array.h /^ void (*free_elem)(void *p);$/;" m struct:Array
|
1129
|
+
free_elem hashset.h /^ void (*free_elem)(void *p);$/;" m struct:HashSet
|
1130
|
+
free_elem priorityqueue.h /^ void (*free_elem)(void *p);$/;" m struct:PriorityQueue2
|
1131
|
+
free_elem priorityqueue.h /^ void (*free_elem)(void *p1);$/;" m struct:PriorityQueue
|
1132
|
+
free_func hash.c /^typedef void (*free_func)(void *);$/;" t file:
|
1133
|
+
free_hts hash.c /^static HshTable *free_hts[MAX_FREE_HASH_TABLES];$/;" v file:
|
1134
|
+
free_key hash.h /^ void (*free_key)(void *key);$/;" m struct:HshTable
|
1135
|
+
free_value hash.h /^ void (*free_value)(void *value);$/;" m struct:HshTable
|
1136
|
+
freq index.h /^ int (*freq)(TermDocEnum *tde);$/;" m struct:TermDocEnum
|
1137
|
+
freq index.h /^ int freq;$/;" m
|
1138
|
+
freq index.h /^ int freq;$/;" m struct:Posting
|
1139
|
+
freq index.h /^ int freq;$/;" m struct:SegmentTermDocEnum
|
1140
|
+
freq index.h /^ int freq;$/;" m struct:TVTerm
|
1141
|
+
freq search.h /^ float freq;$/;" m struct:PhraseScorer
|
1142
|
+
freq search.h /^ float freq;$/;" m struct:SpanScorer
|
1143
|
+
freq search.h /^ int freq;$/;" m struct:SpanTermEnum
|
1144
|
+
freq_in index.h /^ InStream *freq_in;$/;" m struct:SegmentReader
|
1145
|
+
freq_in index.h /^ InStream *freq_in;$/;" m struct:SegmentTermDocEnum
|
1146
|
+
freq_out index.h /^ OutStream *freq_out;$/;" m struct:SegmentMerger
|
1147
|
+
freq_pointer index.h /^ int freq_pointer;$/;" m struct:SegmentTermDocEnum
|
1148
|
+
freq_pointer index.h /^ int freq_pointer;$/;" m struct:TermInfo
|
1149
|
+
freqs index.h /^ int *freqs;$/;" m struct:TermVector
|
1150
|
+
freqs search.h /^ int freqs[TDE_READ_SIZE];$/;" m struct:TermScorer
|
1151
|
+
from_store ram_store.c /^ Store *to_store, *from_store;$/;" m struct:CopyFileArg file:
|
1152
|
+
frt_analyzer_free r_analysis.c /^frt_analyzer_free(void *p)$/;" f file:
|
1153
|
+
frt_bq_add_query r_search.c /^frt_bq_add_query(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1154
|
+
frt_bq_init r_search.c /^frt_bq_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1155
|
+
frt_bq_mark r_search.c /^frt_bq_mark(void *p)$/;" f file:
|
1156
|
+
frt_csq_init r_search.c /^frt_csq_init(VALUE self, VALUE rfilter)$/;" f file:
|
1157
|
+
frt_data_alloc ferret.c /^frt_data_alloc(VALUE klass)$/;" f
|
1158
|
+
frt_deref_free ferret.c /^frt_deref_free(void *p)$/;" f
|
1159
|
+
frt_dir_close r_store.c /^frt_dir_close(VALUE self)$/;" f file:
|
1160
|
+
frt_dir_delete r_store.c /^frt_dir_delete(VALUE self, VALUE rfname)$/;" f file:
|
1161
|
+
frt_dir_exists r_store.c /^frt_dir_exists(VALUE self, VALUE rfname)$/;" f file:
|
1162
|
+
frt_dir_file_count r_store.c /^frt_dir_file_count(VALUE self)$/;" f file:
|
1163
|
+
frt_dir_free r_store.c /^frt_dir_free(void *p)$/;" f
|
1164
|
+
frt_dir_make_lock r_store.c /^frt_dir_make_lock(VALUE self, VALUE rlock_name)$/;" f file:
|
1165
|
+
frt_dir_refresh r_store.c /^frt_dir_refresh(VALUE self)$/;" f file:
|
1166
|
+
frt_dir_rename r_store.c /^frt_dir_rename(VALUE self, VALUE rfrom, VALUE rto)$/;" f file:
|
1167
|
+
frt_dir_touch r_store.c /^frt_dir_touch(VALUE self, VALUE rfname)$/;" f file:
|
1168
|
+
frt_doc_add_field r_doc.c /^frt_doc_add_field(VALUE self, VALUE rfield)$/;" f file:
|
1169
|
+
frt_doc_all_fields r_doc.c /^frt_doc_all_fields(VALUE self)$/;" f file:
|
1170
|
+
frt_doc_alloc r_doc.c /^frt_doc_alloc(VALUE klass)$/;" f file:
|
1171
|
+
frt_doc_binaries r_doc.c /^frt_doc_binaries(VALUE self, VALUE rname)$/;" f file:
|
1172
|
+
frt_doc_entry_count r_doc.c /^frt_doc_entry_count(VALUE self)$/;" f file:
|
1173
|
+
frt_doc_field r_doc.c /^frt_doc_field(VALUE self, VALUE rname)$/;" f file:
|
1174
|
+
frt_doc_field_count r_doc.c /^frt_doc_field_count(VALUE self)$/;" f file:
|
1175
|
+
frt_doc_fields r_doc.c /^frt_doc_fields(VALUE self, VALUE rname)$/;" f file:
|
1176
|
+
frt_doc_free r_doc.c /^frt_doc_free(void *p)$/;" f
|
1177
|
+
frt_doc_get_boost r_doc.c /^frt_doc_get_boost(VALUE self)$/;" f file:
|
1178
|
+
frt_doc_init r_doc.c /^frt_doc_init(VALUE self) $/;" f file:
|
1179
|
+
frt_doc_mark r_doc.c /^frt_doc_mark(void *p)$/;" f
|
1180
|
+
frt_doc_remove_field r_doc.c /^frt_doc_remove_field(VALUE self, VALUE rname)$/;" f file:
|
1181
|
+
frt_doc_remove_fields r_doc.c /^frt_doc_remove_fields(VALUE self, VALUE rname)$/;" f file:
|
1182
|
+
frt_doc_set r_doc.c /^frt_doc_set(VALUE self, VALUE rname, VALUE rdata)$/;" f file:
|
1183
|
+
frt_doc_set_boost r_doc.c /^frt_doc_set_boost(VALUE self, VALUE rboost)$/;" f file:
|
1184
|
+
frt_doc_to_s r_doc.c /^frt_doc_to_s(VALUE self)$/;" f file:
|
1185
|
+
frt_doc_values r_doc.c /^frt_doc_values(VALUE self, VALUE rname)$/;" f file:
|
1186
|
+
frt_expl_to_html r_search.c /^frt_expl_to_html(VALUE self)$/;" f file:
|
1187
|
+
frt_expl_to_s r_search.c /^frt_expl_to_s(VALUE self)$/;" f file:
|
1188
|
+
frt_expl_value r_search.c /^frt_expl_value(VALUE self)$/;" f file:
|
1189
|
+
frt_f_free r_search.c /^frt_f_free(void *p)$/;" f file:
|
1190
|
+
frt_f_to_s r_search.c /^frt_f_to_s(VALUE self)$/;" f file:
|
1191
|
+
frt_field_alloc r_doc.c /^frt_field_alloc(VALUE klass)$/;" f file:
|
1192
|
+
frt_field_free r_doc.c /^frt_field_free(void *p)$/;" f
|
1193
|
+
frt_field_get_boost r_doc.c /^frt_field_get_boost(VALUE self)$/;" f file:
|
1194
|
+
frt_field_get_data r_doc.c /^frt_field_get_data(VALUE self)$/;" f file:
|
1195
|
+
frt_field_get_name r_doc.c /^frt_field_get_name(VALUE self)$/;" f file:
|
1196
|
+
frt_field_init r_doc.c /^frt_field_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1197
|
+
frt_field_is_binary r_doc.c /^frt_field_is_binary(VALUE self)$/;" f file:
|
1198
|
+
frt_field_is_compressed r_doc.c /^frt_field_is_compressed(VALUE self)$/;" f file:
|
1199
|
+
frt_field_is_indexed r_doc.c /^frt_field_is_indexed(VALUE self)$/;" f file:
|
1200
|
+
frt_field_is_stored r_doc.c /^frt_field_is_stored(VALUE self)$/;" f file:
|
1201
|
+
frt_field_is_tokenized r_doc.c /^frt_field_is_tokenized(VALUE self)$/;" f file:
|
1202
|
+
frt_field_new_binary r_doc.c /^frt_field_new_binary(VALUE klass, VALUE rname, VALUE rdata, VALUE rstore)$/;" f file:
|
1203
|
+
frt_field_omit_norms r_doc.c /^frt_field_omit_norms(VALUE self)$/;" f file:
|
1204
|
+
frt_field_set_boost r_doc.c /^frt_field_set_boost(VALUE self, VALUE rboost)$/;" f file:
|
1205
|
+
frt_field_set_data r_doc.c /^frt_field_set_data(VALUE self, VALUE rdata)$/;" f file:
|
1206
|
+
frt_field_set_index r_doc.c /^frt_field_set_index(VALUE self, VALUE rindex)$/;" f file:
|
1207
|
+
frt_field_set_name r_doc.c /^frt_field_set_name(VALUE self, VALUE rname)$/;" f file:
|
1208
|
+
frt_field_set_store r_doc.c /^frt_field_set_store(VALUE self, VALUE rstore)$/;" f file:
|
1209
|
+
frt_field_set_term_vector r_doc.c /^frt_field_set_term_vector(VALUE self, VALUE rterm_vector)$/;" f file:
|
1210
|
+
frt_field_store_offset r_doc.c /^frt_field_store_offset(VALUE self)$/;" f file:
|
1211
|
+
frt_field_store_pos r_doc.c /^frt_field_store_pos(VALUE self)$/;" f file:
|
1212
|
+
frt_field_store_tv r_doc.c /^frt_field_store_tv(VALUE self)$/;" f file:
|
1213
|
+
frt_field_to_s r_doc.c /^frt_field_to_s(VALUE self)$/;" f file:
|
1214
|
+
frt_fq_get_dms r_search.c /^frt_fq_get_dms(VALUE self)$/;" f file:
|
1215
|
+
frt_fq_get_dpl r_search.c /^frt_fq_get_dpl(VALUE self)$/;" f file:
|
1216
|
+
frt_fq_init r_search.c /^frt_fq_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1217
|
+
frt_fq_set_dms r_search.c /^frt_fq_set_dms(VALUE self, VALUE val)$/;" f file:
|
1218
|
+
frt_fq_set_dpl r_search.c /^frt_fq_set_dpl(VALUE self, VALUE val)$/;" f file:
|
1219
|
+
frt_fqq_init r_search.c /^frt_fqq_init(VALUE self, VALUE rquery, VALUE rfilter)$/;" f file:
|
1220
|
+
frt_fqq_mark r_search.c /^frt_fqq_mark(void *p)$/;" f file:
|
1221
|
+
frt_fsdir_new r_store.c /^frt_fsdir_new(VALUE klass, VALUE rpath, VALUE rcreate) $/;" f file:
|
1222
|
+
frt_gc_mark ferret.c /^frt_gc_mark(void *key)$/;" f
|
1223
|
+
frt_get_analyzer r_analysis.c /^frt_get_analyzer(Analyzer *a)$/;" f
|
1224
|
+
frt_get_doc r_doc.c /^frt_get_doc(Document *doc)$/;" f
|
1225
|
+
frt_get_fields r_qparser.c /^frt_get_fields(VALUE rfields)$/;" f
|
1226
|
+
frt_get_q r_search.c /^frt_get_q(Query *q)$/;" f
|
1227
|
+
frt_get_query_i r_search.c /^frt_get_query_i(Index *ind, VALUE rquery, bool *destroy_query)$/;" f file:
|
1228
|
+
frt_get_rterm r_term.c /^frt_get_rterm(char *field, char *text)$/;" f
|
1229
|
+
frt_get_sd r_search.c /^frt_get_sd(Hit *hit)$/;" f file:
|
1230
|
+
frt_get_sf r_search.c /^frt_get_sf(SortField *sf)$/;" f file:
|
1231
|
+
frt_get_td r_search.c /^frt_get_td(TopDocs *td)$/;" f file:
|
1232
|
+
frt_get_tde r_index_io.c /^frt_get_tde(TermDocEnum *tde)$/;" f file:
|
1233
|
+
frt_get_term r_term.c /^frt_get_term(VALUE self)$/;" f
|
1234
|
+
frt_get_tv r_index_io.c /^frt_get_tv(TermVector *tv)$/;" f file:
|
1235
|
+
frt_hash_to_doc_i r_search.c /^frt_hash_to_doc_i(VALUE key, VALUE value, Document *doc)$/;" f file:
|
1236
|
+
frt_hash_update_doc_i r_search.c /^frt_hash_update_doc_i(VALUE key, VALUE value, Document *doc)$/;" f file:
|
1237
|
+
frt_ind_add_doc r_search.c /^frt_ind_add_doc(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1238
|
+
frt_ind_add_indexes r_search.c /^frt_ind_add_indexes(VALUE self, VALUE rindexes)$/;" f file:
|
1239
|
+
frt_ind_add_indexes_i r_search.c /^frt_ind_add_indexes_i(Index *ind, VALUE *indexes, int cnt)$/;" f file:
|
1240
|
+
frt_ind_close r_search.c /^frt_ind_close(VALUE self)$/;" f file:
|
1241
|
+
frt_ind_delete r_search.c /^frt_ind_delete(VALUE self, VALUE rid)$/;" f file:
|
1242
|
+
frt_ind_doc r_search.c /^frt_ind_doc(VALUE self, VALUE rid)$/;" f file:
|
1243
|
+
frt_ind_doc_i r_search.c /^frt_ind_doc_i(VALUE self, VALUE rid)$/;" f file:
|
1244
|
+
frt_ind_explain r_search.c /^frt_ind_explain(VALUE self, VALUE rquery, VALUE rdoc_num)$/;" f file:
|
1245
|
+
frt_ind_flush r_search.c /^frt_ind_flush(VALUE self)$/;" f file:
|
1246
|
+
frt_ind_free r_search.c /^frt_ind_free(void *p)$/;" f file:
|
1247
|
+
frt_ind_free_store_i r_search.c /^frt_ind_free_store_i(Index *self)$/;" f file:
|
1248
|
+
frt_ind_get_doc_num_i r_search.c /^frt_ind_get_doc_num_i(Index *ind, VALUE rid)$/;" f file:
|
1249
|
+
frt_ind_has_deletions r_search.c /^frt_ind_has_deletions(VALUE self)$/;" f file:
|
1250
|
+
frt_ind_has_writes r_search.c /^frt_ind_has_writes(VALUE self)$/;" f file:
|
1251
|
+
frt_ind_init r_search.c /^frt_ind_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1252
|
+
frt_ind_is_deleted r_search.c /^frt_ind_is_deleted(VALUE self, VALUE rdoc_num)$/;" f file:
|
1253
|
+
frt_ind_mark r_search.c /^frt_ind_mark(void *p)$/;" f file:
|
1254
|
+
frt_ind_optimize r_search.c /^frt_ind_optimize(VALUE self)$/;" f file:
|
1255
|
+
frt_ind_persist r_search.c /^frt_ind_persist(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1256
|
+
frt_ind_query_delete r_search.c /^frt_ind_query_delete(VALUE self, VALUE rquery)$/;" f file:
|
1257
|
+
frt_ind_query_update r_search.c /^frt_ind_query_update(VALUE self, VALUE rquery, VALUE rdoc)$/;" f file:
|
1258
|
+
frt_ind_qupd_i r_search.c /^static void frt_ind_qupd_i(Searcher *sea, int doc_num, void *arg)$/;" f file:
|
1259
|
+
frt_ind_search r_search.c /^frt_ind_search(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1260
|
+
frt_ind_search_each r_search.c /^frt_ind_search_each(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1261
|
+
frt_ind_size r_search.c /^frt_ind_size(VALUE self)$/;" f file:
|
1262
|
+
frt_ind_update r_search.c /^frt_ind_update(VALUE self, VALUE rid, VALUE rdoc)$/;" f file:
|
1263
|
+
frt_ir_close r_index_io.c /^frt_ir_close(VALUE self)$/;" f file:
|
1264
|
+
frt_ir_commit r_index_io.c /^frt_ir_commit(VALUE self)$/;" f file:
|
1265
|
+
frt_ir_delete r_index_io.c /^frt_ir_delete(VALUE self, VALUE rdoc_num)$/;" f file:
|
1266
|
+
frt_ir_doc_freq r_index_io.c /^frt_ir_doc_freq(VALUE self, VALUE rterm)$/;" f file:
|
1267
|
+
frt_ir_free r_index_io.c /^frt_ir_free(void *p)$/;" f
|
1268
|
+
frt_ir_get_doc r_index_io.c /^frt_ir_get_doc(VALUE self, VALUE rdoc_num)$/;" f file:
|
1269
|
+
frt_ir_get_norms r_index_io.c /^frt_ir_get_norms(VALUE self, VALUE rfield)$/;" f file:
|
1270
|
+
frt_ir_get_norms_into r_index_io.c /^frt_ir_get_norms_into(VALUE self, VALUE rfield, VALUE rnorms, VALUE roffset)$/;" f file:
|
1271
|
+
frt_ir_get_term_vector r_index_io.c /^frt_ir_get_term_vector(VALUE self, VALUE rdoc_num, VALUE rfield)$/;" f file:
|
1272
|
+
frt_ir_get_term_vectors r_index_io.c /^frt_ir_get_term_vectors(VALUE self, VALUE rdoc_num)$/;" f file:
|
1273
|
+
frt_ir_has_deletions r_index_io.c /^frt_ir_has_deletions(VALUE self)$/;" f file:
|
1274
|
+
frt_ir_init r_index_io.c /^frt_ir_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1275
|
+
frt_ir_is_deleted r_index_io.c /^frt_ir_is_deleted(VALUE self, VALUE rdoc_num)$/;" f file:
|
1276
|
+
frt_ir_is_latest r_index_io.c /^frt_ir_is_latest(VALUE self)$/;" f file:
|
1277
|
+
frt_ir_mark r_index_io.c /^frt_ir_mark(void *p)$/;" f
|
1278
|
+
frt_ir_max_doc r_index_io.c /^frt_ir_max_doc(VALUE self)$/;" f file:
|
1279
|
+
frt_ir_num_docs r_index_io.c /^frt_ir_num_docs(VALUE self)$/;" f file:
|
1280
|
+
frt_ir_open r_index_io.c /^frt_ir_open(int argc, VALUE *argv, VALUE klass)$/;" f file:
|
1281
|
+
frt_ir_set_norm r_index_io.c /^frt_ir_set_norm(VALUE self, VALUE rdoc_num, VALUE rfield, VALUE rval)$/;" f file:
|
1282
|
+
frt_ir_term_docs r_index_io.c /^frt_ir_term_docs(VALUE self)$/;" f file:
|
1283
|
+
frt_ir_term_docs_for r_index_io.c /^frt_ir_term_docs_for(VALUE self, VALUE rterm)$/;" f file:
|
1284
|
+
frt_ir_term_positions r_index_io.c /^frt_ir_term_positions(VALUE self)$/;" f file:
|
1285
|
+
frt_ir_term_positions_for r_index_io.c /^frt_ir_term_positions_for(VALUE self, VALUE rterm)$/;" f file:
|
1286
|
+
frt_ir_terms r_index_io.c /^frt_ir_terms(VALUE self)$/;" f file:
|
1287
|
+
frt_ir_terms_from r_index_io.c /^frt_ir_terms_from(VALUE self, VALUE rterm)$/;" f file:
|
1288
|
+
frt_ir_undelete_all r_index_io.c /^frt_ir_undelete_all(VALUE self)$/;" f file:
|
1289
|
+
frt_is_close r_search.c /^frt_is_close(VALUE self)$/;" f file:
|
1290
|
+
frt_is_doc r_search.c /^frt_is_doc(VALUE self, VALUE rdoc_num)$/;" f file:
|
1291
|
+
frt_is_doc_freq r_search.c /^frt_is_doc_freq(VALUE self, VALUE rterm)$/;" f file:
|
1292
|
+
frt_is_doc_freqs r_search.c /^frt_is_doc_freqs(VALUE self, VALUE rterms)$/;" f file:
|
1293
|
+
frt_is_explain r_search.c /^frt_is_explain(VALUE self, VALUE rquery, VALUE rdoc_num)$/;" f file:
|
1294
|
+
frt_is_free r_search.c /^frt_is_free(void *p)$/;" f file:
|
1295
|
+
frt_is_init r_search.c /^frt_is_init(VALUE self, VALUE obj)$/;" f file:
|
1296
|
+
frt_is_mark r_search.c /^frt_is_mark(void *p)$/;" f file:
|
1297
|
+
frt_is_max_doc r_search.c /^frt_is_max_doc(VALUE self)$/;" f file:
|
1298
|
+
frt_is_search r_search.c /^frt_is_search(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1299
|
+
frt_is_search_each r_search.c /^frt_is_search_each(VALUE self, VALUE rquery, VALUE roptions)$/;" f file:
|
1300
|
+
frt_is_search_internal r_search.c /^frt_is_search_internal(Query *query, VALUE roptions, Searcher *sea)$/;" f file:
|
1301
|
+
frt_iw_add_doc r_index_io.c /^frt_iw_add_doc(VALUE self, VALUE rdoc)$/;" f file:
|
1302
|
+
frt_iw_close r_index_io.c /^frt_iw_close(VALUE self)$/;" f file:
|
1303
|
+
frt_iw_free r_index_io.c /^frt_iw_free(void *p)$/;" f
|
1304
|
+
frt_iw_get_doc_count r_index_io.c /^frt_iw_get_doc_count(VALUE self)$/;" f file:
|
1305
|
+
frt_iw_get_max_field_length r_index_io.c /^frt_iw_get_max_field_length(VALUE self)$/;" f file:
|
1306
|
+
frt_iw_get_max_merge_docs r_index_io.c /^frt_iw_get_max_merge_docs(VALUE self)$/;" f file:
|
1307
|
+
frt_iw_get_merge_factor r_index_io.c /^frt_iw_get_merge_factor(VALUE self)$/;" f file:
|
1308
|
+
frt_iw_get_min_merge_docs r_index_io.c /^frt_iw_get_min_merge_docs(VALUE self)$/;" f file:
|
1309
|
+
frt_iw_get_term_index_interval r_index_io.c /^frt_iw_get_term_index_interval(VALUE self)$/;" f file:
|
1310
|
+
frt_iw_get_use_compound_file r_index_io.c /^frt_iw_get_use_compound_file(VALUE self)$/;" f file:
|
1311
|
+
frt_iw_init r_index_io.c /^frt_iw_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1312
|
+
frt_iw_mark r_index_io.c /^frt_iw_mark(void *p)$/;" f
|
1313
|
+
frt_iw_optimize r_index_io.c /^frt_iw_optimize(VALUE self)$/;" f file:
|
1314
|
+
frt_iw_set_max_field_length r_index_io.c /^frt_iw_set_max_field_length(VALUE self, VALUE val)$/;" f file:
|
1315
|
+
frt_iw_set_max_merge_docs r_index_io.c /^frt_iw_set_max_merge_docs(VALUE self, VALUE val)$/;" f file:
|
1316
|
+
frt_iw_set_merge_factor r_index_io.c /^frt_iw_set_merge_factor(VALUE self, VALUE val)$/;" f file:
|
1317
|
+
frt_iw_set_min_merge_docs r_index_io.c /^frt_iw_set_min_merge_docs(VALUE self, VALUE val)$/;" f file:
|
1318
|
+
frt_iw_set_term_index_interval r_index_io.c /^frt_iw_set_term_index_interval(VALUE self, VALUE val)$/;" f file:
|
1319
|
+
frt_iw_set_use_compound_file r_index_io.c /^frt_iw_set_use_compound_file(VALUE self, VALUE val)$/;" f file:
|
1320
|
+
frt_letter_analyzer_init r_analysis.c /^frt_letter_analyzer_init(VALUE self)$/;" f file:
|
1321
|
+
frt_letter_tokenizer_init r_analysis.c /^frt_letter_tokenizer_init(VALUE self, VALUE rstr) $/;" f file:
|
1322
|
+
frt_lock_free r_store.c /^frt_lock_free(void *p)$/;" f
|
1323
|
+
frt_lock_is_locked r_store.c /^frt_lock_is_locked(VALUE self)$/;" f file:
|
1324
|
+
frt_lock_mark r_store.c /^frt_lock_mark(void *p)$/;" f
|
1325
|
+
frt_lock_obtain r_store.c /^frt_lock_obtain(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1326
|
+
frt_lock_release r_store.c /^frt_lock_release(VALUE self)$/;" f file:
|
1327
|
+
frt_lock_while_locked r_store.c /^frt_lock_while_locked(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1328
|
+
frt_maq_alloc r_search.c /^frt_maq_alloc(VALUE klass)$/;" f file:
|
1329
|
+
frt_maq_init r_search.c /^frt_maq_init(VALUE self)$/;" f file:
|
1330
|
+
frt_mphq_add r_search.c /^frt_mphq_add(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1331
|
+
frt_mphq_alloc r_search.c /^frt_mphq_alloc(VALUE klass)$/;" f file:
|
1332
|
+
frt_mphq_get_slop r_search.c /^frt_mphq_get_slop(VALUE self)$/;" f file:
|
1333
|
+
frt_mphq_init r_search.c /^frt_mphq_init(VALUE self)$/;" f file:
|
1334
|
+
frt_mphq_set_slop r_search.c /^frt_mphq_set_slop(VALUE self, VALUE rslop)$/;" f file:
|
1335
|
+
frt_mphq_shift r_search.c /^frt_mphq_shift(VALUE self, VALUE rterm)$/;" f file:
|
1336
|
+
frt_phq_add r_search.c /^frt_phq_add(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1337
|
+
frt_phq_alloc r_search.c /^frt_phq_alloc(VALUE klass)$/;" f file:
|
1338
|
+
frt_phq_get_slop r_search.c /^frt_phq_get_slop(VALUE self)$/;" f file:
|
1339
|
+
frt_phq_init r_search.c /^frt_phq_init(VALUE self)$/;" f file:
|
1340
|
+
frt_phq_set_slop r_search.c /^frt_phq_set_slop(VALUE self, VALUE rslop)$/;" f file:
|
1341
|
+
frt_phq_shift r_search.c /^frt_phq_shift(VALUE self, VALUE rterm)$/;" f file:
|
1342
|
+
frt_prq_init r_search.c /^frt_prq_init(VALUE self, VALUE rterm)$/;" f file:
|
1343
|
+
frt_q_free r_search.c /^frt_q_free(void *p)$/;" f file:
|
1344
|
+
frt_q_get_boost r_search.c /^frt_q_get_boost(VALUE self)$/;" f file:
|
1345
|
+
frt_q_set_boost r_search.c /^frt_q_set_boost(VALUE self, VALUE rboost)$/;" f file:
|
1346
|
+
frt_q_to_s r_search.c /^frt_q_to_s(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1347
|
+
frt_qf_init r_search.c /^frt_qf_init(VALUE self, VALUE rquery)$/;" f file:
|
1348
|
+
frt_qp_free r_qparser.c /^frt_qp_free(void *p)$/;" f file:
|
1349
|
+
frt_qp_init r_qparser.c /^frt_qp_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1350
|
+
frt_qp_mark r_qparser.c /^frt_qp_mark(void *p)$/;" f file:
|
1351
|
+
frt_qp_parse r_qparser.c /^frt_qp_parse(VALUE self, VALUE rstr)$/;" f file:
|
1352
|
+
frt_ramdir_init r_store.c /^frt_ramdir_init(int argc, VALUE *argv, VALUE self) $/;" f file:
|
1353
|
+
frt_rdoc_to_doc r_search.c /^frt_rdoc_to_doc(Index *ind, VALUE rdoc, bool *close_doc)$/;" f file:
|
1354
|
+
frt_rdoc_update_doc r_search.c /^frt_rdoc_update_doc(Index *ind, VALUE rdoc, Document *doc)$/;" f file:
|
1355
|
+
frt_rf_init r_search.c /^frt_rf_init(VALUE self, VALUE rfield, VALUE rlterm, VALUE ruterm,$/;" f file:
|
1356
|
+
frt_rf_new_less r_search.c /^frt_rf_new_less(int argc, VALUE *argv, VALUE klass)$/;" f file:
|
1357
|
+
frt_rf_new_more r_search.c /^frt_rf_new_more(int argc, VALUE *argv, VALUE klass)$/;" f file:
|
1358
|
+
frt_rq_init r_search.c /^frt_rq_init(VALUE self, VALUE rfield, VALUE rlterm, VALUE ruterm,$/;" f file:
|
1359
|
+
frt_rq_new_less r_search.c /^frt_rq_new_less(VALUE klass, VALUE rfield, VALUE ruterm, VALUE rincu)$/;" f file:
|
1360
|
+
frt_rq_new_more r_search.c /^frt_rq_new_more(VALUE klass, VALUE rfield, VALUE rlterm, VALUE rincl)$/;" f file:
|
1361
|
+
frt_sd_doc r_search.c /^frt_sd_doc(VALUE self)$/;" f file:
|
1362
|
+
frt_sd_free r_search.c /^frt_sd_free(void *p)$/;" f file:
|
1363
|
+
frt_sd_score r_search.c /^frt_sd_score(VALUE self)$/;" f file:
|
1364
|
+
frt_set_term r_term.c /^frt_set_term(VALUE self, Term *t)$/;" f
|
1365
|
+
frt_sf_free r_search.c /^frt_sf_free(void *p)$/;" f file:
|
1366
|
+
frt_sf_get_comparator r_search.c /^frt_sf_get_comparator(VALUE self)$/;" f file:
|
1367
|
+
frt_sf_get_name r_search.c /^frt_sf_get_name(VALUE self)$/;" f file:
|
1368
|
+
frt_sf_get_sort_type r_search.c /^frt_sf_get_sort_type(VALUE self)$/;" f file:
|
1369
|
+
frt_sf_init r_search.c /^frt_sf_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1370
|
+
frt_sf_is_reverse r_search.c /^frt_sf_is_reverse(VALUE self)$/;" f file:
|
1371
|
+
frt_sort_add r_search.c /^frt_sort_add(Sort *sort, VALUE rsf, bool reverse)$/;" f file:
|
1372
|
+
frt_sort_alloc r_search.c /^frt_sort_alloc(VALUE klass)$/;" f file:
|
1373
|
+
frt_sort_free r_search.c /^frt_sort_free(void *p)$/;" f file:
|
1374
|
+
frt_sort_get_fields r_search.c /^frt_sort_get_fields(VALUE self)$/;" f file:
|
1375
|
+
frt_sort_init r_search.c /^frt_sort_init(int argc, VALUE *argv, VALUE self)$/;" f file:
|
1376
|
+
frt_sort_mark r_search.c /^frt_sort_mark(void *p)$/;" f file:
|
1377
|
+
frt_spanfq_init r_search.c /^frt_spanfq_init(VALUE self, VALUE rmatch, VALUE rend)$/;" f file:
|
1378
|
+
frt_spannq_free r_search.c /^frt_spannq_free(void *p)$/;" f file:
|
1379
|
+
frt_spannq_init r_search.c /^frt_spannq_init(VALUE self, VALUE rclauses, VALUE rslop, VALUE rin_order)$/;" f file:
|
1380
|
+
frt_spannq_mark r_search.c /^frt_spannq_mark(void *p)$/;" f file:
|
1381
|
+
frt_spanoq_free r_search.c /^frt_spanoq_free(void *p)$/;" f file:
|
1382
|
+
frt_spanoq_init r_search.c /^frt_spanoq_init(VALUE self, VALUE rclauses)$/;" f file:
|
1383
|
+
frt_spanoq_mark r_search.c /^frt_spanoq_mark(void *p)$/;" f file:
|
1384
|
+
frt_spantq_init r_search.c /^frt_spantq_init(VALUE self, VALUE rterm)$/;" f file:
|
1385
|
+
frt_spanxq_init r_search.c /^frt_spanxq_init(VALUE self, VALUE rinc, VALUE rexc)$/;" f file:
|
1386
|
+
frt_spanxq_mark r_search.c /^frt_spanxq_mark(void *p)$/;" f file:
|
1387
|
+
frt_standard_analyzer_init r_analysis.c /^frt_standard_analyzer_init(VALUE self)$/;" f file:
|
1388
|
+
frt_td_each r_search.c /^frt_td_each(VALUE self)$/;" f file:
|
1389
|
+
frt_td_fields r_search.c /^frt_td_fields(VALUE self)$/;" f file:
|
1390
|
+
frt_td_free r_search.c /^frt_td_free(void *p)$/;" f file:
|
1391
|
+
frt_td_hits r_search.c /^frt_td_hits(VALUE self)$/;" f file:
|
1392
|
+
frt_td_mark r_search.c /^frt_td_mark(void *p)$/;" f file:
|
1393
|
+
frt_td_size r_search.c /^frt_td_size(VALUE self)$/;" f file:
|
1394
|
+
frt_td_total_hits r_search.c /^frt_td_total_hits(VALUE self)$/;" f file:
|
1395
|
+
frt_tde_close r_index_io.c /^frt_tde_close(VALUE self)$/;" f file:
|
1396
|
+
frt_tde_doc r_index_io.c /^frt_tde_doc(VALUE self)$/;" f file:
|
1397
|
+
frt_tde_free r_index_io.c /^frt_tde_free(void *p)$/;" f
|
1398
|
+
frt_tde_freq r_index_io.c /^frt_tde_freq(VALUE self)$/;" f file:
|
1399
|
+
frt_tde_next r_index_io.c /^frt_tde_next(VALUE self)$/;" f file:
|
1400
|
+
frt_tde_next_position r_index_io.c /^frt_tde_next_position(VALUE self)$/;" f file:
|
1401
|
+
frt_tde_read r_index_io.c /^frt_tde_read(VALUE self, VALUE rdocs, VALUE rfreqs)$/;" f file:
|
1402
|
+
frt_tde_seek r_index_io.c /^frt_tde_seek(VALUE self, VALUE rterm)$/;" f file:
|
1403
|
+
frt_tde_skip_to r_index_io.c /^frt_tde_skip_to(VALUE self, VALUE rtarget)$/;" f file:
|
1404
|
+
frt_te_close r_index_io.c /^frt_te_close(VALUE self)$/;" f file:
|
1405
|
+
frt_te_doc_freq r_index_io.c /^frt_te_doc_freq(VALUE self)$/;" f file:
|
1406
|
+
frt_te_free r_index_io.c /^frt_te_free(void *p)$/;" f file:
|
1407
|
+
frt_te_next r_index_io.c /^frt_te_next(VALUE self)$/;" f file:
|
1408
|
+
frt_te_skip_to r_index_io.c /^frt_te_skip_to(VALUE self, VALUE rterm)$/;" f file:
|
1409
|
+
frt_te_term r_index_io.c /^frt_te_term(VALUE self)$/;" f file:
|
1410
|
+
frt_term_alloc r_term.c /^frt_term_alloc(VALUE klass)$/;" f file:
|
1411
|
+
frt_term_cmp r_term.c /^frt_term_cmp(RTerm *t1, RTerm *t2)$/;" f
|
1412
|
+
frt_term_compare_to r_term.c /^frt_term_compare_to(VALUE self, VALUE other)$/;" f file:
|
1413
|
+
frt_term_compare_to_int r_term.c /^frt_term_compare_to_int(VALUE self, VALUE rother)$/;" f
|
1414
|
+
frt_term_eq r_term.c /^frt_term_eq(VALUE self, VALUE rother)$/;" f
|
1415
|
+
frt_term_ge r_term.c /^frt_term_ge(VALUE self, VALUE rother)$/;" f
|
1416
|
+
frt_term_get_field r_term.c /^frt_term_get_field(VALUE self)$/;" f file:
|
1417
|
+
frt_term_get_text r_term.c /^frt_term_get_text(VALUE self)$/;" f file:
|
1418
|
+
frt_term_gt r_term.c /^frt_term_gt(VALUE self, VALUE rother)$/;" f
|
1419
|
+
frt_term_hash r_term.c /^frt_term_hash(VALUE self)$/;" f file:
|
1420
|
+
frt_term_init r_term.c /^frt_term_init(VALUE self, VALUE rfield, VALUE rtext)$/;" f file:
|
1421
|
+
frt_term_le r_term.c /^frt_term_le(VALUE self, VALUE rother)$/;" f
|
1422
|
+
frt_term_lt r_term.c /^frt_term_lt(VALUE self, VALUE rother)$/;" f
|
1423
|
+
frt_term_mark r_term.c /^frt_term_mark(void *p)$/;" f
|
1424
|
+
frt_term_set_field r_term.c /^frt_term_set_field(VALUE self, VALUE rfield)$/;" f file:
|
1425
|
+
frt_term_set_text r_term.c /^frt_term_set_text(VALUE self, VALUE rtext)$/;" f file:
|
1426
|
+
frt_term_to_s r_term.c /^frt_term_to_s(VALUE self)$/;" f
|
1427
|
+
frt_token_alloc r_analysis.c /^frt_token_alloc(VALUE klass)$/;" f file:
|
1428
|
+
frt_token_cmp r_analysis.c /^frt_token_cmp(VALUE self, VALUE rother)$/;" f file:
|
1429
|
+
frt_token_free r_analysis.c /^frt_token_free(void *p)$/;" f file:
|
1430
|
+
frt_token_get_end_offset r_analysis.c /^frt_token_get_end_offset(VALUE self)$/;" f file:
|
1431
|
+
frt_token_get_pos_inc r_analysis.c /^frt_token_get_pos_inc(VALUE self)$/;" f file:
|
1432
|
+
frt_token_get_start_offset r_analysis.c /^frt_token_get_start_offset(VALUE self)$/;" f file:
|
1433
|
+
frt_token_get_text r_analysis.c /^frt_token_get_text(VALUE self)$/;" f file:
|
1434
|
+
frt_token_init r_analysis.c /^frt_token_init(int argc, VALUE *argv, VALUE self) $/;" f file:
|
1435
|
+
frt_token_mark r_analysis.c /^frt_token_mark(void *p)$/;" f file:
|
1436
|
+
frt_token_set_text r_analysis.c /^frt_token_set_text(VALUE self, VALUE rtext)$/;" f file:
|
1437
|
+
frt_token_to_s r_analysis.c /^frt_token_to_s(VALUE self)$/;" f file:
|
1438
|
+
frt_tokenizer_free r_analysis.c /^frt_tokenizer_free(void *p)$/;" f file:
|
1439
|
+
frt_tq_init r_search.c /^frt_tq_init(VALUE self, VALUE rterm)$/;" f file:
|
1440
|
+
frt_tv_free r_index_io.c /^frt_tv_free(void *p)$/;" f
|
1441
|
+
frt_tv_get_field r_index_io.c /^frt_tv_get_field(VALUE self)$/;" f file:
|
1442
|
+
frt_tv_get_freqs r_index_io.c /^frt_tv_get_freqs(VALUE self)$/;" f file:
|
1443
|
+
frt_tv_get_offsets r_index_io.c /^frt_tv_get_offsets(VALUE self)$/;" f file:
|
1444
|
+
frt_tv_get_positions r_index_io.c /^frt_tv_get_positions(VALUE self)$/;" f file:
|
1445
|
+
frt_tv_get_terms r_index_io.c /^frt_tv_get_terms(VALUE self)$/;" f file:
|
1446
|
+
frt_tv_mark r_index_io.c /^frt_tv_mark(void *p)$/;" f
|
1447
|
+
frt_tvoi_eql r_index_io.c /^frt_tvoi_eql(VALUE self, VALUE rother)$/;" f file:
|
1448
|
+
frt_tvoi_free r_index_io.c /^frt_tvoi_free(void *p)$/;" f
|
1449
|
+
frt_tvoi_get_end r_index_io.c /^frt_tvoi_get_end(VALUE self)$/;" f file:
|
1450
|
+
frt_tvoi_get_start r_index_io.c /^frt_tvoi_get_start(VALUE self)$/;" f file:
|
1451
|
+
frt_tvoi_hash r_index_io.c /^frt_tvoi_hash(VALUE self, VALUE rother)$/;" f file:
|
1452
|
+
frt_tvoi_init r_index_io.c /^frt_tvoi_init(VALUE self, VALUE rstart, VALUE rend)$/;" f file:
|
1453
|
+
frt_tvoi_set_end r_index_io.c /^frt_tvoi_set_end(VALUE self, VALUE rend)$/;" f file:
|
1454
|
+
frt_tvoi_set_start r_index_io.c /^frt_tvoi_set_start(VALUE self, VALUE rstart)$/;" f file:
|
1455
|
+
frt_tvoi_to_s r_index_io.c /^frt_tvoi_to_s(VALUE self)$/;" f file:
|
1456
|
+
frt_wcq_init r_search.c /^frt_wcq_init(VALUE self, VALUE rterm)$/;" f file:
|
1457
|
+
frt_white_space_analyzer_init r_analysis.c /^frt_white_space_analyzer_init(VALUE self)$/;" f file:
|
1458
|
+
fs_clear fs_store.c /^void fs_clear(Store *store)$/;" f
|
1459
|
+
fs_clear_all fs_store.c /^void fs_clear_all(Store *store)$/;" f
|
1460
|
+
fs_clear_locks fs_store.c /^void fs_clear_locks(Store *store)$/;" f
|
1461
|
+
fs_close fs_store.c /^void fs_close(Store *store)$/;" f
|
1462
|
+
fs_close_lock fs_store.c /^void fs_close_lock(Lock *lock)$/;" f
|
1463
|
+
fs_count fs_store.c /^int fs_count(Store *store)$/;" f
|
1464
|
+
fs_create_output fs_store.c /^OutStream *fs_create_output(Store *store, const char *filename)$/;" f
|
1465
|
+
fs_destroy fs_store.c /^void fs_destroy(void *p)$/;" f
|
1466
|
+
fs_each fs_store.c /^void fs_each(Store *store, void (*func)(char *fname, void *arg), void *arg)$/;" f
|
1467
|
+
fs_exists fs_store.c /^int fs_exists(Store *store, char *filename)$/;" f
|
1468
|
+
fs_length fs_store.c /^int fs_length(Store *store, char *filename)$/;" f
|
1469
|
+
fs_lock_is_locked fs_store.c /^int fs_lock_is_locked(Lock *lock)$/;" f
|
1470
|
+
fs_lock_obtain fs_store.c /^int fs_lock_obtain(Lock *lock)$/;" f
|
1471
|
+
fs_lock_release fs_store.c /^void fs_lock_release(Lock *lock)$/;" f
|
1472
|
+
fs_open_input fs_store.c /^InStream *fs_open_input(Store *store, const char *filename)$/;" f
|
1473
|
+
fs_open_lock fs_store.c /^Lock *fs_open_lock(Store *store, char *lockname)$/;" f
|
1474
|
+
fs_remove fs_store.c /^int fs_remove(Store *store, char *filename)$/;" f
|
1475
|
+
fs_rename fs_store.c /^int fs_rename(Store *store, char *from, char *to)$/;" f
|
1476
|
+
fs_store_create fs_store.c /^Store *fs_store_create(const char *pathname)$/;" f
|
1477
|
+
fs_touch fs_store.c /^void fs_touch(Store *store, char *filename)$/;" f
|
1478
|
+
fshq_less_than sort.c /^bool fshq_less_than(void *hit1, void *hit2)$/;" f
|
1479
|
+
fshq_lt sort.c /^inline bool fshq_lt(Hit *sorter_ptr, Hit *hit1, Hit *hit2)$/;" f
|
1480
|
+
fshq_pq_create sort.c /^PriorityQueue *fshq_pq_create(int size, Sort *sort, IndexReader *ir)$/;" f
|
1481
|
+
fshq_pq_destroy sort.c /^void fshq_pq_destroy(void *p)$/;" f
|
1482
|
+
fshq_pq_down sort.c /^void fshq_pq_down(PriorityQueue *pq)$/;" f
|
1483
|
+
fshq_pq_pop sort.c /^Hit *fshq_pq_pop(PriorityQueue *pq)$/;" f
|
1484
|
+
fshq_pq_push sort.c /^void fshq_pq_push(PriorityQueue *pq, void *elem)$/;" f
|
1485
|
+
fshq_pq_up sort.c /^inline void fshq_pq_up(PriorityQueue *pq)$/;" f
|
1486
|
+
fsi_clone_internal fs_store.c /^void fsi_clone_internal(InStream *is, InStream *new_is)$/;" f
|
1487
|
+
fsi_close_internal fs_store.c /^void fsi_close_internal(InStream *is)$/;" f
|
1488
|
+
fsi_length fs_store.c /^int fsi_length(InStream *is)$/;" f
|
1489
|
+
fsi_read_internal fs_store.c /^void fsi_read_internal(InStream *is, uchar *b, int offset, int len)$/;" f
|
1490
|
+
fsi_seek_internal fs_store.c /^void fsi_seek_internal(InStream *is, int pos)$/;" f
|
1491
|
+
fsize index.h /^ int fsize;$/;" m struct:TermVectorsWriter
|
1492
|
+
fso_close_internal fs_store.c /^void fso_close_internal(OutStream *os)$/;" f
|
1493
|
+
fso_flush_internal fs_store.c /^void fso_flush_internal(OutStream *os, uchar *src, int len)$/;" f
|
1494
|
+
fso_seek_internal fs_store.c /^void fso_seek_internal(OutStream *os, int pos)$/;" f
|
1495
|
+
ft_raise lang.c /^void ft_raise(char *file, int line_num, VALUE etype, const char *fmt, ...)$/;" f
|
1496
|
+
fuzq_calculate_max_distance q_fuzzy.c /^int fuzq_calculate_max_distance(FuzzyQuery *fuzq, int m) $/;" f
|
1497
|
+
fuzq_create q_fuzzy.c /^Query *fuzq_create(Term *term)$/;" f
|
1498
|
+
fuzq_create_mp q_fuzzy.c /^Query *fuzq_create_mp(Term *term, float min_sim, int pre_len)$/;" f
|
1499
|
+
fuzq_destroy q_fuzzy.c /^void fuzq_destroy(void *p)$/;" f
|
1500
|
+
fuzq_get_max_distance q_fuzzy.c /^float fuzq_get_max_distance(FuzzyQuery *fuzq, int m)$/;" f
|
1501
|
+
fuzq_initialize_max_distances q_fuzzy.c /^void fuzq_initialize_max_distances(FuzzyQuery *fuzq)$/;" f
|
1502
|
+
fuzq_rewrite q_fuzzy.c /^Query *fuzq_rewrite(Query *self, IndexReader *ir)$/;" f
|
1503
|
+
fuzq_score q_fuzzy.c /^float fuzq_score(FuzzyQuery *fuzq, char *target)$/;" f
|
1504
|
+
fuzq_to_s q_fuzzy.c /^char *fuzq_to_s(Query *self, char *field) $/;" f
|
1505
|
+
fw_add_doc field.c /^void fw_add_doc(FieldsWriter *fw, Document *doc)$/;" f
|
1506
|
+
fw_close field.c /^void fw_close(FieldsWriter *fw)$/;" f
|
1507
|
+
fw_open field.c /^FieldsWriter *fw_open(Store *store, char *segment, FieldInfos *fis)$/;" f
|
1508
|
+
get_bool_cls q_parser.c /^BooleanClause *get_bool_cls(Query *q, unsigned int occur)$/;" f
|
1509
|
+
get_bool_q q_parser.c /^Query *get_bool_q(Array *bclauses)$/;" f
|
1510
|
+
get_bv search.h /^ BitVector *(*get_bv)(struct Filter *self, IndexReader *ir);$/;" m struct:Filter
|
1511
|
+
get_doc index.h /^ Document *(*get_doc)(IndexReader *ir, int doc_num);$/;" m struct:IndexReader
|
1512
|
+
get_doc search.h /^ Document *(*get_doc)(Searcher *self, int doc_num);$/;" m struct:Searcher
|
1513
|
+
get_field_names index.h /^ HashSet *(*get_field_names)(IndexReader *ir, int field_type);$/;" m struct:IndexReader
|
1514
|
+
get_fuzzy_q q_parser.c /^Query *get_fuzzy_q(QParser *qp, char *field, char *word, char *slop_str)$/;" f
|
1515
|
+
get_multi_phrase_query q_parser.c /^Query *get_multi_phrase_query(QParser *qp, char *field, Phrase *phrase, int slop)$/;" f
|
1516
|
+
get_normal_phrase_query q_parser.c /^Query *get_normal_phrase_query(QParser *qp, char *field, Phrase *phrase, int slop)$/;" f
|
1517
|
+
get_norms index.h /^ uchar *(*get_norms)(IndexReader *ir, char *field);$/;" m struct:IndexReader
|
1518
|
+
get_norms_always index.h /^ uchar *(*get_norms_always)(IndexReader *ir, char *field);$/;" m struct:IndexReader
|
1519
|
+
get_norms_into index.h /^ void (*get_norms_into)(IndexReader *ir, char *field, uchar *buf, int offset);$/;" m struct:IndexReader
|
1520
|
+
get_phrase_q q_parser.c /^Query *get_phrase_q(QParser *qp, Phrase *phrase, char *slop_str)$/;" f
|
1521
|
+
get_query search.h /^ Query *(*get_query)(Weight *self);$/;" m struct:Weight
|
1522
|
+
get_range_q q_parser.c /^Query *get_range_q(char *field, char *from, char *to, bool inc_lower, bool inc_upper)$/;" f
|
1523
|
+
get_similarity search.h /^ Similarity *(*get_similarity)(Searcher *self);$/;" m struct:Searcher
|
1524
|
+
get_similarity search.h /^ Similarity *(*get_similarity)(Query *self, Searcher *searcher);$/;" m struct:Query
|
1525
|
+
get_spans search.h /^ SpanEnum *(*get_spans)(Query *self, IndexReader *ir);$/;" m struct:SpanQuery
|
1526
|
+
get_term_q q_parser.c /^Query *get_term_q(QParser *qp, char *field, char *word)$/;" f
|
1527
|
+
get_term_vector index.h /^ TermVector *(*get_term_vector)(IndexReader *ir, int doc_num, char *field);$/;" m struct:IndexReader
|
1528
|
+
get_term_vectors index.h /^ Array *(*get_term_vectors)(IndexReader *ir, int doc_num);$/;" m struct:IndexReader
|
1529
|
+
get_terms search.h /^ Array *(*get_terms)(Query *self);$/;" m struct:SpanQuery
|
1530
|
+
get_ts analysis.h /^ TokenStream *(*get_ts)(struct Analyzer *a, char *field, char *text);$/;" m struct:Analyzer
|
1531
|
+
get_value search.h /^ float (*get_value)(Weight *self);$/;" m struct:Weight
|
1532
|
+
get_wild_q q_parser.c /^Query *get_wild_q(QParser *qp, char *field, char *pattern)$/;" f
|
1533
|
+
get_word q_parser.c /^int get_word(YYSTYPE *lvalp, QParser *qp)$/;" f
|
1534
|
+
h_clear hash.c /^void h_clear(HshTable *ht)$/;" f
|
1535
|
+
h_del hash.c /^int h_del(HshTable *ht, const void *key)$/;" f
|
1536
|
+
h_destroy hash.c /^void h_destroy(HshTable *ht)$/;" f
|
1537
|
+
h_get hash.c /^void *h_get(HshTable *ht, const void *key)$/;" f
|
1538
|
+
h_has_key hash.c /^int h_has_key(HshTable *ht, const void *key)$/;" f
|
1539
|
+
h_lookup hash.c /^HshEntry *h_lookup(HshTable *ht, register const void *key)$/;" f
|
1540
|
+
h_lookup_str hash.c /^HshEntry *h_lookup_str(HshTable *ht, register const void *key_p)$/;" f
|
1541
|
+
h_new hash.c /^HshTable *h_new(unsigned int (*hash)(const void *key),$/;" f
|
1542
|
+
h_new_str hash.c /^HshTable *h_new_str(void (*free_key)(void *key), void (*free_value)(void *value))$/;" f
|
1543
|
+
h_rem hash.c /^void *h_rem(HshTable *ht, const void *key, bool destory_key)$/;" f
|
1544
|
+
h_resize hash.c /^int h_resize(HshTable *ht, int min_newsize) {$/;" f
|
1545
|
+
h_set hash.c /^int h_set(HshTable *ht, const void *key, void *value)$/;" f
|
1546
|
+
handle_parse_errors search.h /^ bool handle_parse_errors : 1;$/;" m struct:QParser
|
1547
|
+
handle_term search.h /^ void (*handle_term)(void *index, TermDocEnum *tde, char *text);$/;" m struct:SortField
|
1548
|
+
has_changes index.h /^ bool has_changes : 1;$/;" m struct:IndexReader
|
1549
|
+
has_deletions index.h /^ bool (*has_deletions)(IndexReader *ir);$/;" m struct:IndexReader
|
1550
|
+
has_deletions index.h /^ bool has_deletions : 1;$/;" m struct:MultiReader
|
1551
|
+
has_norm_file index_rw.c /^ bool has_norm_file;$/;" m struct:NormTester file:
|
1552
|
+
has_norms index.h /^ bool (*has_norms)(IndexReader *ir, char *field);$/;" m struct:IndexReader
|
1553
|
+
has_writes search.h /^ bool has_writes : 1;$/;" m struct:Index
|
1554
|
+
hash hash.c /^unsigned int hash(const char *str)$/;" f
|
1555
|
+
hash hash.h /^ int hash; \/* cached hash code of key *\/$/;" m
|
1556
|
+
hash hash.h /^ unsigned int (*hash)(const void *key);$/;" m struct:HshTable
|
1557
|
+
hashset q_parser.c /^ HashSet *hashset;$/;" m union:YYSTYPE file:
|
1558
|
+
have_skipped index.h /^ unsigned int have_skipped : 1;$/;" m struct:SegmentTermDocEnum
|
1559
|
+
hdrdir Makefile /^hdrdir = $(topdir)$/;" m
|
1560
|
+
heap priorityqueue.h /^ void **heap;$/;" m struct:PriorityQueue
|
1561
|
+
heap priorityqueue.h /^ void **heap;$/;" m struct:PriorityQueue2
|
1562
|
+
high_bit similarity.c /^static int low_bit = 0, low_mid_bit = 0, high_mid_bit = 0, high_bit = 0;$/;" v file:
|
1563
|
+
high_mid_bit similarity.c /^static int low_bit = 0, low_mid_bit = 0, high_mid_bit = 0, high_bit = 0;$/;" v file:
|
1564
|
+
hit_less_than search.c /^bool hit_less_than(void *hit1, void *hit2)$/;" f
|
1565
|
+
hit_lt search.c /^inline bool hit_lt(Hit *hit1, Hit *hit2)$/;" f
|
1566
|
+
hit_pq_down search.c /^void hit_pq_down(PriorityQueue *pq)$/;" f
|
1567
|
+
hit_pq_pop search.c /^Hit *hit_pq_pop(PriorityQueue *pq)$/;" f
|
1568
|
+
hit_pq_push search.c /^void hit_pq_push(PriorityQueue *pq, void *elem) $/;" f
|
1569
|
+
hit_pq_up search.c /^inline void hit_pq_up(PriorityQueue *pq)$/;" f
|
1570
|
+
hits search.h /^ Hit **hits;$/;" m struct:TopDocs
|
1571
|
+
hlp_string_diff helper.c /^inline int hlp_string_diff(register const char *const s1,$/;" f
|
1572
|
+
hs_add hashset.c /^int hs_add(HashSet *hs, void *elem)$/;" f
|
1573
|
+
hs_clear hashset.c /^void hs_clear(HashSet *self)$/;" f
|
1574
|
+
hs_create hashset.c /^HashSet *hs_create(unsigned int (*hash)(const void *p),$/;" f
|
1575
|
+
hs_del hashset.c /^int hs_del(HashSet *hs, void *elem)$/;" f
|
1576
|
+
hs_destroy hashset.c /^void hs_destroy(void *p)$/;" f
|
1577
|
+
hs_destroy_all hashset.c /^void hs_destroy_all(void *p)$/;" f
|
1578
|
+
hs_dummy_free hashset.c /^void hs_dummy_free(void *p){}$/;" f
|
1579
|
+
hs_exists hashset.c /^int hs_exists(HashSet *hs, void *elem)$/;" f
|
1580
|
+
hs_merge hashset.c /^HashSet *hs_merge(HashSet *hs, HashSet *other)$/;" f
|
1581
|
+
hs_orig hashset.c /^void *hs_orig(HashSet *hs, void *elem)$/;" f
|
1582
|
+
hs_rem hashset.c /^void *hs_rem(HashSet *hs, void *elem)$/;" f
|
1583
|
+
hs_str_create hashset.c /^HashSet *hs_str_create(void (*free_elem)(void *p))$/;" f
|
1584
|
+
ht hashset.h /^ HshTable *ht;$/;" m struct:HashSet
|
1585
|
+
ht store.h /^ HshTable *ht; \/* for ram_store only *\/$/;" m union:Store::<anonymous>
|
1586
|
+
ht_count hash.c /^int ht_count(HashEntry **ht)$/;" f
|
1587
|
+
ht_create hash.c /^HashEntry **ht_create()$/;" f
|
1588
|
+
ht_delete hash.c /^void *ht_delete(HashEntry **ht, char *name)$/;" f
|
1589
|
+
ht_destroy hash.c /^void ht_destroy(HashEntry **ht)$/;" f
|
1590
|
+
ht_destroy_all hash.c /^void ht_destroy_all(HashEntry **ht, void (*fn)(void *))$/;" f
|
1591
|
+
ht_get hash.c /^void *ht_get(HashEntry **ht, char *name)$/;" f
|
1592
|
+
ht_set hash.c /^void ht_set(HashEntry **ht, char *name, void *value)$/;" f
|
1593
|
+
icmp global.c /^int icmp(const void *p1, const void *p2)$/;" f
|
1594
|
+
icmp_risky global.c /^int icmp_risky(const void *p1, const void *p2)$/;" f
|
1595
|
+
id_field search.h /^ char *id_field;$/;" m struct:Index
|
1596
|
+
id_new ferret.c /^ID id_new;$/;" v
|
1597
|
+
idf search.h /^ float (*idf)(Similarity *self, int doc_freq, int num_docs);$/;" m struct:Similarity
|
1598
|
+
idf search.h /^ float idf;$/;" m struct:Weight
|
1599
|
+
idf_phrase search.h /^ float (*idf_phrase)(Similarity *self, Term **terms, int tcnt, Searcher *searcher);$/;" m struct:Similarity
|
1600
|
+
idf_term search.h /^ float (*idf_term)(Similarity *self, Term *term, Searcher *searcher);$/;" m struct:Similarity
|
1601
|
+
ids index.h /^ HashSet *ids;$/;" m struct:CompoundWriter
|
1602
|
+
imalloc hashset.c /^int *imalloc(int i)$/;" f
|
1603
|
+
in_order search.h /^ bool in_order : 1;$/;" m struct:SpanNearEnum
|
1604
|
+
in_order search.h /^ bool in_order;$/;" m struct:SpanNearQuery
|
1605
|
+
inc search.h /^ Query *inc;$/;" m struct:SpanNotQuery
|
1606
|
+
inc search.h /^ SpanEnum *inc;$/;" m struct:SpanNotEnum
|
1607
|
+
include_lower search.h /^ bool include_lower;$/;" m struct:Range
|
1608
|
+
include_upper search.h /^ bool include_upper;$/;" m struct:Range
|
1609
|
+
includedir Makefile /^includedir = $(prefix)\/include$/;" m
|
1610
|
+
ind r_search.c /^ Index *ind;$/;" m struct:QueryUpdateArg file:
|
1611
|
+
index search.h /^ int index;$/;" m struct:SpanEnumCell
|
1612
|
+
index search.h /^ void *index;$/;" m struct:SortField
|
1613
|
+
index sort.c /^ int *index;$/;" m struct:StringIndex file:
|
1614
|
+
index sort.c /^ void *index;$/;" m struct:Comparator file:
|
1615
|
+
index_add_array ind.c /^void index_add_array(Index *self, Array *ary, Analyzer *analyzer)$/;" f
|
1616
|
+
index_add_doc ind.c /^void index_add_doc(Index *self, Document *doc)$/;" f
|
1617
|
+
index_add_doc_a ind.c /^void index_add_doc_a(Index *self, Document *doc, Analyzer *analyzer)$/;" f
|
1618
|
+
index_add_doc_i ind.c /^static void inline index_add_doc_i(Index *self, Document *doc)$/;" f file:
|
1619
|
+
index_add_string ind.c /^void index_add_string(Index *self, char *str, Analyzer *analyzer)$/;" f
|
1620
|
+
index_auto_flush_ir ind.c /^void index_auto_flush_ir(Index *self)$/;" f
|
1621
|
+
index_auto_flush_iw ind.c /^void index_auto_flush_iw(Index *self)$/;" f
|
1622
|
+
index_create ind.c /^Index *index_create(Store *store, Analyzer *analyzer, HashSet *def_fields,$/;" f
|
1623
|
+
index_delete ind.c /^void index_delete(Index *self, int doc_num)$/;" f
|
1624
|
+
index_delete_id ind.c /^void index_delete_id(Index *self, char *id)$/;" f
|
1625
|
+
index_delete_query ind.c /^void index_delete_query(Index *self, Query *q, Filter *f)$/;" f
|
1626
|
+
index_delete_query_str ind.c /^void index_delete_query_str(Index *self, char *qstr, Filter *f)$/;" f
|
1627
|
+
index_delete_term ind.c /^void index_delete_term(Index *self, Term *term)$/;" f
|
1628
|
+
index_destroy ind.c /^void index_destroy(Index *self)$/;" f
|
1629
|
+
index_explain ind.c /^Explanation *index_explain(Index *self, Query *q, int doc_num)$/;" f
|
1630
|
+
index_flush ind.c /^void index_flush(Index *self)$/;" f
|
1631
|
+
index_get_doc ind.c /^Document *index_get_doc(Index *self, int doc_num)$/;" f
|
1632
|
+
index_get_doc_id ind.c /^Document *index_get_doc_id(Index *self, char *id)$/;" f
|
1633
|
+
index_get_doc_term ind.c /^Document *index_get_doc_term(Index *self, Term *term)$/;" f
|
1634
|
+
index_get_doc_ts ind.c /^Document *index_get_doc_ts(Index *self, int doc_num)$/;" f
|
1635
|
+
index_get_query ind.c /^Query *index_get_query(Index *self, char *qstr)$/;" f
|
1636
|
+
index_has_del ind.c /^bool index_has_del(Index *self)$/;" f
|
1637
|
+
index_in index.h /^ InStream *index_in;$/;" m struct:FieldsReader
|
1638
|
+
index_interval index.h /^ int index_interval;$/;" m struct:SegmentTermEnum
|
1639
|
+
index_interval index.h /^ int index_interval;$/;" m struct:TermInfosWriter
|
1640
|
+
index_is_deleted ind.c /^bool index_is_deleted(Index *self, int doc_num)$/;" f
|
1641
|
+
index_optimize ind.c /^void index_optimize(Index *self)$/;" f
|
1642
|
+
index_out index.h /^ OutStream *index_out;$/;" m struct:FieldsWriter
|
1643
|
+
index_pointer index.h /^ int index_pointer;$/;" m struct:SegmentTermEnum
|
1644
|
+
index_pointers index.h /^ int *index_pointers;$/;" m struct:TermInfosReader
|
1645
|
+
index_qdel_i ind.c /^static void index_qdel_i(Searcher *sea, int doc_num, void *arg)$/;" f file:
|
1646
|
+
index_search_str ind.c /^TopDocs *index_search_str(Index *self, char *qstr, int first_doc,$/;" f
|
1647
|
+
index_size ind.c /^int index_size(Index *self)$/;" f
|
1648
|
+
index_size index.h /^ int index_size;$/;" m struct:TermInfosReader
|
1649
|
+
index_te index.h /^ TermEnum *index_te;$/;" m struct:TermInfosReader
|
1650
|
+
index_term_id ind.c /^int index_term_id(Index *self, Term *term)$/;" f
|
1651
|
+
index_term_infos index.h /^ TermInfo **index_term_infos;$/;" m struct:TermInfosReader
|
1652
|
+
index_terms index.h /^ Term **index_terms;$/;" m struct:TermInfosReader
|
1653
|
+
infodir Makefile /^infodir = $(prefix)\/info$/;" m
|
1654
|
+
ir index.h /^ IndexReader *ir;$/;" m struct:SegmentMergeInfo
|
1655
|
+
ir search.h /^ IndexReader *ir;$/;" m struct:Index
|
1656
|
+
ir search.h /^ IndexReader *ir;$/;" m struct:MatchAllScorer
|
1657
|
+
ir search.h /^ IndexReader *ir;$/;" m struct:Searcher
|
1658
|
+
ir search.h /^ IndexReader *ir;$/;" m struct:SpanScorer
|
1659
|
+
ir_acquire_not_necessary index_rw.c /^void ir_acquire_not_necessary(IndexReader *ir) {}$/;" f
|
1660
|
+
ir_acquire_write_lock index_rw.c /^void ir_acquire_write_lock(IndexReader *ir)$/;" f
|
1661
|
+
ir_add_cache index_rw.c /^void ir_add_cache(IndexReader *ir)$/;" f
|
1662
|
+
ir_close index_rw.c /^void ir_close(IndexReader *ir)$/;" f
|
1663
|
+
ir_cnt index.h /^ int ir_cnt;$/;" m struct:MultiTermDocEnum
|
1664
|
+
ir_commit index_rw.c /^void ir_commit(IndexReader *ir)$/;" f
|
1665
|
+
ir_commit_internal index_rw.c /^void ir_commit_internal(IndexReader *ir)$/;" f
|
1666
|
+
ir_create index_rw.c /^IndexReader *ir_create(Store *store, SegmentInfos *sis, int is_owner, int close_store)$/;" f
|
1667
|
+
ir_delete_doc index_rw.c /^void ir_delete_doc(IndexReader *ir, int doc_num)$/;" f
|
1668
|
+
ir_destroy index_rw.c /^void ir_destroy(void *p)$/;" f
|
1669
|
+
ir_get_doc_with_term index_rw.c /^Document *ir_get_doc_with_term(IndexReader *ir, Term *term)$/;" f
|
1670
|
+
ir_index_exists index_rw.c /^bool ir_index_exists(Store *store)$/;" f
|
1671
|
+
ir_is_latest index_rw.c /^bool ir_is_latest(IndexReader *ir)$/;" f
|
1672
|
+
ir_open index_rw.c /^IndexReader *ir_open(Store *store, int close_store)$/;" f
|
1673
|
+
ir_set_norm index_rw.c /^void ir_set_norm(IndexReader *ir, int doc_num, char *field, uchar val)$/;" f
|
1674
|
+
ir_term_docs_for index_rw.c /^TermDocEnum *ir_term_docs_for(IndexReader *ir, Term *term)$/;" f
|
1675
|
+
ir_term_positions_for index_rw.c /^TermDocEnum *ir_term_positions_for(IndexReader *ir, Term *term)$/;" f
|
1676
|
+
ir_undelete_all index_rw.c /^void ir_undelete_all(IndexReader *ir)$/;" f
|
1677
|
+
irs index.h /^ IndexReader **irs;$/;" m struct:MultiTermDocEnum
|
1678
|
+
irs_tde index.h /^ TermDocEnum **irs_tde;$/;" m struct:MultiTermDocEnum
|
1679
|
+
is index.h /^ InStream *is;$/;" m struct:Norm
|
1680
|
+
is index.h /^ InStream *is;$/;" m struct:SegmentTermEnum
|
1681
|
+
is_binary document.h /^ bool is_binary : 1;$/;" m struct:DocField
|
1682
|
+
is_clone index_io.c /^InStream *is_clone(InStream *is) $/;" f
|
1683
|
+
is_clone store.h /^ int is_clone;$/;" m struct:InStream
|
1684
|
+
is_close index_io.c /^void is_close(InStream *is)$/;" f
|
1685
|
+
is_compressed document.h /^ bool is_compressed : 1;$/;" m struct:DocField
|
1686
|
+
is_create index_io.c /^InStream *is_create()$/;" f
|
1687
|
+
is_deleted index.h /^ bool (*is_deleted)(IndexReader *ir, int doc_num);$/;" m struct:IndexReader
|
1688
|
+
is_dirty index.h /^ bool is_dirty : 1;$/;" m struct:Norm
|
1689
|
+
is_index index.h /^ bool is_index;$/;" m struct:TermInfosWriter
|
1690
|
+
is_index index.h /^ int is_index;$/;" m struct:SegmentTermEnum
|
1691
|
+
is_indexed document.h /^ bool is_indexed : 1;$/;" m struct:DocField
|
1692
|
+
is_indexed index.h /^ bool is_indexed : 1;$/;" m struct:FieldInfo
|
1693
|
+
is_length store.h 53;" d
|
1694
|
+
is_locked store.h /^ int (*is_locked)(Lock *lock);$/;" m struct:Lock
|
1695
|
+
is_norm_file index_rw.c /^void is_norm_file(char *fname, void *arg)$/;" f
|
1696
|
+
is_owner index.h /^ bool is_owner : 1;$/;" m struct:IndexReader
|
1697
|
+
is_pos index_io.c /^int is_pos(InStream *is)$/;" f
|
1698
|
+
is_prohibited search.h /^ bool is_prohibited : 1;$/;" m struct:BooleanClause
|
1699
|
+
is_read_byte index_io.c /^inline uchar is_read_byte(InStream *is)$/;" f
|
1700
|
+
is_read_bytes index_io.c /^uchar *is_read_bytes(InStream *is, uchar *b, int offset, int len)$/;" f
|
1701
|
+
is_read_chars index_io.c /^is_read_chars(InStream *is, char* buffer, int off, int len)$/;" f
|
1702
|
+
is_read_int index_io.c /^is_read_int(InStream *is)$/;" f
|
1703
|
+
is_read_long index_io.c /^is_read_long(InStream *is)$/;" f
|
1704
|
+
is_read_string index_io.c /^is_read_string(InStream *is)$/;" f
|
1705
|
+
is_read_uint index_io.c /^is_read_uint(InStream *is)$/;" f
|
1706
|
+
is_read_ulong index_io.c /^is_read_ulong(InStream *is)$/;" f
|
1707
|
+
is_read_vint index_io.c /^is_read_vint(InStream *is)$/;" f
|
1708
|
+
is_refill index_io.c /^void is_refill(InStream *is)$/;" f
|
1709
|
+
is_required search.h /^ bool is_required : 1;$/;" m struct:BooleanClause
|
1710
|
+
is_seek index_io.c /^void is_seek(InStream *is, int pos)$/;" f
|
1711
|
+
is_stale index.h /^ bool is_stale : 1;$/;" m struct:IndexReader
|
1712
|
+
is_stored document.h /^ bool is_stored : 1;$/;" m struct:DocField
|
1713
|
+
is_tokenized document.h /^ bool is_tokenized : 1;$/;" m struct:DocField
|
1714
|
+
isnumpunc analysis.c /^int isnumpunc(char c)$/;" f
|
1715
|
+
isstdtokchar analysis.c /^int isstdtokchar(char c)$/;" f
|
1716
|
+
isurlc analysis.c /^int isurlc(char c)$/;" f
|
1717
|
+
isurlpunc analysis.c /^int isurlpunc(char c)$/;" f
|
1718
|
+
isurlxatc analysis.c /^int isurlxatc(char c)$/;" f
|
1719
|
+
isurlxatpunc analysis.c /^int isurlxatpunc(char c)$/;" f
|
1720
|
+
iw search.h /^ IndexWriter *iw;$/;" m struct:Index
|
1721
|
+
iw_add_doc index_rw.c /^void iw_add_doc(IndexWriter *iw, Document *doc)$/;" f
|
1722
|
+
iw_add_indexes index_rw.c /^void iw_add_indexes(IndexWriter *iw, Store **stores, int cnt)$/;" f
|
1723
|
+
iw_add_readers index_rw.c /^void iw_add_readers(IndexWriter *iw, IndexReader **irs, int cnt)$/;" f
|
1724
|
+
iw_close index_rw.c /^void iw_close(IndexWriter *iw)$/;" f
|
1725
|
+
iw_delete_segments index_rw.c /^void iw_delete_segments(IndexWriter *iw, IndexReader **segment_readers, int del_cnt)$/;" f
|
1726
|
+
iw_doc_count index_rw.c /^int iw_doc_count(IndexWriter *iw)$/;" f
|
1727
|
+
iw_flush_ram_segments index_rw.c /^void iw_flush_ram_segments(IndexWriter *iw)$/;" f
|
1728
|
+
iw_maybe_merge_segments index_rw.c /^void iw_maybe_merge_segments(IndexWriter *iw)$/;" f
|
1729
|
+
iw_merge_segments index_rw.c /^void iw_merge_segments(IndexWriter *iw, int min_segment)$/;" f
|
1730
|
+
iw_merge_segments_with_max index_rw.c /^void iw_merge_segments_with_max(IndexWriter *iw, int min_segment, int max_segment)$/;" f
|
1731
|
+
iw_open index_rw.c /^IndexWriter *iw_open(Store *store, Analyzer *analyzer,$/;" f
|
1732
|
+
iw_optimize index_rw.c /^void iw_optimize(IndexWriter *iw)$/;" f
|
1733
|
+
iw_optimize_internal index_rw.c /^static inline void iw_optimize_internal(IndexWriter *iw)$/;" f file:
|
1734
|
+
join_path fs_store.c /^static char *join_path(char *buf, const char *base, const char *filename)$/;" f file:
|
1735
|
+
key hash.h /^ void *key;$/;" m
|
1736
|
+
key search.h /^ HashSet *key;$/;" m struct:Index
|
1737
|
+
last search.h /^ int last;$/;" m struct:ConjunctionScorer
|
1738
|
+
last_index_pointer index.h /^ int last_index_pointer;$/;" m struct:TermInfosWriter
|
1739
|
+
last_scored_doc search.h /^ int last_scored_doc;$/;" m struct:ConjunctionScorer
|
1740
|
+
last_skip_doc index.h /^ int last_skip_doc;$/;" m struct:SegmentMerger
|
1741
|
+
last_skip_freq_pointer index.h /^ int last_skip_freq_pointer;$/;" m struct:SegmentMerger
|
1742
|
+
last_skip_prox_pointer index.h /^ int last_skip_prox_pointer;$/;" m struct:SegmentMerger
|
1743
|
+
last_term index.h /^ Term *last_term;$/;" m struct:TermInfosWriter
|
1744
|
+
last_term_info index.h /^ TermInfo *last_term_info;$/;" m struct:TermInfosWriter
|
1745
|
+
lcf_next analysis.c /^Token *lcf_next(TokenStream *ts)$/;" f
|
1746
|
+
len index.h /^ int len;$/;" m struct:FieldsReader
|
1747
|
+
len ram_store.c /^ int len;$/;" m struct:RamFile file:
|
1748
|
+
len store.h /^ int len;$/;" m struct:Buffer
|
1749
|
+
length compound_io.c /^ int length;$/;" m struct:FileEntry file:
|
1750
|
+
length search.h /^ int length;$/;" m struct:SpanEnumCell
|
1751
|
+
length store.h /^ int (*length)(Store *store, char *filename);$/;" m struct:Store
|
1752
|
+
length store.h /^ int length;$/;" m struct:CompoundInStream
|
1753
|
+
length_internal store.h /^ int (*length_internal)(struct InStream *is);$/;" m struct:InStream
|
1754
|
+
length_norm search.h /^ float (*length_norm)(Similarity *self, char *field, int num_terms);$/;" m struct:Similarity
|
1755
|
+
letter_analyzer_create analysis.c /^Analyzer *letter_analyzer_create()$/;" f
|
1756
|
+
letter_tokenizer_create analysis.c /^TokenStream *letter_tokenizer_create()$/;" f
|
1757
|
+
libdir Makefile /^libdir = $(exec_prefix)\/lib$/;" m
|
1758
|
+
libexecdir Makefile /^libexecdir = $(exec_prefix)\/libexec$/;" m
|
1759
|
+
libpath Makefile /^libpath = $(libdir)$/;" m
|
1760
|
+
localstatedir Makefile /^localstatedir = $(DESTDIR)\/var$/;" m
|
1761
|
+
lookup hash.h /^ HshEntry *(*lookup)(struct HshTable *ht, const void *key);$/;" m struct:HshTable
|
1762
|
+
low_bit similarity.c /^static int low_bit = 0, low_mid_bit = 0, high_mid_bit = 0, high_bit = 0;$/;" v file:
|
1763
|
+
low_mid_bit similarity.c /^static int low_bit = 0, low_mid_bit = 0, high_mid_bit = 0, high_bit = 0;$/;" v file:
|
1764
|
+
lower_str global.c /^void lower_str(char *str)$/;" f
|
1765
|
+
lower_term search.h /^ char *lower_term;$/;" m struct:Range
|
1766
|
+
lowercase_filter_create analysis.c /^TokenStream *lowercase_filter_create(TokenStream *ts)$/;" f
|
1767
|
+
lt priorityqueue.h /^ bool (*lt)(struct PriorityQueue2 *pq, void *p1, void *p2);$/;" m struct:PriorityQueue2
|
1768
|
+
lt priorityqueue.h /^ bool (*lt)(void *p1, void *p2);$/;" m struct:PriorityQueue
|
1769
|
+
lt_next analysis.c /^Token *lt_next(TokenStream *ts)$/;" f
|
1770
|
+
mAnalysis ferret.c /^VALUE mAnalysis;$/;" v
|
1771
|
+
mDocument ferret.c /^VALUE mDocument;$/;" v
|
1772
|
+
mFerret ferret.c /^VALUE mFerret;$/;" v
|
1773
|
+
mIndex ferret.c /^VALUE mIndex;$/;" v
|
1774
|
+
mSearch ferret.c /^VALUE mSearch;$/;" v
|
1775
|
+
mSpans ferret.c /^VALUE mSpans;$/;" v
|
1776
|
+
mStore ferret.c /^VALUE mStore;$/;" v
|
1777
|
+
mStringHelper ferret.c /^VALUE mStringHelper;$/;" v
|
1778
|
+
mUtils ferret.c /^VALUE mUtils;$/;" v
|
1779
|
+
main analysis.c /^int main(int argc, char **argv)$/;" f
|
1780
|
+
make_compound_file index_rw.c /^void make_compound_file(IndexWriter *iw, char *merged_name, SegmentMerger *merger)$/;" f
|
1781
|
+
mandir Makefile /^mandir = $(datadir)\/man$/;" m
|
1782
|
+
maq_create q_match_all.c /^Query *maq_create()$/;" f
|
1783
|
+
maq_destroy q_match_all.c /^void maq_destroy(void *p)$/;" f
|
1784
|
+
maq_to_s q_match_all.c /^char *maq_to_s(Query *self, char *field)$/;" f
|
1785
|
+
masc_create q_match_all.c /^Scorer *masc_create(Weight *weight, IndexReader *ir)$/;" f
|
1786
|
+
masc_explain q_match_all.c /^Explanation *masc_explain(Scorer *self, int doc_num)$/;" f
|
1787
|
+
masc_next q_match_all.c /^bool masc_next(Scorer *self)$/;" f
|
1788
|
+
masc_score q_match_all.c /^float masc_score(Scorer *self)$/;" f
|
1789
|
+
masc_skip_to q_match_all.c /^bool masc_skip_to(Scorer *self, int doc_num)$/;" f
|
1790
|
+
mask hash.h /^ int mask;$/;" m struct:HshTable
|
1791
|
+
match search.h /^ Query *match;$/;" m struct:SpanFirstQuery
|
1792
|
+
maw_create q_match_all.c /^Weight *maw_create(Query *query, Searcher *searcher)$/;" f
|
1793
|
+
maw_destroy q_match_all.c /^void maw_destroy(void *p)$/;" f
|
1794
|
+
maw_explain q_match_all.c /^Explanation *maw_explain(Weight *self, IndexReader *ir, int doc_num)$/;" f
|
1795
|
+
maw_to_s q_match_all.c /^char *maw_to_s(Weight *self)$/;" f
|
1796
|
+
max global.c /^int max(int a, int b)$/;" f
|
1797
|
+
max3 global.c /^int max3(int a, int b, int c)$/;" f
|
1798
|
+
max_clause_cnt search.h /^ int max_clause_cnt;$/;" m struct:BooleanQuery
|
1799
|
+
max_coord search.h /^ int max_coord;$/;" m struct:Coordinator
|
1800
|
+
max_distances search.h /^ int max_distances[TYPICAL_LONGEST_WORD];$/;" m struct:FuzzyQuery
|
1801
|
+
max_doc index.h /^ int (*max_doc)(IndexReader *ir);$/;" m struct:IndexReader
|
1802
|
+
max_doc index.h /^ int max_doc;$/;" m struct:MultiReader
|
1803
|
+
max_doc search.h /^ int (*max_doc)(Searcher *self);$/;" m struct:Searcher
|
1804
|
+
max_doc search.h /^ int max_doc;$/;" m struct:MatchAllScorer
|
1805
|
+
max_field_length index.h /^ int max_field_length;$/;" m struct:Config
|
1806
|
+
max_field_length index.h /^ int max_field_length;$/;" m struct:DocumentWriter
|
1807
|
+
max_field_length index.h /^ int max_field_length;$/;" m struct:IndexWriter
|
1808
|
+
max_merge_docs index.h /^ int max_merge_docs;$/;" m struct:Config
|
1809
|
+
max_merge_docs index.h /^ int max_merge_docs;$/;" m struct:IndexWriter
|
1810
|
+
merge_factor index.h /^ int merge_factor;$/;" m struct:Config
|
1811
|
+
merge_factor index.h /^ int merge_factor;$/;" m struct:IndexWriter
|
1812
|
+
merged index.h /^ bool merged;$/;" m struct:CompoundWriter
|
1813
|
+
min global.c /^int min(int a, int b)$/;" f
|
1814
|
+
min3 global.c /^int min3(int a, int b, int c)$/;" f
|
1815
|
+
min_merge_docs index.h /^ int min_merge_docs;$/;" m struct:Config
|
1816
|
+
min_merge_docs index.h /^ int min_merge_docs;$/;" m struct:IndexWriter
|
1817
|
+
min_num_matches search.h /^ int min_num_matches;$/;" m struct:DisjunctionSumScorer
|
1818
|
+
min_sim search.h /^ float min_sim;$/;" m struct:FuzzyQuery
|
1819
|
+
more search.h /^ bool more : 1;$/;" m struct:ConjunctionScorer
|
1820
|
+
more search.h /^ bool more : 1;$/;" m struct:PhraseScorer
|
1821
|
+
more search.h /^ bool more : 1;$/;" m struct:SpanScorer
|
1822
|
+
more_exc search.h /^ bool more_exc : 1;$/;" m struct:SpanNotEnum
|
1823
|
+
more_inc search.h /^ bool more_inc : 1;$/;" m struct:SpanNotEnum
|
1824
|
+
mphq_add_terms q_multi_phrase.c /^void mphq_add_terms(Query *self, Term **terms, int t_cnt, int pos_inc)$/;" f
|
1825
|
+
mphq_create q_multi_phrase.c /^Query *mphq_create()$/;" f
|
1826
|
+
mphq_destroy q_multi_phrase.c /^void mphq_destroy(void *p)$/;" f
|
1827
|
+
mphq_extract_terms q_multi_phrase.c /^void mphq_extract_terms(Query *self, Array *terms)$/;" f
|
1828
|
+
mphq_rewrite q_multi_phrase.c /^Query *mphq_rewrite(Query *self, IndexReader *ir) $/;" f
|
1829
|
+
mphq_to_s q_multi_phrase.c /^char *mphq_to_s(Query *self, char *field)$/;" f
|
1830
|
+
mphw_create q_multi_phrase.c /^Weight *mphw_create(Query *query, Searcher *searcher)$/;" f
|
1831
|
+
mphw_explain q_multi_phrase.c /^Explanation *mphw_explain(Weight *self, IndexReader *ir, int doc_num)$/;" f
|
1832
|
+
mphw_scorer q_multi_phrase.c /^Scorer *mphw_scorer(Weight *self, IndexReader *ir)$/;" f
|
1833
|
+
mphw_to_s q_multi_phrase.c /^char *mphw_to_s(Weight *self)$/;" f
|
1834
|
+
mr_close index_rw.c /^void mr_close(IndexReader *ir)$/;" f
|
1835
|
+
mr_commit index_rw.c /^void mr_commit(IndexReader *ir)$/;" f
|
1836
|
+
mr_delete_doc index_rw.c /^void mr_delete_doc(IndexReader *ir, int doc_num)$/;" f
|
1837
|
+
mr_doc_freq index_rw.c /^int mr_doc_freq(IndexReader *ir, Term *t)$/;" f
|
1838
|
+
mr_get_doc index_rw.c /^Document *mr_get_doc(IndexReader *ir, int doc_num)$/;" f
|
1839
|
+
mr_get_field_names index_rw.c /^HashSet *mr_get_field_names(IndexReader *ir, int field_type)$/;" f
|
1840
|
+
mr_get_norms index_rw.c /^uchar *mr_get_norms(IndexReader *ir, char *field)$/;" f
|
1841
|
+
mr_get_norms_into index_rw.c /^void mr_get_norms_into(IndexReader *ir, char *field, uchar *buf, int offset)$/;" f
|
1842
|
+
mr_get_term_vector index_rw.c /^TermVector *mr_get_term_vector(IndexReader *ir, int doc_num, char *field)$/;" f
|
1843
|
+
mr_get_term_vectors index_rw.c /^Array *mr_get_term_vectors(IndexReader *ir, int doc_num)$/;" f
|
1844
|
+
mr_has_deletions index_rw.c /^bool mr_has_deletions(IndexReader *ir)$/;" f
|
1845
|
+
mr_has_norms index_rw.c /^bool mr_has_norms(IndexReader *ir, char *field)$/;" f
|
1846
|
+
mr_is_deleted index_rw.c /^bool mr_is_deleted(IndexReader *ir, int doc_num)$/;" f
|
1847
|
+
mr_max_doc index_rw.c /^int mr_max_doc(IndexReader *ir)$/;" f
|
1848
|
+
mr_num_docs index_rw.c /^int mr_num_docs(IndexReader *ir)$/;" f
|
1849
|
+
mr_open index_rw.c /^IndexReader *mr_open(Store *store,$/;" f
|
1850
|
+
mr_reader_index index_rw.c /^int mr_reader_index(MultiReader *mr, int doc_num)$/;" f
|
1851
|
+
mr_set_norm index_rw.c /^void mr_set_norm(IndexReader *ir, int doc_num, char *field, uchar val)$/;" f
|
1852
|
+
mr_term_docs index_rw.c /^TermDocEnum *mr_term_docs(IndexReader *ir)$/;" f
|
1853
|
+
mr_term_positions index_rw.c /^TermDocEnum *mr_term_positions(IndexReader *ir)$/;" f
|
1854
|
+
mr_terms index_rw.c /^TermEnum *mr_terms(IndexReader *ir)$/;" f
|
1855
|
+
mr_terms_from index_rw.c /^TermEnum *mr_terms_from(IndexReader *ir, Term *term)$/;" f
|
1856
|
+
mr_undelete_all index_rw.c /^void mr_undelete_all(IndexReader *ir)$/;" f
|
1857
|
+
mtde_close termdocs.c /^void mtde_close(TermDocEnum *tde)$/;" f
|
1858
|
+
mtde_create termdocs.c /^TermDocEnum *mtde_create(IndexReader **irs, int *starts, int ir_cnt)$/;" f
|
1859
|
+
mtde_doc_num termdocs.c /^int mtde_doc_num(TermDocEnum *tde)$/;" f
|
1860
|
+
mtde_freq termdocs.c /^int mtde_freq(TermDocEnum *tde)$/;" f
|
1861
|
+
mtde_next termdocs.c /^bool mtde_next(TermDocEnum *tde)$/;" f
|
1862
|
+
mtde_read termdocs.c /^int mtde_read(TermDocEnum *tde, int *docs, int *freqs, int req_num)$/;" f
|
1863
|
+
mtde_seek termdocs.c /^void mtde_seek(TermDocEnum *tde, Term *term)$/;" f
|
1864
|
+
mtde_skip_to termdocs.c /^bool mtde_skip_to(TermDocEnum *tde, int target_doc_num)$/;" f
|
1865
|
+
mtde_term_docs termdocs.c /^TermDocEnum *mtde_term_docs(MultiTermDocEnum *mtde, int i)$/;" f
|
1866
|
+
mtde_term_docs_from_reader termdocs.c /^TermDocEnum *mtde_term_docs_from_reader(IndexReader *ir)$/;" f
|
1867
|
+
mtdpe_close termdocs.c /^void mtdpe_close(TermDocEnum *self)$/;" f
|
1868
|
+
mtdpe_create termdocs.c /^TermDocEnum *mtdpe_create(IndexReader *ir, Term **terms, int t_cnt)$/;" f
|
1869
|
+
mtdpe_doc_num termdocs.c /^int mtdpe_doc_num(TermDocEnum *self)$/;" f
|
1870
|
+
mtdpe_freq termdocs.c /^int mtdpe_freq(TermDocEnum *self)$/;" f
|
1871
|
+
mtdpe_next termdocs.c /^bool mtdpe_next(TermDocEnum *self)$/;" f
|
1872
|
+
mtdpe_next_position termdocs.c /^int mtdpe_next_position(TermDocEnum *self)$/;" f
|
1873
|
+
mtdpe_read termdocs.c /^int mtdpe_read(TermDocEnum *tde, int *docs, int *freqs, int req_num)$/;" f
|
1874
|
+
mtdpe_seek termdocs.c /^void mtdpe_seek(TermDocEnum *tde, Term *term)$/;" f
|
1875
|
+
mtdpe_skip_to termdocs.c /^bool mtdpe_skip_to(TermDocEnum *self, int target_doc_num)$/;" f
|
1876
|
+
mte_clone term.c /^TermEnum *mte_clone(TermEnum *te)$/;" f
|
1877
|
+
mte_close term.c /^void mte_close(TermEnum *te)$/;" f
|
1878
|
+
mte_create term.c /^TermEnum *mte_create(IndexReader **readers, int *starts, int rcnt, Term *t)$/;" f
|
1879
|
+
mte_next term.c /^TermBuffer *mte_next(TermEnum *te)$/;" f
|
1880
|
+
mtpe_create termdocs.c /^TermDocEnum *mtpe_create(IndexReader **irs, int *starts, int ir_cnt)$/;" f
|
1881
|
+
mtpe_next_position termdocs.c /^int mtpe_next_position(TermDocEnum *tde)$/;" f
|
1882
|
+
mtpe_term_docs_from_reader termdocs.c /^TermDocEnum *mtpe_term_docs_from_reader(IndexReader *ir)$/;" f
|
1883
|
+
mutex index.h /^ mutex_t mutex;$/;" m struct:IndexReader
|
1884
|
+
mutex index.h /^ mutex_t mutex;$/;" m struct:IndexWriter
|
1885
|
+
mutex index.h /^ mutex_t mutex;$/;" m struct:TermInfosReader
|
1886
|
+
mutex search.h /^ mutex_t mutex;$/;" m struct:Index
|
1887
|
+
mutex search.h /^ mutex_t mutex;$/;" m struct:QParser
|
1888
|
+
mutex search.h /^ mutex_t mutex;$/;" m struct:SortField
|
1889
|
+
mutex store.h /^ mutex_t mutex;$/;" m struct:Store
|
1890
|
+
mutex_destroy inc/lang.h 34;" d
|
1891
|
+
mutex_destroy lang.h 34;" d
|
1892
|
+
mutex_init inc/lang.h 30;" d
|
1893
|
+
mutex_init lang.h 30;" d
|
1894
|
+
mutex_lock inc/lang.h 31;" d
|
1895
|
+
mutex_lock lang.h 31;" d
|
1896
|
+
mutex_t inc/lang.h /^typedef void * mutex_t;$/;" t
|
1897
|
+
mutex_t lang.h /^typedef void * mutex_t;$/;" t
|
1898
|
+
mutex_trylock inc/lang.h 32;" d
|
1899
|
+
mutex_trylock lang.h 32;" d
|
1900
|
+
mutex_unlock inc/lang.h 33;" d
|
1901
|
+
mutex_unlock lang.h 33;" d
|
1902
|
+
name compound_io.c /^ char *name;$/;" m struct:WFileEntry file:
|
1903
|
+
name document.h /^ char *name;$/;" m struct:DocField
|
1904
|
+
name global.c /^static char name[200]; \/* program name for error msgs *\/$/;" v file:
|
1905
|
+
name hash.h /^ char *name;$/;" m struct:HashEntry
|
1906
|
+
name index.h /^ char *name;$/;" m struct:FieldInfo
|
1907
|
+
name index.h /^ char *name;$/;" m struct:SegmentInfo
|
1908
|
+
name index.h /^ char *name;$/;" m struct:SegmentMerger
|
1909
|
+
name index.h /^ const char *name;$/;" m struct:CompoundWriter
|
1910
|
+
name ram_store.c /^ char *name;$/;" m struct:RamFile file:
|
1911
|
+
name search.h /^ char *name;$/;" m struct:Filter
|
1912
|
+
name store.h /^ char *name;$/;" m struct:Lock
|
1913
|
+
name store.h /^ const char *name;$/;" m struct:CompoundStore
|
1914
|
+
new_segment_name index_rw.c /^char *new_segment_name(int counter) $/;" f
|
1915
|
+
next analysis.h /^ Token *(*next)(TokenStream *ts);$/;" m struct:TokenStream
|
1916
|
+
next hash.h /^ struct HashEntry *next;$/;" m struct:HashEntry
|
1917
|
+
next index.h /^ TermBuffer *(*next)(TermEnum *te);$/;" m struct:TermEnum
|
1918
|
+
next index.h /^ bool (*next)(TermDocEnum *tde);$/;" m struct:TermDocEnum
|
1919
|
+
next search.h /^ bool (*next)(Scorer *self);$/;" m struct:Scorer
|
1920
|
+
next search.h /^ bool (*next)(SpanEnum *self);$/;" m struct:SpanEnum
|
1921
|
+
next_position index.h /^ int (*next_position)(TermDocEnum *tde);$/;" m struct:TermDocEnum
|
1922
|
+
nmsc_explain q_boolean.c /^Explanation *nmsc_explain(Scorer *self, int doc_num)$/;" f
|
1923
|
+
nmsc_next q_boolean.c /^bool nmsc_next(Scorer *self)$/;" f
|
1924
|
+
nmsc_score q_boolean.c /^float nmsc_score(Scorer *self)$/;" f
|
1925
|
+
nmsc_skip_to q_boolean.c /^bool nmsc_skip_to(Scorer *self, int doc_num)$/;" f
|
1926
|
+
non_matching_scorer_create q_boolean.c /^Scorer *non_matching_scorer_create()$/;" f
|
1927
|
+
norm_create index_rw.c /^Norm *norm_create(InStream *is, int field_num)$/;" f
|
1928
|
+
norm_destroy index_rw.c /^void norm_destroy(void *p)$/;" f
|
1929
|
+
norm_rewrite index_rw.c /^void norm_rewrite(Norm *norm, Store *store, char *segment,$/;" f
|
1930
|
+
norm_table search.h /^ float norm_table[256];$/;" m struct:Similarity
|
1931
|
+
normalize search.h /^ void (*normalize)(Weight *self, float normalization_factor);$/;" m struct:Weight
|
1932
|
+
norms index.h /^ HshTable *norms;$/;" m struct:SegmentReader
|
1933
|
+
norms search.h /^ uchar *norms;$/;" m struct:PhraseScorer
|
1934
|
+
norms search.h /^ uchar *norms;$/;" m struct:SpanScorer
|
1935
|
+
norms search.h /^ uchar *norms;$/;" m struct:TermScorer
|
1936
|
+
norms_cache index.h /^ HshTable *norms_cache;$/;" m struct:MultiReader
|
1937
|
+
norms_dirty index.h /^ bool norms_dirty : 1;$/;" m struct:SegmentReader
|
1938
|
+
not_word q_parser.c /^const char *not_word = " \\t&:()[]{}!+\\"~^-|<>=";$/;" v
|
1939
|
+
num_docs index.h /^ int (*num_docs)(IndexReader *ir);$/;" m struct:IndexReader
|
1940
|
+
num_docs_cache index.h /^ int num_docs_cache;$/;" m struct:MultiReader
|
1941
|
+
num_free_hts hash.c /^static int num_free_hts = 0;$/;" v file:
|
1942
|
+
num_matches search.h /^ int num_matches;$/;" m struct:Coordinator
|
1943
|
+
num_matches search.h /^ int num_matches;$/;" m struct:DisjunctionSumScorer
|
1944
|
+
num_skips index.h /^ int num_skips;$/;" m struct:SegmentTermDocEnum
|
1945
|
+
number index.h /^ int number;$/;" m struct:FieldInfo
|
1946
|
+
number index.h /^ int number;$/;" m struct:TVField
|
1947
|
+
obj index.h /^ void *obj;$/;" m struct:CacheObject
|
1948
|
+
object_add ferret.h 33;" d
|
1949
|
+
object_add2 ferret.c /^object_add2(void *key, VALUE obj, const char *file, int line, const char *func)$/;" f
|
1950
|
+
object_del ferret.h 36;" d
|
1951
|
+
object_del2 ferret.c /^object_del2(void *key, const char *file, int line, const char *func)$/;" f
|
1952
|
+
object_eq ferret.c /^object_eq(const void *key1, const void *key2)$/;" f
|
1953
|
+
object_get ferret.c /^object_get(void *key)$/;" f
|
1954
|
+
object_hash ferret.c /^object_hash(const void *key)$/;" f
|
1955
|
+
object_map ferret.c /^static HshTable *object_map;$/;" v file:
|
1956
|
+
obtain store.h /^ int (*obtain)(Lock *lock);$/;" m struct:Lock
|
1957
|
+
occur search.h /^ unsigned int occur : 4;$/;" m struct:BooleanClause
|
1958
|
+
offset compound_io.c /^ int offset;$/;" m struct:FileEntry file:
|
1959
|
+
offset search.h /^ int offset;$/;" m struct:PhrasePosition
|
1960
|
+
offset store.h /^ int offset;$/;" m struct:CompoundInStream
|
1961
|
+
offsets index.h /^ TVOffsetInfo ***offsets;$/;" m struct:TermVector
|
1962
|
+
offsets index.h /^ TVOffsetInfo **offsets;$/;" m struct:Posting
|
1963
|
+
offsets index.h /^ TVOffsetInfo **offsets;$/;" m struct:TVTerm
|
1964
|
+
oldincludedir Makefile /^oldincludedir = $(DESTDIR)\/usr\/include$/;" m
|
1965
|
+
omit_norms document.h /^ bool omit_norms : 1;$/;" m struct:DocField
|
1966
|
+
omit_norms index.h /^ bool omit_norms : 1;$/;" m struct:FieldInfo
|
1967
|
+
open_cmpd_store compound_io.c /^Store *open_cmpd_store(Store *store, const char *name)$/;" f
|
1968
|
+
open_cw compound_io.c /^CompoundWriter *open_cw(Store *store, char *name)$/;" f
|
1969
|
+
open_fs_store fs_store.c /^Store *open_fs_store(const char *pathname)$/;" f
|
1970
|
+
open_input store.h /^ InStream *(*open_input)(Store *store, const char *filename);$/;" m struct:Store
|
1971
|
+
open_lock store.h /^ Lock *(*open_lock)(Store *store, char *lockname);$/;" m struct:Store
|
1972
|
+
open_ram_store ram_store.c /^Store *open_ram_store()$/;" f
|
1973
|
+
open_ram_store_and_copy ram_store.c /^Store *open_ram_store_and_copy(Store *from_store, bool close_dir)$/;" f
|
1974
|
+
opt_scorer search.h /^ Scorer *opt_scorer;$/;" m struct:ReqOptSumScorer
|
1975
|
+
optional_scorers search.h /^ Scorer **optional_scorers;$/;" m struct:BooleanScorer
|
1976
|
+
or_default search.h /^ bool or_default : 1;$/;" m struct:QParser
|
1977
|
+
orig_te index.h /^ TermEnum *orig_te;$/;" m struct:TermInfosReader
|
1978
|
+
orig_tvr index.h /^ TermVectorsReader *orig_tvr;$/;" m struct:SegmentReader
|
1979
|
+
original_boost search.h /^ float original_boost;$/;" m struct:Query
|
1980
|
+
os index.h /^ OutStream *os;$/;" m struct:TermInfosWriter
|
1981
|
+
os_capa search.h /^ int os_capa;$/;" m struct:BooleanScorer
|
1982
|
+
os_close index_io.c /^void os_close(OutStream *os)$/;" f
|
1983
|
+
os_cnt search.h /^ int os_cnt;$/;" m struct:BooleanScorer
|
1984
|
+
os_create index_io.c /^OutStream *os_create()$/;" f
|
1985
|
+
os_flush index_io.c /^inline void os_flush(OutStream *os)$/;" f
|
1986
|
+
os_pos index_io.c /^int os_pos(OutStream *os)$/;" f
|
1987
|
+
os_seek index_io.c /^void os_seek(OutStream *os, int new_pos)$/;" f
|
1988
|
+
os_write_byte index_io.c /^inline void os_write_byte(OutStream *os, uchar b)$/;" f
|
1989
|
+
os_write_bytes index_io.c /^void os_write_bytes(OutStream *os, uchar *b, int len)$/;" f
|
1990
|
+
os_write_chars index_io.c /^os_write_chars(OutStream *os, char *buf, int start, int length)$/;" f
|
1991
|
+
os_write_int index_io.c /^os_write_int(OutStream *os, int l)$/;" f
|
1992
|
+
os_write_long index_io.c /^os_write_long(OutStream *os, long long l)$/;" f
|
1993
|
+
os_write_string index_io.c /^os_write_string(OutStream *os, char *str)$/;" f
|
1994
|
+
os_write_uint index_io.c /^os_write_uint(OutStream *os, unsigned int l)$/;" f
|
1995
|
+
os_write_ulong index_io.c /^os_write_ulong(OutStream *os, unsigned long long l)$/;" f
|
1996
|
+
os_write_vint index_io.c /^os_write_vint(OutStream *os, register unsigned long long i)$/;" f
|
1997
|
+
other index.h /^ struct TermInfosWriter *other;$/;" m struct:TermInfosWriter
|
1998
|
+
p_add_occurance index_rw.c /^void p_add_occurance(Posting *p, int position, TVOffsetInfo *offset)$/;" f
|
1999
|
+
p_cmp index_rw.c /^inline int p_cmp(const void *const p1, const void *const p2)$/;" f
|
2000
|
+
p_create index_rw.c /^Posting *p_create(Term *term, int position, TVOffsetInfo *offset)$/;" f
|
2001
|
+
p_destroy index_rw.c /^void p_destroy(void *p)$/;" f
|
2002
|
+
parent index.h /^ SegmentReader *parent;$/;" m struct:SegmentTermDocEnum
|
2003
|
+
parent search.h /^ SpanEnum *parent;$/;" m struct:SpanEnumCell
|
2004
|
+
path store.h /^ char *path; \/* for fs_store only *\/$/;" m union:Store::<anonymous>
|
2005
|
+
path store.h /^ char *path; \/\/ only used by FSIn$/;" m union:InStream::<anonymous>
|
2006
|
+
pcnt index.h /^ int pcnt;$/;" m struct:DocumentWriter
|
2007
|
+
ph_add_multi_word q_parser.c /^Phrase *ph_add_multi_word(Phrase *self, char *word)$/;" f
|
2008
|
+
ph_add_word q_parser.c /^Phrase *ph_add_word(Phrase *self, char *word)$/;" f
|
2009
|
+
ph_create q_parser.c /^Phrase *ph_create()$/;" f
|
2010
|
+
ph_destroy q_parser.c /^void ph_destroy(Phrase *self)$/;" f
|
2011
|
+
ph_first_word q_parser.c /^Phrase *ph_first_word(char *word)$/;" f
|
2012
|
+
phq_add_term q_phrase.c /^void phq_add_term(Query *self, Term *term, int pos_inc)$/;" f
|
2013
|
+
phq_create q_phrase.c /^Query *phq_create()$/;" f
|
2014
|
+
phq_destroy q_phrase.c /^void phq_destroy(void *p)$/;" f
|
2015
|
+
phq_extract_terms q_phrase.c /^void phq_extract_terms(Query *self, Array *terms)$/;" f
|
2016
|
+
phq_rewrite q_phrase.c /^Query *phq_rewrite(Query *self, IndexReader *ir)$/;" f
|
2017
|
+
phq_to_s q_phrase.c /^char *phq_to_s(Query *self, char *field)$/;" f
|
2018
|
+
phrase q_parser.c /^ Phrase *phrase;$/;" m union:YYSTYPE file:
|
2019
|
+
phrase_freq search.h /^ float (*phrase_freq)(Scorer *self);$/;" m struct:PhraseScorer
|
2020
|
+
phrase_pos search.h /^ PhrasePosition **phrase_pos;$/;" m struct:PhraseScorer
|
2021
|
+
phsc_create q_phrase.c /^Scorer *phsc_create(Weight *weight, TermDocEnum **term_pos_enum,$/;" f
|
2022
|
+
phsc_destroy q_phrase.c /^void phsc_destroy(void *p)$/;" f
|
2023
|
+
phsc_do_next q_phrase.c /^bool phsc_do_next(Scorer *self)$/;" f
|
2024
|
+
phsc_explain q_phrase.c /^Explanation *phsc_explain(Scorer *self, int doc_num)$/;" f
|
2025
|
+
phsc_init q_phrase.c /^void phsc_init(PhraseScorer *phsc)$/;" f
|
2026
|
+
phsc_next q_phrase.c /^bool phsc_next(Scorer *self)$/;" f
|
2027
|
+
phsc_score q_phrase.c /^float phsc_score(Scorer *self)$/;" f
|
2028
|
+
phsc_skip_to q_phrase.c /^bool phsc_skip_to(Scorer *self, int doc_num)$/;" f
|
2029
|
+
phw_create q_phrase.c /^Weight *phw_create(Query *query, Searcher *searcher)$/;" f
|
2030
|
+
phw_explain q_phrase.c /^Explanation *phw_explain(Weight *self, IndexReader *ir, int doc_num)$/;" f
|
2031
|
+
phw_scorer q_phrase.c /^Scorer *phw_scorer(Weight *self, IndexReader *ir)$/;" f
|
2032
|
+
phw_to_s q_phrase.c /^char *phw_to_s(Weight *self)$/;" f
|
2033
|
+
pointer index.h /^ int pointer;$/;" m struct:MultiTermDocEnum
|
2034
|
+
pointer search.h /^ int pointer;$/;" m struct:TermScorer
|
2035
|
+
pointer store.h /^ int pointer; \/\/ only used by RAMIn$/;" m union:InStream::<anonymous>
|
2036
|
+
pointer store.h /^ int pointer; \/\/ only used by RAMOut$/;" m struct:OutStream
|
2037
|
+
pointer_max search.h /^ int pointer_max;$/;" m struct:TermScorer
|
2038
|
+
pos analysis.h /^ int pos;$/;" m struct:TokenStream
|
2039
|
+
pos index.h /^ int pos;$/;" m struct:SegmentTermEnum
|
2040
|
+
pos store.h /^ int pos;$/;" m struct:Buffer
|
2041
|
+
pos_inc analysis.h /^ int pos_inc;$/;" m struct:Token
|
2042
|
+
pos_inc r_analysis.c /^ int pos_inc;$/;" m struct:RToken file:
|
2043
|
+
pos_queue index.h /^ int *pos_queue;$/;" m
|
2044
|
+
pos_queue_capa index.h /^ int pos_queue_capa;$/;" m
|
2045
|
+
pos_queue_index index.h /^ int pos_queue_index;$/;" m
|
2046
|
+
position index.h /^ int position;$/;" m struct:SegmentTermDocEnum
|
2047
|
+
position search.h /^ int position;$/;" m struct:PhrasePosition
|
2048
|
+
position search.h /^ int position;$/;" m struct:SpanTermEnum
|
2049
|
+
positions index.h /^ int **positions;$/;" m struct:TermVector
|
2050
|
+
positions index.h /^ int *positions;$/;" m struct:Posting
|
2051
|
+
positions index.h /^ int *positions;$/;" m struct:TVTerm
|
2052
|
+
positions search.h /^ TermDocEnum *positions;$/;" m struct:SpanTermEnum
|
2053
|
+
positions search.h /^ int *positions;$/;" m struct:MultiPhraseQuery
|
2054
|
+
positions search.h /^ int *positions;$/;" m struct:PhraseQuery
|
2055
|
+
postings index.h /^ TermDocEnum *postings;$/;" m struct:SegmentMergeInfo
|
2056
|
+
postingtable index.h /^ HshTable *postingtable;$/;" m struct:DocumentWriter
|
2057
|
+
pp_cmp q_phrase.c /^inline int pp_cmp(const void *const p1, const void *const p2)$/;" f
|
2058
|
+
pp_cnt search.h /^ int pp_cnt;$/;" m struct:PhraseScorer
|
2059
|
+
pp_create q_phrase.c /^PhrasePosition *pp_create(TermDocEnum *tpe, int offset)$/;" f
|
2060
|
+
pp_destroy q_phrase.c /^void pp_destroy(void *p)$/;" f
|
2061
|
+
pp_first search.h /^ int pp_first;$/;" m struct:PhraseScorer
|
2062
|
+
pp_first_position q_phrase.c /^bool pp_first_position(PhrasePosition *self)$/;" f
|
2063
|
+
pp_last search.h /^ int pp_last;$/;" m struct:PhraseScorer
|
2064
|
+
pp_less_than q_phrase.c /^bool pp_less_than(void *p1, void *p2)$/;" f
|
2065
|
+
pp_next q_phrase.c /^bool pp_next(PhrasePosition *self)$/;" f
|
2066
|
+
pp_next_position q_phrase.c /^bool pp_next_position(PhrasePosition *self)$/;" f
|
2067
|
+
pp_skip_to q_phrase.c /^bool pp_skip_to(PhrasePosition *self, int doc_num)$/;" f
|
2068
|
+
pp_to_s q_phrase.c /^char *pp_to_s(PhrasePosition *self)$/;" f
|
2069
|
+
pq index.h /^ PriorityQueue *pq;$/;" m
|
2070
|
+
pq2_clear priorityqueue.c /^void pq2_clear(PriorityQueue2 *pq)$/;" f
|
2071
|
+
pq2_create priorityqueue.c /^PriorityQueue2 *pq2_create(int max_size,$/;" f
|
2072
|
+
pq2_destroy priorityqueue.c /^void pq2_destroy(void *p)$/;" f
|
2073
|
+
pq2_down priorityqueue.c /^void pq2_down(PriorityQueue2 *pq)$/;" f
|
2074
|
+
pq2_insert priorityqueue.c /^int pq2_insert(PriorityQueue2 *pq, void *elem) $/;" f
|
2075
|
+
pq2_pop priorityqueue.c /^void *pq2_pop(PriorityQueue2 *pq)$/;" f
|
2076
|
+
pq2_push priorityqueue.c /^void pq2_push(PriorityQueue2 *pq, void *elem) $/;" f
|
2077
|
+
pq2_top priorityqueue.c /^void *pq2_top(PriorityQueue2 *pq)$/;" f
|
2078
|
+
pq2_up priorityqueue.c /^void pq2_up(PriorityQueue2 *pq)$/;" f
|
2079
|
+
pq_clear priorityqueue.c /^void pq_clear(PriorityQueue *pq)$/;" f
|
2080
|
+
pq_create priorityqueue.c /^PriorityQueue *pq_create(int max_size, bool (*less_than)(void *p1, void *p2))$/;" f
|
2081
|
+
pq_destroy priorityqueue.c /^void pq_destroy(void *p)$/;" f
|
2082
|
+
pq_down priorityqueue.c /^void pq_down(PriorityQueue *pq)$/;" f
|
2083
|
+
pq_full priorityqueue.h 22;" d
|
2084
|
+
pq_insert priorityqueue.c /^int pq_insert(PriorityQueue *pq, void *elem) $/;" f
|
2085
|
+
pq_pop priorityqueue.c /^void *pq_pop(PriorityQueue *pq)$/;" f
|
2086
|
+
pq_push priorityqueue.c /^void pq_push(PriorityQueue *pq, void *elem) $/;" f
|
2087
|
+
pq_top priorityqueue.c /^void *pq_top(PriorityQueue *pq)$/;" f
|
2088
|
+
pq_up priorityqueue.c /^void pq_up(PriorityQueue *pq)$/;" f
|
2089
|
+
pre_len search.h /^ int pre_len;$/;" m struct:FuzzyQuery
|
2090
|
+
prefix Makefile /^prefix = $(DESTDIR)\/usr$/;" m
|
2091
|
+
prefixq_create q_prefix.c /^Query *prefixq_create(Term *prefix)$/;" f
|
2092
|
+
preload Makefile /^preload = $/;" m
|
2093
|
+
progname global.c /^char *progname(void)$/;" f
|
2094
|
+
prohibited_scorers search.h /^ Scorer **prohibited_scorers;$/;" m struct:BooleanScorer
|
2095
|
+
prox_cnt index.h /^ int prox_cnt;$/;" m struct:SegmentTermDocEnum
|
2096
|
+
prox_in index.h /^ InStream *prox_in;$/;" m struct:SegmentReader
|
2097
|
+
prox_in index.h /^ InStream *prox_in;$/;" m struct:SegmentTermDocEnum
|
2098
|
+
prox_out index.h /^ OutStream *prox_out;$/;" m struct:SegmentMerger
|
2099
|
+
prox_pointer index.h /^ int prox_pointer;$/;" m struct:SegmentTermDocEnum
|
2100
|
+
prox_pointer index.h /^ int prox_pointer;$/;" m struct:TermInfo
|
2101
|
+
prq_destroy q_prefix.c /^void prq_destroy(void *p)$/;" f
|
2102
|
+
prq_rewrite q_prefix.c /^Query *prq_rewrite(Query *self, IndexReader *ir)$/;" f
|
2103
|
+
prq_to_s q_prefix.c /^char *prq_to_s(Query *self, char *field) $/;" f
|
2104
|
+
ps_capa search.h /^ int ps_capa;$/;" m struct:BooleanScorer
|
2105
|
+
ps_cnt search.h /^ int ps_cnt;$/;" m struct:BooleanScorer
|
2106
|
+
pt_cnt search.h /^ int *pt_cnt;$/;" m struct:MultiPhraseQuery
|
2107
|
+
q_create search.c /^Query *q_create()$/;" f
|
2108
|
+
q_destroy search.c /^void q_destroy(Query *self)$/;" f
|
2109
|
+
q_extract_terms search.c /^void q_extract_terms(Query *self, Array *terms)$/;" f
|
2110
|
+
q_get_similarity search.c /^Similarity *q_get_similarity(Query *self, Searcher *searcher)$/;" f
|
2111
|
+
q_rewrite search.c /^Query *q_rewrite(Query *self, IndexReader *ir)$/;" f
|
2112
|
+
q_weight search.c /^Weight *q_weight(Query *self, Searcher *searcher)$/;" f
|
2113
|
+
qfilt_create filter.c /^Filter *qfilt_create(Query *query)$/;" f
|
2114
|
+
qfilt_destroy filter.c /^void qfilt_destroy(void *p)$/;" f
|
2115
|
+
qfilt_get_bv filter.c /^BitVector *qfilt_get_bv(Filter *filt, IndexReader *ir)$/;" f
|
2116
|
+
qfilt_to_s filter.c /^char *qfilt_to_s(Filter *self)$/;" f
|
2117
|
+
qnorm search.h /^ float qnorm;$/;" m struct:Weight
|
2118
|
+
qp search.h /^ QParser *qp;$/;" m struct:Index
|
2119
|
+
qp_clean_str q_parser.c /^char *qp_clean_str(char *str)$/;" f
|
2120
|
+
qp_create q_parser.c /^QParser *qp_create(HashSet *all_fields, HashSet *def_fields, Analyzer *analyzer)$/;" f
|
2121
|
+
qp_destroy q_parser.c /^void qp_destroy(void *p)$/;" f
|
2122
|
+
qp_get_bad_query q_parser.c /^Query *qp_get_bad_query(QParser *qp, char *str)$/;" f
|
2123
|
+
qp_parse q_parser.c /^Query *qp_parse(QParser *self, char *qstr)$/;" f
|
2124
|
+
qstr search.h /^ char *qstr;$/;" m struct:QParser
|
2125
|
+
qstrp search.h /^ char *qstrp;$/;" m struct:QParser
|
2126
|
+
query q_parser.c /^ Query *query;$/;" m union:YYSTYPE file:
|
2127
|
+
query search.h /^ Query *query;$/;" m struct:BooleanClause
|
2128
|
+
query search.h /^ Query *query;$/;" m struct:FilteredQuery
|
2129
|
+
query search.h /^ Query *query;$/;" m struct:QueryFilter
|
2130
|
+
query search.h /^ Query *query;$/;" m struct:SpanEnum
|
2131
|
+
query search.h /^ Query *query;$/;" m struct:Weight
|
2132
|
+
query_norm search.h /^ float (*query_norm)(Similarity *self, float sum_of_squared_weights);$/;" m struct:Similarity
|
2133
|
+
queue index.h /^ PriorityQueue *queue;$/;" m struct:SegmentMerger
|
2134
|
+
queue search.h /^ PriorityQueue *queue;$/;" m struct:SpanOrEnum
|
2135
|
+
qweight search.h /^ float qweight;$/;" m struct:Weight
|
2136
|
+
rallow_any_fields_key r_qparser.c /^VALUE rallow_any_fields_key;$/;" v
|
2137
|
+
ram_clear ram_store.c /^void ram_clear(Store *store)$/;" f
|
2138
|
+
ram_clear_all ram_store.c /^void ram_clear_all(Store *store)$/;" f
|
2139
|
+
ram_clear_locks ram_store.c /^void ram_clear_locks(Store *store)$/;" f
|
2140
|
+
ram_close ram_store.c /^void ram_close(Store *store)$/;" f
|
2141
|
+
ram_close_lock ram_store.c /^void ram_close_lock(Lock *lock)$/;" f
|
2142
|
+
ram_count ram_store.c /^int ram_count(Store *store)$/;" f
|
2143
|
+
ram_create_buffer ram_store.c /^OutStream *ram_create_buffer()$/;" f
|
2144
|
+
ram_create_output ram_store.c /^OutStream *ram_create_output(Store *store, const char *filename)$/;" f
|
2145
|
+
ram_destroy_buffer ram_store.c /^void ram_destroy_buffer(OutStream *os)$/;" f
|
2146
|
+
ram_each ram_store.c /^void ram_each(Store *store, void (*func)(char *fname, void *arg), void *arg)$/;" f
|
2147
|
+
ram_exists ram_store.c /^int ram_exists(Store *store, char *filename)$/;" f
|
2148
|
+
ram_length ram_store.c /^int ram_length(Store *store, char *filename)$/;" f
|
2149
|
+
ram_lock_is_locked ram_store.c /^int ram_lock_is_locked(Lock *lock)$/;" f
|
2150
|
+
ram_lock_obtain ram_store.c /^int ram_lock_obtain(Lock *lock)$/;" f
|
2151
|
+
ram_lock_release ram_store.c /^void ram_lock_release(Lock *lock)$/;" f
|
2152
|
+
ram_open_input ram_store.c /^InStream *ram_open_input(Store *store, const char *filename)$/;" f
|
2153
|
+
ram_open_lock ram_store.c /^Lock *ram_open_lock(Store *store, char *lockname)$/;" f
|
2154
|
+
ram_remove ram_store.c /^int ram_remove(Store *store, char *filename)$/;" f
|
2155
|
+
ram_rename ram_store.c /^int ram_rename(Store *store, char *from, char *to)$/;" f
|
2156
|
+
ram_store index.h /^ Store *ram_store;$/;" m struct:IndexWriter
|
2157
|
+
ram_touch ram_store.c /^void ram_touch(Store *store, char *filename)$/;" f
|
2158
|
+
rami_clone_internal ram_store.c /^void rami_clone_internal(InStream *is, InStream *new_index_i)$/;" f
|
2159
|
+
rami_close_internal ram_store.c /^void rami_close_internal(InStream *is)$/;" f
|
2160
|
+
rami_length ram_store.c /^int rami_length(InStream *is)$/;" f
|
2161
|
+
rami_read_internal ram_store.c /^void rami_read_internal(InStream *is, uchar *b, int offset, int len)$/;" f
|
2162
|
+
rami_seek_internal ram_store.c /^void rami_seek_internal(InStream *is, int pos)$/;" f
|
2163
|
+
ramo_close_internal ram_store.c /^void ramo_close_internal(OutStream *os)$/;" f
|
2164
|
+
ramo_flush_internal ram_store.c /^void ramo_flush_internal(OutStream *os, uchar *src, int len)$/;" f
|
2165
|
+
ramo_length ram_store.c /^int ramo_length(OutStream *os)$/;" f
|
2166
|
+
ramo_reset ram_store.c /^void ramo_reset(OutStream *os)$/;" f
|
2167
|
+
ramo_seek_internal ram_store.c /^void ramo_seek_internal(OutStream *os, int pos)$/;" f
|
2168
|
+
ramo_write_to ram_store.c /^void ramo_write_to(OutStream *os, OutStream *other_o)$/;" f
|
2169
|
+
ranalyzer_key r_index_io.c /^VALUE ranalyzer_key;$/;" v
|
2170
|
+
ranalyzer_key r_qparser.c /^VALUE ranalyzer_key;$/;" v
|
2171
|
+
range_create q_range.c /^Range *range_create(const char *field, char *lower_term, char *upper_term,$/;" f
|
2172
|
+
range_destroy q_range.c /^void range_destroy(void *p)$/;" f
|
2173
|
+
range_to_s q_range.c /^char *range_to_s(Range *range, char *field, float boost)$/;" f
|
2174
|
+
rauto_flush_key r_search.c /^static VALUE rauto_flush_key;$/;" v file:
|
2175
|
+
rclose_dir_key r_index_io.c /^VALUE rclose_dir_key;$/;" v
|
2176
|
+
rclose_dir_key r_search.c /^static VALUE rclose_dir_key;$/;" v file:
|
2177
|
+
rcnt index.h /^ int rcnt;$/;" m struct:MultiReader
|
2178
|
+
rcomparator_key r_search.c /^static VALUE rcomparator_key;$/;" v file:
|
2179
|
+
rcreate_if_missing_key r_index_io.c /^VALUE rcreate_if_missing_key;$/;" v
|
2180
|
+
rcreate_if_missing_key r_search.c /^static VALUE rcreate_if_missing_key;$/;" v file:
|
2181
|
+
rcreate_key r_index_io.c /^VALUE rcreate_key;$/;" v
|
2182
|
+
rcreate_key r_search.c /^static VALUE rcreate_key;$/;" v file:
|
2183
|
+
rdefault_field_key r_search.c /^static VALUE rdefault_field_key;$/;" v file:
|
2184
|
+
rdefault_min_similarity_id r_search.c /^static VALUE rdefault_min_similarity_id;$/;" v file:
|
2185
|
+
rdefault_prefix_length_id r_search.c /^static VALUE rdefault_prefix_length_id;$/;" v file:
|
2186
|
+
rdefault_search_field_key r_search.c /^static VALUE rdefault_search_field_key;$/;" v file:
|
2187
|
+
rdefault_slop_key r_qparser.c /^VALUE rdefault_slop_key;$/;" v
|
2188
|
+
rdir_key r_search.c /^static VALUE rdir_key;$/;" v file:
|
2189
|
+
rdoc r_search.c /^ VALUE rdoc;$/;" m struct:QueryUpdateArg file:
|
2190
|
+
read index.h /^ int (*read)(TermDocEnum *tde, int *docs, int *freqs, int req_num);$/;" m struct:TermDocEnum
|
2191
|
+
read_byte index_io.c 114;" d file:
|
2192
|
+
read_internal store.h /^ void (*read_internal)(struct InStream *is, uchar *buf, int offset, int len);$/;" m struct:InStream
|
2193
|
+
readers index.h /^ Array *readers;$/;" m struct:SegmentMerger
|
2194
|
+
ref1 index.h /^ void *ref1;$/;" m struct:CacheObject
|
2195
|
+
ref2 index.h /^ void *ref2;$/;" m struct:CacheObject
|
2196
|
+
ref_cnt store.h /^ int ref_cnt; \/* for fs_store only *\/$/;" m struct:Store
|
2197
|
+
ref_tab1 index.h /^ HshTable *ref_tab1;$/;" m struct:CacheObject
|
2198
|
+
ref_tab2 index.h /^ HshTable *ref_tab2;$/;" m struct:CacheObject
|
2199
|
+
refcnt ram_store.c /^ int refcnt;$/;" m struct:RamFile file:
|
2200
|
+
release store.h /^ void (*release)(Lock *lock);$/;" m struct:Lock
|
2201
|
+
remove store.h /^ int (*remove)(Store *store, char *filename);$/;" m struct:Store
|
2202
|
+
rename store.h /^ int (*rename)(Store *store, char *from, char *to);$/;" m struct:Store
|
2203
|
+
req_excl_scorer_create q_boolean.c /^Scorer *req_excl_scorer_create(Scorer *req_scorer, Scorer *excl_scorer)$/;" f
|
2204
|
+
req_opt_sum_scorer_create q_boolean.c /^Scorer *req_opt_sum_scorer_create(Scorer *req_scorer, Scorer *opt_scorer)$/;" f
|
2205
|
+
req_scorer search.h /^ Scorer *req_scorer;$/;" m struct:ReqExclScorer
|
2206
|
+
req_scorer search.h /^ Scorer *req_scorer;$/;" m struct:ReqOptSumScorer
|
2207
|
+
required_scorers search.h /^ Scorer **required_scorers;$/;" m struct:BooleanScorer
|
2208
|
+
reset analysis.h /^ void (*reset)(TokenStream *ts, char *text);$/;" m struct:TokenStream
|
2209
|
+
result search.h /^ Query *result;$/;" m struct:QParser
|
2210
|
+
reverse search.h /^ bool reverse : 1;$/;" m struct:SortField
|
2211
|
+
reverse sort.c /^ bool reverse : 1;$/;" m struct:Comparator file:
|
2212
|
+
rewrite search.h /^ Query *(*rewrite)(Searcher *self, Query *original);$/;" m struct:Searcher
|
2213
|
+
rewrite search.h /^ Query *(*rewrite)(Query *self, IndexReader *ir);$/;" m struct:Query
|
2214
|
+
rewritten search.h /^ Query *rewritten;$/;" m struct:BooleanClause
|
2215
|
+
rewritten search.h /^ Query *rewritten;$/;" m struct:Query
|
2216
|
+
rf_close ram_store.c /^void rf_close(void *p)$/;" f
|
2217
|
+
rf_create ram_store.c /^RamFile *rf_create(const char *name)$/;" f
|
2218
|
+
rf_extend_if_necessary ram_store.c /^void rf_extend_if_necessary(RamFile *rf, int buf_num)$/;" f
|
2219
|
+
rfilt_create q_range.c /^Filter *rfilt_create(const char *field, char *lower_term, char *upper_term,$/;" f
|
2220
|
+
rfilt_destroy q_range.c /^void rfilt_destroy(void *p)$/;" f
|
2221
|
+
rfilt_get_bv q_range.c /^BitVector *rfilt_get_bv(Filter *self, IndexReader *ir)$/;" f
|
2222
|
+
rfilt_to_s q_range.c /^char *rfilt_to_s(Filter *self)$/;" f
|
2223
|
+
rfilter_key r_search.c /^static VALUE rfilter_key;$/;" v file:
|
2224
|
+
rfirst_doc_key r_search.c /^static VALUE rfirst_doc_key;$/;" v file:
|
2225
|
+
rhandle_parse_errors_key r_qparser.c /^VALUE rhandle_parse_errors_key;$/;" v
|
2226
|
+
rid_field_key r_search.c /^static VALUE rid_field_key;$/;" v file:
|
2227
|
+
rkey_key r_search.c /^static VALUE rkey_key;$/;" v file:
|
2228
|
+
rmax_field_length_key r_index_io.c /^VALUE rmax_field_length_key;$/;" v
|
2229
|
+
rmax_merge_docs_key r_index_io.c /^VALUE rmax_merge_docs_key;$/;" v
|
2230
|
+
rmerge_factor_key r_index_io.c /^VALUE rmerge_factor_key;$/;" v
|
2231
|
+
rmin_merge_docs_key r_index_io.c /^VALUE rmin_merge_docs_key;$/;" v
|
2232
|
+
rnum_docs_key r_search.c /^static VALUE rnum_docs_key;$/;" v file:
|
2233
|
+
roccur_default_key r_qparser.c /^VALUE roccur_default_key;$/;" v
|
2234
|
+
rossc_destroy q_boolean.c /^void rossc_destroy(void *p)$/;" f
|
2235
|
+
rossc_explain q_boolean.c /^Explanation *rossc_explain(Scorer *self, int doc_num)$/;" f
|
2236
|
+
rossc_next q_boolean.c /^bool rossc_next(Scorer *self)$/;" f
|
2237
|
+
rossc_score q_boolean.c /^float rossc_score(Scorer *self)$/;" f
|
2238
|
+
rossc_skip_to q_boolean.c /^bool rossc_skip_to(Scorer *self, int doc_num)$/;" f
|
2239
|
+
rpath_key r_search.c /^static VALUE rpath_key;$/;" v file:
|
2240
|
+
rq_create q_range.c /^Query *rq_create(const char *field, char *lower_term, char *upper_term,$/;" f
|
2241
|
+
rq_create_less q_range.c /^Query *rq_create_less(const char *field, char *upper_term, bool include_upper)$/;" f
|
2242
|
+
rq_create_more q_range.c /^Query *rq_create_more(const char *field, char *lower_term, bool include_lower)$/;" f
|
2243
|
+
rq_destroy q_range.c /^void rq_destroy(void *p)$/;" f
|
2244
|
+
rq_rewrite q_range.c /^Query *rq_rewrite(Query *self, IndexReader *ir)$/;" f
|
2245
|
+
rq_to_s q_range.c /^char *rq_to_s(Query *self, char *field)$/;" f
|
2246
|
+
rreverse_key r_search.c /^static VALUE rreverse_key;$/;" v file:
|
2247
|
+
rs_capa search.h /^ int rs_capa;$/;" m struct:BooleanScorer
|
2248
|
+
rs_cnt search.h /^ int rs_cnt;$/;" m struct:BooleanScorer
|
2249
|
+
rsort_key r_search.c /^static VALUE rsort_key;$/;" v file:
|
2250
|
+
rsort_type_key r_search.c /^static VALUE rsort_type_key;$/;" v file:
|
2251
|
+
rterm_index_interval_key r_index_io.c /^VALUE rterm_index_interval_key;$/;" v
|
2252
|
+
ruby Makefile /^ruby = \/usr\/bin\/ruby1.8$/;" m
|
2253
|
+
ruby_version Makefile /^ruby_version = 1.8$/;" m
|
2254
|
+
rubylibdir Makefile /^rubylibdir = $(libdir)\/ruby\/$(ruby_version)$/;" m
|
2255
|
+
ruse_compound_file_key r_index_io.c /^VALUE ruse_compound_file_key;$/;" v
|
2256
|
+
ruse_compound_file_key r_search.c /^static VALUE ruse_compound_file_key;$/;" v file:
|
2257
|
+
rwild_lower_key r_qparser.c /^VALUE rwild_lower_key;$/;" v
|
2258
|
+
rxsc_destroy q_boolean.c /^void rxsc_destroy(void *p)$/;" f
|
2259
|
+
rxsc_explain q_boolean.c /^Explanation *rxsc_explain(Scorer *self, int doc_num)$/;" f
|
2260
|
+
rxsc_next q_boolean.c /^bool rxsc_next(Scorer *self)$/;" f
|
2261
|
+
rxsc_score q_boolean.c /^float rxsc_score(Scorer *self)$/;" f
|
2262
|
+
rxsc_skip_to q_boolean.c /^bool rxsc_skip_to(Scorer *self, int doc_num)$/;" f
|
2263
|
+
rxsc_to_non_excluded q_boolean.c /^bool rxsc_to_non_excluded(Scorer *self)$/;" f
|
2264
|
+
s_cnt search.h /^ int s_cnt;$/;" m struct:SpanNearEnum
|
2265
|
+
s_cnt search.h /^ int s_cnt;$/;" m struct:SpanOrEnum
|
2266
|
+
save_data field.c /^void save_data(OutStream *fout, char *data, int dlen)$/;" f
|
2267
|
+
sbindir Makefile /^sbindir = $(exec_prefix)\/sbin$/;" m
|
2268
|
+
scale_factor search.h /^ float scale_factor;$/;" m struct:FuzzyQuery
|
2269
|
+
scmp global.c /^int scmp(const void *p1, const void *p2)$/;" f
|
2270
|
+
scnt index.h /^ int scnt;$/;" m struct:SegmentInfos
|
2271
|
+
score q_fuzzy.c /^ float score;$/;" m struct:ScoredTerm file:
|
2272
|
+
score search.h /^ float (*score)(Scorer *self);$/;" m struct:Scorer
|
2273
|
+
score search.h /^ float score;$/;" m struct:ConstantScoreScorer
|
2274
|
+
score search.h /^ float score;$/;" m struct:Hit
|
2275
|
+
score search.h /^ float score;$/;" m struct:MatchAllScorer
|
2276
|
+
score_cache search.h /^ float score_cache[SCORE_CACHE_SIZE];$/;" m struct:TermScorer
|
2277
|
+
scored_term_create q_fuzzy.c /^ScoredTerm *scored_term_create(Term *term, float score)$/;" f
|
2278
|
+
scored_term_destroy q_fuzzy.c /^void scored_term_destroy(void *p)$/;" f
|
2279
|
+
scored_term_less_than q_fuzzy.c /^bool scored_term_less_than(void *p1, void *p2)$/;" f
|
2280
|
+
scorer search.h /^ Scorer *(*scorer)(Weight *self, IndexReader *ir);$/;" m struct:Weight
|
2281
|
+
scorer search.h /^ Scorer *scorer;$/;" m struct:SingleMatchScorer
|
2282
|
+
scorer_create search.c /^Scorer *scorer_create(Similarity *similarity)$/;" f
|
2283
|
+
scorer_destroy search.c /^void scorer_destroy(void *p)$/;" f
|
2284
|
+
scorer_doc_cmp search.c /^int scorer_doc_cmp(const void *p1, const void *p2)$/;" f
|
2285
|
+
scorer_doc_less_than search.c /^bool scorer_doc_less_than(void *p1, void *p2)$/;" f
|
2286
|
+
scorer_less_than search.c /^bool scorer_less_than(void *p1, void *p2)$/;" f
|
2287
|
+
scorer_queue search.h /^ PriorityQueue *scorer_queue;$/;" m struct:DisjunctionSumScorer
|
2288
|
+
se search.h /^ SpanEnum *se;$/;" m struct:SpanEnumCell
|
2289
|
+
sea search.h /^ Searcher *sea;$/;" m struct:Index
|
2290
|
+
sea_close search.c /^void sea_close(Searcher *self)$/;" f
|
2291
|
+
sea_create search.c /^Searcher *sea_create(IndexReader *ir)$/;" f
|
2292
|
+
sea_create_weight search.c /^Weight *sea_create_weight(Searcher *self, Query *query)$/;" f
|
2293
|
+
sea_doc_freq search.c /^int sea_doc_freq(Searcher *self, Term *term)$/;" f
|
2294
|
+
sea_doc_freqs search.c /^int *sea_doc_freqs(Searcher *self, Term **terms, int tcnt)$/;" f
|
2295
|
+
sea_explain search.c /^Explanation *sea_explain(Searcher *self, Query *query, int doc_num)$/;" f
|
2296
|
+
sea_get_doc search.c /^Document *sea_get_doc(Searcher *self, int doc_num)$/;" f
|
2297
|
+
sea_get_similarity search.c /^Similarity *sea_get_similarity(Searcher *self)$/;" f
|
2298
|
+
sea_max_doc search.c /^int sea_max_doc(Searcher *self)$/;" f
|
2299
|
+
sea_rewrite search.c /^Query *sea_rewrite(Searcher *self, Query *original)$/;" f
|
2300
|
+
sea_search search.c /^TopDocs *sea_search(Searcher *self, Query *query, int first_doc,$/;" f
|
2301
|
+
sea_search_each search.c /^void sea_search_each(Searcher *self, Query *query, Filter *filter,$/;" f
|
2302
|
+
search search.h /^ TopDocs *(*search)(Searcher *self, Query *query, int first_doc,$/;" m struct:Searcher
|
2303
|
+
seek index.h /^ void (*seek)(TermDocEnum *tde, Term *term);$/;" m struct:TermDocEnum
|
2304
|
+
seek_internal store.h /^ void (*seek_internal)(struct InStream *is, int pos);$/;" m struct:InStream
|
2305
|
+
seek_internal store.h /^ void (*seek_internal)(struct OutStream *os, int pos);$/;" m struct:OutStream
|
2306
|
+
seek_prox index.h /^ void (*seek_prox)(SegmentTermDocEnum *stde, int prox_pointer);$/;" m struct:SegmentTermDocEnum
|
2307
|
+
segment index.h /^ char *segment;$/;" m struct:SegmentReader
|
2308
|
+
segment_name index_rw.c /^ char *segment_name;$/;" m struct:NormTester file:
|
2309
|
+
segs index.h /^ SegmentInfo **segs;$/;" m struct:SegmentInfos
|
2310
|
+
setprogname global.c /^void setprogname(const char *str)$/;" f
|
2311
|
+
setup_endian similarity.c /^setup_endian()$/;" f file:
|
2312
|
+
sf_capa search.h /^ int sf_capa;$/;" m struct:Sort
|
2313
|
+
sf_cnt search.h /^ int sf_cnt;$/;" m struct:Sort
|
2314
|
+
sf_destroy analysis.c /^void sf_destroy(void *p)$/;" f
|
2315
|
+
sf_doc_compare sort.c /^int sf_doc_compare(void *index_ptr, Hit *hit1, Hit *hit2)$/;" f
|
2316
|
+
sf_float_compare sort.c /^int sf_float_compare(void *index_ptr, Hit *hit1, Hit *hit2)$/;" f
|
2317
|
+
sf_float_create_index sort.c /^void *sf_float_create_index(int size)$/;" f
|
2318
|
+
sf_float_handle_term sort.c /^void sf_float_handle_term(void *index_ptr, TermDocEnum *tde, char *text)$/;" f
|
2319
|
+
sf_int_compare sort.c /^int sf_int_compare(void *index_ptr, Hit *hit1, Hit *hit2)$/;" f
|
2320
|
+
sf_int_create_index sort.c /^void *sf_int_create_index(int size)$/;" f
|
2321
|
+
sf_int_handle_term sort.c /^void sf_int_handle_term(void *index_ptr, TermDocEnum *tde, char *text)$/;" f
|
2322
|
+
sf_next analysis.c /^Token *sf_next(TokenStream *ts)$/;" f
|
2323
|
+
sf_score_compare sort.c /^int sf_score_compare(void *index_ptr, Hit *hit2, Hit *hit1)$/;" f
|
2324
|
+
sf_string_compare sort.c /^int sf_string_compare(void *index_ptr, Hit *hit1, Hit *hit2)$/;" f
|
2325
|
+
sf_string_create_index sort.c /^void *sf_string_create_index(int size)$/;" f
|
2326
|
+
sf_string_destroy_index sort.c /^void sf_string_destroy_index(void *p)$/;" f
|
2327
|
+
sf_string_handle_term sort.c /^void sf_string_handle_term(void *index_ptr, TermDocEnum *tde, char *text)$/;" f
|
2328
|
+
sharedstatedir Makefile /^sharedstatedir = $(prefix)\/com$/;" m
|
2329
|
+
si_create index_rw.c /^SegmentInfo *si_create(char *name, int doc_cnt, Store *store)$/;" f
|
2330
|
+
si_destroy index_rw.c /^void si_destroy(void *p)$/;" f
|
2331
|
+
si_has_deletions index_rw.c /^bool si_has_deletions(SegmentInfo *si)$/;" f
|
2332
|
+
si_has_separate_norms index_rw.c /^bool si_has_separate_norms(SegmentInfo *si)$/;" f
|
2333
|
+
si_uses_compound_file index_rw.c /^bool si_uses_compound_file(SegmentInfo *si)$/;" f
|
2334
|
+
sim search.h /^ Similarity *sim;$/;" m struct:SpanScorer
|
2335
|
+
sim_coord search.h 42;" d
|
2336
|
+
sim_create_default similarity.c /^Similarity *sim_create_default()$/;" f
|
2337
|
+
sim_decode_norm search.h 43;" d
|
2338
|
+
sim_destroy search.h 45;" d
|
2339
|
+
sim_encode_norm search.h 44;" d
|
2340
|
+
sim_idf search.h 41;" d
|
2341
|
+
sim_idf_phrase search.h 40;" d
|
2342
|
+
sim_idf_term search.h 39;" d
|
2343
|
+
sim_length_norm search.h 35;" d
|
2344
|
+
sim_query_norm search.h 36;" d
|
2345
|
+
sim_sloppy_freq search.h 38;" d
|
2346
|
+
sim_tf search.h 37;" d
|
2347
|
+
simdef_coord similarity.c /^float simdef_coord(struct Similarity *s, int overlap, int max_overlap)$/;" f
|
2348
|
+
simdef_decode_norm similarity.c /^float simdef_decode_norm(struct Similarity *s, uchar b)$/;" f
|
2349
|
+
simdef_destroy similarity.c /^void simdef_destroy(void *p)$/;" f
|
2350
|
+
simdef_encode_norm similarity.c /^float simdef_encode_norm(struct Similarity *s, float f)$/;" f
|
2351
|
+
simdef_idf similarity.c /^float simdef_idf(struct Similarity *s, int doc_freq, int num_docs)$/;" f
|
2352
|
+
simdef_idf_phrase similarity.c /^float simdef_idf_phrase(struct Similarity *s, Term **terms, int tcnt, Searcher *searcher)$/;" f
|
2353
|
+
simdef_idf_term similarity.c /^float simdef_idf_term(struct Similarity *s, Term *term, Searcher *searcher)$/;" f
|
2354
|
+
simdef_length_norm similarity.c /^float simdef_length_norm(Similarity *s, char *field, int num_terms)$/;" f
|
2355
|
+
simdef_query_norm similarity.c /^float simdef_query_norm(struct Similarity *s, float sum_of_squared_weights)$/;" f
|
2356
|
+
simdef_sloppy_freq similarity.c /^float simdef_sloppy_freq(struct Similarity *s, int distance)$/;" f
|
2357
|
+
simdef_tf similarity.c /^float simdef_tf(struct Similarity *s, float freq)$/;" f
|
2358
|
+
similarity index.h /^ Similarity *similarity;$/;" m struct:DocumentWriter
|
2359
|
+
similarity index.h /^ Similarity *similarity;$/;" m struct:IndexWriter
|
2360
|
+
similarity search.h /^ Similarity *similarity;$/;" m struct:Scorer
|
2361
|
+
similarity search.h /^ Similarity *similarity;$/;" m struct:Searcher
|
2362
|
+
similarity search.h /^ Similarity *similarity;$/;" m struct:Weight
|
2363
|
+
similarity search.h /^ Similarity *similarity;$/;" m struct:BooleanQuery
|
2364
|
+
similarity search.h /^ Similarity *similarity;$/;" m struct:Coordinator
|
2365
|
+
single_match_scorer_create q_boolean.c /^Scorer *single_match_scorer_create(Coordinator *coordinator, Scorer *scorer)$/;" f
|
2366
|
+
sis index.h /^ SegmentInfos *sis;$/;" m struct:IndexReader
|
2367
|
+
sis index.h /^ SegmentInfos *sis;$/;" m struct:IndexWriter
|
2368
|
+
sis_add_si index_rw.c /^void sis_add_si(SegmentInfos *sis, SegmentInfo *si)$/;" f
|
2369
|
+
sis_clear index_rw.c /^void sis_clear(SegmentInfos *sis)$/;" f
|
2370
|
+
sis_create index_rw.c /^SegmentInfos *sis_create()$/;" f
|
2371
|
+
sis_del_at index_rw.c /^void sis_del_at(SegmentInfos *sis, int at)$/;" f
|
2372
|
+
sis_del_from_to index_rw.c /^void sis_del_from_to(SegmentInfos *sis, int from, int to)$/;" f
|
2373
|
+
sis_destroy index_rw.c /^void sis_destroy(void *p)$/;" f
|
2374
|
+
sis_destroy_not_infos index_rw.c /^void sis_destroy_not_infos(void *p)$/;" f
|
2375
|
+
sis_read index_rw.c /^void sis_read(SegmentInfos *sis, Store *store)$/;" f
|
2376
|
+
sis_read_current_version index_rw.c /^int sis_read_current_version(Store *store)$/;" f
|
2377
|
+
sis_write index_rw.c /^void sis_write(SegmentInfos *sis, Store *store)$/;" f
|
2378
|
+
sitearch Makefile /^sitearch = i486-linux$/;" m
|
2379
|
+
sitearchdir Makefile /^sitearchdir = $(sitelibdir)\/$(sitearch)$/;" m
|
2380
|
+
sitedir Makefile /^sitedir = $(DESTDIR)\/usr\/local\/lib\/site_ruby$/;" m
|
2381
|
+
sitelibdir Makefile /^sitelibdir = $(sitedir)\/$(ruby_version)$/;" m
|
2382
|
+
size array.h /^ int size;$/;" m struct:Array
|
2383
|
+
size bitvector.h /^ int size;$/;" m struct:BitVector
|
2384
|
+
size hashset.h /^ int size;$/;" m struct:HashSet
|
2385
|
+
size index.h /^ int size;$/;" m struct:Posting
|
2386
|
+
size index.h /^ int size;$/;" m struct:SegmentInfos
|
2387
|
+
size index.h /^ int size;$/;" m struct:SegmentTermEnum
|
2388
|
+
size index.h /^ int size;$/;" m struct:TermInfosReader
|
2389
|
+
size index.h /^ int size;$/;" m struct:TermInfosWriter
|
2390
|
+
size index.h /^ int size;$/;" m struct:TermVectorsReader
|
2391
|
+
size priorityqueue.h /^ int size;$/;" m struct:PriorityQueue
|
2392
|
+
size priorityqueue.h /^ int size;$/;" m struct:PriorityQueue2
|
2393
|
+
size search.h /^ int size;$/;" m struct:TopDocs
|
2394
|
+
size sort.c /^ int size;$/;" m struct:StringIndex file:
|
2395
|
+
skip_buffer index.h /^ OutStream *skip_buffer;$/;" m struct:SegmentMerger
|
2396
|
+
skip_count index.h /^ int skip_count;$/;" m struct:SegmentTermDocEnum
|
2397
|
+
skip_doc index.h /^ int skip_doc;$/;" m struct:SegmentTermDocEnum
|
2398
|
+
skip_in index.h /^ InStream *skip_in;$/;" m struct:SegmentTermDocEnum
|
2399
|
+
skip_interval index.h /^ int skip_interval;$/;" m struct:SegmentMerger
|
2400
|
+
skip_interval index.h /^ int skip_interval;$/;" m struct:SegmentTermDocEnum
|
2401
|
+
skip_interval index.h /^ int skip_interval;$/;" m struct:SegmentTermEnum
|
2402
|
+
skip_interval index.h /^ int skip_interval;$/;" m struct:TermInfosReader
|
2403
|
+
skip_interval index.h /^ int skip_interval;$/;" m struct:TermInfosWriter
|
2404
|
+
skip_offset index.h /^ int skip_offset;$/;" m struct:TermInfo
|
2405
|
+
skip_pointer index.h /^ int skip_pointer;$/;" m struct:SegmentTermDocEnum
|
2406
|
+
skip_prox index.h /^ void (*skip_prox)(SegmentTermDocEnum *stde);$/;" m struct:SegmentTermDocEnum
|
2407
|
+
skip_to index.h /^ bool (*skip_to)(TermDocEnum *tde, int target);$/;" m struct:TermDocEnum
|
2408
|
+
skip_to search.h /^ bool (*skip_to)(Scorer *self, int doc_num);$/;" m struct:Scorer
|
2409
|
+
skip_to search.h /^ bool (*skip_to)(SpanEnum *self, int target_doc);$/;" m struct:SpanEnum
|
2410
|
+
slop search.h /^ int slop;$/;" m struct:MultiPhraseQuery
|
2411
|
+
slop search.h /^ int slop;$/;" m struct:PhraseQuery
|
2412
|
+
slop search.h /^ int slop;$/;" m struct:PhraseScorer
|
2413
|
+
slop search.h /^ int slop;$/;" m struct:SpanNearEnum
|
2414
|
+
slop search.h /^ int slop;$/;" m struct:SpanNearQuery
|
2415
|
+
sloppy_freq search.h /^ float (*sloppy_freq)(Similarity *self, int distance);$/;" m struct:Similarity
|
2416
|
+
sloppy_phrase_scorer_create q_phrase.c /^Scorer *sloppy_phrase_scorer_create(Weight *weight, TermDocEnum **term_pos_enum,$/;" f
|
2417
|
+
sm_add index_rw.c /^void sm_add(SegmentMerger *sm, IndexReader *ir)$/;" f
|
2418
|
+
sm_add_indexed index_rw.c /^static inline void sm_add_indexed(IndexReader *ir,$/;" f file:
|
2419
|
+
sm_append_postings index_rw.c /^int sm_append_postings(SegmentMerger *sm, SegmentMergeInfo **smis, int cnt)$/;" f
|
2420
|
+
sm_buffer_skip index_rw.c /^inline void sm_buffer_skip(SegmentMerger *sm, int doc)$/;" f
|
2421
|
+
sm_close index_rw.c /^void sm_close(SegmentMerger *sm)$/;" f
|
2422
|
+
sm_create index_rw.c /^SegmentMerger *sm_create(Store *store, char *name, int term_index_interval)$/;" f
|
2423
|
+
sm_create_compound_file index_rw.c /^Array *sm_create_compound_file(SegmentMerger *sm, char *file_name)$/;" f
|
2424
|
+
sm_destroy index_rw.c /^void sm_destroy(void *p)$/;" f
|
2425
|
+
sm_merge index_rw.c /^int sm_merge(SegmentMerger *sm)$/;" f
|
2426
|
+
sm_merge_fields index_rw.c /^int sm_merge_fields(SegmentMerger *sm)$/;" f
|
2427
|
+
sm_merge_norms index_rw.c /^void sm_merge_norms(SegmentMerger *sm)$/;" f
|
2428
|
+
sm_merge_term_info index_rw.c /^void sm_merge_term_info(SegmentMerger *sm, SegmentMergeInfo **smis, int cnt)$/;" f
|
2429
|
+
sm_merge_term_infos index_rw.c /^void sm_merge_term_infos(SegmentMerger *sm)$/;" f
|
2430
|
+
sm_merge_terms index_rw.c /^void sm_merge_terms(SegmentMerger *sm)$/;" f
|
2431
|
+
sm_merge_vectors index_rw.c /^void sm_merge_vectors(SegmentMerger *sm)$/;" f
|
2432
|
+
sm_reset_skip index_rw.c /^void sm_reset_skip(SegmentMerger *sm)$/;" f
|
2433
|
+
sm_tb_to_term index_rw.c /^Term *sm_tb_to_term(SegmentMerger *sm, TermBuffer *tb)$/;" f
|
2434
|
+
sm_write_skip index_rw.c /^int sm_write_skip(SegmentMerger *sm)$/;" f
|
2435
|
+
smalltable hash.h /^ HshEntry smalltable[Hsh_MINSIZE];$/;" m struct:HshTable
|
2436
|
+
smi_create index_rw.c /^SegmentMergeInfo *smi_create(int base, TermEnum *te, IndexReader *ir)$/;" f
|
2437
|
+
smi_destroy index_rw.c /^void smi_destroy(void *p)$/;" f
|
2438
|
+
smi_load_doc_map index_rw.c /^int *smi_load_doc_map(SegmentMergeInfo *smi)$/;" f
|
2439
|
+
smi_lt index_rw.c /^bool smi_lt(void *p1, void *p2)$/;" f
|
2440
|
+
smi_next index_rw.c /^TermBuffer *smi_next(SegmentMergeInfo *smi)$/;" f
|
2441
|
+
smi_queue index.h /^ PriorityQueue *smi_queue;$/;" m struct:MultiTermEnum
|
2442
|
+
smsc_destroy q_boolean.c /^void smsc_destroy(void *p)$/;" f
|
2443
|
+
smsc_explain q_boolean.c /^Explanation *smsc_explain(Scorer *self, int doc_num)$/;" f
|
2444
|
+
smsc_next q_boolean.c /^bool smsc_next(Scorer *self)$/;" f
|
2445
|
+
smsc_score q_boolean.c /^float smsc_score(Scorer *self)$/;" f
|
2446
|
+
smsc_skip_to q_boolean.c /^bool smsc_skip_to(Scorer *self, int doc_num)$/;" f
|
2447
|
+
sne_goto_next_doc q_span.c /^bool sne_goto_next_doc(SpanNearEnum *sne)$/;" f
|
2448
|
+
sne_init q_span.c /^bool sne_init(SpanNearEnum *sne)$/;" f
|
2449
|
+
sne_next_match q_span.c /^bool sne_next_match(SpanEnum *self)$/;" f
|
2450
|
+
sne_next_ordered_match q_span.c /^bool sne_next_ordered_match(SpanEnum *self)$/;" f
|
2451
|
+
sne_next_unordered_match q_span.c /^bool sne_next_unordered_match(SpanEnum *self)$/;" f
|
2452
|
+
sort_add_sort_field sort.c /^void sort_add_sort_field(Sort *self, SortField *sf)$/;" f
|
2453
|
+
sort_cache index.h /^ HshTable *sort_cache;$/;" m struct:IndexReader
|
2454
|
+
sort_clear sort.c /^void sort_clear(Sort *self)$/;" f
|
2455
|
+
sort_create sort.c /^Sort *sort_create()$/;" f
|
2456
|
+
sort_destroy sort.c /^void sort_destroy(void *p)$/;" f
|
2457
|
+
sort_field_alloc sort.c /^SortField *sort_field_alloc(char *field, int type, bool reverse)$/;" f
|
2458
|
+
sort_field_auto_create sort.c /^SortField *sort_field_auto_create(char *field, bool reverse)$/;" f
|
2459
|
+
sort_field_auto_evaluate sort.c /^void sort_field_auto_evaluate(SortField *sf, char *text)$/;" f
|
2460
|
+
sort_field_clone sort.c /^SortField *sort_field_clone(SortField *self)$/;" f
|
2461
|
+
sort_field_create sort.c /^SortField *sort_field_create(char *field, int type, bool reverse)$/;" f
|
2462
|
+
sort_field_destroy sort.c /^void sort_field_destroy(void *p)$/;" f
|
2463
|
+
sort_field_doc_create sort.c /^SortField *sort_field_doc_create(bool reverse)$/;" f
|
2464
|
+
sort_field_eq sort.c /^int sort_field_eq(const void *p1, const void *p2)$/;" f
|
2465
|
+
sort_field_float_create sort.c /^SortField *sort_field_float_create(char *field, bool reverse)$/;" f
|
2466
|
+
sort_field_float_methods sort.c /^void sort_field_float_methods(SortField *self)$/;" f
|
2467
|
+
sort_field_hash sort.c /^unsigned int sort_field_hash(const void *p)$/;" f
|
2468
|
+
sort_field_int_create sort.c /^SortField *sort_field_int_create(char *field, bool reverse)$/;" f
|
2469
|
+
sort_field_int_methods sort.c /^void sort_field_int_methods(SortField *self)$/;" f
|
2470
|
+
sort_field_score_create sort.c /^SortField *sort_field_score_create(bool reverse)$/;" f
|
2471
|
+
sort_field_string_create sort.c /^SortField *sort_field_string_create(char *field, bool reverse)$/;" f
|
2472
|
+
sort_field_string_methods sort.c /^void sort_field_string_methods(SortField *self)$/;" f
|
2473
|
+
sort_fields search.h /^ SortField **sort_fields;$/;" m struct:Sort
|
2474
|
+
sorter_create sort.c /^Sorter *sorter_create(int size)$/;" f
|
2475
|
+
sorter_destroy sort.c /^void sorter_destroy(void *p)$/;" f
|
2476
|
+
sorter_get_comparator sort.c /^Comparator *sorter_get_comparator(SortField *sf, IndexReader *ir)$/;" f
|
2477
|
+
span_enums search.h /^ SpanEnum **span_enums;$/;" m struct:SpanNearEnum
|
2478
|
+
span_enums search.h /^ SpanEnum **span_enums;$/;" m struct:SpanOrEnum
|
2479
|
+
span_less_than q_span.c /^bool span_less_than(void *p1, void *p2)$/;" f
|
2480
|
+
spanfe_create q_span.c /^SpanEnum *spanfe_create(Query *query, IndexReader *ir)$/;" f
|
2481
|
+
spanfe_destroy q_span.c /^void spanfe_destroy(void *p)$/;" f
|
2482
|
+
spanfe_doc q_span.c /^int spanfe_doc(SpanEnum *self)$/;" f
|
2483
|
+
spanfe_end q_span.c /^int spanfe_end(SpanEnum *self)$/;" f
|
2484
|
+
spanfe_next q_span.c /^bool spanfe_next(SpanEnum *self)$/;" f
|
2485
|
+
spanfe_skip_to q_span.c /^bool spanfe_skip_to(SpanEnum *self, int target)$/;" f
|
2486
|
+
spanfe_start q_span.c /^int spanfe_start(SpanEnum *self)$/;" f
|
2487
|
+
spanfe_to_s q_span.c /^char *spanfe_to_s(SpanEnum *self) $/;" f
|
2488
|
+
spanfq_create q_span.c /^Query *spanfq_create(Query *match, int end)$/;" f
|
2489
|
+
spanfq_destroy q_span.c /^void spanfq_destroy(void *p)$/;" f
|
2490
|
+
spanfq_extract_terms q_span.c /^void spanfq_extract_terms(Query *self, Array *terms)$/;" f
|
2491
|
+
spanfq_get_terms q_span.c /^Array *spanfq_get_terms(Query *self)$/;" f
|
2492
|
+
spanfq_rewrite q_span.c /^Query *spanfq_rewrite(Query *self, IndexReader *ir)$/;" f
|
2493
|
+
spanfq_to_s q_span.c /^char *spanfq_to_s(Query *self, char *field)$/;" f
|
2494
|
+
spanne_create q_span.c /^SpanEnum *spanne_create(Query *query, IndexReader *ir)$/;" f
|
2495
|
+
spanne_destroy q_span.c /^void spanne_destroy(void *p)$/;" f
|
2496
|
+
spanne_doc q_span.c /^int spanne_doc(SpanEnum *self)$/;" f
|
2497
|
+
spanne_end q_span.c /^int spanne_end(SpanEnum *self)$/;" f
|
2498
|
+
spanne_next q_span.c /^bool spanne_next(SpanEnum *self)$/;" f
|
2499
|
+
spanne_skip_to q_span.c /^bool spanne_skip_to(SpanEnum *self, int target)$/;" f
|
2500
|
+
spanne_start q_span.c /^int spanne_start(SpanEnum *self)$/;" f
|
2501
|
+
spanne_to_s q_span.c /^char *spanne_to_s(SpanEnum *self) $/;" f
|
2502
|
+
spannq_create q_span.c /^Query *spannq_create(Query **clauses, int c_cnt, int slop, bool in_order)$/;" f
|
2503
|
+
spannq_destroy q_span.c /^void spannq_destroy(void *p)$/;" f
|
2504
|
+
spannq_extract_terms q_span.c /^void spannq_extract_terms(Query *self, Array *terms)$/;" f
|
2505
|
+
spannq_get_spans q_span.c /^SpanEnum *spannq_get_spans(Query *self, IndexReader *ir)$/;" f
|
2506
|
+
spannq_get_terms q_span.c /^Array *spannq_get_terms(Query *self)$/;" f
|
2507
|
+
spannq_rewrite q_span.c /^Query *spannq_rewrite(Query *self, IndexReader *ir)$/;" f
|
2508
|
+
spannq_to_s q_span.c /^char *spannq_to_s(Query *self, char *field)$/;" f
|
2509
|
+
spanoe_create q_span.c /^SpanEnum *spanoe_create(Query *query, IndexReader *ir)$/;" f
|
2510
|
+
spanoe_destroy q_span.c /^void spanoe_destroy(void *p)$/;" f
|
2511
|
+
spanoe_doc q_span.c /^int spanoe_doc(SpanEnum *self)$/;" f
|
2512
|
+
spanoe_end q_span.c /^int spanoe_end(SpanEnum *self)$/;" f
|
2513
|
+
spanoe_next q_span.c /^bool spanoe_next(SpanEnum *self)$/;" f
|
2514
|
+
spanoe_skip_to q_span.c /^bool spanoe_skip_to(SpanEnum *self, int target)$/;" f
|
2515
|
+
spanoe_start q_span.c /^int spanoe_start(SpanEnum *self)$/;" f
|
2516
|
+
spanoe_to_s q_span.c /^char *spanoe_to_s(SpanEnum *self) $/;" f
|
2517
|
+
spanoq_create q_span.c /^Query *spanoq_create(Query **clauses, int c_cnt)$/;" f
|
2518
|
+
spanoq_destroy q_span.c /^void spanoq_destroy(void *p)$/;" f
|
2519
|
+
spanoq_extract_terms q_span.c /^void spanoq_extract_terms(Query *self, Array *terms)$/;" f
|
2520
|
+
spanoq_get_spans q_span.c /^SpanEnum *spanoq_get_spans(Query *self, IndexReader *ir)$/;" f
|
2521
|
+
spanoq_get_terms q_span.c /^Array *spanoq_get_terms(Query *self)$/;" f
|
2522
|
+
spanoq_rewrite q_span.c /^Query *spanoq_rewrite(Query *self, IndexReader *ir)$/;" f
|
2523
|
+
spanoq_to_s q_span.c /^char *spanoq_to_s(Query *self, char *field)$/;" f
|
2524
|
+
spanq_destroy q_span.c /^void spanq_destroy(void *p)$/;" f
|
2525
|
+
spans search.h /^ SpanEnum *spans;$/;" m struct:SpanScorer
|
2526
|
+
spansc_create q_span.c /^Scorer *spansc_create(Weight *weight, IndexReader *ir)$/;" f
|
2527
|
+
spansc_destroy q_span.c /^void spansc_destroy(void *p)$/;" f
|
2528
|
+
spansc_explain q_span.c /^Explanation *spansc_explain(Scorer *self, int target)$/;" f
|
2529
|
+
spansc_next q_span.c /^bool spansc_next(Scorer *self)$/;" f
|
2530
|
+
spansc_score q_span.c /^float spansc_score(Scorer *self)$/;" f
|
2531
|
+
spansc_skip_to q_span.c /^bool spansc_skip_to(Scorer *self, int target)$/;" f
|
2532
|
+
spante_create q_span.c /^SpanEnum *spante_create(Query *query, IndexReader *ir)$/;" f
|
2533
|
+
spante_destroy q_span.c /^void spante_destroy(void *p)$/;" f
|
2534
|
+
spante_doc q_span.c /^int spante_doc(SpanEnum *self)$/;" f
|
2535
|
+
spante_end q_span.c /^int spante_end(SpanEnum *self)$/;" f
|
2536
|
+
spante_next q_span.c /^bool spante_next(SpanEnum *self)$/;" f
|
2537
|
+
spante_skip_to q_span.c /^bool spante_skip_to(SpanEnum *self, int target)$/;" f
|
2538
|
+
spante_start q_span.c /^int spante_start(SpanEnum *self)$/;" f
|
2539
|
+
spante_to_s q_span.c /^char *spante_to_s(SpanEnum *self) $/;" f
|
2540
|
+
spantq_create q_span.c /^Query *spantq_create(Term *term)$/;" f
|
2541
|
+
spantq_destroy q_span.c /^void spantq_destroy(void *p)$/;" f
|
2542
|
+
spantq_extract_terms q_span.c /^void spantq_extract_terms(Query *self, Array *terms)$/;" f
|
2543
|
+
spantq_get_terms q_span.c /^Array *spantq_get_terms(Query *self)$/;" f
|
2544
|
+
spantq_to_s q_span.c /^char *spantq_to_s(Query *self, char *field)$/;" f
|
2545
|
+
spanw_create q_span.c /^Weight *spanw_create(Query *query, Searcher *searcher)$/;" f
|
2546
|
+
spanw_destroy q_span.c /^void spanw_destroy(void *p)$/;" f
|
2547
|
+
spanw_explain q_span.c /^Explanation *spanw_explain(Weight *self, IndexReader *ir, int target)$/;" f
|
2548
|
+
spanw_to_s q_span.c /^char *spanw_to_s(Weight *self)$/;" f
|
2549
|
+
spanxe_create q_span.c /^SpanEnum *spanxe_create(Query *query, IndexReader *ir)$/;" f
|
2550
|
+
spanxe_destroy q_span.c /^void spanxe_destroy(void *p)$/;" f
|
2551
|
+
spanxe_doc q_span.c /^int spanxe_doc(SpanEnum *self)$/;" f
|
2552
|
+
spanxe_end q_span.c /^int spanxe_end(SpanEnum *self)$/;" f
|
2553
|
+
spanxe_next q_span.c /^bool spanxe_next(SpanEnum *self)$/;" f
|
2554
|
+
spanxe_skip_to q_span.c /^bool spanxe_skip_to(SpanEnum *self, int target)$/;" f
|
2555
|
+
spanxe_start q_span.c /^int spanxe_start(SpanEnum *self)$/;" f
|
2556
|
+
spanxe_to_s q_span.c /^char *spanxe_to_s(SpanEnum *self) $/;" f
|
2557
|
+
spanxq_create q_span.c /^Query *spanxq_create(Query *inc, Query *exc)$/;" f
|
2558
|
+
spanxq_destroy q_span.c /^void spanxq_destroy(void *p)$/;" f
|
2559
|
+
spanxq_extract_terms q_span.c /^void spanxq_extract_terms(Query *self, Array *terms)$/;" f
|
2560
|
+
spanxq_get_terms q_span.c /^Array *spanxq_get_terms(Query *self)$/;" f
|
2561
|
+
spanxq_rewrite q_span.c /^Query *spanxq_rewrite(Query *self, IndexReader *ir)$/;" f
|
2562
|
+
spanxq_to_s q_span.c /^char *spanxq_to_s(Query *self, char *field)$/;" f
|
2563
|
+
special_char q_parser.c /^const char *special_char = "&:()[]{}!+\\"~^-|<>=*?";$/;" v
|
2564
|
+
sphsc_phrase_freq q_phrase.c /^float sphsc_phrase_freq(Scorer *self)$/;" f
|
2565
|
+
sr_close index_rw.c /^void sr_close(IndexReader *ir)$/;" f
|
2566
|
+
sr_close_norms index_rw.c /^static inline void sr_close_norms(SegmentReader *sr)$/;" f file:
|
2567
|
+
sr_commit index_rw.c /^void sr_commit(IndexReader *ir)$/;" f
|
2568
|
+
sr_delete_doc index_rw.c /^void sr_delete_doc(IndexReader *ir, int doc_num) $/;" f
|
2569
|
+
sr_doc_freq index_rw.c /^int sr_doc_freq(IndexReader *ir, Term *t)$/;" f
|
2570
|
+
sr_file_names index_rw.c /^Array *sr_file_names(IndexReader *ir)$/;" f
|
2571
|
+
sr_get_doc index_rw.c /^Document *sr_get_doc(IndexReader *ir, int doc_num)$/;" f
|
2572
|
+
sr_get_field_names index_rw.c /^HashSet *sr_get_field_names(IndexReader *ir, int field_type)$/;" f
|
2573
|
+
sr_get_norms index_rw.c /^uchar *sr_get_norms(IndexReader *ir, char *field)$/;" f
|
2574
|
+
sr_get_norms_always index_rw.c /^static inline uchar *sr_get_norms_always(IndexReader *ir, char *field)$/;" f file:
|
2575
|
+
sr_get_norms_internal index_rw.c /^static inline uchar *sr_get_norms_internal(IndexReader *ir, char *field)$/;" f file:
|
2576
|
+
sr_get_norms_into index_rw.c /^void sr_get_norms_into(IndexReader *ir, char *field, uchar *buf, int offset)$/;" f
|
2577
|
+
sr_get_norms_into_internal index_rw.c /^sr_get_norms_into_internal(IndexReader *ir, char *field, uchar *buf, int offset)$/;" f file:
|
2578
|
+
sr_get_term_vector index_rw.c /^TermVector *sr_get_term_vector(IndexReader *ir, int doc_num, char *field)$/;" f
|
2579
|
+
sr_get_term_vectors index_rw.c /^Array *sr_get_term_vectors(IndexReader *ir, int doc_num)$/;" f
|
2580
|
+
sr_has_deletions index_rw.c /^bool sr_has_deletions(IndexReader *ir)$/;" f
|
2581
|
+
sr_has_norms index_rw.c /^bool sr_has_norms(IndexReader *ir, char *field)$/;" f
|
2582
|
+
sr_is_deleted index_rw.c /^bool sr_is_deleted(IndexReader *ir, int doc_num)$/;" f
|
2583
|
+
sr_is_deleted_internal index_rw.c /^static inline bool sr_is_deleted_internal(IndexReader *ir, int doc_num)$/;" f file:
|
2584
|
+
sr_max_doc index_rw.c /^int sr_max_doc(IndexReader *ir)$/;" f
|
2585
|
+
sr_num_docs index_rw.c /^int sr_num_docs(IndexReader *ir)$/;" f
|
2586
|
+
sr_open index_rw.c /^IndexReader *sr_open(SegmentInfos *sis, int si_num, int is_owner, int close_store)$/;" f
|
2587
|
+
sr_open_internal index_rw.c /^IndexReader *sr_open_internal(IndexReader *ir, SegmentInfo *si)$/;" f
|
2588
|
+
sr_open_norms index_rw.c /^void sr_open_norms(IndexReader *ir, Store *cfs_store)$/;" f
|
2589
|
+
sr_open_si index_rw.c /^IndexReader *sr_open_si(SegmentInfo *si)$/;" f
|
2590
|
+
sr_set_norm index_rw.c /^void sr_set_norm(IndexReader *ir, int doc_num, char *field, uchar val)$/;" f
|
2591
|
+
sr_term_docs index_rw.c /^TermDocEnum *sr_term_docs(IndexReader *ir)$/;" f
|
2592
|
+
sr_term_positions index_rw.c /^TermDocEnum *sr_term_positions(IndexReader *ir)$/;" f
|
2593
|
+
sr_terms index_rw.c /^TermEnum *sr_terms(IndexReader *ir)$/;" f
|
2594
|
+
sr_terms_from index_rw.c /^TermEnum *sr_terms_from(IndexReader *ir, Term *term)$/;" f
|
2595
|
+
sr_tvr index_rw.c /^static inline TermVectorsReader *sr_tvr(SegmentReader *sr)$/;" f file:
|
2596
|
+
sr_undelete_all index_rw.c /^void sr_undelete_all(IndexReader *ir)$/;" f
|
2597
|
+
srcdir Makefile /^srcdir = .$/;" m
|
2598
|
+
ss_capa search.h /^ int ss_capa;$/;" m struct:ConjunctionScorer
|
2599
|
+
ss_cnt search.h /^ int ss_cnt;$/;" m struct:ConjunctionScorer
|
2600
|
+
ss_cnt search.h /^ int ss_cnt;$/;" m struct:DisjunctionSumScorer
|
2601
|
+
standard_analyzer_create analysis.c /^Analyzer *standard_analyzer_create()$/;" f
|
2602
|
+
standard_analyzer_create_with_words analysis.c /^Analyzer *standard_analyzer_create_with_words(char **words, int len)$/;" f
|
2603
|
+
standard_tokenizer_create analysis.c /^TokenStream *standard_tokenizer_create()$/;" f
|
2604
|
+
start analysis.h /^ int start;$/;" m struct:Token
|
2605
|
+
start index.h /^ int start;$/;" m struct:TVOffsetInfo
|
2606
|
+
start r_analysis.c /^ int start;$/;" m struct:RToken file:
|
2607
|
+
start search.h /^ int (*start)(SpanEnum *self);$/;" m struct:SpanEnum
|
2608
|
+
start search.h /^ int start;$/;" m struct:SpanNearEnum
|
2609
|
+
start store.h /^ int start;$/;" m struct:Buffer
|
2610
|
+
starts index.h /^ int *starts;$/;" m struct:MultiReader
|
2611
|
+
starts index.h /^ int *starts;$/;" m struct:MultiTermDocEnum
|
2612
|
+
std_get_alnum analysis.c /^int std_get_alnum(char *input, char *token)$/;" f
|
2613
|
+
std_get_alpha analysis.c /^int std_get_alpha(char *input, char *token)$/;" f
|
2614
|
+
std_get_apostrophe analysis.c /^int std_get_apostrophe(char *input)$/;" f
|
2615
|
+
std_get_company_name analysis.c /^int std_get_company_name(char *input)$/;" f
|
2616
|
+
std_get_number analysis.c /^int std_get_number(char *input)$/;" f
|
2617
|
+
std_get_url analysis.c /^int std_get_url(char *input, char *token)$/;" f
|
2618
|
+
std_next analysis.c /^Token *std_next(TokenStream *ts)$/;" f
|
2619
|
+
stde_close termdocs.c /^void stde_close(TermDocEnum *tde)$/;" f
|
2620
|
+
stde_create termdocs.c /^TermDocEnum *stde_create(IndexReader *ir)$/;" f
|
2621
|
+
stde_doc_num termdocs.c /^int stde_doc_num(TermDocEnum *tde)$/;" f
|
2622
|
+
stde_freq termdocs.c /^int stde_freq(TermDocEnum *tde)$/;" f
|
2623
|
+
stde_next termdocs.c /^bool stde_next(TermDocEnum *tde)$/;" f
|
2624
|
+
stde_read termdocs.c /^int stde_read(TermDocEnum *tde, int *docs, int *freqs, int req_num)$/;" f
|
2625
|
+
stde_seek termdocs.c /^void stde_seek(TermDocEnum *tde, Term *term)$/;" f
|
2626
|
+
stde_seek_prox termdocs.c /^void stde_seek_prox(SegmentTermDocEnum *stde, int prox_pointer) { }$/;" f
|
2627
|
+
stde_seek_ti termdocs.c /^void stde_seek_ti(TermDocEnum *tde, TermInfo *ti)$/;" f
|
2628
|
+
stde_skip_prox termdocs.c /^void stde_skip_prox(SegmentTermDocEnum *stde) { }$/;" f
|
2629
|
+
stde_skip_to termdocs.c /^bool stde_skip_to(TermDocEnum *tde, int target_doc_num)$/;" f
|
2630
|
+
ste_allocate term.c /^TermEnum *ste_allocate()$/;" f
|
2631
|
+
ste_clone term.c /^TermEnum *ste_clone(TermEnum *other_te)$/;" f
|
2632
|
+
ste_close term.c /^void ste_close(TermEnum *te)$/;" f
|
2633
|
+
ste_create term.c /^TermEnum *ste_create(InStream *is, FieldInfos *fis, int is_index)$/;" f
|
2634
|
+
ste_next term.c /^TermBuffer *ste_next(TermEnum *te)$/;" f
|
2635
|
+
ste_scan_for_term term.c /^Term *ste_scan_for_term(TermEnum *te, int pos)$/;" f
|
2636
|
+
ste_scan_for_term_info term.c /^TermInfo *ste_scan_for_term_info(TermEnum *te, Term *t)$/;" f
|
2637
|
+
ste_seek term.c /^void ste_seek(TermEnum *te, int pointer, int pos, Term *t, TermInfo *ti)$/;" f
|
2638
|
+
stop_filter_create analysis.c /^TokenStream *stop_filter_create(TokenStream *ts)$/;" f
|
2639
|
+
stop_filter_create_with_words analysis.c /^TokenStream *stop_filter_create_with_words(TokenStream *ts, char **words, int len)$/;" f
|
2640
|
+
store index.h /^ Store *store;$/;" m struct:CompoundWriter
|
2641
|
+
store index.h /^ Store *store;$/;" m struct:DocumentWriter
|
2642
|
+
store index.h /^ Store *store;$/;" m struct:IndexReader
|
2643
|
+
store index.h /^ Store *store;$/;" m struct:IndexWriter
|
2644
|
+
store index.h /^ Store *store;$/;" m struct:SegmentInfo
|
2645
|
+
store index.h /^ Store *store;$/;" m struct:SegmentInfos
|
2646
|
+
store index.h /^ Store *store;$/;" m struct:SegmentMerger
|
2647
|
+
store search.h /^ Store *store;$/;" m struct:Index
|
2648
|
+
store store.h /^ Store *store;$/;" m struct:CompoundStore
|
2649
|
+
store store.h /^ Store *store;$/;" m struct:Lock
|
2650
|
+
store_close store.h 98;" d
|
2651
|
+
store_create store.c /^Store *store_create()$/;" f
|
2652
|
+
store_destroy store.c /^void store_destroy(Store *store)$/;" f
|
2653
|
+
store_offset document.h /^ bool store_offset : 1;$/;" m struct:DocField
|
2654
|
+
store_offset index.h /^ bool store_offset : 1;$/;" m struct:FieldInfo
|
2655
|
+
store_offsets index.h /^ unsigned int store_offsets : 1;$/;" m struct:TVField
|
2656
|
+
store_pos document.h /^ bool store_pos : 1;$/;" m struct:DocField
|
2657
|
+
store_pos index.h /^ bool store_pos : 1;$/;" m struct:FieldInfo
|
2658
|
+
store_positions index.h /^ unsigned int store_positions : 1;$/;" m struct:TVField
|
2659
|
+
store_tv document.h /^ bool store_tv : 1;$/;" m struct:DocField
|
2660
|
+
store_tv index.h /^ bool store_tv : 1;$/;" m struct:FieldInfo
|
2661
|
+
stores fs_store.c /^static HshTable stores = {$/;" v file:
|
2662
|
+
stores_mutex fs_store.c /^static mutex_t stores_mutex = MUTEX_INITIALIZER;$/;" v file:
|
2663
|
+
stpe_close termdocs.c /^void stpe_close(TermDocEnum *tde)$/;" f
|
2664
|
+
stpe_create termdocs.c /^TermDocEnum *stpe_create(IndexReader *ir)$/;" f
|
2665
|
+
stpe_next termdocs.c /^bool stpe_next(TermDocEnum *tde)$/;" f
|
2666
|
+
stpe_next_position termdocs.c /^int stpe_next_position(TermDocEnum *tde)$/;" f
|
2667
|
+
stpe_read termdocs.c /^int stpe_read(TermDocEnum *tde, int *docs, int *freqs, int req_num)$/;" f
|
2668
|
+
stpe_seek termdocs.c /^void stpe_seek(TermDocEnum *tde, Term *term)$/;" f
|
2669
|
+
stpe_seek_prox termdocs.c /^void stpe_seek_prox(SegmentTermDocEnum *stde, int prox_pointer)$/;" f
|
2670
|
+
stpe_skip_prox termdocs.c /^void stpe_skip_prox(SegmentTermDocEnum *stde)$/;" f
|
2671
|
+
str q_parser.c /^ char *str;$/;" m union:YYSTYPE file:
|
2672
|
+
str_hash hash.c /^inline unsigned int str_hash(const char *const str)$/;" f
|
2673
|
+
str_insert q_parser.c /^void str_insert(char *str, int len, char chr)$/;" f
|
2674
|
+
stream store.h /^ InStream *stream;$/;" m struct:CompoundStore
|
2675
|
+
strfmt global.c /^char *strfmt(const char *fmt, ...)$/;" f
|
2676
|
+
sub store.h /^ InStream *sub;$/;" m struct:CompoundInStream
|
2677
|
+
sub_readers index.h /^ IndexReader **sub_readers;$/;" m struct:MultiReader
|
2678
|
+
sub_scorer q_filtered_query.c /^ Scorer *sub_scorer;$/;" m struct:FilteredQueryScorer file:
|
2679
|
+
sub_scorers search.h /^ Scorer **sub_scorers;$/;" m struct:ConjunctionScorer
|
2680
|
+
sub_scorers search.h /^ Scorer **sub_scorers;$/;" m struct:DisjunctionSumScorer
|
2681
|
+
sub_ts analysis.h /^ TokenStream *sub_ts; \/\/ used by filters$/;" m struct:TokenStream
|
2682
|
+
sum_of_squared_weights search.h /^ float (*sum_of_squared_weights)(Weight *self);$/;" m struct:Weight
|
2683
|
+
sysconfdir Makefile /^sysconfdir = $(DESTDIR)\/etc$/;" m
|
2684
|
+
t_capa search.h /^ int t_capa;$/;" m struct:MultiPhraseQuery
|
2685
|
+
t_capa search.h /^ int t_capa;$/;" m struct:PhraseQuery
|
2686
|
+
t_cnt search.h /^ int t_cnt;$/;" m struct:MultiPhraseQuery
|
2687
|
+
t_cnt search.h /^ int t_cnt;$/;" m struct:PhraseQuery
|
2688
|
+
table hash.h /^ HshEntry *table;$/;" m struct:HshTable
|
2689
|
+
target_prefix Makefile /^target_prefix = $/;" m
|
2690
|
+
tb index.h /^ TermBuffer *tb;$/;" m struct:SegmentMergeInfo
|
2691
|
+
tb_cmp term.c /^int tb_cmp(TermBuffer *tb1, TermBuffer *tb2)$/;" f
|
2692
|
+
tb_cpy term.c /^TermBuffer *tb_cpy(TermBuffer *tb1, TermBuffer *tb2)$/;" f
|
2693
|
+
tb_create term.c /^TermBuffer *tb_create()$/;" f
|
2694
|
+
tb_curr index.h /^ TermBuffer *tb_curr;$/;" m struct:TermEnum
|
2695
|
+
tb_destroy term.c /^void tb_destroy(void *p)$/;" f
|
2696
|
+
tb_get_term term.c /^Term *tb_get_term(TermBuffer *tb)$/;" f
|
2697
|
+
tb_prev index.h /^ TermBuffer *tb_prev;$/;" m struct:TermEnum
|
2698
|
+
tb_read term.c /^TermBuffer *tb_read(TermBuffer *tb, InStream *is, FieldInfos *fis)$/;" f
|
2699
|
+
tb_reset term.c /^void tb_reset(TermBuffer *tb)$/;" f
|
2700
|
+
tb_set_term term.c /^TermBuffer *tb_set_term(TermBuffer *tb, Term *t)$/;" f
|
2701
|
+
tb_term_cmp term.c /^int tb_term_cmp(TermBuffer *tb, Term *t)$/;" f
|
2702
|
+
tcnt index.h /^ int tcnt;$/;" m struct:TermVector
|
2703
|
+
tcnt index.h /^ int tcnt;$/;" m struct:TermVectorsWriter
|
2704
|
+
td_create search.c /^TopDocs *td_create(int total_hits, int size, Hit **hits)$/;" f
|
2705
|
+
td_destroy search.c /^void td_destroy(void *p)$/;" f
|
2706
|
+
td_to_s search.c /^char *td_to_s(TopDocs *td)$/;" f
|
2707
|
+
tde search.h /^ TermDocEnum *tde;$/;" m struct:TermScorer
|
2708
|
+
tde_destroy termdocs.c /^void tde_destroy(void *p) {$/;" f
|
2709
|
+
tdpe_less_than termdocs.c /^bool tdpe_less_than(void *p1, void *p2)$/;" f
|
2710
|
+
te index.h /^ TermEnum *te;$/;" m struct:SegmentMergeInfo
|
2711
|
+
te_bucket index.h /^ Array *te_bucket;$/;" m struct:TermInfosReader
|
2712
|
+
te_create term.c /^TermEnum *te_create()$/;" f
|
2713
|
+
te_destroy term.c /^void te_destroy(void *p)$/;" f
|
2714
|
+
te_get_term term.c /^Term *te_get_term(TermEnum *te)$/;" f
|
2715
|
+
te_get_ti term.c /^TermInfo *te_get_ti(TermEnum *te)$/;" f
|
2716
|
+
te_skip_to term.c /^TermBuffer *te_skip_to(TermEnum *te, Term *t)$/;" f
|
2717
|
+
term index.h /^ Term *term;$/;" m struct:MultiTermDocEnum
|
2718
|
+
term index.h /^ Term *term;$/;" m struct:Posting
|
2719
|
+
term q_fuzzy.c /^ Term *term;$/;" m struct:ScoredTerm file:
|
2720
|
+
term search.h /^ Term *term;$/;" m struct:FuzzyQuery
|
2721
|
+
term search.h /^ Term *term;$/;" m struct:TermQuery
|
2722
|
+
term_clone term.c /^Term *term_clone(Term *term)$/;" f
|
2723
|
+
term_cmp term.c /^int term_cmp(void *t1, void *t2)$/;" f
|
2724
|
+
term_create term.c /^Term *term_create(const char *field, char *text)$/;" f
|
2725
|
+
term_destroy term.c /^void term_destroy(void *p)$/;" f
|
2726
|
+
term_docs index.h /^ TermDocEnum *(*term_docs)(IndexReader *ir);$/;" m struct:IndexReader
|
2727
|
+
term_docs_from_reader index.h /^ TermDocEnum *(*term_docs_from_reader)(IndexReader *ir);$/;" m struct:MultiTermDocEnum
|
2728
|
+
term_eq term.c /^int term_eq(const void *t1, const void *t2)$/;" f
|
2729
|
+
term_hash term.c /^unsigned int term_hash(const void *t)$/;" f
|
2730
|
+
term_index_interval index.h /^ int term_index_interval;$/;" m struct:Config
|
2731
|
+
term_index_interval index.h /^ int term_index_interval;$/;" m struct:DocumentWriter
|
2732
|
+
term_index_interval index.h /^ int term_index_interval;$/;" m struct:IndexWriter
|
2733
|
+
term_index_interval index.h /^ int term_index_interval;$/;" m struct:SegmentMerger
|
2734
|
+
term_positions index.h /^ TermDocEnum *(*term_positions)(IndexReader *ir);$/;" m struct:IndexReader
|
2735
|
+
term_to_s term.c /^char *term_to_s(Term *term)$/;" f
|
2736
|
+
terms index.h /^ TVTerm **terms;$/;" m struct:TermVectorsWriter
|
2737
|
+
terms index.h /^ TermEnum *(*terms)(IndexReader *ir);$/;" m struct:IndexReader
|
2738
|
+
terms index.h /^ char **terms;$/;" m struct:TermVector
|
2739
|
+
terms search.h /^ Term ***terms;$/;" m struct:MultiPhraseQuery
|
2740
|
+
terms search.h /^ Term **terms;$/;" m struct:PhraseQuery
|
2741
|
+
terms_buf index.h /^ Term *terms_buf;$/;" m struct:SegmentMerger
|
2742
|
+
terms_buf_pointer index.h /^ int terms_buf_pointer;$/;" m struct:SegmentMerger
|
2743
|
+
terms_buf_size index.h /^ int terms_buf_size;$/;" m struct:SegmentMerger
|
2744
|
+
terms_from index.h /^ TermEnum *(*terms_from)(IndexReader *ir, Term *term);$/;" m struct:IndexReader
|
2745
|
+
text analysis.h /^ char *text;$/;" m struct:TokenStream
|
2746
|
+
text analysis.h /^ char text[MAX_WORD_SIZE];$/;" m struct:Token
|
2747
|
+
text index.h /^ char *text;$/;" m struct:TVTerm
|
2748
|
+
text index.h /^ char *text;$/;" m struct:Term
|
2749
|
+
text index.h /^ char text[MAX_WORD_SIZE];$/;" m struct:TermBuffer
|
2750
|
+
text r_analysis.c /^ VALUE text;$/;" m struct:RToken file:
|
2751
|
+
text r_store.c /^ VALUE text;$/;" m struct:RTerm file:
|
2752
|
+
text r_term.c /^ VALUE text;$/;" m struct:RTerm file:
|
2753
|
+
text search.h /^ char *text; \/* term text after prefix *\/$/;" m struct:FuzzyQuery
|
2754
|
+
text_len search.h /^ int text_len;$/;" m struct:FuzzyQuery
|
2755
|
+
tf search.h /^ float (*tf)(Similarity *self, float freq);$/;" m struct:Similarity
|
2756
|
+
thread_exit inc/lang.h 39;" d
|
2757
|
+
thread_exit lang.h 39;" d
|
2758
|
+
thread_getspecific inc/lang.h 38;" d
|
2759
|
+
thread_getspecific lang.h 38;" d
|
2760
|
+
thread_key_create inc/lang.h 35;" d
|
2761
|
+
thread_key_create lang.h 35;" d
|
2762
|
+
thread_key_delete inc/lang.h 36;" d
|
2763
|
+
thread_key_delete lang.h 36;" d
|
2764
|
+
thread_key_t inc/lang.h /^typedef void * thread_key_t;$/;" t
|
2765
|
+
thread_key_t lang.h /^typedef void * thread_key_t;$/;" t
|
2766
|
+
thread_setspecific inc/lang.h 37;" d
|
2767
|
+
thread_setspecific lang.h 37;" d
|
2768
|
+
thread_te index.h /^ thread_key_t thread_te;$/;" m struct:TermInfosReader
|
2769
|
+
thread_tvr index.h /^ thread_key_t thread_tvr;$/;" m struct:SegmentReader
|
2770
|
+
ti index.h /^ TermInfo *ti;$/;" m struct:SegmentMerger
|
2771
|
+
ti_clone term.c /^TermInfo *ti_clone(TermInfo *other)$/;" f
|
2772
|
+
ti_cpy term.c /^TermInfo *ti_cpy(TermInfo *ti, TermInfo *other)$/;" f
|
2773
|
+
ti_create term.c /^TermInfo *ti_create(int doc_freq, int freq_pointer, int prox_pointer, int skip_offset)$/;" f
|
2774
|
+
ti_curr index.h /^ TermInfo *ti_curr;$/;" m struct:TermEnum
|
2775
|
+
ti_destroy term.c /^void ti_destroy(void *p)$/;" f
|
2776
|
+
ti_eq term.c /^int ti_eq(TermInfo *ti, TermInfo *other)$/;" f
|
2777
|
+
ti_set term.c /^TermInfo *ti_set(TermInfo *ti, int doc_freq, int freq_pointer, int prox_pointer, int skip_offset)$/;" f
|
2778
|
+
tir index.h /^ TermInfosReader *tir;$/;" m struct:SegmentReader
|
2779
|
+
tir_close term.c /^void tir_close(TermInfosReader *tir)$/;" f
|
2780
|
+
tir_ensure_index_is_read term.c /^void tir_ensure_index_is_read(TermInfosReader *tir)$/;" f
|
2781
|
+
tir_enum term.c /^static inline TermEnum *tir_enum(TermInfosReader *tir)$/;" f file:
|
2782
|
+
tir_get_index_offset term.c /^int tir_get_index_offset(TermInfosReader *tir, Term *t)$/;" f
|
2783
|
+
tir_get_term term.c /^Term *tir_get_term(TermInfosReader *tir, int pos)$/;" f
|
2784
|
+
tir_get_term_pos term.c /^int tir_get_term_pos(TermInfosReader *tir, Term *t)$/;" f
|
2785
|
+
tir_get_ti term.c /^TermInfo *tir_get_ti(TermInfosReader *tir, Term *t)$/;" f
|
2786
|
+
tir_open term.c /^TermInfosReader *tir_open(Store *store, char *segment, FieldInfos *fis)$/;" f
|
2787
|
+
tir_seek_enum term.c /^void tir_seek_enum(TermInfosReader *tir, int ind_offset)$/;" f
|
2788
|
+
tiw index.h /^ TermInfosWriter *tiw;$/;" m struct:SegmentMerger
|
2789
|
+
tiw_add term.c /^void tiw_add(TermInfosWriter *tiw, Term *t, TermInfo *ti)$/;" f
|
2790
|
+
tiw_close term.c /^void tiw_close(TermInfosWriter *tiw)$/;" f
|
2791
|
+
tiw_open term.c /^TermInfosWriter *tiw_open(Store *store, char *segment, FieldInfos *fis, int interval)$/;" f
|
2792
|
+
tiw_open_internal term.c /^TermInfosWriter *tiw_open_internal(Store *store,$/;" f
|
2793
|
+
tiw_write_term term.c /^void tiw_write_term(TermInfosWriter *tiw, OutStream *os, Term *t)$/;" f
|
2794
|
+
tk_cmp analysis.c /^int tk_cmp(Token *tk1, Token *tk2)$/;" f
|
2795
|
+
tk_create analysis.c /^Token *tk_create()$/;" f
|
2796
|
+
tk_destroy analysis.c /^void tk_destroy(void *p)$/;" f
|
2797
|
+
tk_eq analysis.c /^int tk_eq(Token *tk1, Token *tk2)$/;" f
|
2798
|
+
tk_set analysis.c /^inline Token *tk_set(Token *tk, char *text, int tlen, int start, int end, int pos_inc)$/;" f
|
2799
|
+
tk_set_no_len analysis.c /^inline Token *tk_set_no_len(Token *tk, char *text, int start, int end, int pos_inc)$/;" f
|
2800
|
+
to_s search.h /^ char *(*to_s)(Weight *self);$/;" m struct:Weight
|
2801
|
+
to_s search.h /^ char *(*to_s)(Query *self, char *field);$/;" m struct:Query
|
2802
|
+
to_s search.h /^ char *(*to_s)(struct Filter *self);$/;" m struct:Filter
|
2803
|
+
to_s search.h /^ char *(*to_s)(SpanEnum *self);$/;" m struct:SpanEnum
|
2804
|
+
to_store ram_store.c /^ Store *to_store, *from_store;$/;" m struct:CopyFileArg file:
|
2805
|
+
token analysis.h /^ Token *token;$/;" m struct:TokenStream
|
2806
|
+
topdir Makefile /^topdir = \/usr\/lib\/ruby\/1.8\/i486-linux$/;" m
|
2807
|
+
total_hits search.h /^ int total_hits;$/;" m struct:TopDocs
|
2808
|
+
touch store.h /^ void (*touch)(Store *store, char *filename);$/;" m struct:Store
|
2809
|
+
tpe search.h /^ TermDocEnum *tpe;$/;" m struct:PhrasePosition
|
2810
|
+
tq_create q_term.c /^Query *tq_create(Term *term)$/;" f
|
2811
|
+
tq_destroy q_term.c /^void tq_destroy(void *p)$/;" f
|
2812
|
+
tq_extract_terms q_term.c /^void tq_extract_terms(Query *self, Array *terms)$/;" f
|
2813
|
+
tq_to_s q_term.c /^char *tq_to_s(Query *self, char *field)$/;" f
|
2814
|
+
true global.h 14;" d
|
2815
|
+
ts_create analysis.c /^TokenStream *ts_create()$/;" f
|
2816
|
+
ts_destroy analysis.h 46;" d
|
2817
|
+
ts_next analysis.h 45;" d
|
2818
|
+
ts_reset analysis.c /^void ts_reset(TokenStream *ts, char *text)$/;" f
|
2819
|
+
ts_standard_destroy analysis.c /^void ts_standard_destroy(void *p)$/;" f
|
2820
|
+
tsc_create q_term.c /^Scorer *tsc_create(Weight *weight, TermDocEnum *tde, uchar *norms)$/;" f
|
2821
|
+
tsc_destroy q_term.c /^void tsc_destroy(void *p)$/;" f
|
2822
|
+
tsc_explain q_term.c /^Explanation *tsc_explain(Scorer *self, int doc_num)$/;" f
|
2823
|
+
tsc_next q_term.c /^bool tsc_next(Scorer *self)$/;" f
|
2824
|
+
tsc_score q_term.c /^float tsc_score(Scorer *self)$/;" f
|
2825
|
+
tsc_skip_to q_term.c /^bool tsc_skip_to(Scorer *self, int doc_num)$/;" f
|
2826
|
+
tsize index.h /^ int tsize;$/;" m struct:TermVectorsWriter
|
2827
|
+
tv_create vector.c /^TermVector *tv_create($/;" f
|
2828
|
+
tv_destroy vector.c /^void tv_destroy(void *p)$/;" f
|
2829
|
+
tv_destroy_except_data vector.c /^void tv_destroy_except_data(void *p)$/;" f
|
2830
|
+
tvd index.h /^ InStream *tvd;$/;" m struct:TermVectorsReader
|
2831
|
+
tvd index.h /^ OutStream *tvd;$/;" m struct:TermVectorsWriter
|
2832
|
+
tvd_format index.h /^ int tvd_format;$/;" m struct:TermVectorsReader
|
2833
|
+
tvf index.h /^ InStream *tvf;$/;" m struct:TermVectorsReader
|
2834
|
+
tvf index.h /^ OutStream *tvf;$/;" m struct:TermVectorsWriter
|
2835
|
+
tvf_create vector.c /^TVField *tvf_create(int number, int store_positions, int store_offsets)$/;" f
|
2836
|
+
tvf_destroy vector.c /^void tvf_destroy(void *p)$/;" f
|
2837
|
+
tvf_format index.h /^ int tvf_format;$/;" m struct:TermVectorsReader
|
2838
|
+
tvf_pointer index.h /^ int tvf_pointer;$/;" m struct:TVField
|
2839
|
+
tvoi_create vector.c /^TVOffsetInfo *tvoi_create(int start, int end)$/;" f
|
2840
|
+
tvoi_destroy vector.c /^void tvoi_destroy(void *p)$/;" f
|
2841
|
+
tvr_bucket index.h /^ Array *tvr_bucket;$/;" m struct:SegmentReader
|
2842
|
+
tvr_check_valid_format vector.c /^int tvr_check_valid_format(InStream *is)$/;" f
|
2843
|
+
tvr_clone vector.c /^TermVectorsReader *tvr_clone(TermVectorsReader *orig)$/;" f
|
2844
|
+
tvr_close vector.c /^void tvr_close(TermVectorsReader *tvr)$/;" f
|
2845
|
+
tvr_get_field_tv vector.c /^TermVector *tvr_get_field_tv(TermVectorsReader *tvr, int doc_num, char *field)$/;" f
|
2846
|
+
tvr_get_tv vector.c /^Array *tvr_get_tv(TermVectorsReader *tvr, int doc_num)$/;" f
|
2847
|
+
tvr_open vector.c /^TermVectorsReader *tvr_open(Store *store, char *segment, FieldInfos *fis)$/;" f
|
2848
|
+
tvr_read_term_vector vector.c /^TermVector *tvr_read_term_vector(TermVectorsReader *tvr,$/;" f
|
2849
|
+
tvt_create vector.c /^TVTerm *tvt_create(char *text, int freq, int *positions, TVOffsetInfo **offsets)$/;" f
|
2850
|
+
tvt_destroy vector.c /^void tvt_destroy(void *p)$/;" f
|
2851
|
+
tvw_add_all_doc_vectors vector.c /^void tvw_add_all_doc_vectors(TermVectorsWriter *tvw, Array *vectors)$/;" f
|
2852
|
+
tvw_add_term vector.c /^void tvw_add_term(TermVectorsWriter *tvw,$/;" f
|
2853
|
+
tvw_close vector.c /^void tvw_close(TermVectorsWriter *tvw)$/;" f
|
2854
|
+
tvw_close_doc vector.c /^void tvw_close_doc(TermVectorsWriter *tvw)$/;" f
|
2855
|
+
tvw_close_field vector.c /^void tvw_close_field(TermVectorsWriter *tvw)$/;" f
|
2856
|
+
tvw_create_field vector.c /^void tvw_create_field(TermVectorsWriter *tvw,$/;" f
|
2857
|
+
tvw_open vector.c /^TermVectorsWriter *tvw_open(Store *store, char *segment, FieldInfos *fis)$/;" f
|
2858
|
+
tvw_open_doc vector.c /^void tvw_open_doc(TermVectorsWriter *tvw)$/;" f
|
2859
|
+
tvw_open_field vector.c /^void tvw_open_field(TermVectorsWriter *tvw, char *field)$/;" f
|
2860
|
+
tvw_write_doc vector.c /^void tvw_write_doc(TermVectorsWriter *tvw)$/;" f
|
2861
|
+
tvw_write_field vector.c /^void tvw_write_field(TermVectorsWriter *tvw)$/;" f
|
2862
|
+
tvx index.h /^ InStream *tvx;$/;" m struct:TermVectorsReader
|
2863
|
+
tvx index.h /^ OutStream *tvx;$/;" m struct:TermVectorsWriter
|
2864
|
+
tw_create q_term.c /^Weight *tw_create(Query *query, Searcher *searcher)$/;" f
|
2865
|
+
tw_destroy q_term.c /^void tw_destroy(void *p)$/;" f
|
2866
|
+
tw_explain q_term.c /^Explanation *tw_explain(Weight *self, IndexReader *ir, int doc_num)$/;" f
|
2867
|
+
tw_scorer q_term.c /^Scorer *tw_scorer(Weight *self, IndexReader *ir)$/;" f
|
2868
|
+
tw_to_s q_term.c /^char *tw_to_s(Weight *self)$/;" f
|
2869
|
+
type search.h /^ int type;$/;" m struct:SortField
|
2870
|
+
type search.h /^ uchar type;$/;" m struct:Query
|
2871
|
+
uchar global.h /^typedef unsigned char uchar;$/;" t
|
2872
|
+
uint global.h /^typedef unsigned int uint;$/;" t
|
2873
|
+
undelete_all index.h /^ bool undelete_all : 1;$/;" m struct:SegmentReader
|
2874
|
+
upper_term search.h /^ char *upper_term;$/;" m struct:Range
|
2875
|
+
use_compound_file index.h /^ bool use_compound_file : 1;$/;" m struct:IndexWriter
|
2876
|
+
use_compound_file search.h /^ bool use_compound_file : 1;$/;" m struct:Index
|
2877
|
+
used hash.h /^ int used; \/* # Active *\/$/;" m struct:HshTable
|
2878
|
+
v_cnt sort.c /^ int v_cnt;$/;" m struct:StringIndex file:
|
2879
|
+
v_size sort.c /^ int v_size;$/;" m struct:StringIndex file:
|
2880
|
+
value hash.h /^ void *value;$/;" m
|
2881
|
+
value hash.h /^ void *value;$/;" m struct:HashEntry
|
2882
|
+
value search.h /^ float value;$/;" m struct:Explanation
|
2883
|
+
value search.h /^ float value;$/;" m struct:PhraseScorer
|
2884
|
+
value search.h /^ float value;$/;" m struct:SpanScorer
|
2885
|
+
value search.h /^ float value;$/;" m struct:Weight
|
2886
|
+
values sort.c /^ char **values;$/;" m struct:StringIndex file:
|
2887
|
+
version index.h /^ unsigned int version;$/;" m struct:SegmentInfos
|
2888
|
+
w_capa q_parser.c /^ int *w_capa;$/;" m struct:Phrase file:
|
2889
|
+
w_cnt q_parser.c /^ int *w_cnt;$/;" m struct:Phrase file:
|
2890
|
+
w_cnt search.h /^ int w_cnt;$/;" m struct:BooleanWeight
|
2891
|
+
w_get_query search.c /^Query *w_get_query(Weight *self)$/;" f
|
2892
|
+
w_get_value search.c /^float w_get_value(Weight *self)$/;" f
|
2893
|
+
w_normalize search.c /^void w_normalize(Weight *self, float normalization_factor)$/;" f
|
2894
|
+
w_sum_of_squared_weights search.c /^float w_sum_of_squared_weights(Weight *self)$/;" f
|
2895
|
+
wc_match q_wildcard.c /^bool wc_match(char *pattern, char *text)$/;" f
|
2896
|
+
wcq_create q_wildcard.c /^Query *wcq_create(Term *term)$/;" f
|
2897
|
+
wcq_destroy q_wildcard.c /^void wcq_destroy(void *p)$/;" f
|
2898
|
+
wcq_rewrite q_wildcard.c /^Query *wcq_rewrite(Query *self, IndexReader *ir)$/;" f
|
2899
|
+
wcq_to_s q_wildcard.c /^char *wcq_to_s(Query *self, char *field) $/;" f
|
2900
|
+
weight search.h /^ Weight *weight;$/;" m struct:PhraseScorer
|
2901
|
+
weight search.h /^ Weight *weight;$/;" m struct:Query
|
2902
|
+
weight search.h /^ Weight *weight;$/;" m struct:SpanScorer
|
2903
|
+
weight search.h /^ Weight *weight;$/;" m struct:TermScorer
|
2904
|
+
weight_value search.h /^ float weight_value;$/;" m struct:TermScorer
|
2905
|
+
weights search.h /^ Weight **weights;$/;" m struct:BooleanWeight
|
2906
|
+
weprintf global.c /^void weprintf(const char *fmt, ...)$/;" f
|
2907
|
+
wfe_create compound_io.c /^WFileEntry *wfe_create(char *name)$/;" f
|
2908
|
+
wfe_destroy compound_io.c /^void wfe_destroy(void *p)$/;" f
|
2909
|
+
whitespace_analyzer_create analysis.c /^Analyzer *whitespace_analyzer_create()$/;" f
|
2910
|
+
whitespace_tokenizer_create analysis.c /^TokenStream *whitespace_tokenizer_create()$/;" f
|
2911
|
+
wild_lower search.h /^ bool wild_lower : 1;$/;" m struct:QParser
|
2912
|
+
with_lock store.c /^void with_lock(Lock *lock, void (*func)(void *arg), void *arg)$/;" f
|
2913
|
+
with_lock_name store.c /^void with_lock_name(Store *store, char *lock_name,$/;" f
|
2914
|
+
words q_parser.c /^ char ***words;$/;" m struct:Phrase file:
|
2915
|
+
write_byte index_io.c 53;" d file:
|
2916
|
+
write_lock index.h /^ Lock *write_lock;$/;" m struct:IndexReader
|
2917
|
+
write_lock index.h /^ Lock *write_lock;$/;" m struct:IndexWriter
|
2918
|
+
wst_next analysis.c /^Token *wst_next(TokenStream *ts)$/;" f
|
2919
|
+
yy_reduce_print q_parser.c /^yy_reduce_print (yyrule)$/;" f file:
|
2920
|
+
yy_stack_print q_parser.c /^yy_stack_print (bottom, top)$/;" f file:
|
2921
|
+
yyalloc q_parser.c /^union yyalloc$/;" u file:
|
2922
|
+
yycheck q_parser.c /^static const unsigned char yycheck[] =$/;" v file:
|
2923
|
+
yyclearin q_parser.c 531;" d file:
|
2924
|
+
yydebug q_parser.c /^int yydebug;$/;" v
|
2925
|
+
yydefact q_parser.c /^static const unsigned char yydefact[] =$/;" v file:
|
2926
|
+
yydefgoto q_parser.c /^static const yysigned_char yydefgoto[] =$/;" v file:
|
2927
|
+
yydestruct q_parser.c /^yydestruct (yymsg, yytype, yyvaluep)$/;" f file:
|
2928
|
+
yyerrok q_parser.c 530;" d file:
|
2929
|
+
yyerror q_parser.c /^int yyerror(QParser *qp, char const *msg)$/;" f
|
2930
|
+
yylex q_parser.c /^int yylex(YYSTYPE *lvalp, QParser *qp)$/;" f
|
2931
|
+
yypact q_parser.c /^static const yysigned_char yypact[] =$/;" v file:
|
2932
|
+
yypgoto q_parser.c /^static const yysigned_char yypgoto[] =$/;" v file:
|
2933
|
+
yyprhs q_parser.c /^static const unsigned char yyprhs[] =$/;" v file:
|
2934
|
+
yyr1 q_parser.c /^static const unsigned char yyr1[] =$/;" v file:
|
2935
|
+
yyr2 q_parser.c /^static const unsigned char yyr2[] =$/;" v file:
|
2936
|
+
yyrhs q_parser.c /^static const yysigned_char yyrhs[] =$/;" v file:
|
2937
|
+
yyrline q_parser.c /^static const unsigned char yyrline[] =$/;" v file:
|
2938
|
+
yysigned_char q_parser.c /^ typedef short int yysigned_char;$/;" t file:
|
2939
|
+
yysigned_char q_parser.c /^ typedef signed char yysigned_char;$/;" t file:
|
2940
|
+
yyss q_parser.c /^ short int yyss;$/;" m union:yyalloc file:
|
2941
|
+
yystos q_parser.c /^static const unsigned char yystos[] =$/;" v file:
|
2942
|
+
yystpcpy q_parser.c /^yystpcpy (char *yydest, const char *yysrc)$/;" f file:
|
2943
|
+
yystpcpy q_parser.c 758;" d file:
|
2944
|
+
yystrlen q_parser.c /^yystrlen (const char *yystr)$/;" f file:
|
2945
|
+
yystrlen q_parser.c 735;" d file:
|
2946
|
+
yystype q_parser.c 119;" d file:
|
2947
|
+
yysymprint q_parser.c /^yysymprint (yyoutput, yytype, yyvaluep)$/;" f file:
|
2948
|
+
yytable q_parser.c /^static const yysigned_char yytable[] =$/;" v file:
|
2949
|
+
yytname q_parser.c /^static const char *const yytname[] =$/;" v file:
|
2950
|
+
yytokentype q_parser.c /^ enum yytokentype {$/;" g file:
|
2951
|
+
yytoknum q_parser.c /^static const unsigned short int yytoknum[] =$/;" v file:
|
2952
|
+
yytranslate q_parser.c /^static const unsigned char yytranslate[] =$/;" v file:
|
2953
|
+
yyvs q_parser.c /^ YYSTYPE yyvs;$/;" m union:yyalloc file:
|