TheRock/rocm-systems/projects/rocprofiler-systems/external/dyninst/parseAPI/h/ParseContainers.h

/*
 * See the dyninst/COPYRIGHT file for copyright information.
 * 
 * We provide the Paradyn Tools (below described as "Paradyn")
 * on an AS IS basis, and do not warrant its validity or performance.
 * We reserve the right to update, modify, or discontinue this
 * software at any time.  We shall have no obligation to supply such
 * updates or modifications or any other form of support to you.
 * 
 * By your use of Paradyn, you understand and agree that we (or any
 * other person or entity with proprietary rights in Paradyn) are
 * under no obligation to provide either maintenance services,
 * update services, notices of latent defects, or correction of
 * defects for Paradyn.
 * 
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 * 
 * This library 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
 * Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
 */
#ifndef _ITERATORS_H_
#define _ITERATORS_H_

#include <dyncompat/iterator/filter_iterator.hpp>
#include <dyncompat/type_traits.hpp>
#include <dyncompat/function.hpp>
/*
 * An iterator and a predicate interface, and a 
 * ContainerWrapper that can provide a forward
 * predicate iterator for any container that exports
 * a begin() and end()
 */
 
namespace Dyninst {
namespace ParseAPI {


/*** A predicate interface ***/
template <
    typename VALUE,
    typename REFERENCE = VALUE &
>
class iterator_predicate {
 public:
inline bool operator()(const REFERENCE o) const
{
    return pred_impl(o);
}
 virtual bool pred_impl(const REFERENCE) const 
 {
   return true;
 }
 virtual ~iterator_predicate() 
 {
 }
 
 
};


/*** Container wrapper and iterators for predicate containers ***/

template<typename ARG>
 struct true_predicate : iterator_predicate<ARG>
{
  bool operator()(ARG)
  {
    return true;
  }
  
};
 
 
#if 0
template <
    typename C,
    typename VALUE,
    typename REFERENCE = VALUE &,
 class PREDICATE = iterator_predicate<VALUE, REFERENCE>
>
 class ContainerWrapper
 {
 private:

 public:
 
 typedef dyncompat::filter_iterator<PREDICATE, typename boost::remove_const<C>::type::iterator> iterator;
 typedef dyncompat::filter_iterator<PREDICATE, typename boost::remove_const<C>::type::const_iterator> const_iterator;
 

 PARSER_EXPORT ContainerWrapper(C & cont) : _m_container(cont) { }
 PARSER_EXPORT ~ContainerWrapper() { }

 iterator        begin()
 {
   return dyncompat::make_filter_iterator<PREDICATE>(_m_container.begin(), _m_container.end());
 }
 
 template <typename P>
 dyncompat::filter_iterator<P, typename boost::remove_const<C>::type::iterator> 
 begin(P * p)
 {
   return dyncompat::make_filter_iterator(*p, _m_container.begin(), _m_container.end());
 }
 
 iterator end()
 {
   return dyncompat::make_filter_iterator<PREDICATE>(_m_container.end(), _m_container.end());
 }
 template <typename P>
 dyncompat::filter_iterator<P, typename boost::remove_const<C>::type::iterator> 
 end(P * p)
 {
   return dyncompat::make_filter_iterator<>(*p, _m_container.end(), _m_container.end());
 }
 const_iterator        begin() const
 {
   return dyncompat::make_filter_iterator<PREDICATE>(_m_container.begin(), _m_container.end());
 }
 
 template <typename P>
 dyncompat::filter_iterator<P, typename boost::remove_const<C>::type::const_iterator> 
 begin(P * p) const
 {
   return dyncompat::make_filter_iterator(*p, _m_container.begin(), _m_container.end());
 }
 
 const_iterator end() const
 {
   return dyncompat::make_filter_iterator<PREDICATE>(_m_container.end(), _m_container.end());
 } 
 template <typename P>
 dyncompat::filter_iterator<P, typename boost::remove_const<C>::type::const_iterator> 
 end(P * p) const
 {
   return dyncompat::make_filter_iterator(*p, _m_container.end(), _m_container.end());
 }

 size_t          size() const;
 bool            empty() const;
 private:
 C & _m_container;
 };


/*** implementation details ***/

template<typename C,typename V,typename R,typename P>
inline size_t
ContainerWrapper<C,V,R,P>::size() const
{
    return _m_container.size();
}
template<typename C,typename V,typename R,typename P>
inline bool
ContainerWrapper<C,V,R,P>::empty() const
{
    return _m_container.empty();
}
#endif

/*** static binding implementation ***/

}
}

#endif