Searched refs:terms (Results 1 - 25 of 211) sorted by relevance

123456789

/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/index/
H A DSegmentTermVector.java25 private String terms[]; field in class:SegmentTermVector
28 SegmentTermVector(String field, String terms[], int termFreqs[]) { argument
30 this.terms = terms;
47 if(terms != null){
48 for (int i=0; i<terms.length; i++) {
50 sb.append(terms[i]).append('/').append(termFreqs[i]);
59 return terms == null ? 0 : terms.length;
63 return terms;
[all...]
H A DTermFreqVector.java21 * a document field. The vector consists of the name of the field, an array of the terms that occur in the field of the
23 * frequency of getTerms()[5], assuming there are at least 5 terms in the Document.
34 * @return The number of terms in the term vector.
45 * to the terms in the array obtained from <code>getTerms</code>
60 /** Just like <code>indexOf(int)</code> but searches for a number of terms
62 * of terms searched for, each slot containing the result of searching for
65 * @param terms array containing terms to look for
66 * @param start index in the array where the list of terms starts
67 * @param len the number of terms i
69 indexesOf(String[] terms, int start, int len) argument
[all...]
H A DBufferedDeletes.java65 final Map<Term,Integer> terms = new HashMap<Term,Integer>(); field in class:BufferedDeletes
80 return "gen=" + gen + " numTerms=" + numTermDeletes + ", terms=" + terms
86 s += " " + numTermDeletes.get() + " deleted terms (unique count=" + terms.size() + ")";
116 Integer current = terms.get(term);
128 terms.put(term, Integer.valueOf(docIDUpto));
136 terms.clear();
149 return terms.size() > 0 || docIDs.size() > 0 || queries.size() > 0;
H A DFrozenBufferedDeletes.java39 final PrefixCodedTerms terms; field in class:FrozenBufferedDeletes
51 Term termsArray[] = deletes.terms.keySet().toArray(new Term[deletes.terms.size()]);
58 terms = builder.finish();
69 bytesUsed = (int) terms.getSizeInBytes() + queries.length * BYTES_PER_DEL_QUERY;
78 return terms.iterator();
115 s += " " + numTermDeletes + " deleted terms (unique count=" + termCount + ")";
H A DSegmentTermPositionVector.java25 public SegmentTermPositionVector(String field, String terms[], int termFreqs[], int[][] positions, TermVectorOffsetInfo[][] offsets) { argument
26 super(field, terms, termFreqs);
/lucene-3.6.0/lucene/contrib/join/src/java/org/apache/lucene/search/join/
H A DTermsQuery.java31 * A query that has an array of terms from a specific field. This query will match documents have one or more terms in
32 * the specified field that match with the terms specified in the array.
68 private final String[] terms; field in class:TermsQuery
72 * @param field The field that should contain terms that are specified in the previous parameter
73 * @param terms A set terms that matching documents should have.
75 TermsQuery(String field, Set<String> terms) { argument
77 this.terms = terms
103 private final String[] terms; field in class:TermsQuery.SeekingTermsEnum
110 SeekingTermsEnum(TermEnum termEnum, Term firstTerm, String field, String[] terms) argument
[all...]
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/
H A DTestQueryTermVector.java31 String [] terms = result.getTerms();
32 assertTrue(terms.length == 4);
35 checkGold(terms, gold, freq, goldFreqs);
40 terms = result.getTerms();
41 assertTrue(terms.length == 4);
44 checkGold(terms, gold, freq, goldFreqs);
47 private void checkGold(String[] terms, String[] gold, int[] freq, int[] goldFreqs) { argument
48 for (int i = 0; i < terms.length; i++) {
49 assertTrue(terms[i].equals(gold[i]));
H A DTestFieldCacheTermsFilter.java43 int term = i * 10; //terms are units of 10;
55 List<String> terms = new ArrayList<String>();
56 terms.add("5");
57 results = searcher.search(q, new FieldCacheTermsFilter(fieldName, terms.toArray(new String[0])), numDocs).scoreDocs;
60 terms = new ArrayList<String>();
61 terms.add("10");
62 results = searcher.search(q, new FieldCacheTermsFilter(fieldName, terms.toArray(new String[0])), numDocs).scoreDocs;
65 terms = new ArrayList<String>();
66 terms.add("10");
67 terms
[all...]
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/
H A DTestQueryTermVector.java31 String [] terms = result.getTerms();
32 assertTrue(terms.length == 4);
35 checkGold(terms, gold, freq, goldFreqs);
40 terms = result.getTerms();
41 assertTrue(terms.length == 4);
44 checkGold(terms, gold, freq, goldFreqs);
47 private void checkGold(String[] terms, String[] gold, int[] freq, int[] goldFreqs) { argument
48 for (int i = 0; i < terms.length; i++) {
49 assertTrue(terms[i].equals(gold[i]));
H A DTestFieldCacheTermsFilter.java43 int term = i * 10; //terms are units of 10;
55 List<String> terms = new ArrayList<String>();
56 terms.add("5");
57 results = searcher.search(q, new FieldCacheTermsFilter(fieldName, terms.toArray(new String[0])), numDocs).scoreDocs;
60 terms = new ArrayList<String>();
61 terms.add("10");
62 results = searcher.search(q, new FieldCacheTermsFilter(fieldName, terms.toArray(new String[0])), numDocs).scoreDocs;
65 terms = new ArrayList<String>();
66 terms.add("10");
67 terms
[all...]
/lucene-3.6.0/lucene/contrib/instantiated/src/java/org/apache/lucene/store/instantiated/
H A DInstantiatedTermFreqVector.java37 private final String terms[]; field in class:InstantiatedTermFreqVector
43 terms = new String[termDocumentInformations.size()];
48 terms[i] = termDocumentInformation.getTerm().text();
65 if (terms != null) {
66 for (int i = 0; i < terms.length; i++) {
68 sb.append(terms[i]).append('/').append(termFrequencies[i]);
77 return terms == null ? 0 : terms.length;
81 return terms;
89 if (terms
[all...]
/lucene-3.6.0/lucene/contrib/queries/src/java/org/apache/lucene/search/
H A DTermsFilter.java31 * Constructs a filter for docs matching any of the terms added to this class.
32 * Unlike a RangeFilter this can be used for filtering on multiple terms that are not necessarily in
40 Set<Term> terms=new TreeSet<Term>(); field in class:TermsFilter
43 * Adds a term to the list of acceptable terms
48 terms.add(term);
61 for (Iterator<Term> iter = terms.iterator(); iter.hasNext();)
86 return (terms == test.terms ||
87 (terms != null && terms
[all...]
/lucene-3.6.0/lucene/contrib/highlighter/src/java/org/apache/lucene/search/highlight/
H A DQueryTermExtractor.java32 * Utility class used to extract the terms used in a query, plus any weights.
33 * This class will not find terms for MultiTermQuery, TermRangeQuery and PrefixQuery classes
35 * expanded terms.
42 * Extracts all terms texts of a given Query into an array of WeightedTerms
45 * @return an array of the terms used in a query, plus their weights.
53 * Extracts all terms texts of a given Query into an array of WeightedTerms
59 * @return an array of the terms used in a query, plus their weights.
63 WeightedTerm[] terms=getTerms(query,false, fieldName);
65 for (int i = 0; i < terms.length; i++)
69 int docFreq=reader.docFreq(new Term(fieldName,terms[
118 getTerms(Query query, HashSet<WeightedTerm> terms,boolean prohibited, String fieldName) argument
158 getTermsFromBooleanQuery(BooleanQuery query, HashSet<WeightedTerm> terms, boolean prohibited, String fieldName) argument
167 getTermsFromFilteredQuery(FilteredQuery query, HashSet<WeightedTerm> terms, boolean prohibited, String fieldName) argument
[all...]
/lucene-3.6.0/lucene/contrib/misc/src/java/org/apache/lucene/misc/
H A DHighFreqTerms.java32 * <code>HighFreqTerms</code> class extracts the top n most frequent terms
73 TermStats[] terms = getHighFreqTerms(reader, numTerms, field);
80 for (int i = 0; i < terms.length; i++) {
82 terms[i].term, terms[i].docFreq);
86 TermStats[] termsWithTF = sortByTotalTermFreq(reader, terms);
107 * @return TermStats[] ordered by terms with highest docFreq first.
115 TermEnum terms = reader.terms(new Term(field));
116 if (terms !
157 sortByTotalTermFreq(IndexReader reader, TermStats[] terms) argument
[all...]
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/
H A DFieldCacheTermsFilter.java29 * provided set of allowed terms.
63 * DocIdSet for each possible combination of terms.
77 * to the number of terms, which can be exceptionally costly
87 * a very small number of terms, and those terms in turn
98 private String[] terms; field in class:FieldCacheTermsFilter
100 public FieldCacheTermsFilter(String field, String... terms) { argument
102 this.terms = terms;
113 for (int i=0;i<terms
[all...]
H A DPhraseQuery.java32 /** A Query that matches documents containing a particular sequence of terms.
35 * <p>This query may be combined with other terms or queries with a {@link BooleanQuery}.
39 private ArrayList<Term> terms = new ArrayList<Term>(4); field in class:PhraseQuery
52 moves of terms in the query phrase out of position. For example, to switch
87 if (terms.size() == 0)
90 throw new IllegalArgumentException("All phrase terms must be in the same field: " + term);
92 terms.add(term);
97 /** Returns the set of terms in this phrase. */
99 return terms.toArray(new Term[0]);
103 * Returns the relative positions of terms i
126 final Term[] terms; field in class:PhraseQuery.PostingsAndFreq
129 PostingsAndFreq(TermPositions postings, int docFreq, int position, Term... terms) argument
[all...]
H A DQueryTermVector.java40 private String [] terms = new String[0]; field in class:QueryTermVector
47 * @param queryTerms The original list of terms from the query, can contain duplicates
65 List<String> terms = new ArrayList<String>();
74 terms.add(termAtt.toString());
77 processTerms(terms.toArray(new String[terms.size()]));
105 terms = tmpList.toArray(terms);
119 for (int i=0; i<terms.length; i++) {
121 sb.append(terms[
145 indexesOf(String[] terms, int start, int len) argument
[all...]
H A DMultiPhraseQuery.java35 * add(Term) on the term "Microsoft", then find all terms that have "app" as
36 * prefix using IndexReader.terms(Term), and use MultiPhraseQuery.add(Term[]
37 * terms) to add them to the query.
63 /** Add multiple terms at the next position in the phrase. Any of the terms
68 public void add(Term[] terms) { argument
73 add(terms, position);
77 * Allows to specify the relative position of terms within the phrase.
80 * @param terms
83 public void add(Term[] terms, in argument
119 extractTerms(Set<Term> terms) argument
[all...]
H A DNGramPhraseQuery.java57 Term[] terms = getTerms();
68 final int lastPos = terms.length - 1;
69 for(int i = 0; i < terms.length; i++){
71 optimized.add(terms[i], positions[i]);
H A DPhrasePositions.java36 final Term[] terms; // for repetitions initialization field in class:PhrasePositions
38 PhrasePositions(TermPositions t, int o, int ord, Term[] terms) { argument
42 this.terms = terms;
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/index/
H A DTestTermsEnum.java50 final List<Term> terms = new ArrayList<Term>();
51 TermEnum termEnum = r.terms(new Term("body"));
57 terms.add(term);
61 System.out.println("TEST: " + terms.size() + " terms");
80 assertEquals(upto, terms.size());
84 System.out.println(" got term=" + termEnum.term() + " expected=" + terms.get(upto));
86 assertTrue(upto < terms.size());
87 assertEquals(terms.get(upto), termEnum.term());
105 target = terms
145 makeIndex(String... terms) argument
361 getNonExistTerm(BytesRef[] terms) argument
[all...]
/lucene-3.6.0/lucene/contrib/misc/src/test/org/apache/lucene/misc/
H A DTestHighFreqTerms.java63 TermStats[] terms = HighFreqTerms.getHighFreqTerms(reader, numTerms, field);
64 assertEquals("Term with highest docfreq is first", 20,terms[0].docFreq );
70 TermStats[] terms = HighFreqTerms.getHighFreqTerms(reader, numTerms, field);
71 assertEquals("Term with highest docfreq is first", 10,terms[0].docFreq );
76 TermStats[] terms = HighFreqTerms.getHighFreqTerms(reader, numTerms, field);
77 for (int i = 0; i < terms.length; i++) {
79 assertTrue ("out of order " + terms[i-1].docFreq + "should be >= " + terms[i].docFreq,terms[i-1].docFreq >= terms[
[all...]
/lucene-3.6.0/solr/solrj/src/test/org/apache/solr/client/solrj/response/
H A DTermsResponseTest.java50 query.setQueryType("/terms");
59 List<Term> terms = request.process(getSolrServer()).getTermsResponse().getTerms("terms_s");
61 Assert.assertNotNull(terms);
62 Assert.assertEquals(terms.size(), 1);
64 Term term = terms.get(0);
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/index/
H A DTestFilterIndexReader.java36 /** Filter that only permits terms containing 'e'.*/
42 /** Scan for terms containing the letter 'e'.*/
74 /** Filter terms with TestTermEnum. */
76 public TermEnum terms() throws IOException { method in class:TestFilterIndexReader.TestReader
77 return new TestTermEnum(in.terms());
116 TermEnum terms = reader.terms();
117 while (terms.next()) {
118 assertTrue(terms.term().text().indexOf('e') != -1);
120 terms
[all...]
/lucene-3.6.0/lucene/contrib/pruning/src/java/org/apache/lucene/index/
H A DPruningReader.java114 * Applies {@link TermPruningPolicy} to terms inside term vectors.
137 String[] terms = v.getTerms();
140 int removed = termPolicy.pruneTermVectorTerms(docNumber, v.getField(), terms, freqs, v);
141 if (removed > 0 && removed < terms.length) {
142 String[] newTerms = new String[terms.length - removed];
143 int[] newFreqs = new int[terms.length - removed];
145 for (int i = 0; i < terms.length; i++) {
146 if (terms[i] != null) {
147 newTerms[j] = terms[i];
154 TermVectorOffsetInfo[][] offsets = new TermVectorOffsetInfo[terms
215 public TermEnum terms() throws IOException { method in class:PruningReader
[all...]

Completed in 2692 milliseconds

123456789