FM / detail

/usr/include/boost/poly_collection/detail/

/usr/include/boost/poly_collection/detail

Name	Size	Mode	Actions
allocator_adaptor.hpp	9222	0644	edit dl rm
any_iterator.hpp	2356	0644	edit dl rm
any_model.hpp	6018	0644	edit dl rm
auto_iterator.hpp	1474	0644	edit dl rm
base_model.hpp	3294	0644	edit dl rm
callable_wrapper.hpp	2673	0644	edit dl rm
callable_wrapper_iterator.hpp	2610	0644	edit dl rm
functional.hpp	5202	0644	edit dl rm
function_model.hpp	3441	0644	edit dl rm
is_acceptable.hpp	1235	0644	edit dl rm
is_constructible.hpp	1459	0644	edit dl rm
is_equality_comparable.hpp	817	0644	edit dl rm
is_final.hpp	1419	0644	edit dl rm
is_invocable.hpp	2264	0644	edit dl rm
is_nothrow_eq_comparable.hpp	1064	0644	edit dl rm
iterator_impl.hpp	7050	0644	edit dl rm
iterator_traits.hpp	3056	0644	edit dl rm
packed_segment.hpp	9916	0644	edit dl rm
poly_collection.hpp	34291	0644	edit dl rm
segment.hpp	9731	0644	edit dl rm
segment_backend.hpp	3234	0644	edit dl rm
segment_split.hpp	4448	0644	edit dl rm
split_segment.hpp	13524	0644	edit dl rm
stride_iterator.hpp	4404	0644	edit dl rm
type_info_map.hpp	7309	0644	edit dl rm
type_restitution.hpp	5515	0644	edit dl rm
value_holder.hpp	7388	0644	edit dl rm

Edit: /usr/include/boost/poly_collection/detail/auto_iterator.hpp (1474B)

#ifndef BOOST_POLY_COLLECTION_DETAIL_AUTO_ITERATOR_HPP
#define BOOST_POLY_COLLECTION_DETAIL_AUTO_ITERATOR_HPP

#if defined(_MSC_VER)
#pragma once
#endif

#include <boost/iterator/iterator_adaptor.hpp>

namespace boost{

namespace poly_collection{

namespace detail{

/* auto_iterator<Iterator> (for want of a better name) behaves like Iterator
 * save for the fact that it derefs to Iterator& rather than
 * Iterator::reference. This is useful to "lift" std algorithms so that
 * user-defined predicates are passed iterators that can then be dereferenced
 * internally.
 */

template<typename Iterator>
class auto_iterator:
  public boost::iterator_adaptor<auto_iterator<Iterator>,Iterator,Iterator>
{
public:
  auto_iterator()=default;
  auto_iterator(const Iterator& it):auto_iterator::iterator_adaptor_{it}{}
  auto_iterator(const auto_iterator&)=default;
  auto_iterator& operator=(const auto_iterator&)=default;

private:
  friend class boost::iterator_core_access;

Iterator& dereference()const noexcept
  {
    return const_cast<auto_iterator*>(this)->base_reference();
  }
};

} /* namespace poly_collection::detail */

} /* namespace poly_collection */

} /* namespace boost */

#endif

/* Copyright 2016 Joaquin M Lopez Munoz. * Distributed under the Boost Software License, Version 1.0. * (See accompanying file LICENSE_1_0.txt or copy at * http://www.boost.org/LICENSE_1_0.txt) * * See http://www.boost.org/libs/poly_collection for library home page. */ #ifndef BOOST_POLY_COLLECTION_DETAIL_AUTO_ITERATOR_HPP #define BOOST_POLY_COLLECTION_DETAIL_AUTO_ITERATOR_HPP #if defined(_MSC_VER) #pragma once #endif #include namespace boost{ namespace poly_collection{ namespace detail{ /* auto_iterator (for want of a better name) behaves like Iterator * save for the fact that it derefs to Iterator& rather than * Iterator::reference. This is useful to "lift" std algorithms so that * user-defined predicates are passed iterators that can then be dereferenced * internally. */ template class auto_iterator: public boost::iterator_adaptor,Iterator,Iterator> { public: auto_iterator()=default; auto_iterator(const Iterator& it):auto_iterator::iterator_adaptor_{it}{} auto_iterator(const auto_iterator&)=default; auto_iterator& operator=(const auto_iterator&)=default; private: friend class boost::iterator_core_access; Iterator& dereference()const noexcept { return const_cast(this)->base_reference(); } }; } /* namespace poly_collection::detail */ } /* namespace poly_collection */ } /* namespace boost */ #endif