MtasSpanUniquePositionSpans.java.html 13.2 KB

Edit Raw Blame History

<?xml version="1.0" encoding="UTF-8"?><!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"><html xmlns="http://www.w3.org/1999/xhtml" lang="en"><head><meta http-equiv="Content-Type" content="text/html;charset=UTF-8"/><link rel="stylesheet" href="../jacoco-resources/report.css" type="text/css"/><link rel="shortcut icon" href="../jacoco-resources/report.gif" type="image/gif"/><title>MtasSpanUniquePositionSpans.java</title><link rel="stylesheet" href="../jacoco-resources/prettify.css" type="text/css"/><script type="text/javascript" src="../jacoco-resources/prettify.js"></script></head><body onload="window['PR_TAB_WIDTH']=4;prettyPrint()"><div class="breadcrumb" id="breadcrumb"><span class="info"><a href="../jacoco-sessions.html" class="el_session">Sessions</a></span><a href="../index.html" class="el_report">MTAS</a> &gt; <a href="index.source.html" class="el_package">mtas.search.spans.util</a> &gt; <span class="el_source">MtasSpanUniquePositionSpans.java</span></div><h1>MtasSpanUniquePositionSpans.java</h1><pre class="source lang-java linenums">package mtas.search.spans.util;

import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

import org.apache.lucene.search.TwoPhaseIterator;
import org.apache.lucene.search.spans.SpanCollector;
import org.apache.lucene.search.spans.Spans;

/**
 * The Class MtasSpanUniquePosition.
 */
public class MtasSpanUniquePositionSpans extends MtasSpans {

  /** The spans. */
  Spans spans;

  /** The queue spans. */
  List&lt;Match&gt; queueSpans;

  /** The queue matches. */
  List&lt;Match&gt; queueMatches;

  /** The current match. */
  Match currentMatch;

  /** The last start position. */
  int lastStartPosition; // startPosition of last retrieved span

  /** The last span. */
  boolean lastSpan; // last span for this document added to queue

  /** The no more positions. */
  boolean noMorePositions;

  /**
   * Instantiates a new mtas span unique position.
   *
   * @param spans the spans
   */
  public MtasSpanUniquePositionSpans(Spans spans) {
<span class="fc" id="L43">    super();</span>
<span class="fc" id="L44">    this.spans = spans;</span>
<span class="fc" id="L45">    queueSpans = new ArrayList&lt;&gt;();</span>
<span class="fc" id="L46">    queueMatches = new ArrayList&lt;&gt;();</span>
<span class="fc" id="L47">    resetQueue();</span>
<span class="fc" id="L48">  }</span>

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.spans.Spans#nextStartPosition()
   */
  @Override
  public int nextStartPosition() throws IOException {
<span class="fc bfc" id="L57" title="All 2 branches covered.">    if (findMatches()) {</span>
<span class="fc" id="L58">      currentMatch = queueMatches.get(0);</span>
<span class="fc" id="L59">      queueMatches.remove(0);</span>
<span class="fc" id="L60">      noMorePositions = false;</span>
<span class="fc" id="L61">      return currentMatch.startPosition();</span>
    } else {
<span class="fc" id="L63">      currentMatch = null;</span>
<span class="fc" id="L64">      noMorePositions = true;</span>
<span class="fc" id="L65">      return NO_MORE_POSITIONS;</span>
    }
  }

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.spans.Spans#startPosition()
   */
  @Override
  public int startPosition() {
<span class="pc bpc" id="L76" title="1 of 2 branches missed.">    if (currentMatch == null) {      </span>
<span class="fc bfc" id="L77" title="All 2 branches covered.">      if(noMorePositions) {</span>
<span class="fc" id="L78">        return NO_MORE_POSITIONS;</span>
      } else {
<span class="fc" id="L80">        return -1;</span>
      }
    } else {
<span class="nc" id="L83">      return currentMatch.startPosition();</span>
    }
  }

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.spans.Spans#endPosition()
   */
  @Override
  public int endPosition() {
<span class="fc bfc" id="L94" title="All 2 branches covered.">    if (currentMatch == null) {      </span>
<span class="fc bfc" id="L95" title="All 2 branches covered.">      if(noMorePositions) {</span>
<span class="fc" id="L96">        return NO_MORE_POSITIONS;</span>
      } else {
<span class="fc" id="L98">        return -1;</span>
      }
    } else {
<span class="fc" id="L101">      return currentMatch.endPosition();</span>
    }
  }

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.spans.Spans#width()
   */
  @Override
  public int width() {
    // return (currentMatch.endPosition() - currentMatch.startPosition());
<span class="fc" id="L113">    return 1;</span>
  }

  /*
   * (non-Javadoc)
   *
   * @see
   * org.apache.lucene.search.spans.Spans#collect(org.apache.lucene.search.spans
   * .SpanCollector)
   */
  @Override
  public void collect(SpanCollector collector) throws IOException {
<span class="nc" id="L125">    spans.collect(collector);</span>
<span class="nc" id="L126">  }</span>

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.DocIdSetIterator#docID()
   */
  @Override
  public int docID() {
<span class="fc" id="L135">    return spans.docID();</span>
  }

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.DocIdSetIterator#nextDoc()
   */
  @Override
  public int nextDoc() throws IOException {
<span class="fc" id="L145">    resetQueue();</span>
<span class="fc" id="L146">    noMorePositions = false;</span>
<span class="fc bfc" id="L147" title="All 2 branches covered.">    return (spans.nextDoc() == NO_MORE_DOCS) ? NO_MORE_DOCS : toMatchDoc();</span>
  }

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.DocIdSetIterator#advance(int)
   */
  @Override
  public int advance(int target) throws IOException {
<span class="fc" id="L157">    resetQueue();</span>
<span class="fc" id="L158">    noMorePositions = false;</span>
<span class="fc bfc" id="L159" title="All 2 branches covered.">    return (spans.advance(target) == NO_MORE_DOCS) ? NO_MORE_DOCS</span>
<span class="fc" id="L160">        : toMatchDoc();</span>
  }

  @Override
  public TwoPhaseIterator asTwoPhaseIterator() {
<span class="fc" id="L165">    return spans.asTwoPhaseIterator();     </span>
  }

  /**
   * Reset queue.
   */
  void resetQueue() {
<span class="fc" id="L172">    queueSpans.clear();</span>
<span class="fc" id="L173">    queueMatches.clear();</span>
<span class="fc" id="L174">    lastStartPosition = 0;</span>
<span class="fc" id="L175">    lastSpan = false;</span>
<span class="fc" id="L176">    currentMatch = null;</span>
<span class="fc" id="L177">  }</span>

  /**
   * To match doc.
   *
   * @return the int
   * @throws IOException Signals that an I/O exception has occurred.
   */
  int toMatchDoc() throws IOException {
    while (true) {
<span class="pc bpc" id="L187" title="1 of 2 branches missed.">      if (findMatches()) {</span>
<span class="fc" id="L188">        return docID();</span>
      }
<span class="nc bnc" id="L190" title="All 2 branches missed.">      if (spans.nextDoc() == NO_MORE_DOCS) {</span>
<span class="nc" id="L191">        return NO_MORE_DOCS;</span>
      }
    }
  }

  /**
   * Collect span.
   *
   * @return true, if successful
   * @throws IOException Signals that an I/O exception has occurred.
   */
  // try to get something in the queue of spans
  private boolean collectSpan() throws IOException {
<span class="fc bfc" id="L204" title="All 2 branches covered.">    if (lastSpan) {</span>
<span class="fc" id="L205">      return false;</span>
<span class="fc bfc" id="L206" title="All 2 branches covered.">    } else if (spans.nextStartPosition() == NO_MORE_POSITIONS) {</span>
<span class="fc" id="L207">      lastSpan = true;</span>
<span class="fc" id="L208">      return false;</span>
    } else {
<span class="fc" id="L210">      queueSpans.add(new Match(spans.startPosition(), spans.endPosition()));</span>
<span class="fc" id="L211">      lastStartPosition = spans.startPosition();</span>
<span class="fc" id="L212">      return true;</span>
    }
  }

  /**
   * Find matches.
   *
   * @return true, if successful
   * @throws IOException Signals that an I/O exception has occurred.
   */
  private boolean findMatches() throws IOException {
    // check for something in queue of matches
<span class="fc bfc" id="L224" title="All 2 branches covered.">    if (!queueMatches.isEmpty()) {</span>
<span class="fc" id="L225">      return true;</span>
    } else {
      while (true) {
        // try to get something in queue of spans
<span class="fc bfc" id="L229" title="All 4 branches covered.">        if (queueSpans.isEmpty() &amp;&amp; !collectSpan()) {</span>
<span class="fc" id="L230">          return false;</span>
        }
        // try to get matches with first span in queue
<span class="fc" id="L233">        Match firstMatch = queueSpans.get(0);</span>
<span class="fc" id="L234">        queueSpans.remove(0);</span>
        // create a list of matches with same startposition as firstMatch
<span class="fc" id="L236">        List&lt;Match&gt; matches = new ArrayList&lt;&gt;();</span>
<span class="fc" id="L237">        matches.add(firstMatch);</span>
        // try to collect spans until lastStartPosition not equal to
        // startposition of firstMatch
<span class="fc bfc" id="L240" title="All 4 branches covered.">        while (!lastSpan &amp;&amp; (lastStartPosition == firstMatch.startPosition())) {</span>
<span class="fc" id="L241">          collectSpan();</span>
        }
<span class="fc bfc" id="L243" title="All 2 branches covered.">        while (!queueSpans.isEmpty() &amp;&amp; (queueSpans.get(0)</span>
<span class="fc bfc" id="L244" title="All 2 branches covered.">            .startPosition() == firstMatch.startPosition())) {</span>
<span class="fc" id="L245">          matches.add(queueSpans.get(0));</span>
<span class="fc" id="L246">          queueSpans.remove(0);</span>
        }
        // construct all matches for this startposition
<span class="fc bfc" id="L249" title="All 2 branches covered.">        for (Match match : matches) {</span>
          // only unique spans
<span class="pc bpc" id="L251" title="1 of 2 branches missed.">          if (!queueMatches.contains(match)) {</span>
<span class="fc" id="L252">            queueMatches.add(match);</span>
          }
<span class="fc" id="L254">        }</span>
        // check for something in queue of matches
<span class="pc bpc" id="L256" title="1 of 2 branches missed.">        if (!queueMatches.isEmpty()) {</span>
<span class="fc" id="L257">          return true;</span>
        }
<span class="nc" id="L259">      }</span>
    }
  }

  /**
   * The Class Match.
   */
  private static class Match {

    /** The start position. */
    private int startPosition;

    /** The end position. */
    private int endPosition;

    /**
     * Instantiates a new match.
     *
     * @param startPosition the start position
     * @param endPosition the end position
     */
<span class="fc" id="L280">    Match(int startPosition, int endPosition) {</span>
<span class="fc" id="L281">      this.startPosition = startPosition;</span>
<span class="fc" id="L282">      this.endPosition = endPosition;</span>
<span class="fc" id="L283">    }</span>

    /**
     * Start position.
     *
     * @return the int
     */
    public int startPosition() {
<span class="fc" id="L291">      return startPosition;</span>
    }

    /**
     * End position.
     *
     * @return the int
     */
    public int endPosition() {
<span class="fc" id="L300">      return endPosition;</span>
    }

    /*
     * (non-Javadoc)
     *
     * @see java.lang.Object#equals(java.lang.Object)
     */
    @Override
    public boolean equals(Object obj) {
<span class="pc bpc" id="L310" title="1 of 2 branches missed.">      if (this == obj)</span>
<span class="nc" id="L311">        return true;</span>
<span class="pc bpc" id="L312" title="1 of 2 branches missed.">      if (obj == null)</span>
<span class="nc" id="L313">        return false;</span>
<span class="pc bpc" id="L314" title="1 of 2 branches missed.">      if (getClass() != obj.getClass())</span>
<span class="nc" id="L315">        return false;</span>
<span class="fc" id="L316">      final Match that = (Match) obj;</span>
<span class="pc bpc" id="L317" title="2 of 4 branches missed.">      return startPosition == that.startPosition</span>
          &amp;&amp; endPosition == that.endPosition;
    }

    /* (non-Javadoc)
     * @see java.lang.Object#hashCode()
     */
    @Override
    public int hashCode() {
<span class="nc" id="L326">      int h = this.getClass().getSimpleName().hashCode();</span>
<span class="nc" id="L327">      h = (h * 5) ^ startPosition;</span>
<span class="nc" id="L328">      h = (h * 7) ^ endPosition;</span>
<span class="nc" id="L329">      return h;</span>
    }

  }

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.DocIdSetIterator#cost()
   */
  @Override
  public long cost() {
<span class="nc bnc" id="L341" title="All 2 branches missed.">    return (spans == null) ? 0 : spans.cost();</span>
  }

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.spans.Spans#positionsCost()
   */
  @Override
  public float positionsCost() {
<span class="nc bnc" id="L351" title="All 2 branches missed.">    return (spans == null) ? 0 : spans.positionsCost();</span>
  }

}
</pre><div class="footer"><span class="right">Created with <a href="http://www.jacoco.org/jacoco">JaCoCo</a> 0.7.9.201702052155</span></div></body></html>