Searched defs:words (Results 1 - 12 of 12) sorted by relevance

/lucene-3.6.0/solr/core/src/java/org/apache/solr/analysis/
H A DKeepWordFilter.java30 * required words. This filter behaves like the inverse of StopFilter.
36 private final CharArraySet words; field in class:KeepWordFilter
41 public KeepWordFilter(TokenStream in, Set<String> words, boolean ignoreCase ) { argument
42 this(false, in, new CharArraySet(words, ignoreCase));
45 /** The words set passed to this constructor will be directly used by this filter
47 public KeepWordFilter(boolean enablePositionIncrements, TokenStream in, CharArraySet words) { argument
49 this.words = words;
54 return words.contains(termAtt.buffer(), 0, termAtt.length());
H A DKeepWordFilterFactory.java37 * &lt;filter class="solr.KeepWordFilterFactory" words="keepwords.txt" ignoreCase="false" enablePositionIncrements="false"/&gt;
51 String wordFiles = args.get("words");
57 words = getWordSet(loader, wordFiles, ignoreCase);
64 private CharArraySet words; field in class:KeepWordFilterFactory
70 * NOTE: if ignoreCase==true, the words are expected to be lowercase
72 public void setWords(Set<String> words) { argument
73 this.words = new CharArraySet(luceneMatchVersion, words, ignoreCase);
77 if (words != null && this.ignoreCase != ignoreCase) {
78 words
[all...]
/lucene-3.6.0/solr/core/src/java/org/apache/solr/util/
H A DBitSetIterator.java61 private final int words; field in class:BitSetIterator
73 words = numWords;
114 if (++i >= words) return -1;
134 if (i>=words) {
144 if (++i >= words) return -1;
/lucene-3.6.0/lucene/contrib/facet/src/examples/org/apache/lucene/facet/example/multiCL/
H A DMultiCLIndexer.java63 static String words = "Sed ut perspiciatis unde omnis iste natus error sit " field in class:MultiCLIndexer
110 String[] tokens = words.split(" ");
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/util/
H A DOpenBitSetIterator.java83 final int words; field in class:OpenBitSetIterator
96 words = numWords;
138 if (++i >= words) {
161 if (i >= words) {
171 if (++i >= words) {
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/
H A DTestThreadSafe.java103 String[] words = "now is the time for all good men to come to the aid of their country".split(" "); field in class:TestThreadSafe
114 while (sb.length() < flen) sb.append(' ').append(words[random.nextInt(words.length)]);
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/
H A DTestThreadSafe.java103 String[] words = "now is the time for all good men to come to the aid of their country".split(" "); field in class:TestThreadSafe
114 while (sb.length() < flen) sb.append(' ').append(words[random.nextInt(words.length)]);
/lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/apache/lucene/analysis/synonym/
H A DSynonymMap.java47 /** for multiword support, you must separate words with this separator */
52 public final BytesRefHash words; field in class:SynonymMap
56 public SynonymMap(FST<BytesRef> fst, BytesRefHash words, int maxHorizontalContext) { argument
58 this.words = words;
70 private final BytesRefHash words = new BytesRefHash(); field in class:SynonymMap.Builder
90 public static CharsRef join(String[] words, CharsRef reuse) { argument
93 for(String word : words) {
194 int ord = words.add(utf8Scratch, hashCode);
229 * Phrases are character sequences where words ar
[all...]
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/payloads/
H A DTestPayloadNearQuery.java103 String[] words = phrase.split("[\\s]+");
104 SpanQuery clauses[] = new SpanQuery[words.length];
106 clauses[i] = new SpanTermQuery(new Term(fieldName, words[i]));
263 private SpanNearQuery spanNearQuery(String fieldName, String words) { argument
264 String[] wordList = words.split("[\\s]+");
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/payloads/
H A DTestPayloadNearQuery.java103 String[] words = phrase.split("[\\s]+");
104 SpanQuery clauses[] = new SpanQuery[words.length];
106 clauses[i] = new SpanTermQuery(new Term(fieldName, words[i]));
263 private SpanNearQuery spanNearQuery(String fieldName, String words) { argument
264 String[] wordList = words.split("[\\s]+");
/lucene-3.6.0/lucene/contrib/analyzers/common/src/java/org/apache/lucene/analysis/hunspell/
H A DHunspellDictionary.java53 private CharArrayMap<List<HunspellWord>> words; field in class:HunspellDictionary
108 words = new CharArrayMap<List<HunspellWord>>(version, 65535 /* guess */, this.ignoreCase);
123 return words.get(word, offset, length);
304 * Reads the dictionary file through the provided InputStream, building up the words map
342 List<HunspellWord> entries = words.get(entry);
345 words.put(entry, entries);
/lucene-3.6.0/lucene/contrib/queries/src/java/org/apache/lucene/search/similar/
H A DMoreLikeThis.java177 * Ignore words which do not occur in at least this many docs.
185 * Ignore words which occur in more than this many docs.
208 * Ignore words less than this length or if 0 then this has no effect.
216 * Ignore words greater than this length or if 0 then this has no effect.
224 * Default set of stopwords. If null means to allow stop words.
232 * Current set of stop words.
251 * Ignore words less frequent that this.
256 * Ignore words which do not occur in at least this many docs.
261 * Ignore words which occur in more than this many docs.
282 * Ignore words i
722 createQueue(Map<String,Int> words) argument
[all...]

Completed in 212 milliseconds