AbuseCacheStack.h

Go to the documentation of this file.

#ifndef ABUSECACHESTACK_H
#define ABUSECACHESTACK_H

#include <abuse/AbuseAddiesCache.h>
#include <deque>

/*
This class implements a stack of AbuseAddiesCache*;
Everytime the class is queried for an abuse addy, it loops over the 
stack and ask every cache, stopping when it finds a valid response.

Implementation Notes:
==================== 
- The stack is owner of the caches' pointers -> it will free them when
  it's destroyed. 
- As it handles some raw pointers, we should write a    
  copy ctor and an operator=, but - since we're not interested in deep-copying
  an AbuseCacheStack, we simply declare them private and not implemented.
*/

class AbuseCacheStack: public AbuseAddiesCache
{
public:
        AbuseCacheStack(){}
        //AbuseAddiesCache Interface
        virtual ~AbuseCacheStack();
        virtual std::list<std::string> query(const Url& url)const throw(std::runtime_error);
        virtual std::list<std::string> query(const std::string& doman)const throw(std::runtime_error);
        virtual void add(const UrlRange& range,const std::list<std::string>& addies);

        //other public methods
        //note: I don't use the usual notation myMethod
        //      I use the STL one, as it sounds more familiar here
        void push_front(AbuseAddiesCache* cache);
        void push_back(AbuseAddiesCache* cache);
        size_t size()const;
        AbuseAddiesCache* pop_front();
        AbuseAddiesCache* pop_back();
private:
        std::deque<AbuseAddiesCache*> m_stack;
        //not implemented!
        AbuseCacheStack(const AbuseCacheStack&);
        void operator=(const AbuseCacheStack&);
};

#endif  //ABUSECACHESTACK_H

---