---

MatchInfo.hpp

Go to the documentation of this file.

/*==========================================================================
 * Copyright (c) 2002-2003 University of Massachusetts.  All Rights Reserved.
 *
 * Use of the Lemur Toolkit for Language Modeling and Information Retrieval
 * is subject to the terms of the software license set forth in the LICENSE
 * file included with this software, and also available at
 * http://www.lemurproject.org/license.html
 *
 *==========================================================================
*/
/*
 * author: dmf
 * 
*/
#ifndef _MATCHINFO_HPP_
#define _MATCHINFO_HPP_
#include <vector>
#include <algorithm>

#include "RetrievalMethod.hpp"

class TMatch {
public:
  TMatch(TERMID_T t, int s, int e, int p): tid(t), start(s), end(e), 
                                      position(p) { }
  TERMID_T tid;
  int start;
  int end;
  int position;
};

class MatchInfo : public vector<TMatch> {
public: 
  virtual ~MatchInfo() {}

  int count() const {return size();}

  // void startIteration() const {iter = matchList.begin();}
  //bool hasMore() const {return(iter != matchList.end());}

  //TMatch nextMatch() const {TMatch ret = *iter; iter++; return ret;}

  static MatchInfo *getMatches(const Index &ind, const Query &qry, DOCID_T docID);

private:
  MatchInfo() {}

  void add(TERMID_T tid, int position, int start=-1, int end=-1) {
    TMatch t(tid, start, end, position);
    //matchList.push_back(t);
    push_back(t);
  }

  class TMatchAscending {
  public:
    bool operator()(const TMatch & a, const TMatch & b) {
      return a.position < b.position;
    }
  };

  void sort() {
    TMatchAscending tma;
    //    std::sort(matchList.begin(), matchList.end(), tma);
    std::sort(this->begin(), this->end(), tma);
  }

  //  vector<TMatch> matchList;
  //mutable vector<TMatch>::iterator iter;
};
#endif

---