EventDataCache.h

Go to the documentation of this file.

/*
 * EventDataCache.h
 *
 *  Created on: 11 Dec 2017
 *      Author: Nicola Mori
 */

#ifndef EVENTDATACACHE_H_
#define EVENTDATACACHE_H_

#include "core/ObjectWrapper.h"
#include "core/RetrievalResult.h"
#include <unordered_map>
#include <vector>

namespace EA {

class EventDataStore;

class EventDataCache {
public:
  EventDataCache(EventDataStore &evStore);

  bool BookObject(const std::string &objName, unsigned int sizeHint = 1000);

  bool CacheValues();

  bool Unbook(const std::string &objName = "");

  bool SetCurrentEvent(unsigned int event);

  RetrievalResult GetCachedValue(const std::string &objName, ObjectWrapper &wrapper);

  bool Clean(const std::string &objName = "");

  std::string GetStoreName();

private:
  EventDataStore &_evStore;
  unsigned int _currEv;

  // Cache structure: vector of wrappers, the vector index corresponds to the event ID. If the object is
  // missing for an event then for that event the wrapper wraps nothing.
  // This data structure is optimized for these hypotheses: the object is present for almost all the events
  // (i.e. there are almost no holes), first event is event 0 (i.e. we don't waste space at the beginning of
  // the container), event processing is done sequentially (i.e. we need efficient
  using Cache = std::vector<ObjectWrapper>;

  struct ObjCache {
    bool booked;
    Cache cache;
    ObjCache(unsigned int sizeHint) : booked(true) { cache.reserve(sizeHint); }
  };

  using ObjCacheMap = std::unordered_map<std::string, ObjCache>;
  ObjCacheMap _cacheMap;
};

} // namespace EA

#endif /* EVENTDATACACHE_H_ */