MtasSpanUniquePosition.java.html 13 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>MtasSpanUniquePosition.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">MtasSpanUniquePosition.java</span></div><h1>MtasSpanUniquePosition.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.spans.SpanCollector;
import org.apache.lucene.search.spans.Spans;

/**
 * The Class MtasSpanUniquePosition.
 */
public class MtasSpanUniquePosition extends Spans implements 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 MtasSpanUniquePosition(Spans spans) {
<span class="fc" id="L42">    super();</span>
<span class="fc" id="L43">    this.spans = spans;</span>
<span class="fc" id="L44">    queueSpans = new ArrayList&lt;&gt;();</span>
<span class="fc" id="L45">    queueMatches = new ArrayList&lt;&gt;();</span>
<span class="fc" id="L46">    resetQueue();</span>
<span class="fc" id="L47">  }</span>

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

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

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.spans.Spans#endPosition()
   */
  @Override
  public int endPosition() {
<span class="fc bfc" id="L93" title="All 2 branches covered.">    if (currentMatch == null) {      </span>
<span class="fc bfc" id="L94" title="All 2 branches covered.">      if(noMorePositions) {</span>
<span class="fc" id="L95">        return NO_MORE_POSITIONS;</span>
      } else {
<span class="fc" id="L97">        return -1;</span>
      }
    } else {
<span class="fc" id="L100">      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="L112">    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="L124">    spans.collect(collector);</span>
<span class="nc" id="L125">  }</span>

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

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

  /**
   * Reset queue.
   */
  void resetQueue() {
<span class="fc" id="L166">    queueSpans.clear();</span>
<span class="fc" id="L167">    queueMatches.clear();</span>
<span class="fc" id="L168">    lastStartPosition = 0;</span>
<span class="fc" id="L169">    lastSpan = false;</span>
<span class="fc" id="L170">    currentMatch = null;</span>
<span class="fc" id="L171">  }</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="L181" title="1 of 2 branches missed.">      if (findMatches()) {</span>
<span class="fc" id="L182">        return docID();</span>
      }
<span class="nc bnc" id="L184" title="All 2 branches missed.">      if (spans.nextDoc() == NO_MORE_DOCS) {</span>
<span class="nc" id="L185">        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="L198" title="All 2 branches covered.">    if (lastSpan) {</span>
<span class="fc" id="L199">      return false;</span>
<span class="fc bfc" id="L200" title="All 2 branches covered.">    } else if (spans.nextStartPosition() == NO_MORE_POSITIONS) {</span>
<span class="fc" id="L201">      lastSpan = true;</span>
<span class="fc" id="L202">      return false;</span>
    } else {
<span class="fc" id="L204">      queueSpans.add(new Match(spans.startPosition(), spans.endPosition()));</span>
<span class="fc" id="L205">      lastStartPosition = spans.startPosition();</span>
<span class="fc" id="L206">      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="L218" title="All 2 branches covered.">    if (!queueMatches.isEmpty()) {</span>
<span class="fc" id="L219">      return true;</span>
    } else {
      while (true) {
        // try to get something in queue of spans
<span class="fc bfc" id="L223" title="All 4 branches covered.">        if (queueSpans.isEmpty() &amp;&amp; !collectSpan()) {</span>
<span class="fc" id="L224">          return false;</span>
        }
        // try to get matches with first span in queue
<span class="fc" id="L227">        Match firstMatch = queueSpans.get(0);</span>
<span class="fc" id="L228">        queueSpans.remove(0);</span>
        // create a list of matches with same startposition as firstMatch
<span class="fc" id="L230">        List&lt;Match&gt; matches = new ArrayList&lt;&gt;();</span>
<span class="fc" id="L231">        matches.add(firstMatch);</span>
        // try to collect spans until lastStartPosition not equal to
        // startposition of firstMatch
<span class="fc bfc" id="L234" title="All 4 branches covered.">        while (!lastSpan &amp;&amp; (lastStartPosition == firstMatch.startPosition())) {</span>
<span class="fc" id="L235">          collectSpan();</span>
        }
<span class="fc bfc" id="L237" title="All 2 branches covered.">        while (!queueSpans.isEmpty() &amp;&amp; (queueSpans.get(0)</span>
<span class="fc bfc" id="L238" title="All 2 branches covered.">            .startPosition() == firstMatch.startPosition())) {</span>
<span class="fc" id="L239">          matches.add(queueSpans.get(0));</span>
<span class="fc" id="L240">          queueSpans.remove(0);</span>
        }
        // construct all matches for this startposition
<span class="fc bfc" id="L243" title="All 2 branches covered.">        for (Match match : matches) {</span>
          // only unique spans
<span class="pc bpc" id="L245" title="1 of 2 branches missed.">          if (!queueMatches.contains(match)) {</span>
<span class="fc" id="L246">            queueMatches.add(match);</span>
          }
<span class="fc" id="L248">        }</span>
        // check for something in queue of matches
<span class="pc bpc" id="L250" title="1 of 2 branches missed.">        if (!queueMatches.isEmpty()) {</span>
<span class="fc" id="L251">          return true;</span>
        }
<span class="nc" id="L253">      }</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="L274">    Match(int startPosition, int endPosition) {</span>
<span class="fc" id="L275">      this.startPosition = startPosition;</span>
<span class="fc" id="L276">      this.endPosition = endPosition;</span>
<span class="fc" id="L277">    }</span>

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

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

    /*
     * (non-Javadoc)
     *
     * @see java.lang.Object#equals(java.lang.Object)
     */
    @Override
    public boolean equals(Object obj) {
<span class="pc bpc" id="L304" title="1 of 2 branches missed.">      if (this == obj)</span>
<span class="nc" id="L305">        return true;</span>
<span class="pc bpc" id="L306" title="1 of 2 branches missed.">      if (obj == null)</span>
<span class="nc" id="L307">        return false;</span>
<span class="pc bpc" id="L308" title="1 of 2 branches missed.">      if (getClass() != obj.getClass())</span>
<span class="nc" id="L309">        return false;</span>
<span class="fc" id="L310">      final Match that = (Match) obj;</span>
<span class="pc bpc" id="L311" 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="L320">      int h = this.getClass().getSimpleName().hashCode();</span>
<span class="nc" id="L321">      h = (h * 5) ^ startPosition;</span>
<span class="nc" id="L322">      h = (h * 7) ^ endPosition;</span>
<span class="nc" id="L323">      return h;</span>
    }

  }

  /*
   * (non-Javadoc)
   *
   * @see org.apache.lucene.search.DocIdSetIterator#cost()
   */
  @Override
  public long cost() {
<span class="nc bnc" id="L335" 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="L345" 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>