---

InvFPDocList.hpp

Go to the documentation of this file.

/*==========================================================================
 * Copyright (c) 2001 Carnegie Mellon University.  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.cs.cmu.edu/~lemur/license.html
 *
 *==========================================================================
*/


#ifndef _INVFPDOCLIST_HPP
#define _INVFPDOCLIST_HPP

/*
 * NAME DATE - COMMENTS
 * tnt 03/2001 - created
 *
 *========================================================================*/
#include <cmath>
#include "common_headers.hpp"
#include "DocInfoList.hpp"
#include "InvFPDocInfo.hpp"
#include "MemCache.hpp"

extern "C" {
  #include <cstdio>
}

#define DEFAULT 9

class InvFPDocList: public DocInfoList {
public:
  InvFPDocList();

  InvFPDocList(int id, int len);
  InvFPDocList(MemCache* mc, int id, int len);  
  InvFPDocList(MemCache* mc, int id, int len, int docid, int location);
  InvFPDocList(int id, int listlen, int* list, int fr, int* ldocid, int len);
  ~InvFPDocList();

  void setList(int id, int listlen, int* list, int fr, int* ldocid=NULL, int len=0);

  void setListSafe(int id, int listlen, int* list, int fr, int* ldocid, int len);

  void reset();

  void resetFree();

  bool allocMem();
  bool hasNoMem();
  bool addLocation(int docid, LOC_T location);

  void startIteration();
  bool hasMore();
  DocInfo* nextEntry();
  void nextEntry(InvFPDocInfo* info);

  DOCID_T curDocID() { if (lastid == NULL) return -1; return *lastid; };
  int docFreq() { return df; };
  int length() { return end-begin; };
  int termID() { return uid; };
  int termLen() { return strlength; };
  int curDocIDdiff() { return lastid-begin; };
  int curDocIDtf() { return *(lastid+1); };

  void binWrite(ofstream& of);

  bool binRead(ifstream& inf);

private:
  bool getMoreMem();
  int logb2(int num);

  int* begin;           // pointer to the beginning of this list
  int* lastid;  // pointer to the most recent DocID added
  int* freq;            // pointer to the frequency of the last DocID
  int* end;               // pointer to the next free memory
  int* iter;    // pointer tells us where we are in iteration
  int  size;            // how big are we, increment in powers of 2, start at 16K
  int  intsize; // sizeof(int) value
  int  strlength;       // the character length of our corresponding string
  TERMID_T  uid;                          // a unique ID for our string
  int  df;                        // the document frequency for current term
  MemCache* cache;      // the cache to get memory from
  bool hascache;        // remember if we have our own cache

  bool READ_ONLY;    // flag for whether this list can be added
};

#endif

---