You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@lucene.apache.org by rm...@apache.org on 2015/02/07 11:10:37 UTC
svn commit: r1658040 [3/4] - in /lucene/dev/trunk/lucene: ./
analysis/common/src/java/org/apache/lucene/analysis/bg/
analysis/common/src/java/org/apache/lucene/analysis/charfilter/
analysis/common/src/java/org/apache/lucene/analysis/cjk/ analysis/commo...
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/Similarity.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/Similarity.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/Similarity.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/Similarity.java Sat Feb 7 10:10:34 2015
@@ -47,7 +47,7 @@ import java.io.IOException;
* this class at both <a href="#indextime">index-time</a> and
* <a href="#querytime">query-time</a>.
* <p>
- * <a name="indextime"/>
+ * <a name="indextime">Indexing Time</a>
* At indexing time, the indexer calls {@link #computeNorm(FieldInvertState)}, allowing
* the Similarity implementation to set a per-document value for the field that will
* be later accessible via {@link org.apache.lucene.index.LeafReader#getNormValues(String)}. Lucene makes no assumption
@@ -74,7 +74,7 @@ import java.io.IOException;
* boost parameter <i>C</i>, and {@link PerFieldSimilarityWrapper} can return different
* instances with different boosts depending upon field name.
* <p>
- * <a name="querytime"/>
+ * <a name="querytime">Query time</a>
* At query-time, Queries interact with the Similarity via these steps:
* <ol>
* <li>The {@link #computeWeight(float, CollectionStatistics, TermStatistics...)} method is called a single time,
@@ -91,7 +91,7 @@ import java.io.IOException;
* The score() method is called for each matching document.
* </ol>
* <p>
- * <a name="explaintime"/>
+ * <a name="explaintime">Explanations</a>
* When {@link IndexSearcher#explain(org.apache.lucene.search.Query, int)} is called, queries consult the Similarity's DocScorer for an
* explanation of how it computed its score. The query passes in a the document id and an explanation of how the frequency
* was computed.
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/TFIDFSimilarity.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/TFIDFSimilarity.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/TFIDFSimilarity.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/TFIDFSimilarity.java Sat Feb 7 10:10:34 2015
@@ -256,7 +256,6 @@ import org.apache.lucene.util.BytesRef;
* The color codes demonstrate how it relates
* to those of the <i>conceptual</i> formula:
*
- * <P>
* <table cellpadding="2" cellspacing="2" border="0" style="width:auto; margin-left:auto; margin-right:auto" summary="formatting only">
* <tr><td>
* <table cellpadding="" cellspacing="2" border="2" style="margin-left:auto; margin-right:auto" summary="formatting only">
@@ -280,7 +279,7 @@ import org.apache.lucene.util.BytesRef;
* <big><big>)</big></big>
* </td>
* </tr>
- * <tr valigh="top">
+ * <tr valign="top">
* <td></td>
* <td align="center" style="text-align: center"><small>t in q</small></td>
* <td></td>
@@ -426,7 +425,7 @@ import org.apache.lucene.util.BytesRef;
* <big><big>) <sup>2</sup> </big></big>
* </td>
* </tr>
- * <tr valigh="top">
+ * <tr valign="top">
* <td></td>
* <td align="center" style="text-align: center"><small>t in q</small></td>
* <td></td>
@@ -489,7 +488,7 @@ import org.apache.lucene.util.BytesRef;
* {@link org.apache.lucene.index.IndexableField#boost() f.boost}()
* </td>
* </tr>
- * <tr valigh="top">
+ * <tr valign="top">
* <td></td>
* <td align="center" style="text-align: center"><small>field <i><b>f</b></i> in <i>d</i> named as <i><b>t</b></i></small></td>
* <td></td>
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/package-info.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/package-info.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/package-info.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/similarities/package-info.java Sat Feb 7 10:10:34 2015
@@ -23,12 +23,10 @@
* package.
*
* <h2>Table Of Contents</h2>
- * <p>
* <ol>
* <li><a href="#sims">Summary of the Ranking Methods</a></li>
* <li><a href="#changingSimilarity">Changing the Similarity</a></li>
* </ol>
- * </p>
*
*
* <a name="sims"></a>
@@ -37,10 +35,10 @@
* <p>{@link org.apache.lucene.search.similarities.DefaultSimilarity} is the original Lucene
* scoring function. It is based on a highly optimized
* <a href="http://en.wikipedia.org/wiki/Vector_Space_Model">Vector Space Model</a>. For more
- * information, see {@link org.apache.lucene.search.similarities.TFIDFSimilarity}.</p>
+ * information, see {@link org.apache.lucene.search.similarities.TFIDFSimilarity}.
*
* <p>{@link org.apache.lucene.search.similarities.BM25Similarity} is an optimized
- * implementation of the successful Okapi BM25 model.</p>
+ * implementation of the successful Okapi BM25 model.
*
* <p>{@link org.apache.lucene.search.similarities.SimilarityBase} provides a basic
* implementation of the Similarity contract and exposes a highly simplified
@@ -63,7 +61,7 @@
* {@link org.apache.lucene.search.similarities.BM25Similarity}, a difference in
* performance is to be expected when using the methods listed above. However,
* optimizations can always be implemented in subclasses; see
- * <a href="#changingSimilarity">below</a>.</p>
+ * <a href="#changingSimilarity">below</a>.
*
* <a name="changingSimilarity"></a>
* <h2>Changing Similarity</h2>
@@ -74,13 +72,12 @@
* href="Similarity.html">Similarity</a> implementation. For instance, some
* applications do not need to
* distinguish between shorter and longer documents (see <a
- * href="http://www.gossamer-threads.com/lists/lucene/java-user/38967#38967">a "fair" similarity</a>).</p>
+ * href="http://www.gossamer-threads.com/lists/lucene/java-user/38967#38967">a "fair" similarity</a>).
*
* <p>To change {@link org.apache.lucene.search.similarities.Similarity}, one must do so for both indexing and
* searching, and the changes must happen before
* either of these actions take place. Although in theory there is nothing stopping you from changing mid-stream, it
* just isn't well-defined what is going to happen.
- * </p>
*
* <p>To make this change, implement your own {@link org.apache.lucene.search.similarities.Similarity} (likely
* you'll want to simply subclass an existing method, be it
@@ -91,7 +88,6 @@
* before indexing and
* {@link org.apache.lucene.search.IndexSearcher#setSimilarity(Similarity)}
* before searching.
- * </p>
*
* <h3>Extending {@linkplain org.apache.lucene.search.similarities.SimilarityBase}</h3>
* <p>
@@ -100,7 +96,7 @@
* basic implementations for the low level . Subclasses are only required to
* implement the {@link org.apache.lucene.search.similarities.SimilarityBase#score(BasicStats, float, float)}
* and {@link org.apache.lucene.search.similarities.SimilarityBase#toString()}
- * methods.</p>
+ * methods.
*
* <p>Another option is to extend one of the <a href="#framework">frameworks</a>
* based on {@link org.apache.lucene.search.similarities.SimilarityBase}. These
@@ -111,7 +107,7 @@
* {@link org.apache.lucene.search.similarities.AfterEffect} and
* {@link org.apache.lucene.search.similarities.Normalization}. Instead of
* subclassing the Similarity, one can simply introduce a new basic model and tell
- * {@link org.apache.lucene.search.similarities.DFRSimilarity} to use it.</p>
+ * {@link org.apache.lucene.search.similarities.DFRSimilarity} to use it.
*
* <h3>Changing {@linkplain org.apache.lucene.search.similarities.DefaultSimilarity}</h3>
* <p>
@@ -123,17 +119,17 @@
* <code>org.apache.lucene.misc</code> gives small
* increases as the frequency increases a small amount
* and then greater increases when you hit the "sweet spot", i.e. where
- * you think the frequency of terms is more significant.</p></li>
+ * you think the frequency of terms is more significant.</li>
* <li><p>Overriding tf — In some applications, it doesn't matter what the score of a document is as long as a
* matching term occurs. In these
- * cases people have overridden Similarity to return 1 from the tf() method.</p></li>
+ * cases people have overridden Similarity to return 1 from the tf() method.</li>
* <li><p>Changing Length Normalization — By overriding
* {@link org.apache.lucene.search.similarities.Similarity#computeNorm(org.apache.lucene.index.FieldInvertState state)},
* it is possible to discount how the length of a field contributes
* to a score. In {@link org.apache.lucene.search.similarities.DefaultSimilarity},
* lengthNorm = 1 / (numTerms in field)^0.5, but if one changes this to be
* 1 / (numTerms in field), all fields will be treated
- * <a href="http://www.gossamer-threads.com/lists/lucene/java-user/38967#38967">"fairly"</a>.</p></li>
+ * <a href="http://www.gossamer-threads.com/lists/lucene/java-user/38967#38967">"fairly"</a>.</li>
* </ol>
* In general, Chris Hostetter sums it up best in saying (from <a
* href="http://www.gossamer-threads.com/lists/lucene/java-user/39125#39125">the Lucene users's mailing list</a>):
@@ -141,6 +137,5 @@
* that
* it's "text" is a situation where it *might* make sense to to override your
* Similarity method.</blockquote>
- * </p>
*/
package org.apache.lucene.search.similarities;
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/FieldMaskingSpanQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/FieldMaskingSpanQuery.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/FieldMaskingSpanQuery.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/FieldMaskingSpanQuery.java Sat Feb 7 10:10:34 2015
@@ -67,12 +67,12 @@ import org.apache.lucene.util.ToStringUt
* </pre>
* to search for 'studentfirstname:james studentsurname:jones' and find
* teacherid 1 without matching teacherid 2 (which has a 'james' in position 0
- * and 'jones' in position 1). </p>
+ * and 'jones' in position 1).
*
* <p>Note: as {@link #getField()} returns the masked field, scoring will be
* done using the Similarity and collection statistics of the field name supplied,
* but with the term statistics of the real field. This may lead to exceptions,
- * poor performance, and unexpected scoring behaviour.</p>
+ * poor performance, and unexpected scoring behaviour.
*/
public class FieldMaskingSpanQuery extends SpanQuery {
private SpanQuery maskedQuery;
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanFirstQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanFirstQuery.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanFirstQuery.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanFirstQuery.java Sat Feb 7 10:10:34 2015
@@ -21,13 +21,12 @@ import org.apache.lucene.util.ToStringUt
import java.io.IOException;
-/** Matches spans near the beginning of a field.
- * <p/>
+/**
+ * Matches spans near the beginning of a field.
+ * <p>
* This class is a simple extension of {@link SpanPositionRangeQuery} in that it assumes the
* start to be zero and only checks the end boundary.
- *
- *
- * */
+ */
public class SpanFirstQuery extends SpanPositionRangeQuery {
/** Construct a SpanFirstQuery matching spans in <code>match</code> whose end
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanNearPayloadCheckQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanNearPayloadCheckQuery.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanNearPayloadCheckQuery.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanNearPayloadCheckQuery.java Sat Feb 7 10:10:34 2015
@@ -26,8 +26,6 @@ import java.util.Collection;
/**
* Only return those matches that have a specific payload at
* the given position.
- * <p/>
- *
*/
public class SpanNearPayloadCheckQuery extends SpanPositionCheckQuery {
protected final Collection<byte[]> payloadToMatch;
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanPayloadCheckQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanPayloadCheckQuery.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanPayloadCheckQuery.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/SpanPayloadCheckQuery.java Sat Feb 7 10:10:34 2015
@@ -25,14 +25,13 @@ import java.util.Iterator;
/**
- * Only return those matches that have a specific payload at
- * the given position.
- *<p/>
+ * Only return those matches that have a specific payload at
+ * the given position.
+ * <p>
* Do not use this with an SpanQuery that contains a {@link org.apache.lucene.search.spans.SpanNearQuery}. Instead, use
* {@link SpanNearPayloadCheckQuery} since it properly handles the fact that payloads
* aren't ordered by {@link org.apache.lucene.search.spans.SpanNearQuery}.
- *
- **/
+ */
public class SpanPayloadCheckQuery extends SpanPositionCheckQuery{
protected final Collection<byte[]> payloadToMatch;
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/Spans.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/Spans.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/Spans.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/Spans.java Sat Feb 7 10:10:34 2015
@@ -69,19 +69,19 @@ public abstract class Spans {
* you do not want ordered SpanNearQuerys to collect payloads, you can
* disable collection with a constructor option.<br>
* <br>
- * Note that the return type is a collection, thus the ordering should not be relied upon.
- * <br/>
+ * Note that the return type is a collection, thus the ordering should not be relied upon.
+ * <br>
* @lucene.experimental
*
* @return a List of byte arrays containing the data of this payload, otherwise null if isPayloadAvailable is false
* @throws IOException if there is a low-level I/O error
- */
+ */
// TODO: Remove warning after API has been finalized
public abstract Collection<byte[]> getPayload() throws IOException;
/**
* Checks if a payload can be loaded at this position.
- * <p/>
+ * <p>
* Payloads can only be loaded once per call to
* {@link #next()}.
*
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/package-info.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/package-info.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/package-info.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/search/spans/package-info.java Sat Feb 7 10:10:34 2015
@@ -53,7 +53,6 @@
* In all cases, output spans are minimally inclusive. In other words, a
* span formed by matching a span in x and y starts at the lesser of the
* two starts and ends at the greater of the two ends.
- * </p>
*
* <p>For example, a span query which matches "John Kerry" within ten
* words of "George Bush" within the first 100 words of the document
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/DataOutput.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/DataOutput.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/DataOutput.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/DataOutput.java Sat Feb 7 10:10:34 2015
@@ -23,7 +23,6 @@ import java.util.Set;
import org.apache.lucene.util.BitUtil;
import org.apache.lucene.util.BytesRef;
-import org.apache.lucene.util.UnicodeUtil;
/**
* Abstract base class for performing write operations of Lucene's low-level
@@ -92,10 +91,6 @@ public abstract class DataOutput {
* byte, values from 128 to 16,383 may be stored in two bytes, and so on.</p>
* <p>VByte Encoding Example</p>
* <table cellspacing="0" cellpadding="2" border="0" summary="variable length encoding examples">
- * <col width="64*">
- * <col width="64*">
- * <col width="64*">
- * <col width="64*">
* <tr valign="top">
* <th align="left">Value</th>
* <th align="left">Byte 1</th>
@@ -104,19 +99,19 @@ public abstract class DataOutput {
* </tr>
* <tr valign="bottom">
* <td>0</td>
- * <td><kbd>00000000</kbd></td>
+ * <td><code>00000000</code></td>
* <td></td>
* <td></td>
* </tr>
* <tr valign="bottom">
* <td>1</td>
- * <td><kbd>00000001</kbd></td>
+ * <td><code>00000001</code></td>
* <td></td>
* <td></td>
* </tr>
* <tr valign="bottom">
* <td>2</td>
- * <td><kbd>00000010</kbd></td>
+ * <td><code>00000010</code></td>
* <td></td>
* <td></td>
* </tr>
@@ -128,26 +123,26 @@ public abstract class DataOutput {
* </tr>
* <tr valign="bottom">
* <td>127</td>
- * <td><kbd>01111111</kbd></td>
+ * <td><code>01111111</code></td>
* <td></td>
* <td></td>
* </tr>
* <tr valign="bottom">
* <td>128</td>
- * <td><kbd>10000000</kbd></td>
- * <td><kbd>00000001</kbd></td>
+ * <td><code>10000000</code></td>
+ * <td><code>00000001</code></td>
* <td></td>
* </tr>
* <tr valign="bottom">
* <td>129</td>
- * <td><kbd>10000001</kbd></td>
- * <td><kbd>00000001</kbd></td>
+ * <td><code>10000001</code></td>
+ * <td><code>00000001</code></td>
* <td></td>
* </tr>
* <tr valign="bottom">
* <td>130</td>
- * <td><kbd>10000010</kbd></td>
- * <td><kbd>00000001</kbd></td>
+ * <td><code>10000010</code></td>
+ * <td><code>00000001</code></td>
* <td></td>
* </tr>
* <tr>
@@ -158,21 +153,21 @@ public abstract class DataOutput {
* </tr>
* <tr valign="bottom">
* <td>16,383</td>
- * <td><kbd>11111111</kbd></td>
- * <td><kbd>01111111</kbd></td>
+ * <td><code>11111111</code></td>
+ * <td><code>01111111</code></td>
* <td></td>
* </tr>
* <tr valign="bottom">
* <td>16,384</td>
- * <td><kbd>10000000</kbd></td>
- * <td><kbd>10000000</kbd></td>
- * <td><kbd>00000001</kbd></td>
+ * <td><code>10000000</code></td>
+ * <td><code>10000000</code></td>
+ * <td><code>00000001</code></td>
* </tr>
* <tr valign="bottom">
* <td>16,385</td>
- * <td><kbd>10000001</kbd></td>
- * <td><kbd>10000000</kbd></td>
- * <td><kbd>00000001</kbd></td>
+ * <td><code>10000001</code></td>
+ * <td><code>10000000</code></td>
+ * <td><code>00000001</code></td>
* </tr>
* <tr>
* <td valign="top">...</td>
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/Directory.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/Directory.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/Directory.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/Directory.java Sat Feb 7 10:10:34 2015
@@ -78,8 +78,8 @@ public abstract class Directory implemen
* Ensure that any writes to these files are moved to
* stable storage. Lucene uses this to properly commit
* changes to the index, to prevent a machine/OS crash
- * from corrupting the index.<br/>
- * <br/>
+ * from corrupting the index.
+ * <br>
* NOTE: Clients may call this method for same files over
* and over again, so some impls might optimize for that.
* For other impls the operation can be a noop, for various
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/FSDirectory.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/FSDirectory.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/FSDirectory.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/store/FSDirectory.java Sat Feb 7 10:10:34 2015
@@ -36,7 +36,7 @@ import org.apache.lucene.util.IOUtils;
/**
* Base class for Directory implementations that store index
* files in the file system.
- * <a name="subclasses"/>
+ * <a name="subclasses"></a>
* There are currently three core
* subclasses:
*
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/SentinelIntSet.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/SentinelIntSet.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/SentinelIntSet.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/SentinelIntSet.java Sat Feb 7 10:10:34 2015
@@ -25,7 +25,7 @@ import java.util.Arrays;
* would make it >= 75% full. Consider extending and over-riding {@link #hash(int)} if the values might be poor
* hash keys; Lucene docids should be fine.
* The internal fields are exposed publicly to enable more efficient use at the expense of better O-O principles.
- * <p/>
+ * <p>
* To iterate over the integers held in this set, simply use code like this:
* <pre class="prettyprint">
* SentinelIntSet set = ...
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/TimSorter.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/TimSorter.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/TimSorter.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/TimSorter.java Sat Feb 7 10:10:34 2015
@@ -26,7 +26,7 @@ import java.util.Arrays;
* <p>This implementation is especially good at sorting partially-sorted
* arrays and sorts small arrays with binary sort.
* <p><b>NOTE</b>:There are a few differences with the original implementation:<ul>
- * <li><a name="maxTempSlots"/>The extra amount of memory to perform merges is
+ * <li><a name="maxTempSlots"></a>The extra amount of memory to perform merges is
* configurable. This allows small merges to be very fast while large merges
* will be performed in-place (slightly slower). You can make sure that the
* fast merge routine will always be used by having <code>maxTempSlots</code>
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/WeakIdentityMap.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/WeakIdentityMap.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/WeakIdentityMap.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/WeakIdentityMap.java Sat Feb 7 10:10:34 2015
@@ -45,7 +45,7 @@ import java.util.concurrent.ConcurrentHa
* on the values and not-GCed keys. Lucene's implementation also supports {@code null}
* keys, but those are never weak!
*
- * <p><a name="reapInfo" />The map supports two modes of operation:
+ * <p><a name="reapInfo"></a>The map supports two modes of operation:
* <ul>
* <li>{@code reapOnRead = true}: This behaves identical to a {@link java.util.WeakHashMap}
* where it also cleans up the reference queue on every read operation ({@link #get(Object)},
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/automaton/LevenshteinAutomata.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/automaton/LevenshteinAutomata.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/automaton/LevenshteinAutomata.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/automaton/LevenshteinAutomata.java Sat Feb 7 10:10:34 2015
@@ -28,7 +28,6 @@ import org.apache.lucene.util.UnicodeUti
* <p>
* Implements the algorithm described in:
* Schulz and Mihov: Fast String Correction with Levenshtein Automata
- * <p>
* @lucene.experimental
*/
public class LevenshteinAutomata {
@@ -125,7 +124,6 @@ public class LevenshteinAutomata {
* <li>There are no transitions to dead states.
* <li>They are not minimal (some transitions could be combined).
* </ul>
- * </p>
*/
public Automaton toAutomaton(int n) {
return toAutomaton(n, "");
@@ -141,7 +139,6 @@ public class LevenshteinAutomata {
* <li>There are no transitions to dead states.
* <li>They are not minimal (some transitions could be combined).
* </ul>
- * </p>
*/
public Automaton toAutomaton(int n, String prefix) {
assert prefix != null;
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/automaton/RegExp.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/automaton/RegExp.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/automaton/RegExp.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/automaton/RegExp.java Sat Feb 7 10:10:34 2015
@@ -40,7 +40,6 @@ import java.util.Set;
* Regular Expression extension to <code>Automaton</code>.
* <p>
* Regular expressions are built from the following abstract syntax:
- * <p>
* <table border=0 summary="description of regular expression grammar">
* <tr>
* <td><i>regexp</i></td>
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/packed/PackedInts.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/packed/PackedInts.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/packed/PackedInts.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/packed/PackedInts.java Sat Feb 7 10:10:34 2015
@@ -224,12 +224,12 @@ public class PackedInts {
* Try to find the {@link Format} and number of bits per value that would
* restore from disk the fastest reader whose overhead is less than
* <code>acceptableOverheadRatio</code>.
- * </p><p>
+ * <p>
* The <code>acceptableOverheadRatio</code> parameter makes sense for
* random-access {@link Reader}s. In case you only plan to perform
* sequential access on this stream later on, you should probably use
* {@link PackedInts#COMPACT}.
- * </p><p>
+ * <p>
* If you don't know how many values you are going to write, use
* <code>valueCount = -1</code>.
*/
@@ -867,7 +867,7 @@ public class PackedInts {
* metadata at the beginning of the stream. This method is useful to restore
* data from streams which have been created using
* {@link PackedInts#getWriterNoHeader(DataOutput, Format, int, int, int)}.
- * </p><p>
+ * <p>
* The returned reader will have very little memory overhead, but every call
* to {@link Reader#get(int)} is likely to perform a disk seek.
*
@@ -896,7 +896,7 @@ public class PackedInts {
* Construct a direct {@link Reader} from an {@link IndexInput}. This method
* is useful to restore data from streams which have been created using
* {@link PackedInts#getWriter(DataOutput, int, int, float)}.
- * </p><p>
+ * <p>
* The returned reader will have very little memory overhead, but every call
* to {@link Reader#get(int)} is likely to perform a disk seek.
*
@@ -918,7 +918,7 @@ public class PackedInts {
* Create a packed integer array with the given amount of values initialized
* to 0. the valueCount and the bitsPerValue cannot be changed after creation.
* All Mutables known by this factory are kept fully in RAM.
- * </p><p>
+ * <p>
* Positive values of <code>acceptableOverheadRatio</code> will trade space
* for speed by selecting a faster but potentially less memory-efficient
* implementation. An <code>acceptableOverheadRatio</code> of
@@ -978,12 +978,12 @@ public class PackedInts {
/**
* Expert: Create a packed integer array writer for the given output, format,
* value count, and number of bits per value.
- * </p><p>
+ * <p>
* The resulting stream will be long-aligned. This means that depending on
* the format which is used, up to 63 bits will be wasted. An easy way to
* make sure that no space is lost is to always use a <code>valueCount</code>
* that is a multiple of 64.
- * </p><p>
+ * <p>
* This method does not write any metadata to the stream, meaning that it is
* your responsibility to store it somewhere else in order to be able to
* recover data from the stream later on:
@@ -993,7 +993,7 @@ public class PackedInts {
* <li><code>bitsPerValue</code>,</li>
* <li>{@link #VERSION_CURRENT}.</li>
* </ul>
- * </p><p>
+ * <p>
* It is possible to start writing values without knowing how many of them you
* are actually going to write. To do this, just pass <code>-1</code> as
* <code>valueCount</code>. On the other hand, for any positive value of
@@ -1001,7 +1001,7 @@ public class PackedInts {
* write more values than expected and pad the end of stream with zeros in
* case you have written less than <code>valueCount</code> when calling
* {@link Writer#finish()}.
- * </p><p>
+ * <p>
* The <code>mem</code> parameter lets you control how much memory can be used
* to buffer changes in memory before flushing to disk. High values of
* <code>mem</code> are likely to improve throughput. On the other hand, if
@@ -1026,18 +1026,18 @@ public class PackedInts {
/**
* Create a packed integer array writer for the given output, format, value
* count, and number of bits per value.
- * </p><p>
+ * <p>
* The resulting stream will be long-aligned. This means that depending on
* the format which is used under the hoods, up to 63 bits will be wasted.
* An easy way to make sure that no space is lost is to always use a
* <code>valueCount</code> that is a multiple of 64.
- * </p><p>
+ * <p>
* This method writes metadata to the stream, so that the resulting stream is
* sufficient to restore a {@link Reader} from it. You don't need to track
* <code>valueCount</code> or <code>bitsPerValue</code> by yourself. In case
* this is a problem, you should probably look at
* {@link #getWriterNoHeader(DataOutput, Format, int, int, int)}.
- * </p><p>
+ * <p>
* The <code>acceptableOverheadRatio</code> parameter controls how
* readers that will be restored from this stream trade space
* for speed by selecting a faster but potentially less memory-efficient
Modified: lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/packed/package-info.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/packed/package-info.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/packed/package-info.java (original)
+++ lucene/dev/trunk/lucene/core/src/java/org/apache/lucene/util/packed/package-info.java Sat Feb 7 10:10:34 2015
@@ -28,9 +28,8 @@
* The implementations provide different trade-offs between memory usage and
* access speed. The standard usage scenario is replacing large int or long
* arrays in order to reduce the memory footprint.
- * </p><p>
+ * <p>
* The main access point is the {@link org.apache.lucene.util.packed.PackedInts} factory.
- * </p>
*
* <h3>In-memory structures</h3>
*
Modified: lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/AbstractAllGroupHeadsCollector.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/AbstractAllGroupHeadsCollector.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/AbstractAllGroupHeadsCollector.java (original)
+++ lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/AbstractAllGroupHeadsCollector.java Sat Feb 7 10:10:34 2015
@@ -82,7 +82,7 @@ public abstract class AbstractAllGroupHe
/**
* Returns the group head and puts it into {@link #temporalResult}.
* If the group head wasn't encountered before then it will be added to the collected group heads.
- * <p/>
+ * <p>
* The {@link TemporalResult#stop} property will be <code>true</code> if the group head wasn't encountered before
* otherwise <code>false</code>.
*
Modified: lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/AbstractAllGroupsCollector.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/AbstractAllGroupsCollector.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/AbstractAllGroupsCollector.java (original)
+++ lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/AbstractAllGroupsCollector.java Sat Feb 7 10:10:34 2015
@@ -29,8 +29,7 @@ import org.apache.lucene.util.BytesRef;
* query. Only the group value is collected, and the order
* is undefined. This collector does not determine
* the most relevant document of a group.
- *
- * <p/>
+ * <p>
* This is an abstract version. Concrete implementations define
* what a group actually is and how it is internally collected.
*
@@ -50,7 +49,7 @@ public abstract class AbstractAllGroupsC
/**
* Returns the group values
- * <p/>
+ * <p>
* This is an unordered collections of group values. For each group that matched the query there is a {@link BytesRef}
* representing a group value.
*
Modified: lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/GroupingSearch.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/GroupingSearch.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/GroupingSearch.java (original)
+++ lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/GroupingSearch.java Sat Feb 7 10:10:34 2015
@@ -379,7 +379,7 @@ public class GroupingSearch {
/**
* Whether to also compute all groups matching the query.
* This can be used to determine the number of groups, which can be used for accurate pagination.
- * <p/>
+ * <p>
* When grouping by doc block the number of groups are automatically included in the {@link TopGroups} and this
* option doesn't have any influence.
*
@@ -406,7 +406,7 @@ public class GroupingSearch {
/**
* Whether to compute all group heads (most relevant document per group) matching the query.
- * <p/>
+ * <p>
* This feature isn't enabled when grouping by doc block.
*
* @param allGroupHeads Whether to compute all group heads (most relevant document per group) matching the query
@@ -430,7 +430,7 @@ public class GroupingSearch {
* Sets the initial size of some internal used data structures.
* This prevents growing data structures many times. This can improve the performance of the grouping at the cost of
* more initial RAM.
- * <p/>
+ * <p>
* The {@link #setAllGroups} and {@link #setAllGroupHeads} features use this option.
* Defaults to 128.
*
Modified: lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/function/FunctionAllGroupsCollector.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/function/FunctionAllGroupsCollector.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/function/FunctionAllGroupsCollector.java (original)
+++ lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/function/FunctionAllGroupsCollector.java Sat Feb 7 10:10:34 2015
@@ -34,8 +34,7 @@ import java.util.TreeSet;
* query. Only the group value is collected, and the order
* is undefined. This collector does not determine
* the most relevant document of a group.
- *
- * <p/>
+ * <p>
* Implementation detail: Uses {@link ValueSource} and {@link FunctionValues} to retrieve the
* field values to group by.
*
Modified: lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/term/TermAllGroupsCollector.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/term/TermAllGroupsCollector.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/term/TermAllGroupsCollector.java (original)
+++ lucene/dev/trunk/lucene/grouping/src/java/org/apache/lucene/search/grouping/term/TermAllGroupsCollector.java Sat Feb 7 10:10:34 2015
@@ -34,8 +34,7 @@ import java.util.List;
* query. Only the group value is collected, and the order
* is undefined. This collector does not determine
* the most relevant document of a group.
- *
- * <p/>
+ * <p>
* Implementation detail: an int hash set (SentinelIntSet)
* is used to detect if a group is already added to the
* total count. For each segment the int set is cleared and filled
Modified: lucene/dev/trunk/lucene/highlighter/src/java/org/apache/lucene/search/highlight/TokenStreamFromTermVector.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/highlighter/src/java/org/apache/lucene/search/highlight/TokenStreamFromTermVector.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/highlighter/src/java/org/apache/lucene/search/highlight/TokenStreamFromTermVector.java (original)
+++ lucene/dev/trunk/lucene/highlighter/src/java/org/apache/lucene/search/highlight/TokenStreamFromTermVector.java Sat Feb 7 10:10:34 2015
@@ -41,7 +41,7 @@ import org.apache.lucene.util.UnicodeUti
* because you know the term vector has payloads, since the first call to incrementToken() will observe if you asked
* for them and if not then won't get them. This TokenStream supports an efficient {@link #reset()}, so there's
* no need to wrap with a caching impl.
- * <p />
+ * <p>
* The implementation will create an array of tokens indexed by token position. As long as there aren't massive jumps
* in positions, this is fine. And it assumes there aren't large numbers of tokens at the same position, since it adds
* them to a linked-list per position in O(N^2) complexity. When there aren't positions in the term vector, it divides
Modified: lucene/dev/trunk/lucene/highlighter/src/java/org/apache/lucene/search/vectorhighlight/SingleFragListBuilder.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/highlighter/src/java/org/apache/lucene/search/vectorhighlight/SingleFragListBuilder.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/highlighter/src/java/org/apache/lucene/search/vectorhighlight/SingleFragListBuilder.java (original)
+++ lucene/dev/trunk/lucene/highlighter/src/java/org/apache/lucene/search/vectorhighlight/SingleFragListBuilder.java Sat Feb 7 10:10:34 2015
@@ -27,7 +27,7 @@ import org.apache.lucene.search.vectorhi
/**
* An implementation class of {@link FragListBuilder} that generates one {@link WeightedFragInfo} object.
* Typical use case of this class is that you can get an entire field contents
- * by using both of this class and {@link SimpleFragmentsBuilder}.<br/>
+ * by using both of this class and {@link SimpleFragmentsBuilder}.<br>
* <pre class="prettyprint">
* FastVectorHighlighter h = new FastVectorHighlighter( true, true,
* new SingleFragListBuilder(), new SimpleFragmentsBuilder() );
Modified: lucene/dev/trunk/lucene/join/src/java/org/apache/lucene/search/join/JoinUtil.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/join/src/java/org/apache/lucene/search/join/JoinUtil.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/join/src/java/org/apache/lucene/search/join/JoinUtil.java (original)
+++ lucene/dev/trunk/lucene/join/src/java/org/apache/lucene/search/join/JoinUtil.java Sat Feb 7 10:10:34 2015
@@ -36,16 +36,16 @@ public final class JoinUtil {
/**
* Method for query time joining.
- * <p/>
+ * <p>
* Execute the returned query with a {@link IndexSearcher} to retrieve all documents that have the same terms in the
* to field that match with documents matching the specified fromQuery and have the same terms in the from field.
- * <p/>
+ * <p>
* In the case a single document relates to more than one document the <code>multipleValuesPerDocument</code> option
* should be set to true. When the <code>multipleValuesPerDocument</code> is set to <code>true</code> only the
* the score from the first encountered join value originating from the 'from' side is mapped into the 'to' side.
* Even in the case when a second join value related to a specific document yields a higher score. Obviously this
* doesn't apply in the case that {@link ScoreMode#None} is used, since no scores are computed at all.
- * </p>
+ * <p>
* Memory considerations: During joining all unique join values are kept in memory. On top of that when the scoreMode
* isn't set to {@link ScoreMode#None} a float value per unique join value is kept in memory for computing scores.
* When scoreMode is set to {@link ScoreMode#Avg} also an additional integer value is kept in memory per unique
Modified: lucene/dev/trunk/lucene/memory/src/java/org/apache/lucene/index/memory/MemoryIndex.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/memory/src/java/org/apache/lucene/index/memory/MemoryIndex.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/memory/src/java/org/apache/lucene/index/memory/MemoryIndex.java (original)
+++ lucene/dev/trunk/lucene/memory/src/java/org/apache/lucene/index/memory/MemoryIndex.java Sat Feb 7 10:10:34 2015
@@ -123,7 +123,7 @@ import org.apache.lucene.util.RecyclingI
*
* <p>
* <b>Example Usage</b>
- * <p>
+ * <br>
* <pre class="prettyprint">
* Analyzer analyzer = new SimpleAnalyzer(version);
* MemoryIndex index = new MemoryIndex();
Modified: lucene/dev/trunk/lucene/misc/src/java/org/apache/lucene/store/WindowsDirectory.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/misc/src/java/org/apache/lucene/store/WindowsDirectory.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/misc/src/java/org/apache/lucene/store/WindowsDirectory.java (original)
+++ lucene/dev/trunk/lucene/misc/src/java/org/apache/lucene/store/WindowsDirectory.java Sat Feb 7 10:10:34 2015
@@ -38,7 +38,6 @@ import org.apache.lucene.store.Directory
* <li>Put WindowsDirectory.dll into some directory in your windows PATH
* <li>Open indexes with WindowsDirectory and use it.
* </ol>
- * </p>
* @lucene.experimental
*/
public class WindowsDirectory extends FSDirectory {
Modified: lucene/dev/trunk/lucene/queries/src/java/org/apache/lucene/queries/mlt/MoreLikeThis.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queries/src/java/org/apache/lucene/queries/mlt/MoreLikeThis.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queries/src/java/org/apache/lucene/queries/mlt/MoreLikeThis.java (original)
+++ lucene/dev/trunk/lucene/queries/src/java/org/apache/lucene/queries/mlt/MoreLikeThis.java Sat Feb 7 10:10:34 2015
@@ -49,12 +49,12 @@ import java.util.Set;
/**
* Generate "more like this" similarity queries.
* Based on this mail:
- * <code><pre>
+ * <pre><code>
* Lucene does let you access the document frequency of terms, with IndexReader.docFreq().
* Term frequencies can be computed by re-tokenizing the text, which, for a single document,
* is usually fast enough. But looking up the docFreq() of every term in the document is
* probably too slow.
- * <p/>
+ *
* You can use some heuristics to prune the set of terms, to avoid calling docFreq() too much,
* or at all. Since you're trying to maximize a tf*idf score, you're probably most interested
* in terms with a high tf. Choosing a tf threshold even as low as two or three will radically
@@ -63,44 +63,40 @@ import java.util.Set;
* number of characters, not selecting anything less than, e.g., six or seven characters.
* With these sorts of heuristics you can usually find small set of, e.g., ten or fewer terms
* that do a pretty good job of characterizing a document.
- * <p/>
+ *
* It all depends on what you're trying to do. If you're trying to eek out that last percent
* of precision and recall regardless of computational difficulty so that you can win a TREC
* competition, then the techniques I mention above are useless. But if you're trying to
* provide a "more like this" button on a search results page that does a decent job and has
* good performance, such techniques might be useful.
- * <p/>
+ *
* An efficient, effective "more-like-this" query generator would be a great contribution, if
* anyone's interested. I'd imagine that it would take a Reader or a String (the document's
* text), analyzer Analyzer, and return a set of representative terms using heuristics like those
* above. The frequency and length thresholds could be parameters, etc.
- * <p/>
+ *
* Doug
- * </pre></code>
- * <p/>
- * <p/>
- * <p/>
+ * </code></pre>
* <h3>Initial Usage</h3>
- * <p/>
+ * <p>
* This class has lots of options to try to make it efficient and flexible.
* The simplest possible usage is as follows. The bold
* fragment is specific to this class.
- * <p/>
+ * <br>
* <pre class="prettyprint">
- * <p/>
* IndexReader ir = ...
* IndexSearcher is = ...
- * <p/>
+ *
* MoreLikeThis mlt = new MoreLikeThis(ir);
* Reader target = ... // orig source of doc you want to find similarities to
* Query query = mlt.like( target);
- * <p/>
+ *
* Hits hits = is.search(query);
* // now the usual iteration thru 'hits' - the only thing to watch for is to make sure
* //you ignore the doc if it matches your 'target' document, as it should be similar to itself
- * <p/>
+ *
* </pre>
- * <p/>
+ * <p>
* Thus you:
* <ol>
* <li> do your normal, Lucene setup for searching,
@@ -109,13 +105,12 @@ import java.util.Set;
* <li> then call one of the like() calls to generate a similarity query
* <li> call the searcher to find the similar docs
* </ol>
- * <p/>
+ * <br>
* <h3>More Advanced Usage</h3>
- * <p/>
+ * <p>
* You may want to use {@link #setFieldNames setFieldNames(...)} so you can examine
* multiple fields (e.g. body and title) for similarity.
- * <p/>
- * <p/>
+ * <p>
* Depending on the size of your index and the size and makeup of your documents you
* may want to call the other set methods to control how the similarity queries are
* generated:
@@ -130,7 +125,7 @@ import java.util.Set;
* <li> {@link #setMaxNumTokensParsed setMaxNumTokensParsed(...)}
* <li> {@link #setStopWords setStopWord(...)}
* </ul>
- * <p/>
+ * <br>
* <hr>
* <pre>
* Changes: Mark Harwood 29/02/04
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/classic/QueryParserBase.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/classic/QueryParserBase.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/classic/QueryParserBase.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/classic/QueryParserBase.java Sat Feb 7 10:10:34 2015
@@ -236,7 +236,7 @@ public abstract class QueryParserBase ex
* Sets the boolean operator of the QueryParser.
* In default mode (<code>OR_OPERATOR</code>) terms without any modifiers
* are considered optional: for example <code>capital of Hungary</code> is equal to
- * <code>capital OR of OR Hungary</code>.<br/>
+ * <code>capital OR of OR Hungary</code>.<br>
* In <code>AND_OPERATOR</code> mode terms are considered to be in conjunction: the
* above mentioned query is parsed as <code>capital AND of AND Hungary</code>
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/ext/ExtendableQueryParser.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/ext/ExtendableQueryParser.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/ext/ExtendableQueryParser.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/ext/ExtendableQueryParser.java Sat Feb 7 10:10:34 2015
@@ -55,7 +55,6 @@ import org.apache.lucene.util.Version;
* <pre>
* _customExt:"Apache Lucene\?" OR _customExt:prefix\*
* </pre>
- * </p>
* <p>
* The {@link ExtendableQueryParser} itself does not implement the logic how
* field and extension key are separated or ordered. All logic regarding the
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/core/QueryParserHelper.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/core/QueryParserHelper.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/core/QueryParserHelper.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/core/QueryParserHelper.java Sat Feb 7 10:10:34 2015
@@ -25,15 +25,12 @@ import org.apache.lucene.queryparser.fle
/**
- * <p>
* This class is a helper for the query parser framework, it does all the three
* query parser phrases at once: text parsing, query processing and query
* building.
- * </p>
* <p>
* It contains methods that allows the user to change the implementation used on
* the three phases.
- * </p>
*
* @see QueryNodeProcessor
* @see SyntaxParser
@@ -221,17 +218,17 @@ public class QueryParserHelper {
}
/**
- * Parses a query string to an object, usually some query object. <br/>
- * <br/>
- * In this method the three phases are executed: <br/>
- * <br/>
+ * Parses a query string to an object, usually some query object.<br>
+ * <br>
+ * In this method the three phases are executed: <br>
+ * <br>
* 1st - the query string is parsed using the
* text parser returned by {@link #getSyntaxParser()}, the result is a query
- * node tree <br/>
- * <br/>
+ * node tree <br>
+ * <br>
* 2nd - the query node tree is processed by the
- * processor returned by {@link #getQueryNodeProcessor()} <br/>
- * <br/>
+ * processor returned by {@link #getQueryNodeProcessor()} <br>
+ * <br>
* 3th - a object is built from the query node
* tree using the builder returned by {@link #getQueryBuilder()}
*
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/core/processors/QueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/core/processors/QueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/core/processors/QueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/core/processors/QueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -22,20 +22,16 @@ import org.apache.lucene.queryparser.fle
import org.apache.lucene.queryparser.flexible.core.nodes.QueryNode;
/**
- * <p>
* A {@link QueryNodeProcessor} is an interface for classes that process a
* {@link QueryNode} tree.
* <p>
- * </p>
* The implementor of this class should perform some operation on a query node
* tree and return the same or another query node tree.
* <p>
- * </p>
* It also may carry a {@link QueryConfigHandler} object that contains
* configuration about the query represented by the query tree or the
* collection/index where it's intended to be executed.
* <p>
- * </p>
* In case there is any {@link QueryConfigHandler} associated to the query tree
* to be processed, it should be set using
* {@link QueryNodeProcessor#setQueryConfigHandler(QueryConfigHandler)} before
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/StandardQueryParser.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/StandardQueryParser.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/StandardQueryParser.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/StandardQueryParser.java Sat Feb 7 10:10:34 2015
@@ -41,30 +41,25 @@ import org.apache.lucene.search.MultiTer
import org.apache.lucene.search.Query;
/**
- * <p>
* This class is a helper that enables users to easily use the Lucene query
* parser.
- * </p>
* <p>
* To construct a Query object from a query string, use the
* {@link #parse(String, String)} method:
- * <ul>
- * StandardQueryParser queryParserHelper = new StandardQueryParser(); <br/>
+ * <pre class="prettyprint">
+ * StandardQueryParser queryParserHelper = new StandardQueryParser();
* Query query = queryParserHelper.parse("a AND b", "defaultField");
- * </ul>
+ * </pre>
* <p>
* To change any configuration before parsing the query string do, for example:
- * <p/>
- * <ul>
- * // the query config handler returned by {@link StandardQueryParser} is a
- * {@link StandardQueryConfigHandler} <br/>
- * queryParserHelper.getQueryConfigHandler().setAnalyzer(new
- * WhitespaceAnalyzer());
- * </ul>
+ * <br>
+ * <pre class="prettyprint">
+ * // the query config handler returned by {@link StandardQueryParser} is a {@link StandardQueryConfigHandler}
+ * queryParserHelper.getQueryConfigHandler().setAnalyzer(new WhitespaceAnalyzer());
+ * </pre>
* <p>
* The syntax for query strings is as follows (copied from the old QueryParser
* javadoc):
- * <ul>
* A Query is a series of clauses. A clause may be prefixed by:
* <ul>
* <li>a plus (<code>+</code>) or a minus (<code>-</code>) sign, indicating that
@@ -92,17 +87,13 @@ import org.apache.lucene.search.Query;
* href="{@docRoot}/org/apache/lucene/queryparser/classic/package-summary.html#package_description">
* query syntax documentation</a>.
* </p>
- * </ul>
* <p>
* The text parser used by this helper is a {@link StandardSyntaxParser}.
- * <p/>
* <p>
* The query node processor used by this helper is a
* {@link StandardQueryNodeProcessorPipeline}.
- * <p/>
* <p>
* The builder used by this helper is a {@link StandardQueryTreeBuilder}.
- * <p/>
*
* @see StandardQueryParser
* @see StandardQueryConfigHandler
@@ -126,10 +117,10 @@ public class StandardQueryParser extends
* Constructs a {@link StandardQueryParser} object and sets an
* {@link Analyzer} to it. The same as:
*
- * <ul>
+ * <pre class="prettyprint">
* StandardQueryParser qp = new StandardQueryParser();
* qp.getQueryConfigHandler().setAnalyzer(analyzer);
- * </ul>
+ * </pre>
*
* @param analyzer
* the analyzer to be used by this query parser helper
@@ -181,7 +172,7 @@ public class StandardQueryParser extends
* Sets the boolean operator of the QueryParser. In default mode (
* {@link Operator#OR}) terms without any modifiers are considered optional:
* for example <code>capital of Hungary</code> is equal to
- * <code>capital OR of OR Hungary</code>.<br/>
+ * <code>capital OR of OR Hungary</code>.<br>
* In {@link Operator#AND} mode terms are considered to be in conjunction: the
* above mentioned query is parsed as <code>capital AND of AND Hungary</code>
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/BooleanQueryNodeBuilder.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/BooleanQueryNodeBuilder.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/BooleanQueryNodeBuilder.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/BooleanQueryNodeBuilder.java Sat Feb 7 10:10:34 2015
@@ -36,8 +36,8 @@ import org.apache.lucene.search.BooleanQ
* Builds a {@link BooleanQuery} object from a {@link BooleanQueryNode} object.
* Every children in the {@link BooleanQueryNode} object must be already tagged
* using {@link QueryTreeBuilder#QUERY_TREE_BUILDER_TAGID} with a {@link Query}
- * object. <br/>
- * <br/>
+ * object. <br>
+ * <br>
* It takes in consideration if the children is a {@link ModifierQueryNode} to
* define the {@link BooleanClause}.
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardBooleanQueryNodeBuilder.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardBooleanQueryNodeBuilder.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardBooleanQueryNodeBuilder.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardBooleanQueryNodeBuilder.java Sat Feb 7 10:10:34 2015
@@ -37,7 +37,7 @@ import org.apache.lucene.search.similari
/**
* This builder does the same as the {@link BooleanQueryNodeBuilder}, but this
* considers if the built {@link BooleanQuery} should have its coord disabled or
- * not. <br/>
+ * not. <br>
*
* @see BooleanQueryNodeBuilder
* @see BooleanQuery
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardQueryBuilder.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardQueryBuilder.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardQueryBuilder.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardQueryBuilder.java Sat Feb 7 10:10:34 2015
@@ -25,7 +25,7 @@ import org.apache.lucene.search.Query;
/**
* This interface should be implemented by every class that wants to build
- * {@link Query} objects from {@link QueryNode} objects. <br/>
+ * {@link Query} objects from {@link QueryNode} objects.
*
* @see QueryBuilder
* @see QueryTreeBuilder
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardQueryTreeBuilder.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardQueryTreeBuilder.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardQueryTreeBuilder.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/builders/StandardQueryTreeBuilder.java Sat Feb 7 10:10:34 2015
@@ -45,7 +45,7 @@ import org.apache.lucene.search.Query;
* This query tree builder only defines the necessary map to build a
* {@link Query} tree object. It should be used to generate a {@link Query} tree
* object from a query node tree processed by a
- * {@link StandardQueryNodeProcessorPipeline}. <br/>
+ * {@link StandardQueryNodeProcessorPipeline}.
*
* @see QueryTreeBuilder
* @see StandardQueryNodeProcessorPipeline
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/config/StandardQueryConfigHandler.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/config/StandardQueryConfigHandler.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/config/StandardQueryConfigHandler.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/config/StandardQueryConfigHandler.java Sat Feb 7 10:10:34 2015
@@ -38,7 +38,7 @@ import org.apache.lucene.search.MultiTer
* This query configuration handler is used for almost every processor defined
* in the {@link StandardQueryNodeProcessorPipeline} processor pipeline. It holds
* configuration methods that reproduce the configuration methods that could be set on the old
- * lucene 2.4 QueryParser class. <br/>
+ * lucene 2.4 QueryParser class.
*
* @see StandardQueryNodeProcessorPipeline
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/nodes/BooleanModifierNode.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/nodes/BooleanModifierNode.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/nodes/BooleanModifierNode.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/nodes/BooleanModifierNode.java Sat Feb 7 10:10:34 2015
@@ -24,7 +24,7 @@ import org.apache.lucene.queryparser.fle
/**
* A {@link BooleanModifierNode} has the same behaviour as
* {@link ModifierQueryNode}, it only indicates that this modifier was added by
- * {@link BooleanQuery2ModifierNodeProcessor} and not by the user. <br/>
+ * {@link BooleanQuery2ModifierNodeProcessor} and not by the user.
*
* @see ModifierQueryNode
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/nodes/StandardBooleanQueryNode.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/nodes/StandardBooleanQueryNode.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/nodes/StandardBooleanQueryNode.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/nodes/StandardBooleanQueryNode.java Sat Feb 7 10:10:34 2015
@@ -27,7 +27,7 @@ import org.apache.lucene.search.similari
/**
* A {@link StandardBooleanQueryNode} has the same behavior as
* {@link BooleanQueryNode}. It only indicates if the coord should be enabled or
- * not for this boolean query. <br/>
+ * not for this boolean query.
*
* @see Similarity#coord(int, int)
* @see BooleanQuery
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/AllowLeadingWildcardProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/AllowLeadingWildcardProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/AllowLeadingWildcardProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/AllowLeadingWildcardProcessor.java Sat Feb 7 10:10:34 2015
@@ -35,7 +35,7 @@ import org.apache.lucene.queryparser.fle
* {@link ConfigurationKeys#ALLOW_LEADING_WILDCARD} is defined in the
* {@link QueryConfigHandler}. If it is and leading wildcard is not allowed, it
* looks for every {@link WildcardQueryNode} contained in the query node tree
- * and throws an exception if any of them has a leading wildcard ('*' or '?'). <br/>
+ * and throws an exception if any of them has a leading wildcard ('*' or '?').
*
* @see ConfigurationKeys#ALLOW_LEADING_WILDCARD
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/AnalyzerQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/AnalyzerQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/AnalyzerQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/AnalyzerQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -57,17 +57,17 @@ import org.apache.lucene.queryparser.fle
* not <code>null</code>, it looks for every {@link FieldQueryNode} that is not
* {@link WildcardQueryNode}, {@link FuzzyQueryNode} or
* {@link RangeQueryNode} contained in the query node tree, then it applies
- * the analyzer to that {@link FieldQueryNode} object. <br/>
- * <br/>
+ * the analyzer to that {@link FieldQueryNode} object. <br>
+ * <br>
* If the analyzer return only one term, the returned term is set to the
- * {@link FieldQueryNode} and it's returned. <br/>
- * <br/>
+ * {@link FieldQueryNode} and it's returned. <br>
+ * <br>
* If the analyzer return more than one term, a {@link TokenizedPhraseQueryNode}
* or {@link MultiPhraseQueryNode} is created, whether there is one or more
- * terms at the same position, and it's returned. <br/>
- * <br/>
+ * terms at the same position, and it's returned. <br>
+ * <br>
* If no term is returned by the analyzer a {@link NoTokenFoundQueryNode} object
- * is returned. <br/>
+ * is returned.
*
* @see ConfigurationKeys#ANALYZER
* @see Analyzer
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/BooleanSingleChildOptimizationQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/BooleanSingleChildOptimizationQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/BooleanSingleChildOptimizationQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/BooleanSingleChildOptimizationQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -31,7 +31,7 @@ import org.apache.lucene.queryparser.fle
* This processor removes every {@link BooleanQueryNode} that contains only one
* child and returns this child. If this child is {@link ModifierQueryNode} that
* was defined by the user. A modifier is not defined by the user when it's a
- * {@link BooleanModifierNode} <br/>
+ * {@link BooleanModifierNode}
*
* @see ModifierQueryNode
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/BoostQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/BoostQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/BoostQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/BoostQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -32,7 +32,7 @@ import org.apache.lucene.queryparser.fle
/**
* This processor iterates the query node tree looking for every
* {@link FieldableNode} that has {@link ConfigurationKeys#BOOST} in its
- * config. If there is, the boost is applied to that {@link FieldableNode}. <br/>
+ * config. If there is, the boost is applied to that {@link FieldableNode}.
*
* @see ConfigurationKeys#BOOST
* @see QueryConfigHandler
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/DefaultPhraseSlopQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/DefaultPhraseSlopQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/DefaultPhraseSlopQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/DefaultPhraseSlopQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -34,7 +34,7 @@ import org.apache.lucene.queryparser.fle
* {@link TokenizedPhraseQueryNode} and {@link MultiPhraseQueryNode} that does
* not have any {@link SlopQueryNode} applied to it and creates an
* {@link SlopQueryNode} and apply to it. The new {@link SlopQueryNode} has the
- * same slop value defined in the configuration. <br/>
+ * same slop value defined in the configuration.
*
* @see SlopQueryNode
* @see ConfigurationKeys#PHRASE_SLOP
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/FuzzyQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/FuzzyQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/FuzzyQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/FuzzyQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -34,7 +34,7 @@ import org.apache.lucene.search.FuzzyQue
* query configuration for
* {@link ConfigurationKeys#FUZZY_CONFIG}, gets the
* fuzzy prefix length and default similarity from it and set to the fuzzy node.
- * For more information about fuzzy prefix length check: {@link FuzzyQuery}. <br/>
+ * For more information about fuzzy prefix length check: {@link FuzzyQuery}.
*
* @see ConfigurationKeys#FUZZY_CONFIG
* @see FuzzyQuery
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/LowercaseExpandedTermsQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/LowercaseExpandedTermsQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/LowercaseExpandedTermsQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/LowercaseExpandedTermsQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -39,7 +39,7 @@ import org.apache.lucene.queryparser.fle
* {@link QueryConfigHandler}. If it is and the expanded terms should be
* lower-cased, it looks for every {@link WildcardQueryNode},
* {@link FuzzyQueryNode} and children of a {@link RangeQueryNode} and lower-case its
- * term. <br/>
+ * term.
*
* @see ConfigurationKeys#LOWERCASE_EXPANDED_TERMS
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/MultiFieldQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/MultiFieldQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/MultiFieldQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/MultiFieldQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -32,15 +32,15 @@ import org.apache.lucene.queryparser.fle
/**
* This processor is used to expand terms so the query looks for the same term
- * in different fields. It also boosts a query based on its field. <br/>
- * <br/>
+ * in different fields. It also boosts a query based on its field. <br>
+ * <br>
* This processor looks for every {@link FieldableNode} contained in the query
* node tree. If a {@link FieldableNode} is found, it checks if there is a
* {@link ConfigurationKeys#MULTI_FIELDS} defined in the {@link QueryConfigHandler}. If
* there is, the {@link FieldableNode} is cloned N times and the clones are
* added to a {@link BooleanQueryNode} together with the original node. N is
* defined by the number of fields that it will be expanded to. The
- * {@link BooleanQueryNode} is returned. <br/>
+ * {@link BooleanQueryNode} is returned.
*
* @see ConfigurationKeys#MULTI_FIELDS
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/NumericQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/NumericQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/NumericQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/NumericQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -46,8 +46,8 @@ import org.apache.lucene.queryparser.fle
* {@link NumericRangeQueryNode} with upper and lower inclusive and lower and
* upper equals to the value represented by the {@link FieldQueryNode} converted
* to {@link Number}. It means that <b>field:1</b> is converted to <b>field:[1
- * TO 1]</b>. <br/>
- * <br/>
+ * TO 1]</b>. <br>
+ * <br>
* Note that {@link FieldQueryNode}s children of a
* {@link RangeQueryNode} are ignored.
*
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/PhraseSlopQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/PhraseSlopQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/PhraseSlopQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/PhraseSlopQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -29,7 +29,7 @@ import org.apache.lucene.queryparser.fle
/**
* This processor removes invalid {@link SlopQueryNode} objects in the query
* node tree. A {@link SlopQueryNode} is invalid if its child is neither a
- * {@link TokenizedPhraseQueryNode} nor a {@link MultiPhraseQueryNode}. <br/>
+ * {@link TokenizedPhraseQueryNode} nor a {@link MultiPhraseQueryNode}.
*
* @see SlopQueryNode
*/
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/RemoveEmptyNonLeafQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/RemoveEmptyNonLeafQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/RemoveEmptyNonLeafQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/RemoveEmptyNonLeafQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -30,11 +30,11 @@ import org.apache.lucene.queryparser.fle
/**
* This processor removes every {@link QueryNode} that is not a leaf and has not
* children. If after processing the entire tree the root node is not a leaf and
- * has no children, a {@link MatchNoDocsQueryNode} object is returned. <br/>
- * <br/>
+ * has no children, a {@link MatchNoDocsQueryNode} object is returned.
+ * <br>
* This processor is used at the end of a pipeline to avoid invalid query node
* tree structures like a {@link GroupQueryNode} or {@link ModifierQueryNode}
- * with no children. <br/>
+ * with no children.
*
* @see QueryNode
* @see MatchNoDocsQueryNode
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/StandardQueryNodeProcessorPipeline.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/StandardQueryNodeProcessorPipeline.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/StandardQueryNodeProcessorPipeline.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/StandardQueryNodeProcessorPipeline.java Sat Feb 7 10:10:34 2015
@@ -31,15 +31,15 @@ import org.apache.lucene.search.Query;
/**
* This pipeline has all the processors needed to process a query node tree,
- * generated by {@link StandardSyntaxParser}, already assembled. <br/>
- * <br/>
- * The order they are assembled affects the results. <br/>
- * <br/>
+ * generated by {@link StandardSyntaxParser}, already assembled. <br>
+ * <br>
+ * The order they are assembled affects the results. <br>
+ * <br>
* This processor pipeline was designed to work with
- * {@link StandardQueryConfigHandler}. <br/>
- * <br/>
+ * {@link StandardQueryConfigHandler}. <br>
+ * <br>
* The result query node tree can be used to build a {@link Query} object using
- * {@link StandardQueryTreeBuilder}. <br/>
+ * {@link StandardQueryTreeBuilder}.
*
* @see StandardQueryTreeBuilder
* @see StandardQueryConfigHandler
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/TermRangeQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/TermRangeQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/TermRangeQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/TermRangeQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -40,16 +40,15 @@ import org.apache.lucene.queryparser.fle
* upper bounds value from the {@link TermRangeQueryNode} object and try
* to parse their values using a {@link DateFormat}. If the values cannot be
* parsed to a date value, it will only create the {@link TermRangeQueryNode}
- * using the non-parsed values. <br/>
- * <br/>
+ * using the non-parsed values. <br>
+ * <br>
* If a {@link ConfigurationKeys#LOCALE} is defined in the
* {@link QueryConfigHandler} it will be used to parse the date, otherwise
- * {@link Locale#getDefault()} will be used. <br/>
- * <br/>
+ * {@link Locale#getDefault()} will be used. <br>
+ * <br>
* If a {@link ConfigurationKeys#DATE_RESOLUTION} is defined and the
* {@link Resolution} is not <code>null</code> it will also be used to parse the
- * date value. <br/>
- * <br/>
+ * date value.
*
* @see ConfigurationKeys#DATE_RESOLUTION
* @see ConfigurationKeys#LOCALE
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/WildcardQueryNodeProcessor.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/WildcardQueryNodeProcessor.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/WildcardQueryNodeProcessor.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/flexible/standard/processors/WildcardQueryNodeProcessor.java Sat Feb 7 10:10:34 2015
@@ -37,7 +37,7 @@ import org.apache.lucene.search.PrefixQu
* have values containing the prefixed wildcard. However, Lucene
* {@link PrefixQuery} cannot contain the prefixed wildcard. So, this processor
* basically removed the prefixed wildcard from the
- * {@link PrefixWildcardQueryNode} value. <br/>
+ * {@link PrefixWildcardQueryNode} value.
*
* @see PrefixQuery
* @see PrefixWildcardQueryNode
Modified: lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/xml/builders/CachedFilterBuilder.java
URL: http://svn.apache.org/viewvc/lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/xml/builders/CachedFilterBuilder.java?rev=1658040&r1=1658039&r2=1658040&view=diff
==============================================================================
--- lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/xml/builders/CachedFilterBuilder.java (original)
+++ lucene/dev/trunk/lucene/queryparser/src/java/org/apache/lucene/queryparser/xml/builders/CachedFilterBuilder.java Sat Feb 7 10:10:34 2015
@@ -36,10 +36,10 @@ import java.util.Map;
* A good example of this might be a term query on a field with only 2 possible values -
* "true" or "false". In a large index, querying or filtering on this field requires reading
* millions of document ids from disk which can more usefully be cached as a filter bitset.
- * <p/>
+ * <p>
* For Queries/Filters to be cached and reused the object must implement hashcode and
* equals methods correctly so that duplicate queries/filters can be detected in the cache.
- * <p/>
+ * <p>
* The CoreParser.maxNumCachedFilters property can be used to control the size of the LRU
* Cache established during the construction of CoreParser instances.
*/