/* -*-  Mode: C++; c-file-style: "gnu"; indent-tabs-mode:nil; -*- */
/*
 * Copyright (c) 2011 University of California, Los Angeles
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License version 2 as
 * published by the Free Software Foundation;
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * Author: Alexander Afanasyev <alexander.afanasyev@ucla.edu>
 */

#ifndef EMPTY_POLICY_H_
#define EMPTY_POLICY_H_

namespace ndnSIM
{

/**
 * @brief Traits for empty (bogus) replacement policy
 */
struct empty_policy_traits
{
  typedef void* policy_hook_type;

  template<class Container> struct container_hook { typedef void* type; };

  template<class Base,
           class Container,
           class Hook>
  struct policy 
  {
    struct type
    {
      inline type (Base &base) {}
      
      inline void update (typename Container::iterator) { }
      inline bool insert (typename Container::iterator) { return true; }
      inline void lookup (typename Container::iterator item) { }
      inline void erase (typename Container::iterator item) { }
      inline void clear () { }
    };
  };
};

}

#endif // EMPTY_POLICY_H_