CSTLAssociativeContainer.h

 
#pragma once
 
#if defined(CSTLAssociativeContainer_RECURSES)
#error Recursive header files inclusion detected in CSTLAssociativeContainer.h
#else // defined(CSTLAssociativeContainer_RECURSES)
#define CSTLAssociativeContainer_RECURSES
 
#if !defined CSTLAssociativeContainer_h
#define CSTLAssociativeContainer_h
 
// Inclusions
#include <iostream>
 
namespace DGtal
{
  namespace concepts
  {
    // class CSTLAssociativeContainer
    template <typename T>
      struct CSTLAssociativeContainer : boost::ForwardContainer<T>, boost::DefaultConstructible<T>
    {
      // ----------------------- Concept checks ------------------------------
    public:
      typedef typename T::iterator iterator;
      typedef typename T::value_type value_type;
      typedef typename T::key_type key_type;
      typedef typename T::size_type size_type;
      typedef typename T::const_iterator const_iterator;
 
      BOOST_CONCEPT_USAGE(CSTLAssociativeContainer)
      {
        x.erase(key);
        x.erase(p);
        x.erase(p, q);
        x.clear();
        p = x.find(key);
        r = x.equal_range(key);
        n = x.count(key);
      };
 
    private:
      void const_constraints(const T& cc)
      {
        ci = cc.find(key);
        n = cc.count(key);
        cr = cc.equal_range(key);
      }
    
 
    private:
      T x;
      iterator p,q;
      const_iterator ci;
      value_type val;
      key_type key;
      size_type n;
      std::pair<iterator,iterator> r;
      std::pair<const_iterator,const_iterator> cr;
    
    }; // end of concept CSTLAssociativeContainer
  } // namespace concept
} // namespace DGtal
 
 
 
//                                        //
 
#endif // !defined CSTLAssociativeContainer_h
 
#undef CSTLAssociativeContainer_RECURSES
#endif // else defined(CSTLAssociativeContainer_RECURSES)