File Manager

Hackfut Security File Manager

Current Path: /opt/passenger-5.3.7-4.el6.cloudlinux/src/cxx_supportlib/vendor-modified/boost

opt / passenger-5.3.7-4.el6.cloudlinux / src / cxx_supportlib / vendor-modified / boost /

📁 ..
📁 algorithm
📄 aligned_storage.hpp(653 B)
📄 array.hpp(15.53 KB)
📁 asio
📄 asio.hpp(6.09 KB)
📄 assert.hpp(2.56 KB)
📁 atomic
📄 atomic.hpp(400 B)
📁 bind
📄 bind.hpp(936 B)
📄 call_traits.hpp(633 B)
📄 cerrno.hpp(4.09 KB)
📄 checked_delete.hpp(414 B)
📁 chrono
📄 chrono.hpp(706 B)
📁 circular_buffer
📄 circular_buffer.hpp(2.07 KB)
📄 circular_buffer_fwd.hpp(1.11 KB)
📁 concept
📄 concept_check.hpp(31.18 KB)
📁 config
📄 config.hpp(2.16 KB)
📁 container
📁 container_hash
📁 core
📄 cregex.hpp(721 B)
📄 cstdint.hpp(18.04 KB)
📄 current_function.hpp(1.66 KB)
📁 date_time
📁 detail
📄 enable_shared_from_this.hpp(525 B)
📁 exception
📄 exception_ptr.hpp(374 B)
📄 foreach.hpp(44.23 KB)
📄 foreach_fwd.hpp(1.66 KB)
📁 function
📄 function.hpp(2.46 KB)
📄 function_equal.hpp(791 B)
📁 functional
📄 get_pointer.hpp(2.23 KB)
📁 integer
📄 integer.hpp(11.32 KB)
📄 integer_fwd.hpp(5.06 KB)
📄 integer_traits.hpp(8.12 KB)
📁 intrusive
📄 intrusive_ptr.hpp(481 B)
📁 io
📄 io_fwd.hpp(2.33 KB)
📄 is_placeholder.hpp(634 B)
📁 iterator
📁 lexical_cast
📄 lexical_cast.hpp(3.2 KB)
📁 libs
📄 limits.hpp(6 KB)
📄 make_shared.hpp(464 B)
📁 math
📄 mem_fn.hpp(596 B)
📄 memory_order.hpp(2.63 KB)
📁 move
📁 mpl
📄 next_prior.hpp(5.01 KB)
📄 non_type.hpp(619 B)
📄 noncopyable.hpp(402 B)
📄 none.hpp(1.5 KB)
📄 none_t.hpp(953 B)
📁 numeric
📄 operators.hpp(34.88 KB)
📁 optional
📄 optional.hpp(528 B)
📁 parameter
📄 pointer_cast.hpp(3.6 KB)
📄 pointer_to_other.hpp(1.17 KB)
📁 pool
📁 predef
📄 predef.h(635 B)
📁 preprocessor
📁 random
📄 random.hpp(3.76 KB)
📁 range
📁 ratio
📄 ratio.hpp(349 B)
📄 rational.hpp(36.82 KB)
📄 ref.hpp(370 B)
📁 regex
📄 regex.h(2.12 KB)
📄 regex.hpp(823 B)
📄 regex_fwd.hpp(693 B)
📄 scoped_array.hpp(506 B)
📄 scoped_ptr.hpp(497 B)
📄 shared_array.hpp(536 B)
📄 shared_ptr.hpp(525 B)
📁 smart_ptr
📄 static_assert.hpp(7.07 KB)
📄 swap.hpp(374 B)
📁 system
📁 thread
📄 thread.hpp(839 B)
📄 throw_exception.hpp(2.91 KB)
📄 token_functions.hpp(18.85 KB)
📄 token_iterator.hpp(3.72 KB)
📄 tokenizer.hpp(2.72 KB)
📁 tuple
📄 type.hpp(481 B)
📁 type_index
📄 type_index.hpp(10.51 KB)
📁 type_traits
📁 typeof
📁 unordered
📄 unordered_map.hpp(568 B)
📄 unordered_set.hpp(568 B)
📁 utility
📄 utility.hpp(880 B)
📄 version.hpp(1.09 KB)
📄 visit_each.hpp(690 B)
📄 weak_ptr.hpp(462 B)

Editing: next_prior.hpp

//  Boost next_prior.hpp header file  ---------------------------------------//

//  (C) Copyright Dave Abrahams and Daniel Walker 1999-2003.
//  Copyright (c) Andrey Semashev 2017
//
//  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/utility for documentation.

//  Revision History
//  13 Dec 2003  Added next(x, n) and prior(x, n) (Daniel Walker)

#ifndef BOOST_NEXT_PRIOR_HPP_INCLUDED
#define BOOST_NEXT_PRIOR_HPP_INCLUDED

#include <iterator>
#include <boost/config.hpp>
#include <boost/core/enable_if.hpp>
#include <boost/type_traits/has_plus.hpp>
#include <boost/type_traits/has_plus_assign.hpp>
#include <boost/type_traits/has_minus.hpp>
#include <boost/type_traits/has_minus_assign.hpp>
#include <boost/iterator/advance.hpp>
#include <boost/iterator/reverse_iterator.hpp>

namespace boost {

//  Helper functions for classes like bidirectional iterators not supporting
//  operator+ and operator-
//
//  Usage:
//    const std::list<T>::iterator p = get_some_iterator();
//    const std::list<T>::iterator prev = boost::prior(p);
//    const std::list<T>::iterator next = boost::next(prev, 2);

//  Contributed by Dave Abrahams

namespace next_prior_detail {

// The trait attempts to detect if the T type is an iterator. Class-type iterators are assumed
// to have the nested type iterator_category. Strictly speaking, this is not required to be the
// case (e.g. a user can specialize iterator_traits for T without defining T::iterator_category).
// Still, this is a good heuristic in practice, and we can't do anything better anyway.
// Since C++17 we can test for iterator_traits<T>::iterator_category presence instead as it is
// required to be only present for iterators.
template< typename T, typename Void = void >
struct is_iterator_class
{
    static BOOST_CONSTEXPR_OR_CONST bool value = false;
};

template< typename T >
struct is_iterator_class<
    T,
    typename enable_if_has_type<
#if !defined(BOOST_NO_CXX17_ITERATOR_TRAITS)
        typename std::iterator_traits< T >::iterator_category
#else
        typename T::iterator_category
#endif
    >::type
>
{
    static BOOST_CONSTEXPR_OR_CONST bool value = true;
};

template< typename T >
struct is_iterator :
    public is_iterator_class< T >
{
};

template< typename T >
struct is_iterator< T* >
{
    static BOOST_CONSTEXPR_OR_CONST bool value = true;
};

template< typename T, typename Distance, bool HasPlus = has_plus< T, Distance >::value >
struct next_plus_impl;

template< typename T, typename Distance >
struct next_plus_impl< T, Distance, true >
{
    static T call(T x, Distance n)
    {
        return x + n;
    }
};

template< typename T, typename Distance, bool HasPlusAssign = has_plus_assign< T, Distance >::value >
struct next_plus_assign_impl :
    public next_plus_impl< T, Distance >
{
};

template< typename T, typename Distance >
struct next_plus_assign_impl< T, Distance, true >
{
    static T call(T x, Distance n)
    {
        x += n;
        return x;
    }
};

template< typename T, typename Distance, bool IsIterator = is_iterator< T >::value >
struct next_advance_impl :
    public next_plus_assign_impl< T, Distance >
{
};

template< typename T, typename Distance >
struct next_advance_impl< T, Distance, true >
{
    static T call(T x, Distance n)
    {
        boost::iterators::advance(x, n);
        return x;
    }
};

template< typename T, typename Distance, bool HasMinus = has_minus< T, Distance >::value >
struct prior_minus_impl;

template< typename T, typename Distance >
struct prior_minus_impl< T, Distance, true >
{
    static T call(T x, Distance n)
    {
        return x - n;
    }
};

template< typename T, typename Distance, bool HasMinusAssign = has_minus_assign< T, Distance >::value >
struct prior_minus_assign_impl :
    public prior_minus_impl< T, Distance >
{
};

template< typename T, typename Distance >
struct prior_minus_assign_impl< T, Distance, true >
{
    static T call(T x, Distance n)
    {
        x -= n;
        return x;
    }
};

template< typename T, typename Distance, bool IsIterator = is_iterator< T >::value >
struct prior_advance_impl :
    public prior_minus_assign_impl< T, Distance >
{
};

template< typename T, typename Distance >
struct prior_advance_impl< T, Distance, true >
{
    static T call(T x, Distance n)
    {
        // Avoid negating n to sidestep possible integer overflow
        boost::iterators::reverse_iterator< T > rx(x);
        boost::iterators::advance(rx, n);
        return rx.base();
    }
};

} // namespace next_prior_detail

template <class T>
inline T next(T x) { return ++x; }

template <class T, class Distance>
inline T next(T x, Distance n)
{
    return next_prior_detail::next_advance_impl< T, Distance >::call(x, n);
}

template <class T>
inline T prior(T x) { return --x; }

template <class T, class Distance>
inline T prior(T x, Distance n)
{
    return next_prior_detail::prior_advance_impl< T, Distance >::call(x, n);
}

} // namespace boost

#endif  // BOOST_NEXT_PRIOR_HPP_INCLUDED

Hackfut Security File Manager

Editing: next_prior.hpp

Upload File

Create Folder