---

MemCache.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.lemurproject.org/license.html
 *
 *==========================================================================
*/

#ifndef _MEMCACHE_HPP
#define _MEMCACHE_HPP

/*
 *
 * NAME DATE - COMMENTS
 * tnt 11/2000 - created
 * tnt 03/2001 - mudge to lemur toolkit standards
 *
 * =====================================================================*/
#include <cmath>
#include "common_headers.hpp"

#define MINPOW 5
#define MAXPOW 22
#define NLISTS MAXPOW-MINPOW+1

class MemCache {
public:
  MemCache(int cachesize);

  MemCache(int* cache, int cachesize);

  MemCache();

  ~MemCache();

  int* getMem(int chunksize);

  int* getMoreMem(int newsize, int* location, int oldsize);

  void freeMem(int* location, int memsize);

  void flushMem();

  const int* getBegin();
  const int* getEnd();

private:
  int* getFromFree(int csize);

  int* begin;           
  int  size;            
  int* end;             
  int  intsize;         
  //vector<int*> freelist;      /// a list of free memory holes
  vector<int*> freelist[NLISTS]; 
  bool ourmem; 
};

#endif

---