Repeater.cpp

Go to the documentation of this file.

#include "Repeater.h"

namespace forest {

Repeater::Repeater(int size) : n(size) {
                pmap = new HashMap<int64_t, Pair<int,int>, Hash::s64>(n);
                deadlines = new Dheap<int64_t>(n);
}

Repeater::~Repeater() { delete pmap; delete deadlines; } 

int Repeater::saveReq(int cx, int64_t seqNum, int64_t now, int idx) {
                int x = pmap->put(seqNum, Pair<int,int>(cx,3), idx);
                if (x == 0) return 0;
                deadlines->insert(x, now + 1000000000);
                return x;
}

pair<int,int> Repeater::deleteMatch(int64_t seqNum) {
                int idx = pmap->find(seqNum);
                if (idx == 0) return pair<int,int>(0,0);
                Pair<int,int>& vp = pmap->getValue(idx);
                deadlines->remove(idx);
                pmap->remove(seqNum);
                return pair<int,int>(vp.first,idx);
}

pair<int,int> Repeater::overdue(int64_t now) {
                int idx = deadlines->findmin();
                if (idx == 0 || now < deadlines->key(idx))
                                return pair<int,int>(0,0);
                Pair<int, int>& vp = pmap->getValue(idx);
                if (vp.second == 0) {
                                deadlines->remove(idx);
                                pmap->remove(pmap->getKey(idx));
                                return pair<int,int>(-vp.first,idx);
                }
                // push deadline back by one second and decrement repeat count
                deadlines->changekey(idx, now + 1000000000); vp.second--; 
                return pair<int,int>(vp.first,idx);
}
                                
} // ends namespace