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 2014/03/12 19:14:27 UTC
svn commit: r1576837 [7/29] - in /lucene/dev/branches/branch_4x: ./ lucene/
lucene/analysis/
lucene/analysis/common/src/java/org/apache/lucene/analysis/charfilter/
lucene/analysis/common/src/java/org/apache/lucene/analysis/compound/
lucene/analysis/com...
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/NumericRangeFilter.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/NumericRangeFilter.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/NumericRangeFilter.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/NumericRangeFilter.java Wed Mar 12 18:14:05 2014
@@ -61,7 +61,7 @@ public final class NumericRangeFilter<T
public static NumericRangeFilter<Long> newLongRange(final String field, final int precisionStep,
Long min, Long max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeFilter<Long>(
+ return new NumericRangeFilter<>(
NumericRangeQuery.newLongRange(field, precisionStep, min, max, minInclusive, maxInclusive)
);
}
@@ -76,7 +76,7 @@ public final class NumericRangeFilter<T
public static NumericRangeFilter<Long> newLongRange(final String field,
Long min, Long max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeFilter<Long>(
+ return new NumericRangeFilter<>(
NumericRangeQuery.newLongRange(field, min, max, minInclusive, maxInclusive)
);
}
@@ -91,7 +91,7 @@ public final class NumericRangeFilter<T
public static NumericRangeFilter<Integer> newIntRange(final String field, final int precisionStep,
Integer min, Integer max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeFilter<Integer>(
+ return new NumericRangeFilter<>(
NumericRangeQuery.newIntRange(field, precisionStep, min, max, minInclusive, maxInclusive)
);
}
@@ -106,7 +106,7 @@ public final class NumericRangeFilter<T
public static NumericRangeFilter<Integer> newIntRange(final String field,
Integer min, Integer max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeFilter<Integer>(
+ return new NumericRangeFilter<>(
NumericRangeQuery.newIntRange(field, min, max, minInclusive, maxInclusive)
);
}
@@ -123,7 +123,7 @@ public final class NumericRangeFilter<T
public static NumericRangeFilter<Double> newDoubleRange(final String field, final int precisionStep,
Double min, Double max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeFilter<Double>(
+ return new NumericRangeFilter<>(
NumericRangeQuery.newDoubleRange(field, precisionStep, min, max, minInclusive, maxInclusive)
);
}
@@ -140,7 +140,7 @@ public final class NumericRangeFilter<T
public static NumericRangeFilter<Double> newDoubleRange(final String field,
Double min, Double max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeFilter<Double>(
+ return new NumericRangeFilter<>(
NumericRangeQuery.newDoubleRange(field, min, max, minInclusive, maxInclusive)
);
}
@@ -157,7 +157,7 @@ public final class NumericRangeFilter<T
public static NumericRangeFilter<Float> newFloatRange(final String field, final int precisionStep,
Float min, Float max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeFilter<Float>(
+ return new NumericRangeFilter<>(
NumericRangeQuery.newFloatRange(field, precisionStep, min, max, minInclusive, maxInclusive)
);
}
@@ -174,7 +174,7 @@ public final class NumericRangeFilter<T
public static NumericRangeFilter<Float> newFloatRange(final String field,
Float min, Float max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeFilter<Float>(
+ return new NumericRangeFilter<>(
NumericRangeQuery.newFloatRange(field, min, max, minInclusive, maxInclusive)
);
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/NumericRangeQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/NumericRangeQuery.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/NumericRangeQuery.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/NumericRangeQuery.java Wed Mar 12 18:14:05 2014
@@ -192,7 +192,7 @@ public final class NumericRangeQuery<T e
public static NumericRangeQuery<Long> newLongRange(final String field, final int precisionStep,
Long min, Long max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeQuery<Long>(field, precisionStep, NumericType.LONG, min, max, minInclusive, maxInclusive);
+ return new NumericRangeQuery<>(field, precisionStep, NumericType.LONG, min, max, minInclusive, maxInclusive);
}
/**
@@ -205,7 +205,7 @@ public final class NumericRangeQuery<T e
public static NumericRangeQuery<Long> newLongRange(final String field,
Long min, Long max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeQuery<Long>(field, NumericUtils.PRECISION_STEP_DEFAULT, NumericType.LONG, min, max, minInclusive, maxInclusive);
+ return new NumericRangeQuery<>(field, NumericUtils.PRECISION_STEP_DEFAULT, NumericType.LONG, min, max, minInclusive, maxInclusive);
}
/**
@@ -218,7 +218,7 @@ public final class NumericRangeQuery<T e
public static NumericRangeQuery<Integer> newIntRange(final String field, final int precisionStep,
Integer min, Integer max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeQuery<Integer>(field, precisionStep, NumericType.INT, min, max, minInclusive, maxInclusive);
+ return new NumericRangeQuery<>(field, precisionStep, NumericType.INT, min, max, minInclusive, maxInclusive);
}
/**
@@ -231,7 +231,7 @@ public final class NumericRangeQuery<T e
public static NumericRangeQuery<Integer> newIntRange(final String field,
Integer min, Integer max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeQuery<Integer>(field, NumericUtils.PRECISION_STEP_DEFAULT, NumericType.INT, min, max, minInclusive, maxInclusive);
+ return new NumericRangeQuery<>(field, NumericUtils.PRECISION_STEP_DEFAULT, NumericType.INT, min, max, minInclusive, maxInclusive);
}
/**
@@ -246,7 +246,7 @@ public final class NumericRangeQuery<T e
public static NumericRangeQuery<Double> newDoubleRange(final String field, final int precisionStep,
Double min, Double max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeQuery<Double>(field, precisionStep, NumericType.DOUBLE, min, max, minInclusive, maxInclusive);
+ return new NumericRangeQuery<>(field, precisionStep, NumericType.DOUBLE, min, max, minInclusive, maxInclusive);
}
/**
@@ -261,7 +261,7 @@ public final class NumericRangeQuery<T e
public static NumericRangeQuery<Double> newDoubleRange(final String field,
Double min, Double max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeQuery<Double>(field, NumericUtils.PRECISION_STEP_DEFAULT, NumericType.DOUBLE, min, max, minInclusive, maxInclusive);
+ return new NumericRangeQuery<>(field, NumericUtils.PRECISION_STEP_DEFAULT, NumericType.DOUBLE, min, max, minInclusive, maxInclusive);
}
/**
@@ -276,7 +276,7 @@ public final class NumericRangeQuery<T e
public static NumericRangeQuery<Float> newFloatRange(final String field, final int precisionStep,
Float min, Float max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeQuery<Float>(field, precisionStep, NumericType.FLOAT, min, max, minInclusive, maxInclusive);
+ return new NumericRangeQuery<>(field, precisionStep, NumericType.FLOAT, min, max, minInclusive, maxInclusive);
}
/**
@@ -291,7 +291,7 @@ public final class NumericRangeQuery<T e
public static NumericRangeQuery<Float> newFloatRange(final String field,
Float min, Float max, final boolean minInclusive, final boolean maxInclusive
) {
- return new NumericRangeQuery<Float>(field, NumericUtils.PRECISION_STEP_DEFAULT, NumericType.FLOAT, min, max, minInclusive, maxInclusive);
+ return new NumericRangeQuery<>(field, NumericUtils.PRECISION_STEP_DEFAULT, NumericType.FLOAT, min, max, minInclusive, maxInclusive);
}
@Override @SuppressWarnings("unchecked")
@@ -391,7 +391,7 @@ public final class NumericRangeQuery<T e
private BytesRef currentLowerBound, currentUpperBound;
- private final LinkedList<BytesRef> rangeBounds = new LinkedList<BytesRef>();
+ private final LinkedList<BytesRef> rangeBounds = new LinkedList<>();
private final Comparator<BytesRef> termComp;
NumericRangeTermsEnum(final TermsEnum tenum) {
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/PhraseQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/PhraseQuery.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/PhraseQuery.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/PhraseQuery.java Wed Mar 12 18:14:05 2014
@@ -46,8 +46,8 @@ import org.apache.lucene.util.ToStringUt
*/
public class PhraseQuery extends Query {
private String field;
- private ArrayList<Term> terms = new ArrayList<Term>(4);
- private ArrayList<Integer> positions = new ArrayList<Integer>(4);
+ private ArrayList<Term> terms = new ArrayList<>(4);
+ private ArrayList<Integer> positions = new ArrayList<>(4);
private int maxPosition = 0;
private int slop = 0;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/ReferenceManager.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/ReferenceManager.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/ReferenceManager.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/ReferenceManager.java Wed Mar 12 18:14:05 2014
@@ -47,7 +47,7 @@ public abstract class ReferenceManager<G
private final Lock refreshLock = new ReentrantLock();
- private final List<RefreshListener> refreshListeners = new CopyOnWriteArrayList<RefreshListener>();
+ private final List<RefreshListener> refreshListeners = new CopyOnWriteArrayList<>();
private void ensureOpen() {
if (current == null) {
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/ReqOptSumScorer.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/ReqOptSumScorer.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/ReqOptSumScorer.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/ReqOptSumScorer.java Wed Mar 12 18:14:05 2014
@@ -94,7 +94,7 @@ class ReqOptSumScorer extends Scorer {
@Override
public Collection<ChildScorer> getChildren() {
- ArrayList<ChildScorer> children = new ArrayList<ChildScorer>(2);
+ ArrayList<ChildScorer> children = new ArrayList<>(2);
children.add(new ChildScorer(reqScorer, "MUST"));
children.add(new ChildScorer(optScorer, "SHOULD"));
return children;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/SearcherLifetimeManager.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/SearcherLifetimeManager.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/SearcherLifetimeManager.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/SearcherLifetimeManager.java Wed Mar 12 18:14:05 2014
@@ -132,7 +132,7 @@ public class SearcherLifetimeManager imp
// TODO: we could get by w/ just a "set"; need to have
// Tracker hash by its version and have compareTo(Long)
// compare to its version
- private final ConcurrentHashMap<Long,SearcherTracker> searchers = new ConcurrentHashMap<Long,SearcherTracker>();
+ private final ConcurrentHashMap<Long,SearcherTracker> searchers = new ConcurrentHashMap<>();
private void ensureOpen() {
if (closed) {
@@ -246,7 +246,7 @@ public class SearcherLifetimeManager imp
// (not thread-safe since the values can change while
// ArrayList is init'ing itself); must instead iterate
// ourselves:
- final List<SearcherTracker> trackers = new ArrayList<SearcherTracker>();
+ final List<SearcherTracker> trackers = new ArrayList<>();
for(SearcherTracker tracker : searchers.values()) {
trackers.add(tracker);
}
@@ -285,7 +285,7 @@ public class SearcherLifetimeManager imp
@Override
public synchronized void close() throws IOException {
closed = true;
- final List<SearcherTracker> toClose = new ArrayList<SearcherTracker>(searchers.values());
+ final List<SearcherTracker> toClose = new ArrayList<>(searchers.values());
// Remove up front in case exc below, so we don't
// over-decRef on double-close:
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/SloppyPhraseScorer.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/SloppyPhraseScorer.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/SloppyPhraseScorer.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/SloppyPhraseScorer.java Wed Mar 12 18:14:05 2014
@@ -379,7 +379,7 @@ final class SloppyPhraseScorer extends S
/** Detect repetition groups. Done once - for first doc */
private ArrayList<ArrayList<PhrasePositions>> gatherRptGroups(LinkedHashMap<Term,Integer> rptTerms) throws IOException {
PhrasePositions[] rpp = repeatingPPs(rptTerms);
- ArrayList<ArrayList<PhrasePositions>> res = new ArrayList<ArrayList<PhrasePositions>>();
+ ArrayList<ArrayList<PhrasePositions>> res = new ArrayList<>();
if (!hasMultiTermRpts) {
// simpler - no multi-terms - can base on positions in first doc
for (int i=0; i<rpp.length; i++) {
@@ -399,7 +399,7 @@ final class SloppyPhraseScorer extends S
if (g < 0) {
g = res.size();
pp.rptGroup = g;
- ArrayList<PhrasePositions> rl = new ArrayList<PhrasePositions>(2);
+ ArrayList<PhrasePositions> rl = new ArrayList<>(2);
rl.add(pp);
res.add(rl);
}
@@ -409,11 +409,11 @@ final class SloppyPhraseScorer extends S
}
} else {
// more involved - has multi-terms
- ArrayList<HashSet<PhrasePositions>> tmp = new ArrayList<HashSet<PhrasePositions>>();
+ ArrayList<HashSet<PhrasePositions>> tmp = new ArrayList<>();
ArrayList<FixedBitSet> bb = ppTermsBitSets(rpp, rptTerms);
unionTermGroups(bb);
HashMap<Term,Integer> tg = termGroups(rptTerms, bb);
- HashSet<Integer> distinctGroupIDs = new HashSet<Integer>(tg.values());
+ HashSet<Integer> distinctGroupIDs = new HashSet<>(tg.values());
for (int i=0; i<distinctGroupIDs.size(); i++) {
tmp.add(new HashSet<PhrasePositions>());
}
@@ -428,7 +428,7 @@ final class SloppyPhraseScorer extends S
}
}
for (HashSet<PhrasePositions> hs : tmp) {
- res.add(new ArrayList<PhrasePositions>(hs));
+ res.add(new ArrayList<>(hs));
}
}
return res;
@@ -441,8 +441,8 @@ final class SloppyPhraseScorer extends S
/** find repeating terms and assign them ordinal values */
private LinkedHashMap<Term,Integer> repeatingTerms() {
- LinkedHashMap<Term,Integer> tord = new LinkedHashMap<Term,Integer>();
- HashMap<Term,Integer> tcnt = new HashMap<Term,Integer>();
+ LinkedHashMap<Term,Integer> tord = new LinkedHashMap<>();
+ HashMap<Term,Integer> tcnt = new HashMap<>();
for (PhrasePositions pp=min,prev=null; prev!=max; pp=(prev=pp).next) { // iterate cyclic list: done once handled max
for (Term t : pp.terms) {
Integer cnt0 = tcnt.get(t);
@@ -458,7 +458,7 @@ final class SloppyPhraseScorer extends S
/** find repeating pps, and for each, if has multi-terms, update this.hasMultiTermRpts */
private PhrasePositions[] repeatingPPs(HashMap<Term,Integer> rptTerms) {
- ArrayList<PhrasePositions> rp = new ArrayList<PhrasePositions>();
+ ArrayList<PhrasePositions> rp = new ArrayList<>();
for (PhrasePositions pp=min,prev=null; prev!=max; pp=(prev=pp).next) { // iterate cyclic list: done once handled max
for (Term t : pp.terms) {
if (rptTerms.containsKey(t)) {
@@ -473,7 +473,7 @@ final class SloppyPhraseScorer extends S
/** bit-sets - for each repeating pp, for each of its repeating terms, the term ordinal values is set */
private ArrayList<FixedBitSet> ppTermsBitSets(PhrasePositions[] rpp, HashMap<Term,Integer> tord) {
- ArrayList<FixedBitSet> bb = new ArrayList<FixedBitSet>(rpp.length);
+ ArrayList<FixedBitSet> bb = new ArrayList<>(rpp.length);
for (PhrasePositions pp : rpp) {
FixedBitSet b = new FixedBitSet(tord.size());
Integer ord;
@@ -507,7 +507,7 @@ final class SloppyPhraseScorer extends S
/** map each term to the single group that contains it */
private HashMap<Term,Integer> termGroups(LinkedHashMap<Term,Integer> tord, ArrayList<FixedBitSet> bb) throws IOException {
- HashMap<Term,Integer> tg = new HashMap<Term,Integer>();
+ HashMap<Term,Integer> tg = new HashMap<>();
Term[] t = tord.keySet().toArray(new Term[0]);
for (int i=0; i<bb.size(); i++) { // i is the group no.
DocIdSetIterator bits = bb.get(i).iterator();
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/TopTermsRewrite.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/TopTermsRewrite.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/TopTermsRewrite.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/TopTermsRewrite.java Wed Mar 12 18:14:05 2014
@@ -62,12 +62,12 @@ public abstract class TopTermsRewrite<Q
@Override
public final Q rewrite(final IndexReader reader, final MultiTermQuery query) throws IOException {
final int maxSize = Math.min(size, getMaxSize());
- final PriorityQueue<ScoreTerm> stQueue = new PriorityQueue<ScoreTerm>();
+ final PriorityQueue<ScoreTerm> stQueue = new PriorityQueue<>();
collectTerms(reader, query, new TermCollector() {
private final MaxNonCompetitiveBoostAttribute maxBoostAtt =
attributes.addAttribute(MaxNonCompetitiveBoostAttribute.class);
- private final Map<BytesRef,ScoreTerm> visitedTerms = new HashMap<BytesRef,ScoreTerm>();
+ private final Map<BytesRef,ScoreTerm> visitedTerms = new HashMap<>();
private TermsEnum termsEnum;
private Comparator<BytesRef> termComp;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/WildcardQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/WildcardQuery.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/WildcardQuery.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/WildcardQuery.java Wed Mar 12 18:14:05 2014
@@ -63,7 +63,7 @@ public class WildcardQuery extends Autom
*/
@SuppressWarnings("fallthrough")
public static Automaton toAutomaton(Term wildcardquery) {
- List<Automaton> automata = new ArrayList<Automaton>();
+ List<Automaton> automata = new ArrayList<>();
String wildcardText = wildcardquery.text();
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/payloads/PayloadSpanUtil.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/payloads/PayloadSpanUtil.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/payloads/PayloadSpanUtil.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/payloads/PayloadSpanUtil.java Wed Mar 12 18:14:05 2014
@@ -74,7 +74,7 @@ public class PayloadSpanUtil {
* @throws IOException if there is a low-level I/O error
*/
public Collection<byte[]> getPayloadsForQuery(Query query) throws IOException {
- Collection<byte[]> payloads = new ArrayList<byte[]>();
+ Collection<byte[]> payloads = new ArrayList<>();
queryToSpanQuery(query, payloads);
return payloads;
}
@@ -143,7 +143,7 @@ public class PayloadSpanUtil {
final Term[] termArray = termArrays.get(i);
List<Query> disjuncts = disjunctLists[positions[i]];
if (disjuncts == null) {
- disjuncts = (disjunctLists[positions[i]] = new ArrayList<Query>(
+ disjuncts = (disjunctLists[positions[i]] = new ArrayList<>(
termArray.length));
++distinctPositions;
}
@@ -178,8 +178,8 @@ public class PayloadSpanUtil {
private void getPayloads(Collection<byte []> payloads, SpanQuery query)
throws IOException {
- Map<Term,TermContext> termContexts = new HashMap<Term,TermContext>();
- TreeSet<Term> terms = new TreeSet<Term>();
+ Map<Term,TermContext> termContexts = new HashMap<>();
+ TreeSet<Term> terms = new TreeSet<>();
query.extractTerms(terms);
for (Term term : terms) {
termContexts.put(term, TermContext.build(context, term));
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/NearSpansOrdered.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/NearSpansOrdered.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/NearSpansOrdered.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/NearSpansOrdered.java Wed Mar 12 18:14:05 2014
@@ -103,7 +103,7 @@ public class NearSpansOrdered extends Sp
allowedSlop = spanNearQuery.getSlop();
SpanQuery[] clauses = spanNearQuery.getClauses();
subSpans = new Spans[clauses.length];
- matchPayload = new LinkedList<byte[]>();
+ matchPayload = new LinkedList<>();
subSpansByDoc = new Spans[clauses.length];
for (int i = 0; i < clauses.length; i++) {
subSpans[i] = clauses[i].getSpans(context, acceptDocs, termContexts);
@@ -282,7 +282,7 @@ public class NearSpansOrdered extends Sp
private boolean shrinkToAfterShortestMatch() throws IOException {
matchStart = subSpans[subSpans.length - 1].start();
matchEnd = subSpans[subSpans.length - 1].end();
- Set<byte[]> possibleMatchPayloads = new HashSet<byte[]>();
+ Set<byte[]> possibleMatchPayloads = new HashSet<>();
if (subSpans[subSpans.length - 1].isPayloadAvailable()) {
possibleMatchPayloads.addAll(subSpans[subSpans.length - 1].getPayload());
}
@@ -296,7 +296,7 @@ public class NearSpansOrdered extends Sp
Spans prevSpans = subSpans[i];
if (collectPayloads && prevSpans.isPayloadAvailable()) {
Collection<byte[]> payload = prevSpans.getPayload();
- possiblePayload = new ArrayList<byte[]>(payload.size());
+ possiblePayload = new ArrayList<>(payload.size());
possiblePayload.addAll(payload);
}
@@ -320,7 +320,7 @@ public class NearSpansOrdered extends Sp
prevEnd = ppEnd;
if (collectPayloads && prevSpans.isPayloadAvailable()) {
Collection<byte[]> payload = prevSpans.getPayload();
- possiblePayload = new ArrayList<byte[]>(payload.size());
+ possiblePayload = new ArrayList<>(payload.size());
possiblePayload.addAll(payload);
}
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/NearSpansUnordered.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/NearSpansUnordered.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/NearSpansUnordered.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/NearSpansUnordered.java Wed Mar 12 18:14:05 2014
@@ -40,7 +40,7 @@ import java.util.HashSet;
public class NearSpansUnordered extends Spans {
private SpanNearQuery query;
- private List<SpansCell> ordered = new ArrayList<SpansCell>(); // spans in query order
+ private List<SpansCell> ordered = new ArrayList<>(); // spans in query order
private Spans[] subSpans;
private int slop; // from query
@@ -121,7 +121,7 @@ public class NearSpansUnordered extends
// TODO: Remove warning after API has been finalized
@Override
public Collection<byte[]> getPayload() throws IOException {
- return new ArrayList<byte[]>(spans.getPayload());
+ return new ArrayList<>(spans.getPayload());
}
// TODO: Remove warning after API has been finalized
@@ -250,7 +250,7 @@ public class NearSpansUnordered extends
*/
@Override
public Collection<byte[]> getPayload() throws IOException {
- Set<byte[]> matchPayload = new HashSet<byte[]>();
+ Set<byte[]> matchPayload = new HashSet<>();
for (SpansCell cell = first; cell != null; cell = cell.next) {
if (cell.isPayloadAvailable()) {
matchPayload.addAll(cell.getPayload());
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanNearQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanNearQuery.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanNearQuery.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanNearQuery.java Wed Mar 12 18:14:05 2014
@@ -61,7 +61,7 @@ public class SpanNearQuery extends SpanQ
public SpanNearQuery(SpanQuery[] clauses, int slop, boolean inOrder, boolean collectPayloads) {
// copy clauses array into an ArrayList
- this.clauses = new ArrayList<SpanQuery>(clauses.length);
+ this.clauses = new ArrayList<>(clauses.length);
for (int i = 0; i < clauses.length; i++) {
SpanQuery clause = clauses[i];
if (field == null) { // check field
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanNotQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanNotQuery.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanNotQuery.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanNotQuery.java Wed Mar 12 18:14:05 2014
@@ -175,7 +175,7 @@ public class SpanNotQuery extends SpanQu
public Collection<byte[]> getPayload() throws IOException {
ArrayList<byte[]> result = null;
if (includeSpans.isPayloadAvailable()) {
- result = new ArrayList<byte[]>(includeSpans.getPayload());
+ result = new ArrayList<>(includeSpans.getPayload());
}
return result;
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanOrQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanOrQuery.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanOrQuery.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanOrQuery.java Wed Mar 12 18:14:05 2014
@@ -44,7 +44,7 @@ public class SpanOrQuery extends SpanQue
public SpanOrQuery(SpanQuery... clauses) {
// copy clauses array into an ArrayList
- this.clauses = new ArrayList<SpanQuery>(clauses.length);
+ this.clauses = new ArrayList<>(clauses.length);
for (int i = 0; i < clauses.length; i++) {
addClause(clauses[i]);
}
@@ -242,7 +242,7 @@ public class SpanOrQuery extends SpanQue
ArrayList<byte[]> result = null;
Spans theTop = top();
if (theTop != null && theTop.isPayloadAvailable()) {
- result = new ArrayList<byte[]>(theTop.getPayload());
+ result = new ArrayList<>(theTop.getPayload());
}
return result;
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanPositionCheckQuery.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanPositionCheckQuery.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanPositionCheckQuery.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanPositionCheckQuery.java Wed Mar 12 18:14:05 2014
@@ -169,7 +169,7 @@ public abstract class SpanPositionCheckQ
public Collection<byte[]> getPayload() throws IOException {
ArrayList<byte[]> result = null;
if (spans.isPayloadAvailable()) {
- result = new ArrayList<byte[]>(spans.getPayload());
+ result = new ArrayList<>(spans.getPayload());
}
return result;//TODO: any way to avoid the new construction?
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanWeight.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanWeight.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanWeight.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/search/spans/SpanWeight.java Wed Mar 12 18:14:05 2014
@@ -45,8 +45,8 @@ public class SpanWeight extends Weight {
this.similarity = searcher.getSimilarity();
this.query = query;
- termContexts = new HashMap<Term,TermContext>();
- TreeSet<Term> terms = new TreeSet<Term>();
+ termContexts = new HashMap<>();
+ TreeSet<Term> terms = new TreeSet<>();
query.extractTerms(terms);
final IndexReaderContext context = searcher.getTopReaderContext();
final TermStatistics termStats[] = new TermStatistics[terms.size()];
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/CompoundFileDirectory.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/CompoundFileDirectory.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/CompoundFileDirectory.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/CompoundFileDirectory.java Wed Mar 12 18:14:05 2014
@@ -155,7 +155,7 @@ public final class CompoundFileDirectory
entriesStream = dir.openInput(entriesFileName, IOContext.READONCE);
CodecUtil.checkHeader(entriesStream, CompoundFileWriter.ENTRY_CODEC, CompoundFileWriter.VERSION_START, CompoundFileWriter.VERSION_START);
final int numEntries = entriesStream.readVInt();
- mapping = new HashMap<String,FileEntry>(numEntries);
+ mapping = new HashMap<>(numEntries);
for (int i = 0; i < numEntries; i++) {
final FileEntry fileEntry = new FileEntry();
final String id = entriesStream.readString();
@@ -182,7 +182,7 @@ public final class CompoundFileDirectory
private static Map<String, FileEntry> readLegacyEntries(IndexInput stream,
int firstInt) throws CorruptIndexException, IOException {
- final Map<String,FileEntry> entries = new HashMap<String,FileEntry>();
+ final Map<String,FileEntry> entries = new HashMap<>();
final int count;
final boolean stripSegmentName;
if (firstInt < CompoundFileWriter.FORMAT_PRE_VERSION) {
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/CompoundFileWriter.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/CompoundFileWriter.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/CompoundFileWriter.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/CompoundFileWriter.java Wed Mar 12 18:14:05 2014
@@ -66,10 +66,10 @@ final class CompoundFileWriter implement
static final String ENTRY_CODEC = "CompoundFileWriterEntries";
private final Directory directory;
- private final Map<String, FileEntry> entries = new HashMap<String, FileEntry>();
- private final Set<String> seenIDs = new HashSet<String>();
+ private final Map<String, FileEntry> entries = new HashMap<>();
+ private final Set<String> seenIDs = new HashSet<>();
// all entries that are written to a sep. file but not yet moved into CFS
- private final Queue<FileEntry> pendingEntries = new LinkedList<FileEntry>();
+ private final Queue<FileEntry> pendingEntries = new LinkedList<>();
private boolean closed = false;
private IndexOutput dataOut;
private final AtomicBoolean outputTaken = new AtomicBoolean(false);
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/DataInput.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/DataInput.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/DataInput.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/DataInput.java Wed Mar 12 18:14:05 2014
@@ -212,7 +212,7 @@ public abstract class DataInput implemen
/** Reads a Map<String,String> previously written
* with {@link DataOutput#writeStringStringMap(Map)}. */
public Map<String,String> readStringStringMap() throws IOException {
- final Map<String,String> map = new HashMap<String,String>();
+ final Map<String,String> map = new HashMap<>();
final int count = readInt();
for(int i=0;i<count;i++) {
final String key = readString();
@@ -226,7 +226,7 @@ public abstract class DataInput implemen
/** Reads a Set<String> previously written
* with {@link DataOutput#writeStringSet(Set)}. */
public Set<String> readStringSet() throws IOException {
- final Set<String> set = new HashSet<String>();
+ final Set<String> set = new HashSet<>();
final int count = readInt();
for(int i=0;i<count;i++) {
set.add(readString());
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/FSDirectory.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/FSDirectory.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/FSDirectory.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/FSDirectory.java Wed Mar 12 18:14:05 2014
@@ -300,7 +300,7 @@ public abstract class FSDirectory extend
@Override
public void sync(Collection<String> names) throws IOException {
ensureOpen();
- Set<String> toSync = new HashSet<String>(names);
+ Set<String> toSync = new HashSet<>(names);
toSync.retainAll(staleFiles);
for (String name : toSync)
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/FileSwitchDirectory.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/FileSwitchDirectory.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/FileSwitchDirectory.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/FileSwitchDirectory.java Wed Mar 12 18:14:05 2014
@@ -77,7 +77,7 @@ public class FileSwitchDirectory extends
@Override
public String[] listAll() throws IOException {
- Set<String> files = new HashSet<String>();
+ Set<String> files = new HashSet<>();
// LUCENE-3380: either or both of our dirs could be FSDirs,
// but if one underlying delegate is an FSDir and mkdirs() has not
// yet been called, because so far everything is written to the other,
@@ -154,8 +154,8 @@ public class FileSwitchDirectory extends
@Override
public void sync(Collection<String> names) throws IOException {
- List<String> primaryNames = new ArrayList<String>();
- List<String> secondaryNames = new ArrayList<String>();
+ List<String> primaryNames = new ArrayList<>();
+ List<String> secondaryNames = new ArrayList<>();
for (String name : names)
if (primaryExtensions.contains(getExtension(name)))
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/NRTCachingDirectory.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/NRTCachingDirectory.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/NRTCachingDirectory.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/NRTCachingDirectory.java Wed Mar 12 18:14:05 2014
@@ -121,7 +121,7 @@ public class NRTCachingDirectory extends
@Override
public synchronized String[] listAll() throws IOException {
- final Set<String> files = new HashSet<String>();
+ final Set<String> files = new HashSet<>();
for(String f : cache.listAll()) {
files.add(f);
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/NativeFSLockFactory.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/NativeFSLockFactory.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/NativeFSLockFactory.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/NativeFSLockFactory.java Wed Mar 12 18:14:05 2014
@@ -146,7 +146,7 @@ class NativeFSLock extends Lock {
* (same FileChannel instance or not), so we may want to
* change this when Lucene moves to Java 1.6.
*/
- private static HashSet<String> LOCK_HELD = new HashSet<String>();
+ private static HashSet<String> LOCK_HELD = new HashSet<>();
public NativeFSLock(File lockDir, String lockFileName) {
this.lockDir = lockDir;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/RAMDirectory.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/RAMDirectory.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/RAMDirectory.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/RAMDirectory.java Wed Mar 12 18:14:05 2014
@@ -46,7 +46,7 @@ import java.util.concurrent.atomic.Atomi
* operating system, so copying data to Java heap space is not useful.
*/
public class RAMDirectory extends BaseDirectory {
- protected final Map<String,RAMFile> fileMap = new ConcurrentHashMap<String,RAMFile>();
+ protected final Map<String,RAMFile> fileMap = new ConcurrentHashMap<>();
protected final AtomicLong sizeInBytes = new AtomicLong();
// *****
@@ -113,7 +113,7 @@ public class RAMDirectory extends BaseDi
// NOTE: fileMap.keySet().toArray(new String[0]) is broken in non Sun JDKs,
// and the code below is resilient to map changes during the array population.
Set<String> fileNames = fileMap.keySet();
- List<String> names = new ArrayList<String>(fileNames.size());
+ List<String> names = new ArrayList<>(fileNames.size());
for (String name : fileNames) names.add(name);
return names.toArray(new String[names.size()]);
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/RAMFile.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/RAMFile.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/RAMFile.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/RAMFile.java Wed Mar 12 18:14:05 2014
@@ -23,7 +23,7 @@ import java.util.ArrayList;
* Represents a file in RAM as a list of byte[] buffers.
* @lucene.internal */
public class RAMFile {
- protected ArrayList<byte[]> buffers = new ArrayList<byte[]>();
+ protected ArrayList<byte[]> buffers = new ArrayList<>();
long length;
RAMDirectory directory;
protected long sizeInBytes;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/SingleInstanceLockFactory.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/SingleInstanceLockFactory.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/SingleInstanceLockFactory.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/store/SingleInstanceLockFactory.java Wed Mar 12 18:14:05 2014
@@ -33,7 +33,7 @@ import java.util.HashSet;
public class SingleInstanceLockFactory extends LockFactory {
- private HashSet<String> locks = new HashSet<String>();
+ private HashSet<String> locks = new HashSet<>();
@Override
public Lock makeLock(String lockName) {
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/ArrayUtil.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/ArrayUtil.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/ArrayUtil.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/ArrayUtil.java Wed Mar 12 18:14:05 2014
@@ -647,7 +647,7 @@ public final class ArrayUtil {
*/
public static <T> void introSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> comp) {
if (toIndex-fromIndex <= 1) return;
- new ArrayIntroSorter<T>(a, comp).sort(fromIndex, toIndex);
+ new ArrayIntroSorter<>(a, comp).sort(fromIndex, toIndex);
}
/**
@@ -687,7 +687,7 @@ public final class ArrayUtil {
*/
public static <T> void timSort(T[] a, int fromIndex, int toIndex, Comparator<? super T> comp) {
if (toIndex-fromIndex <= 1) return;
- new ArrayTimSorter<T>(a, comp, a.length / 64).sort(fromIndex, toIndex);
+ new ArrayTimSorter<>(a, comp, a.length / 64).sort(fromIndex, toIndex);
}
/**
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/AttributeSource.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/AttributeSource.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/AttributeSource.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/AttributeSource.java Wed Mar 12 18:14:05 2014
@@ -145,8 +145,8 @@ public class AttributeSource {
* An AttributeSource using the supplied {@link AttributeFactory} for creating new {@link Attribute} instances.
*/
public AttributeSource(AttributeFactory factory) {
- this.attributes = new LinkedHashMap<Class<? extends Attribute>, AttributeImpl>();
- this.attributeImpls = new LinkedHashMap<Class<? extends AttributeImpl>, AttributeImpl>();
+ this.attributes = new LinkedHashMap<>();
+ this.attributeImpls = new LinkedHashMap<>();
this.currentState = new State[1];
this.factory = factory;
}
@@ -207,7 +207,7 @@ public class AttributeSource {
LinkedList<WeakReference<Class<? extends Attribute>>> foundInterfaces = knownImplClasses.get(clazz);
if (foundInterfaces == null) {
// we have the slight chance that another thread may do the same, but who cares?
- foundInterfaces = new LinkedList<WeakReference<Class<? extends Attribute>>>();
+ foundInterfaces = new LinkedList<>();
// find all interfaces that this attribute instance implements
// and that extend the Attribute interface
Class<?> actClazz = clazz;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/CloseableThreadLocal.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/CloseableThreadLocal.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/CloseableThreadLocal.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/CloseableThreadLocal.java Wed Mar 12 18:14:05 2014
@@ -55,11 +55,11 @@ import java.util.concurrent.atomic.Atomi
public class CloseableThreadLocal<T> implements Closeable {
- private ThreadLocal<WeakReference<T>> t = new ThreadLocal<WeakReference<T>>();
+ private ThreadLocal<WeakReference<T>> t = new ThreadLocal<>();
// Use a WeakHashMap so that if a Thread exits and is
// GC'able, its entry may be removed:
- private Map<Thread,T> hardRefs = new WeakHashMap<Thread,T>();
+ private Map<Thread,T> hardRefs = new WeakHashMap<>();
// Increase this to decrease frequency of purging in get:
private static int PURGE_MULTIPLIER = 20;
@@ -92,7 +92,7 @@ public class CloseableThreadLocal<T> imp
public void set(T object) {
- t.set(new WeakReference<T>(object));
+ t.set(new WeakReference<>(object));
synchronized(hardRefs) {
hardRefs.put(Thread.currentThread(), object);
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/CollectionUtil.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/CollectionUtil.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/CollectionUtil.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/CollectionUtil.java Wed Mar 12 18:14:05 2014
@@ -134,7 +134,7 @@ public final class CollectionUtil {
public static <T> void introSort(List<T> list, Comparator<? super T> comp) {
final int size = list.size();
if (size <= 1) return;
- new ListIntroSorter<T>(list, comp).sort(0, size);
+ new ListIntroSorter<>(list, comp).sort(0, size);
}
/**
@@ -160,7 +160,7 @@ public final class CollectionUtil {
public static <T> void timSort(List<T> list, Comparator<? super T> comp) {
final int size = list.size();
if (size <= 1) return;
- new ListTimSorter<T>(list, comp, list.size() / 64).sort(0, size);
+ new ListTimSorter<>(list, comp, list.size() / 64).sort(0, size);
}
/**
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/DoubleBarrelLRUCache.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/DoubleBarrelLRUCache.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/DoubleBarrelLRUCache.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/DoubleBarrelLRUCache.java Wed Mar 12 18:14:05 2014
@@ -59,8 +59,8 @@ final public class DoubleBarrelLRUCache<
public DoubleBarrelLRUCache(int maxSize) {
this.maxSize = maxSize;
countdown = new AtomicInteger(maxSize);
- cache1 = new ConcurrentHashMap<K,V>();
- cache2 = new ConcurrentHashMap<K,V>();
+ cache1 = new ConcurrentHashMap<>();
+ cache2 = new ConcurrentHashMap<>();
}
@SuppressWarnings("unchecked")
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/FieldCacheSanityChecker.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/FieldCacheSanityChecker.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/FieldCacheSanityChecker.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/FieldCacheSanityChecker.java Wed Mar 12 18:14:05 2014
@@ -109,13 +109,13 @@ public final class FieldCacheSanityCheck
//
// maps the (valId) identityhashCode of cache values to
// sets of CacheEntry instances
- final MapOfSets<Integer, CacheEntry> valIdToItems = new MapOfSets<Integer, CacheEntry>(new HashMap<Integer, Set<CacheEntry>>(17));
+ final MapOfSets<Integer, CacheEntry> valIdToItems = new MapOfSets<>(new HashMap<Integer, Set<CacheEntry>>(17));
// maps ReaderField keys to Sets of ValueIds
- final MapOfSets<ReaderField, Integer> readerFieldToValIds = new MapOfSets<ReaderField, Integer>(new HashMap<ReaderField, Set<Integer>>(17));
+ final MapOfSets<ReaderField, Integer> readerFieldToValIds = new MapOfSets<>(new HashMap<ReaderField, Set<Integer>>(17));
//
// any keys that we know result in more then one valId
- final Set<ReaderField> valMismatchKeys = new HashSet<ReaderField>();
+ final Set<ReaderField> valMismatchKeys = new HashSet<>();
// iterate over all the cacheEntries to get the mappings we'll need
for (int i = 0; i < cacheEntries.length; i++) {
@@ -144,7 +144,7 @@ public final class FieldCacheSanityCheck
}
}
- final List<Insanity> insanity = new ArrayList<Insanity>(valMismatchKeys.size() * 3);
+ final List<Insanity> insanity = new ArrayList<>(valMismatchKeys.size() * 3);
insanity.addAll(checkValueMismatch(valIdToItems,
readerFieldToValIds,
@@ -166,7 +166,7 @@ public final class FieldCacheSanityCheck
MapOfSets<ReaderField, Integer> readerFieldToValIds,
Set<ReaderField> valMismatchKeys) {
- final List<Insanity> insanity = new ArrayList<Insanity>(valMismatchKeys.size() * 3);
+ final List<Insanity> insanity = new ArrayList<>(valMismatchKeys.size() * 3);
if (! valMismatchKeys.isEmpty() ) {
// we have multiple values for some ReaderFields
@@ -174,7 +174,7 @@ public final class FieldCacheSanityCheck
final Map<ReaderField, Set<Integer>> rfMap = readerFieldToValIds.getMap();
final Map<Integer, Set<CacheEntry>> valMap = valIdToItems.getMap();
for (final ReaderField rf : valMismatchKeys) {
- final List<CacheEntry> badEntries = new ArrayList<CacheEntry>(valMismatchKeys.size() * 2);
+ final List<CacheEntry> badEntries = new ArrayList<>(valMismatchKeys.size() * 2);
for(final Integer value: rfMap.get(rf)) {
for (final CacheEntry cacheEntry : valMap.get(value)) {
badEntries.add(cacheEntry);
@@ -203,15 +203,15 @@ public final class FieldCacheSanityCheck
private Collection<Insanity> checkSubreaders( MapOfSets<Integer, CacheEntry> valIdToItems,
MapOfSets<ReaderField, Integer> readerFieldToValIds) {
- final List<Insanity> insanity = new ArrayList<Insanity>(23);
+ final List<Insanity> insanity = new ArrayList<>(23);
- Map<ReaderField, Set<ReaderField>> badChildren = new HashMap<ReaderField, Set<ReaderField>>(17);
- MapOfSets<ReaderField, ReaderField> badKids = new MapOfSets<ReaderField, ReaderField>(badChildren); // wrapper
+ Map<ReaderField, Set<ReaderField>> badChildren = new HashMap<>(17);
+ MapOfSets<ReaderField, ReaderField> badKids = new MapOfSets<>(badChildren); // wrapper
Map<Integer, Set<CacheEntry>> viToItemSets = valIdToItems.getMap();
Map<ReaderField, Set<Integer>> rfToValIdSets = readerFieldToValIds.getMap();
- Set<ReaderField> seen = new HashSet<ReaderField>(17);
+ Set<ReaderField> seen = new HashSet<>(17);
Set<ReaderField> readerFields = rfToValIdSets.keySet();
for (final ReaderField rf : readerFields) {
@@ -242,7 +242,7 @@ public final class FieldCacheSanityCheck
for (final ReaderField parent : badChildren.keySet()) {
Set<ReaderField> kids = badChildren.get(parent);
- List<CacheEntry> badEntries = new ArrayList<CacheEntry>(kids.size() * 2);
+ List<CacheEntry> badEntries = new ArrayList<>(kids.size() * 2);
// put parent entr(ies) in first
{
@@ -277,7 +277,7 @@ public final class FieldCacheSanityCheck
* returned by {@code seed.getCoreCacheKey()}
*/
private List<Object> getAllDescendantReaderKeys(Object seed) {
- List<Object> all = new ArrayList<Object>(17); // will grow as we iter
+ List<Object> all = new ArrayList<>(17); // will grow as we iter
all.add(seed);
for (int i = 0; i < all.size(); i++) {
final Object obj = all.get(i);
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/MapOfSets.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/MapOfSets.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/MapOfSets.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/MapOfSets.java Wed Mar 12 18:14:05 2014
@@ -55,7 +55,7 @@ public class MapOfSets<K, V> {
if (theMap.containsKey(key)) {
theSet = theMap.get(key);
} else {
- theSet = new HashSet<V>(23);
+ theSet = new HashSet<>(23);
theMap.put(key, theSet);
}
theSet.add(val);
@@ -72,7 +72,7 @@ public class MapOfSets<K, V> {
if (theMap.containsKey(key)) {
theSet = theMap.get(key);
} else {
- theSet = new HashSet<V>(23);
+ theSet = new HashSet<>(23);
theMap.put(key, theSet);
}
theSet.addAll(vals);
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/MergedIterator.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/MergedIterator.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/MergedIterator.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/MergedIterator.java Wed Mar 12 18:14:05 2014
@@ -59,12 +59,12 @@ public final class MergedIterator<T exte
@SuppressWarnings({"unchecked","rawtypes"})
public MergedIterator(boolean removeDuplicates, Iterator<T>... iterators) {
this.removeDuplicates = removeDuplicates;
- queue = new TermMergeQueue<T>(iterators.length);
+ queue = new TermMergeQueue<>(iterators.length);
top = new SubIterator[iterators.length];
int index = 0;
for (Iterator<T> iterator : iterators) {
if (iterator.hasNext()) {
- SubIterator<T> sub = new SubIterator<T>();
+ SubIterator<T> sub = new SubIterator<>();
sub.current = iterator.next();
sub.iterator = iterator;
sub.index = index++;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/NamedSPILoader.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/NamedSPILoader.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/NamedSPILoader.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/NamedSPILoader.java Wed Mar 12 18:14:05 2014
@@ -59,7 +59,7 @@ public final class NamedSPILoader<S exte
* of new service providers on the given classpath/classloader!</em>
*/
public synchronized void reload(ClassLoader classloader) {
- final LinkedHashMap<String,S> services = new LinkedHashMap<String,S>(this.services);
+ final LinkedHashMap<String,S> services = new LinkedHashMap<>(this.services);
final SPIClassIterator<S> loader = SPIClassIterator.get(clazz, classloader);
while (loader.hasNext()) {
final Class<? extends S> c = loader.next();
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/OfflineSorter.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/OfflineSorter.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/OfflineSorter.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/OfflineSorter.java Wed Mar 12 18:14:05 2014
@@ -225,7 +225,7 @@ public final class OfflineSorter {
output.delete();
- ArrayList<File> merges = new ArrayList<File>();
+ ArrayList<File> merges = new ArrayList<>();
boolean success2 = false;
try {
ByteSequencesReader is = new ByteSequencesReader(input);
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/PagedBytes.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/PagedBytes.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/PagedBytes.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/PagedBytes.java Wed Mar 12 18:14:05 2014
@@ -35,9 +35,9 @@ import org.apache.lucene.store.IndexInpu
// TODO: refactor this, byteblockpool, fst.bytestore, and any
// other "shift/mask big arrays". there are too many of these classes!
public final class PagedBytes {
- private final List<byte[]> blocks = new ArrayList<byte[]>();
+ private final List<byte[]> blocks = new ArrayList<>();
// TODO: these are unused?
- private final List<Integer> blockEnd = new ArrayList<Integer>();
+ private final List<Integer> blockEnd = new ArrayList<>();
private final int blockSize;
private final int blockBits;
private final int blockMask;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/QueryBuilder.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/QueryBuilder.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/QueryBuilder.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/QueryBuilder.java Wed Mar 12 18:14:05 2014
@@ -309,7 +309,7 @@ public class QueryBuilder {
// phrase query:
MultiPhraseQuery mpq = newMultiPhraseQuery();
mpq.setSlop(phraseSlop);
- List<Term> multiTerms = new ArrayList<Term>();
+ List<Term> multiTerms = new ArrayList<>();
int position = -1;
for (int i = 0; i < numTokens; i++) {
int positionIncrement = 1;
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/RamUsageEstimator.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/RamUsageEstimator.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/RamUsageEstimator.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/RamUsageEstimator.java Wed Mar 12 18:14:05 2014
@@ -105,7 +105,7 @@ public final class RamUsageEstimator {
*/
private static final Map<Class<?>,Integer> primitiveSizes;
static {
- primitiveSizes = new IdentityHashMap<Class<?>,Integer>();
+ primitiveSizes = new IdentityHashMap<>();
primitiveSizes.put(boolean.class, Integer.valueOf(NUM_BYTES_BOOLEAN));
primitiveSizes.put(byte.class, Integer.valueOf(NUM_BYTES_BYTE));
primitiveSizes.put(char.class, Integer.valueOf(NUM_BYTES_CHAR));
@@ -403,11 +403,11 @@ public final class RamUsageEstimator {
*/
private static long measureObjectSize(Object root) {
// Objects seen so far.
- final IdentityHashSet<Object> seen = new IdentityHashSet<Object>();
+ final IdentityHashSet<Object> seen = new IdentityHashSet<>();
// Class cache with reference Field and precalculated shallow size.
- final IdentityHashMap<Class<?>, ClassCache> classCache = new IdentityHashMap<Class<?>, ClassCache>();
+ final IdentityHashMap<Class<?>, ClassCache> classCache = new IdentityHashMap<>();
// Stack of objects pending traversal. Recursion caused stack overflows.
- final ArrayList<Object> stack = new ArrayList<Object>();
+ final ArrayList<Object> stack = new ArrayList<>();
stack.add(root);
long totalSize = 0;
@@ -486,7 +486,7 @@ public final class RamUsageEstimator {
private static ClassCache createCacheEntry(final Class<?> clazz) {
ClassCache cachedInfo;
long shallowInstanceSize = NUM_BYTES_OBJECT_HEADER;
- final ArrayList<Field> referenceFields = new ArrayList<Field>(32);
+ final ArrayList<Field> referenceFields = new ArrayList<>(32);
for (Class<?> c = clazz; c != null; c = c.getSuperclass()) {
final Field[] fields = c.getDeclaredFields();
for (final Field f : fields) {
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/SPIClassIterator.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/SPIClassIterator.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/SPIClassIterator.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/SPIClassIterator.java Wed Mar 12 18:14:05 2014
@@ -47,11 +47,11 @@ public final class SPIClassIterator<S> i
private Iterator<String> linesIterator;
public static <S> SPIClassIterator<S> get(Class<S> clazz) {
- return new SPIClassIterator<S>(clazz, Thread.currentThread().getContextClassLoader());
+ return new SPIClassIterator<>(clazz, Thread.currentThread().getContextClassLoader());
}
public static <S> SPIClassIterator<S> get(Class<S> clazz, ClassLoader loader) {
- return new SPIClassIterator<S>(clazz, loader);
+ return new SPIClassIterator<>(clazz, loader);
}
/** Utility method to check if some class loader is a (grand-)parent of or the same as another one.
@@ -84,7 +84,7 @@ public final class SPIClassIterator<S> i
if (lines != null) {
lines.clear();
} else {
- lines = new ArrayList<String>();
+ lines = new ArrayList<>();
}
final URL url = profilesEnum.nextElement();
try {
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/SetOnce.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/SetOnce.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/SetOnce.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/SetOnce.java Wed Mar 12 18:14:05 2014
@@ -77,7 +77,7 @@ public final class SetOnce<T> implements
@Override
public SetOnce<T> clone() {
- return obj == null ? new SetOnce<T>() : new SetOnce<T>(obj);
+ return obj == null ? new SetOnce<T>() : new SetOnce<>(obj);
}
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/WeakIdentityMap.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/WeakIdentityMap.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/WeakIdentityMap.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/WeakIdentityMap.java Wed Mar 12 18:14:05 2014
@@ -62,7 +62,7 @@ import java.util.concurrent.ConcurrentHa
* @lucene.internal
*/
public final class WeakIdentityMap<K,V> {
- private final ReferenceQueue<Object> queue = new ReferenceQueue<Object>();
+ private final ReferenceQueue<Object> queue = new ReferenceQueue<>();
private final Map<IdentityWeakReference, V> backingStore;
private final boolean reapOnRead;
@@ -80,7 +80,7 @@ public final class WeakIdentityMap<K,V>
* @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
*/
public static <K,V> WeakIdentityMap<K,V> newHashMap(boolean reapOnRead) {
- return new WeakIdentityMap<K,V>(new HashMap<IdentityWeakReference,V>(), reapOnRead);
+ return new WeakIdentityMap<>(new HashMap<IdentityWeakReference,V>(), reapOnRead);
}
/**
@@ -96,7 +96,7 @@ public final class WeakIdentityMap<K,V>
* @param reapOnRead controls if the map <a href="#reapInfo">cleans up the reference queue on every read operation</a>.
*/
public static <K,V> WeakIdentityMap<K,V> newConcurrentHashMap(boolean reapOnRead) {
- return new WeakIdentityMap<K,V>(new ConcurrentHashMap<IdentityWeakReference,V>(), reapOnRead);
+ return new WeakIdentityMap<>(new ConcurrentHashMap<IdentityWeakReference,V>(), reapOnRead);
}
/** Private only constructor, to create use the static factory methods. */
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/Automaton.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/Automaton.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/Automaton.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/Automaton.java Wed Mar 12 18:14:05 2014
@@ -269,8 +269,8 @@ public class Automaton implements Clonea
public State[] getNumberedStates() {
if (numberedStates == null) {
expandSingleton();
- final Set<State> visited = new HashSet<State>();
- final LinkedList<State> worklist = new LinkedList<State>();
+ final Set<State> visited = new HashSet<>();
+ final LinkedList<State> worklist = new LinkedList<>();
numberedStates = new State[4];
int upto = 0;
worklist.add(initial);
@@ -333,9 +333,9 @@ public class Automaton implements Clonea
*/
public Set<State> getAcceptStates() {
expandSingleton();
- HashSet<State> accepts = new HashSet<State>();
- HashSet<State> visited = new HashSet<State>();
- LinkedList<State> worklist = new LinkedList<State>();
+ HashSet<State> accepts = new HashSet<>();
+ HashSet<State> visited = new HashSet<>();
+ LinkedList<State> worklist = new LinkedList<>();
worklist.add(initial);
visited.add(initial);
while (worklist.size() > 0) {
@@ -399,7 +399,7 @@ public class Automaton implements Clonea
*/
int[] getStartPoints() {
final State[] states = getNumberedStates();
- Set<Integer> pointset = new HashSet<Integer>();
+ Set<Integer> pointset = new HashSet<>();
pointset.add(Character.MIN_CODE_POINT);
for (State s : states) {
for (Transition t : s.getTransitions()) {
@@ -423,7 +423,7 @@ public class Automaton implements Clonea
*/
private State[] getLiveStates() {
final State[] states = getNumberedStates();
- Set<State> live = new HashSet<State>();
+ Set<State> live = new HashSet<>();
for (State q : states) {
if (q.isAccept()) {
live.add(q);
@@ -432,13 +432,13 @@ public class Automaton implements Clonea
// map<state, set<state>>
@SuppressWarnings({"rawtypes","unchecked"}) Set<State> map[] = new Set[states.length];
for (int i = 0; i < map.length; i++)
- map[i] = new HashSet<State>();
+ map[i] = new HashSet<>();
for (State s : states) {
for(int i=0;i<s.numTransitions;i++) {
map[s.transitionsArray[i].to.number].add(s);
}
}
- LinkedList<State> worklist = new LinkedList<State>(live);
+ LinkedList<State> worklist = new LinkedList<>(live);
while (worklist.size() > 0) {
State s = worklist.removeFirst();
for (State p : map[s.number])
@@ -639,7 +639,7 @@ public class Automaton implements Clonea
try {
Automaton a = (Automaton) super.clone();
if (!isSingleton()) {
- HashMap<State,State> m = new HashMap<State,State>();
+ HashMap<State,State> m = new HashMap<>();
State[] states = getNumberedStates();
for (State s : states)
m.put(s, new State());
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/BasicAutomata.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/BasicAutomata.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/BasicAutomata.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/BasicAutomata.java Wed Mar 12 18:14:05 2014
@@ -216,10 +216,10 @@ final public class BasicAutomata {
by.append('0');
by.append(y);
y = by.toString();
- Collection<State> initials = new ArrayList<State>();
+ Collection<State> initials = new ArrayList<>();
a.initial = between(x, y, 0, initials, digits <= 0);
if (digits <= 0) {
- ArrayList<StatePair> pairs = new ArrayList<StatePair>();
+ ArrayList<StatePair> pairs = new ArrayList<>();
for (State p : initials)
if (a.initial != p) pairs.add(new StatePair(a.initial, p));
BasicOperations.addEpsilons(a, pairs);
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/BasicOperations.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/BasicOperations.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/BasicOperations.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/BasicOperations.java Wed Mar 12 18:14:05 2014
@@ -106,7 +106,7 @@ final public class BasicOperations {
} else {
for (Automaton a : l)
if (BasicOperations.isEmpty(a)) return BasicAutomata.makeEmpty();
- Set<Integer> ids = new HashSet<Integer>();
+ Set<Integer> ids = new HashSet<>();
for (Automaton a : l)
ids.add(System.identityHashCode(a));
boolean has_aliases = ids.size() != l.size();
@@ -187,7 +187,7 @@ final public class BasicOperations {
*/
static public Automaton repeat(Automaton a, int min) {
if (min == 0) return repeat(a);
- List<Automaton> as = new ArrayList<Automaton>();
+ List<Automaton> as = new ArrayList<>();
while (min-- > 0)
as.add(a);
as.add(repeat(a));
@@ -210,7 +210,7 @@ final public class BasicOperations {
if (min == 0) b = BasicAutomata.makeEmptyString();
else if (min == 1) b = a.clone();
else {
- List<Automaton> as = new ArrayList<Automaton>();
+ List<Automaton> as = new ArrayList<>();
while (min-- > 0)
as.add(a);
b = concatenate(as);
@@ -287,8 +287,8 @@ final public class BasicOperations {
Transition[][] transitions1 = a1.getSortedTransitions();
Transition[][] transitions2 = a2.getSortedTransitions();
Automaton c = new Automaton();
- LinkedList<StatePair> worklist = new LinkedList<StatePair>();
- HashMap<StatePair,StatePair> newstates = new HashMap<StatePair,StatePair>();
+ LinkedList<StatePair> worklist = new LinkedList<>();
+ HashMap<StatePair,StatePair> newstates = new HashMap<>();
StatePair p = new StatePair(c.initial, a1.initial, a2.initial);
worklist.add(p);
newstates.put(p, p);
@@ -356,8 +356,8 @@ final public class BasicOperations {
a2.determinize();
Transition[][] transitions1 = a1.getSortedTransitions();
Transition[][] transitions2 = a2.getSortedTransitions();
- LinkedList<StatePair> worklist = new LinkedList<StatePair>();
- HashSet<StatePair> visited = new HashSet<StatePair>();
+ LinkedList<StatePair> worklist = new LinkedList<>();
+ HashSet<StatePair> visited = new HashSet<>();
StatePair p = new StatePair(a1.initial, a2.initial);
worklist.add(p);
visited.add(p);
@@ -431,7 +431,7 @@ final public class BasicOperations {
* Complexity: linear in number of states.
*/
public static Automaton union(Collection<Automaton> l) {
- Set<Integer> ids = new HashSet<Integer>();
+ Set<Integer> ids = new HashSet<>();
for (Automaton a : l)
ids.add(System.identityHashCode(a));
boolean has_aliases = ids.size() != l.size();
@@ -500,7 +500,7 @@ final public class BasicOperations {
PointTransitions[] points = new PointTransitions[5];
private final static int HASHMAP_CUTOVER = 30;
- private final HashMap<Integer,PointTransitions> map = new HashMap<Integer,PointTransitions>();
+ private final HashMap<Integer,PointTransitions> map = new HashMap<>();
private boolean useHash = false;
private PointTransitions next(int point) {
@@ -597,8 +597,8 @@ final public class BasicOperations {
a.initial = new State();
SortedIntSet.FrozenIntSet initialset = new SortedIntSet.FrozenIntSet(initNumber, a.initial);
- LinkedList<SortedIntSet.FrozenIntSet> worklist = new LinkedList<SortedIntSet.FrozenIntSet>();
- Map<SortedIntSet.FrozenIntSet,State> newstate = new HashMap<SortedIntSet.FrozenIntSet,State>();
+ LinkedList<SortedIntSet.FrozenIntSet> worklist = new LinkedList<>();
+ Map<SortedIntSet.FrozenIntSet,State> newstate = new HashMap<>();
worklist.add(initialset);
@@ -713,25 +713,25 @@ final public class BasicOperations {
*/
public static void addEpsilons(Automaton a, Collection<StatePair> pairs) {
a.expandSingleton();
- HashMap<State,HashSet<State>> forward = new HashMap<State,HashSet<State>>();
- HashMap<State,HashSet<State>> back = new HashMap<State,HashSet<State>>();
+ HashMap<State,HashSet<State>> forward = new HashMap<>();
+ HashMap<State,HashSet<State>> back = new HashMap<>();
for (StatePair p : pairs) {
HashSet<State> to = forward.get(p.s1);
if (to == null) {
- to = new HashSet<State>();
+ to = new HashSet<>();
forward.put(p.s1, to);
}
to.add(p.s2);
HashSet<State> from = back.get(p.s2);
if (from == null) {
- from = new HashSet<State>();
+ from = new HashSet<>();
back.put(p.s2, from);
}
from.add(p.s1);
}
// calculate epsilon closure
- LinkedList<StatePair> worklist = new LinkedList<StatePair>(pairs);
- HashSet<StatePair> workset = new HashSet<StatePair>(pairs);
+ LinkedList<StatePair> worklist = new LinkedList<>(pairs);
+ HashSet<StatePair> workset = new HashSet<>(pairs);
while (!worklist.isEmpty()) {
StatePair p = worklist.removeFirst();
workset.remove(p);
@@ -817,12 +817,12 @@ final public class BasicOperations {
return p.accept;
} else {
State[] states = a.getNumberedStates();
- LinkedList<State> pp = new LinkedList<State>();
- LinkedList<State> pp_other = new LinkedList<State>();
+ LinkedList<State> pp = new LinkedList<>();
+ LinkedList<State> pp_other = new LinkedList<>();
BitSet bb = new BitSet(states.length);
BitSet bb_other = new BitSet(states.length);
pp.add(a.initial);
- ArrayList<State> dest = new ArrayList<State>();
+ ArrayList<State> dest = new ArrayList<>();
boolean accept = a.initial.accept;
for (int i = 0, c = 0; i < s.length(); i += Character.charCount(c)) {
c = s.codePointAt(i);
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/CompiledAutomaton.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/CompiledAutomaton.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/CompiledAutomaton.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/CompiledAutomaton.java Wed Mar 12 18:14:05 2014
@@ -272,7 +272,7 @@ public class CompiledAutomaton {
}
}
- final List<Integer> stack = new ArrayList<Integer>();
+ final List<Integer> stack = new ArrayList<>();
int idx = 0;
while (true) {
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/DaciukMihovAutomatonBuilder.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/DaciukMihovAutomatonBuilder.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/DaciukMihovAutomatonBuilder.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/DaciukMihovAutomatonBuilder.java Wed Mar 12 18:14:05 2014
@@ -187,7 +187,7 @@ final class DaciukMihovAutomatonBuilder
/**
* A "registry" for state interning.
*/
- private HashMap<State,State> stateRegistry = new HashMap<State,State>();
+ private HashMap<State,State> stateRegistry = new HashMap<>();
/**
* Root automaton state.
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/LevenshteinAutomata.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/LevenshteinAutomata.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/LevenshteinAutomata.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/LevenshteinAutomata.java Wed Mar 12 18:14:05 2014
@@ -63,7 +63,7 @@ public class LevenshteinAutomata {
this.alphaMax = alphaMax;
// calculate the alphabet
- SortedSet<Integer> set = new TreeSet<Integer>();
+ SortedSet<Integer> set = new TreeSet<>();
for (int i = 0; i < word.length; i++) {
int v = word[i];
if (v > alphaMax) {
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/MinimizationOperations.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/MinimizationOperations.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/MinimizationOperations.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/MinimizationOperations.java Wed Mar 12 18:14:05 2014
@@ -83,13 +83,13 @@ final public class MinimizationOperation
final int[] block = new int[statesLen];
final StateList[][] active = new StateList[statesLen][sigmaLen];
final StateListNode[][] active2 = new StateListNode[statesLen][sigmaLen];
- final LinkedList<IntPair> pending = new LinkedList<IntPair>();
+ final LinkedList<IntPair> pending = new LinkedList<>();
final BitSet pending2 = new BitSet(sigmaLen*statesLen);
final BitSet split = new BitSet(statesLen),
refine = new BitSet(statesLen), refine2 = new BitSet(statesLen);
for (int q = 0; q < statesLen; q++) {
- splitblock[q] = new ArrayList<State>();
- partition[q] = new HashSet<State>();
+ splitblock[q] = new ArrayList<>();
+ partition[q] = new HashSet<>();
for (int x = 0; x < sigmaLen; x++) {
active[q][x] = new StateList();
}
@@ -104,7 +104,7 @@ final public class MinimizationOperation
final ArrayList<State>[] r =
reverse[qq.step(sigma[x]).number];
if (r[x] == null)
- r[x] = new ArrayList<State>();
+ r[x] = new ArrayList<>();
r[x].add(qq);
}
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/RegExp.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/RegExp.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/RegExp.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/RegExp.java Wed Mar 12 18:14:05 2014
@@ -486,14 +486,14 @@ public class RegExp {
Automaton a = null;
switch (kind) {
case REGEXP_UNION:
- list = new ArrayList<Automaton>();
+ list = new ArrayList<>();
findLeaves(exp1, Kind.REGEXP_UNION, list, automata, automaton_provider);
findLeaves(exp2, Kind.REGEXP_UNION, list, automata, automaton_provider);
a = BasicOperations.union(list);
MinimizationOperations.minimize(a);
break;
case REGEXP_CONCATENATION:
- list = new ArrayList<Automaton>();
+ list = new ArrayList<>();
findLeaves(exp1, Kind.REGEXP_CONCATENATION, list, automata,
automaton_provider);
findLeaves(exp2, Kind.REGEXP_CONCATENATION, list, automata,
@@ -664,7 +664,7 @@ public class RegExp {
* Returns set of automaton identifiers that occur in this regular expression.
*/
public Set<String> getIdentifiers() {
- HashSet<String> set = new HashSet<String>();
+ HashSet<String> set = new HashSet<>();
getIdentifiers(set);
return set;
}
Modified: lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/SortedIntSet.java
URL: http://svn.apache.org/viewvc/lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/SortedIntSet.java?rev=1576837&r1=1576836&r2=1576837&view=diff
==============================================================================
--- lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/SortedIntSet.java (original)
+++ lucene/dev/branches/branch_4x/lucene/core/src/java/org/apache/lucene/util/automaton/SortedIntSet.java Wed Mar 12 18:14:05 2014
@@ -35,7 +35,7 @@ final class SortedIntSet {
// O(N^2) linear ops to O(N log(N)) TreeMap
private final static int TREE_MAP_CUTOVER = 30;
- private final Map<Integer,Integer> map = new TreeMap<Integer,Integer>();
+ private final Map<Integer,Integer> map = new TreeMap<>();
private boolean useTreeMap;