/lucene-3.6.0/lucene/contrib/queryparser/src/java/org/apache/lucene/queryParser/core/nodes/ |
H A D | AndQueryNode.java | 33 * @param clauses 36 public AndQueryNode(List<QueryNode> clauses) { argument 37 super(clauses); 38 if ((clauses == null) || (clauses.size() == 0)) {
|
H A D | BooleanQueryNode.java | 34 * @param clauses 37 public BooleanQueryNode(List<QueryNode> clauses) { argument 40 set(clauses);
|
H A D | OrQueryNode.java | 35 * @param clauses 38 public OrQueryNode(List<QueryNode> clauses) { argument 39 super(clauses); 40 if ((clauses == null) || (clauses.size() == 0)) {
|
H A D | AnyQueryNode.java | 35 * @param clauses 38 public AnyQueryNode(List<QueryNode> clauses, CharSequence field, argument 40 super(clauses); 44 if (clauses != null) { 46 for (QueryNode clause : clauses) {
|
H A D | ProximityQueryNode.java | 77 * @param clauses 87 * clauses 89 public ProximityQueryNode(List<QueryNode> clauses, CharSequence field, argument 91 super(clauses); 107 clearFields(clauses, field); 111 * @param clauses 119 * clauses 121 public ProximityQueryNode(List<QueryNode> clauses, CharSequence field, argument 123 this(clauses, field, type, -1, inorder);
|
H A D | QueryNodeImpl.java | 47 private List<QueryNode> clauses = null; field in class:QueryNodeImpl 51 if (this.clauses == null) { 52 this.clauses = new ArrayList<QueryNode>(); 55 this.clauses.clear(); 62 if (isLeaf() || this.clauses == null || child == null) { 67 this.clauses.add(child); 74 if (isLeaf() || this.clauses == null) { 91 if (isLeaf() || this.clauses == null) { 125 if (this.clauses != null) { 127 for (QueryNode clause : this.clauses) { [all...] |
/lucene-3.6.0/lucene/contrib/queryparser/src/java/org/apache/lucene/queryParser/standard/nodes/ |
H A D | StandardBooleanQueryNode.java | 42 * @param clauses 44 public StandardBooleanQueryNode(List<QueryNode> clauses, boolean disableCoord) { argument 45 super(clauses);
|
/lucene-3.6.0/lucene/contrib/queries/src/java/org/apache/lucene/search/ |
H A D | BooleanFilter.java | 40 private final List<FilterClause> clauses = new ArrayList<FilterClause>(); field in class:BooleanFilter 51 for (final FilterClause fc : clauses) { 65 for (final FilterClause fc : clauses) { 79 for (final FilterClause fc : clauses) { 108 clauses.add(filterClause); 116 * Returns the list of clauses 118 public List<FilterClause> clauses() { method in class:BooleanFilter 119 return clauses; 122 /** Returns an iterator on the clauses in this query. It implements the {@link Iterable} interface to 127 return clauses() [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/spans/ |
H A D | SpanNearQuery.java | 38 protected List<SpanQuery> clauses; field in class:SpanNearQuery 48 * must be * ordered as in <code>clauses</code>. 49 * @param clauses the clauses to find near each other 53 public SpanNearQuery(SpanQuery[] clauses, int slop, boolean inOrder) { argument 54 this(clauses, slop, inOrder, true); 57 public SpanNearQuery(SpanQuery[] clauses, int slop, boolean inOrder, boolean collectPayloads) { argument 59 // copy clauses array into an ArrayList 60 this.clauses = new ArrayList<SpanQuery>(clauses [all...] |
H A D | SpanOrQuery.java | 34 /** Matches the union of its clauses.*/ 36 private List<SpanQuery> clauses; field in class:SpanOrQuery 39 /** Construct a SpanOrQuery merging the provided clauses. */ 40 public SpanOrQuery(SpanQuery... clauses) { argument 42 // copy clauses array into an ArrayList 43 this.clauses = new ArrayList<SpanQuery>(clauses.length); 44 for (int i = 0; i < clauses.length; i++) { 45 addClause(clauses[i]); 56 this.clauses [all...] |
/lucene-3.6.0/solr/core/src/test/org/apache/solr/util/ |
H A D | SolrPluginUtilsTest.java | 235 assertEquals(t+" wrong number of clauses", 4, 245 assertEquals(t+" wrong number of clauses", 1, 256 List<BooleanClause> clauses = bq.clauses(); 257 assertEquals(t+" wrong number of clauses", 2, 258 clauses.size()); 259 Query sub = clauses.get(0).getQuery(); 262 assertEquals(t+" first had wrong number of clauses", 4, 264 sub = clauses.get(1).getQuery(); 267 assertEquals(t+" second had wrong number of clauses", 405 calcMSM(int clauses, String spec) argument [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/ |
H A D | BooleanQuery.java | 37 * #getMaxClauseCount()} clauses. This typically happens if 47 /** Return the maximum number of clauses permitted, 1024 by default. 48 * Attempts to add more than the permitted number of clauses cause {@link 55 * Set the maximum number of clauses permitted per BooleanQuery. 64 private ArrayList<BooleanClause> clauses = new ArrayList<BooleanClause>(); field in class:BooleanQuery 96 * By default no optional clauses are necessary for a match 97 * (unless there are no required clauses). If this method is used, 98 * then the specified number of clauses is required. 102 * any specific clauses are required (or prohibited). This number will 103 * only be compared against the number of matching optional clauses 147 public List<BooleanClause> clauses() { return clauses; } method in class:BooleanQuery [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/search/payloads/ |
H A D | PayloadNearQuery.java | 57 public PayloadNearQuery(SpanQuery[] clauses, int slop, boolean inOrder) { argument 58 this(clauses, slop, inOrder, new AveragePayloadFunction()); 61 public PayloadNearQuery(SpanQuery[] clauses, int slop, boolean inOrder, argument 63 super(clauses, slop, inOrder); 64 fieldName = clauses[0].getField(); // all clauses must have same field 75 int sz = clauses.size(); 79 newClauses[i] = (SpanQuery) clauses.get(i).clone(); 91 Iterator<SpanQuery> i = clauses.iterator();
|
/lucene-3.6.0/lucene/core/src/test/org/apache/lucene/search/spans/ |
H A D | TestSpans.java | 452 private SpanQuery createSpan(int slop, boolean ordered, SpanQuery[] clauses) { argument 453 return new SpanNearQuery(clauses, slop, ordered);
|
/lucene-3.6.0/lucene/backwards/src/test/org/apache/lucene/search/spans/ |
H A D | TestSpans.java | 451 private SpanQuery createSpan(int slop, boolean ordered, SpanQuery[] clauses) { argument 452 return new SpanNearQuery(clauses, slop, ordered);
|
/lucene-3.6.0/lucene/contrib/queryparser/src/java/org/apache/lucene/queryParser/standard/ |
H A D | QueryParserWrapper.java | 424 protected Query getBooleanQuery(List<BooleanClause> clauses, boolean disableCoord) argument
|
/lucene-3.6.0/solr/core/src/java/org/apache/solr/search/ |
H A D | ExtendedDismaxQParserPlugin.java | 93 * The field names specified by 'qf' that (most) clauses will 188 List<Clause> clauses = null; 194 clauses = splitIntoClauses(userQuery, false); 195 for (Clause clause : clauses) { 210 // Always rebuild mainUserQuery from clauses to catch modifications from splitIntoClauses 218 for (int i=0; i<clauses.size(); i++) { 219 Clause clause = clauses.get(i); 222 if (i>0 && i+1<clauses.size()) { 263 for (Clause clause : clauses) { 315 // find non-field clauses 444 addShingledPhraseQueries(final BooleanQuery mainQuery, final List<Clause> clauses, final Map<String,Float> fields, int shingleSize, final float tiebreaker, final int slop) argument 898 getBooleanQuery(List clauses, boolean disableCoord) argument 913 addClause(List clauses, int conj, int mods, Query q) argument [all...] |
/lucene-3.6.0/lucene/core/src/java/org/apache/lucene/queryParser/ |
H A D | QueryParser.java | 44 * A Query is a series of clauses. 221 ParseException e = new ParseException("Cannot parse '" +query+ "': too many boolean clauses"); 506 protected void addClause(List<BooleanClause> clauses, int conj, int mods, Query q) { argument 511 if (clauses.size() > 0 && conj == CONJ_AND) { 512 BooleanClause c = clauses.get(clauses.size()-1); 517 if (clauses.size() > 0 && operator == AND_OPERATOR && conj == CONJ_OR) { 522 BooleanClause c = clauses.get(clauses.size()-1); 547 clauses 932 getBooleanQuery(List<BooleanClause> clauses) argument 950 getBooleanQuery(List<BooleanClause> clauses, boolean disableCoord) argument [all...] |