FM / boost

/usr/include/boost

Name	Size	Mode	Actions
accumulators/	-	0755	rm
algorithm/	-	0755	rm
align/	-	0755	rm
archive/	-	0755	rm
asio/	-	0755	rm
assert/	-	0755	rm
assign/	-	0755	rm
atomic/	-	0755	rm
beast/	-	0755	rm
bimap/	-	0755	rm
bind/	-	0755	rm
callable_traits/	-	0755	rm
chrono/	-	0755	rm
circular_buffer/	-	0755	rm
compatibility/	-	0755	rm
compute/	-	0755	rm
concept/	-	0755	rm
concept_check/	-	0755	rm
config/	-	0755	rm
container/	-	0755	rm
container_hash/	-	0755	rm
context/	-	0755	rm
contract/	-	0755	rm
convert/	-	0755	rm
core/	-	0755	rm
coroutine/	-	0755	rm
coroutine2/	-	0755	rm
date_time/	-	0755	rm
detail/	-	0755	rm
dll/	-	0755	rm
dynamic_bitset/	-	0755	rm
endian/	-	0755	rm
exception/	-	0755	rm
fiber/	-	0755	rm
filesystem/	-	0755	rm
flyweight/	-	0755	rm
format/	-	0755	rm
function/	-	0755	rm
functional/	-	0755	rm
function_types/	-	0755	rm
fusion/	-	0755	rm
geometry/	-	0755	rm
gil/	-	0755	rm
graph/	-	0755	rm
hana/	-	0755	rm
heap/	-	0755	rm
histogram/	-	0755	rm
hof/	-	0755	rm
icl/	-	0755	rm
integer/	-	0755	rm
interprocess/	-	0755	rm
intrusive/	-	0755	rm
io/	-	0755	rm
iostreams/	-	0755	rm
iterator/	-	0755	rm
lambda/	-	0755	rm
lexical_cast/	-	0755	rm
locale/	-	0755	rm
local_function/	-	0755	rm
lockfree/	-	0755	rm
log/	-	0755	rm
logic/	-	0755	rm
math/	-	0755	rm
metaparse/	-	0755	rm
move/	-	0755	rm
mp11/	-	0755	rm
mpi/	-	0755	rm
mpl/	-	0755	rm
msm/	-	0755	rm
multiprecision/	-	0755	rm
multi_array/	-	0755	rm
multi_index/	-	0755	rm
nowide/	-	0755	rm
numeric/	-	0755	rm
optional/	-	0755	rm
outcome/	-	0755	rm
parameter/	-	0755	rm
pending/	-	0755	rm
phoenix/	-	0755	rm
polygon/	-	0755	rm
poly_collection/	-	0755	rm
pool/	-	0755	rm
predef/	-	0755	rm
preprocessor/	-	0755	rm
process/	-	0755	rm
program_options/	-	0755	rm
property_map/	-	0755	rm
property_tree/	-	0755	rm
proto/	-	0755	rm
ptr_container/	-	0755	rm
python/	-	0755	rm
qvm/	-	0755	rm
random/	-	0755	rm
range/	-	0755	rm
ratio/	-	0755	rm
regex/	-	0755	rm
safe_numerics/	-	0755	rm
serialization/	-	0755	rm
signals2/	-	0755	rm
smart_ptr/	-	0755	rm
sort/	-	0755	rm
spirit/	-	0755	rm
stacktrace/	-	0755	rm
statechart/	-	0755	rm
static_string/	-	0755	rm
stl_interfaces/	-	0755	rm
system/	-	0755	rm
test/	-	0755	rm
thread/	-	0755	rm
timer/	-	0755	rm
tti/	-	0755	rm
tuple/	-	0755	rm
typeof/	-	0755	rm
type_erasure/	-	0755	rm
type_index/	-	0755	rm
type_traits/	-	0755	rm
units/	-	0755	rm
unordered/	-	0755	rm
utility/	-	0755	rm
uuid/	-	0755	rm
variant/	-	0755	rm
variant2/	-	0755	rm
vmd/	-	0755	rm
wave/	-	0755	rm
winapi/	-	0755	rm
xpressive/	-	0755	rm
yap/	-	0755	rm
align.hpp	633	0644	edit dl rm
aligned_storage.hpp	653	0644	edit dl rm
any.hpp	9472	0644	edit dl rm
array.hpp	15827	0644	edit dl rm
asio.hpp	7472	0644	edit dl rm
assert.hpp	2625	0644	edit dl rm
assign.hpp	592	0644	edit dl rm
atomic.hpp	754	0644	edit dl rm
beast.hpp	591	0644	edit dl rm
bimap.hpp	387	0644	edit dl rm
bind.hpp	1809	0644	edit dl rm
blank.hpp	1985	0644	edit dl rm
blank_fwd.hpp	618	0644	edit dl rm
callable_traits.hpp	2138	0644	edit dl rm
call_traits.hpp	633	0644	edit dl rm
cast.hpp	584	0644	edit dl rm
cerrno.hpp	4187	0644	edit dl rm
checked_delete.hpp	414	0644	edit dl rm
chrono.hpp	706	0644	edit dl rm
circular_buffer.hpp	1946	0644	edit dl rm
circular_buffer_fwd.hpp	1137	0644	edit dl rm
compressed_pair.hpp	653	0644	edit dl rm
compute.hpp	1523	0644	edit dl rm
concept_archetype.hpp	23725	0644	edit dl rm
concept_check.hpp	31977	0644	edit dl rm
config.hpp	2216	0644	edit dl rm
contract.hpp	1842	0644	edit dl rm
contract_macro.hpp	56497	0644	edit dl rm
convert.hpp	7402	0644	edit dl rm
crc.hpp	94883	0644	edit dl rm
cregex.hpp	721	0644	edit dl rm
cstdfloat.hpp	2611	0644	edit dl rm
cstdint.hpp	18497	0644	edit dl rm
cstdlib.hpp	1739	0644	edit dl rm
current_function.hpp	1681	0644	edit dl rm
cxx11_char_types.hpp	4160	0644	edit dl rm
date_time.hpp	540	0644	edit dl rm
dll.hpp	712	0644	edit dl rm
dynamic_bitset.hpp	560	0644	edit dl rm
dynamic_bitset_fwd.hpp	675	0644	edit dl rm
enable_shared_from_this.hpp	525	0644	edit dl rm
endian.hpp	364	0644	edit dl rm
exception_ptr.hpp	396	0644	edit dl rm
filesystem.hpp	862	0644	edit dl rm
flyweight.hpp	604	0644	edit dl rm
foreach.hpp	45551	0644	edit dl rm
foreach_fwd.hpp	1702	0644	edit dl rm
format.hpp	2179	0644	edit dl rm
function.hpp	2524	0644	edit dl rm
functional.hpp	20124	0644	edit dl rm
function_equal.hpp	791	0644	edit dl rm
function_output_iterator.hpp	630	0644	edit dl rm
generator_iterator.hpp	2028	0644	edit dl rm
geometry.hpp	704	0644	edit dl rm
get_pointer.hpp	2288	0644	edit dl rm
gil.hpp	1697	0644	edit dl rm
hana.hpp	6807	0644	edit dl rm
histogram.hpp	1312	0644	edit dl rm
hof.hpp	2009	0644	edit dl rm
implicit_cast.hpp	810	0644	edit dl rm
indirect_reference.hpp	1036	0644	edit dl rm
integer.hpp	11593	0644	edit dl rm
integer_fwd.hpp	5181	0644	edit dl rm
integer_traits.hpp	8319	0644	edit dl rm
intrusive_ptr.hpp	481	0644	edit dl rm
io_fwd.hpp	1879	0644	edit dl rm
is_placeholder.hpp	634	0644	edit dl rm
iterator.hpp	459	0644	edit dl rm
iterator_adaptors.hpp	466	0644	edit dl rm
lexical_cast.hpp	3275	0644	edit dl rm
limits.hpp	6156	0644	edit dl rm
locale.hpp	887	0644	edit dl rm
local_function.hpp	18858	0644	edit dl rm
make_default.hpp	1510	0644	edit dl rm
make_shared.hpp	464	0644	edit dl rm
make_unique.hpp	293	0644	edit dl rm
math_fwd.hpp	975	0644	edit dl rm
memory_order.hpp	2457	0644	edit dl rm
mem_fn.hpp	596	0644	edit dl rm
metaparse.hpp	5281	0644	edit dl rm
mp11.hpp	641	0644	edit dl rm
mpi.hpp	1101	0644	edit dl rm
multi_array.hpp	18021	0644	edit dl rm
multi_index_container.hpp	44983	0644	edit dl rm
multi_index_container_fwd.hpp	3776	0644	edit dl rm
next_prior.hpp	5127	0644	edit dl rm
noncopyable.hpp	402	0644	edit dl rm
nondet_random.hpp	532	0644	edit dl rm
none.hpp	1609	0644	edit dl rm
none_t.hpp	953	0644	edit dl rm
non_type.hpp	619	0644	edit dl rm
operators.hpp	36574	0644	edit dl rm
operators_v1.hpp	37735	0644	edit dl rm
optional.hpp	528	0644	edit dl rm
outcome.hpp	1699	0644	edit dl rm
parameter.hpp	1082	0644	edit dl rm
phoenix.hpp	476	0644	edit dl rm
pointee.hpp	1807	0644	edit dl rm
pointer_cast.hpp	3688	0644	edit dl rm
pointer_to_other.hpp	1197	0644	edit dl rm
polymorphic_cast.hpp	5282	0644	edit dl rm
polymorphic_pointer_cast.hpp	2829	0644	edit dl rm
predef.h	635	0644	edit dl rm
preprocessor.hpp	487	0644	edit dl rm
process.hpp	1366	0644	edit dl rm
program_options.hpp	820	0644	edit dl rm
progress.hpp	5734	0644	edit dl rm
python.hpp	2950	0644	edit dl rm
random.hpp	3854	0644	edit dl rm
range.hpp	603	0644	edit dl rm
ratio.hpp	349	0644	edit dl rm
rational.hpp	39720	0644	edit dl rm
ref.hpp	370	0644	edit dl rm
regex.h	2174	0644	edit dl rm
regex.hpp	823	0644	edit dl rm
regex_fwd.hpp	693	0644	edit dl rm
scoped_array.hpp	506	0644	edit dl rm
scoped_ptr.hpp	497	0644	edit dl rm
scope_exit.hpp	54745	0644	edit dl rm
shared_array.hpp	536	0644	edit dl rm
shared_container_iterator.hpp	2154	0644	edit dl rm
shared_ptr.hpp	525	0644	edit dl rm
signals2.hpp	752	0644	edit dl rm
smart_ptr.hpp	780	0644	edit dl rm
spirit.hpp	1133	0644	edit dl rm
stacktrace.hpp	499	0644	edit dl rm
static_assert.hpp	7213	0644	edit dl rm
static_string.hpp	423	0644	edit dl rm
swap.hpp	374	0644	edit dl rm
thread.hpp	839	0644	edit dl rm
throw_exception.hpp	4328	0644	edit dl rm
timer.hpp	2781	0644	edit dl rm
tokenizer.hpp	2783	0644	edit dl rm
token_functions.hpp	19349	0644	edit dl rm
token_iterator.hpp	3810	0644	edit dl rm
type.hpp	481	0644	edit dl rm
type_index.hpp	10757	0644	edit dl rm
type_traits.hpp	7431	0644	edit dl rm
unordered_map.hpp	568	0644	edit dl rm
unordered_set.hpp	568	0644	edit dl rm
utility.hpp	880	0644	edit dl rm
variant.hpp	883	0644	edit dl rm
version.hpp	1117	0644	edit dl rm
visit_each.hpp	690	0644	edit dl rm
wave.hpp	944	0644	edit dl rm
weak_ptr.hpp	462	0644	edit dl rm

Edit: /usr/include/boost/array.hpp (15827B)

/* The following code declares class array,
 * an STL container (as wrapper) for arrays of constant size.
 *
 * See
 *      http://www.boost.org/libs/array/
 * for documentation.
 *
 * The original author site is at: http://www.josuttis.com/
 *
 * (C) Copyright Nicolai M. Josuttis 2001.
 *
 * 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)
 *
 *  9 Jan 2013 - (mtc) Added constexpr
 * 14 Apr 2012 - (mtc) Added support for boost::hash
 * 28 Dec 2010 - (mtc) Added cbegin and cend (and crbegin and crend) for C++Ox compatibility.
 * 10 Mar 2010 - (mtc) fill method added, matching resolution of the standard library working group.
 *      See <http://www.open-std.org/jtc1/sc22/wg21/docs/lwg-defects.html#776> or Trac issue #3168
 *      Eventually, we should remove "assign" which is now a synonym for "fill" (Marshall Clow)
 * 10 Mar 2010 - added workaround for SUNCC and !STLPort [trac #3893] (Marshall Clow)
 * 29 Jan 2004 - c_array() added, BOOST_NO_PRIVATE_IN_AGGREGATE removed (Nico Josuttis)
 * 23 Aug 2002 - fix for Non-MSVC compilers combined with MSVC libraries.
 * 05 Aug 2001 - minor update (Nico Josuttis)
 * 20 Jan 2001 - STLport fix (Beman Dawes)
 * 29 Sep 2000 - Initial Revision (Nico Josuttis)
 *
 * Jan 29, 2004
 */
#ifndef BOOST_ARRAY_HPP
#define BOOST_ARRAY_HPP

#include <boost/detail/workaround.hpp>

#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)  
# pragma warning(push)  
# pragma warning(disable:4996) // 'std::equal': Function call with parameters that may be unsafe
# pragma warning(disable:4510) // boost::array<T,N>' : default constructor could not be generated 
# pragma warning(disable:4610) // warning C4610: class 'boost::array<T,N>' can never be instantiated - user defined constructor required 
#endif

#include <cstddef>
#include <iterator>
#include <stdexcept>
#include <boost/assert.hpp>
#include <boost/static_assert.hpp>
#include <boost/swap.hpp>

#include <boost/throw_exception.hpp>
#include <algorithm>

// FIXES for broken compilers
#include <boost/config.hpp>

namespace boost {

template<class T, std::size_t N>
    class array {
      public:
        T elems[N];    // fixed-size array of elements of type T

public:
        // type definitions
        typedef T              value_type;
        typedef T*             iterator;
        typedef const T*       const_iterator;
        typedef T&             reference;
        typedef const T&       const_reference;
        typedef std::size_t    size_type;
        typedef std::ptrdiff_t difference_type;

// iterator support
        iterator        begin()       { return elems; }
        const_iterator  begin() const { return elems; }
        const_iterator cbegin() const { return elems; }
        
        iterator        end()       { return elems+N; }
        const_iterator  end() const { return elems+N; }
        const_iterator cend() const { return elems+N; }

// reverse iterator support
#if !defined(BOOST_MSVC_STD_ITERATOR) && !defined(BOOST_NO_STD_ITERATOR_TRAITS)
        typedef std::reverse_iterator<iterator> reverse_iterator;
        typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
#elif defined(_RWSTD_NO_CLASS_PARTIAL_SPEC) 
        typedef std::reverse_iterator<iterator, std::random_access_iterator_tag, 
              value_type, reference, iterator, difference_type> reverse_iterator; 
        typedef std::reverse_iterator<const_iterator, std::random_access_iterator_tag,
              value_type, const_reference, const_iterator, difference_type> const_reverse_iterator;
#else
        // workaround for broken reverse_iterator implementations
        typedef std::reverse_iterator<iterator,T> reverse_iterator;
        typedef std::reverse_iterator<const_iterator,T> const_reverse_iterator;
#endif

reverse_iterator rbegin() { return reverse_iterator(end()); }
        const_reverse_iterator rbegin() const {
            return const_reverse_iterator(end());
        }
        const_reverse_iterator crbegin() const {
            return const_reverse_iterator(end());
        }

reverse_iterator rend() { return reverse_iterator(begin()); }
        const_reverse_iterator rend() const {
            return const_reverse_iterator(begin());
        }
        const_reverse_iterator crend() const {
            return const_reverse_iterator(begin());
        }

// operator[]
        reference operator[](size_type i) 
        { 
            return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i]; 
        }
        
        /*BOOST_CONSTEXPR*/ const_reference operator[](size_type i) const 
        {     
            return BOOST_ASSERT_MSG( i < N, "out of range" ), elems[i]; 
        }

// at() with range check
        reference                           at(size_type i)       { return rangecheck(i), elems[i]; }
        /*BOOST_CONSTEXPR*/ const_reference at(size_type i) const { return rangecheck(i), elems[i]; }
    
        // front() and back()
        reference front() 
        { 
            return elems[0]; 
        }
        
        BOOST_CONSTEXPR const_reference front() const 
        {
            return elems[0];
        }
        
        reference back() 
        { 
            return elems[N-1]; 
        }
        
        BOOST_CONSTEXPR const_reference back() const 
        { 
            return elems[N-1]; 
        }

// size is constant
        static BOOST_CONSTEXPR size_type size() { return N; }
        static BOOST_CONSTEXPR bool empty() { return false; }
        static BOOST_CONSTEXPR size_type max_size() { return N; }
        enum { static_size = N };

// swap (note: linear complexity)
        void swap (array<T,N>& y) {
            for (size_type i = 0; i < N; ++i)
                boost::swap(elems[i],y.elems[i]);
        }

// direct access to data (read-only)
        const T* data() const { return elems; }
        T* data() { return elems; }

// use array as C array (direct read/write access to data)
        T* c_array() { return elems; }

// assignment with type conversion
        template <typename T2>
        array<T,N>& operator= (const array<T2,N>& rhs) {
            std::copy(rhs.begin(),rhs.end(), begin());
            return *this;
        }

// assign one value to all elements
        void assign (const T& value) { fill ( value ); }    // A synonym for fill
        void fill   (const T& value)
        {
            std::fill_n(begin(),size(),value);
        }

// check range (may be private because it is static)
        static BOOST_CONSTEXPR bool rangecheck (size_type i) {
            return i >= size() ? boost::throw_exception(std::out_of_range ("array<>: index out of range")), true : true;
        }

};

template< class T >
    class array< T, 0 > {

// iterator support
        iterator        begin()       { return       iterator( reinterpret_cast<       T * >( this ) ); }
        const_iterator  begin() const { return const_iterator( reinterpret_cast< const T * >( this ) ); }
        const_iterator cbegin() const { return const_iterator( reinterpret_cast< const T * >( this ) ); }

iterator        end()       { return  begin(); }
        const_iterator  end() const { return  begin(); }
        const_iterator cend() const { return cbegin(); }

// operator[]
        reference operator[](size_type /*i*/)
        {
            return failed_rangecheck();
        }

/*BOOST_CONSTEXPR*/ const_reference operator[](size_type /*i*/) const
        {
            return failed_rangecheck();
        }

// at() with range check
        reference at(size_type /*i*/)               {   return failed_rangecheck(); }
        /*BOOST_CONSTEXPR*/ const_reference at(size_type /*i*/) const   { return failed_rangecheck(); }

// front() and back()
        reference front()
        {
            return failed_rangecheck();
        }

BOOST_CONSTEXPR const_reference front() const
        {
            return failed_rangecheck();
        }

reference back()
        {
            return failed_rangecheck();
        }

BOOST_CONSTEXPR const_reference back() const
        {
            return failed_rangecheck();
        }

// size is constant
        static BOOST_CONSTEXPR size_type size() { return 0; }
        static BOOST_CONSTEXPR bool empty() { return true; }
        static BOOST_CONSTEXPR size_type max_size() { return 0; }
        enum { static_size = 0 };

void swap (array<T,0>& /*y*/) {
        }

// direct access to data (read-only)
        const T* data() const { return 0; }
        T* data() { return 0; }

// use array as C array (direct read/write access to data)
        T* c_array() { return 0; }

// assignment with type conversion
        template <typename T2>
        array<T,0>& operator= (const array<T2,0>& ) {
            return *this;
        }

// assign one value to all elements
        void assign (const T& value) { fill ( value ); }
        void fill   (const T& ) {}
        
        // check range (may be private because it is static)
        static reference failed_rangecheck () {
                std::out_of_range e("attempt to access element of an empty array");
                boost::throw_exception(e);
#if defined(BOOST_NO_EXCEPTIONS) || (!defined(BOOST_MSVC) && !defined(__PATHSCALE__))
                //
                // We need to return something here to keep
                // some compilers happy: however we will never
                // actually get here....
                //
                static T placeholder;
                return placeholder;
#endif
            }
    };

// comparisons
    template<class T, std::size_t N>
    bool operator== (const array<T,N>& x, const array<T,N>& y) {
        return std::equal(x.begin(), x.end(), y.begin());
    }
    template<class T, std::size_t N>
    bool operator< (const array<T,N>& x, const array<T,N>& y) {
        return std::lexicographical_compare(x.begin(),x.end(),y.begin(),y.end());
    }
    template<class T, std::size_t N>
    bool operator!= (const array<T,N>& x, const array<T,N>& y) {
        return !(x==y);
    }
    template<class T, std::size_t N>
    bool operator> (const array<T,N>& x, const array<T,N>& y) {
        return y<x;
    }
    template<class T, std::size_t N>
    bool operator<= (const array<T,N>& x, const array<T,N>& y) {
        return !(y<x);
    }
    template<class T, std::size_t N>
    bool operator>= (const array<T,N>& x, const array<T,N>& y) {
        return !(x<y);
    }

// global swap()
    template<class T, std::size_t N>
    inline void swap (array<T,N>& x, array<T,N>& y) {
        x.swap(y);
    }

#if defined(__SUNPRO_CC)
//  Trac ticket #4757; the Sun Solaris compiler can't handle
//  syntax like 'T(&get_c_array(boost::array<T,N>& arg))[N]'
//  
//  We can't just use this for all compilers, because the 
//      borland compilers can't handle this form. 
    namespace detail {
       template <typename T, std::size_t N> struct c_array
       {
           typedef T type[N];
       };
    }
    
   // Specific for boost::array: simply returns its elems data member.
   template <typename T, std::size_t N>
   typename detail::c_array<T,N>::type& get_c_array(boost::array<T,N>& arg)
   {
       return arg.elems;
   }

// Specific for boost::array: simply returns its elems data member.
   template <typename T, std::size_t N>
   typename detail::c_array<T,N>::type const& get_c_array(const boost::array<T,N>& arg)
   {
       return arg.elems;
   }
#else
// Specific for boost::array: simply returns its elems data member.
    template <typename T, std::size_t N>
    T(&get_c_array(boost::array<T,N>& arg))[N]
    {
        return arg.elems;
    }
    
    // Const version.
    template <typename T, std::size_t N>
    const T(&get_c_array(const boost::array<T,N>& arg))[N]
    {
        return arg.elems;
    }
#endif
    
#if 0
    // Overload for std::array, assuming that std::array will have
    // explicit conversion functions as discussed at the WG21 meeting
    // in Summit, March 2009.
    template <typename T, std::size_t N>
    T(&get_c_array(std::array<T,N>& arg))[N]
    {
        return static_cast<T(&)[N]>(arg);
    }
    
    // Const version.
    template <typename T, std::size_t N>
    const T(&get_c_array(const std::array<T,N>& arg))[N]
    {
        return static_cast<T(&)[N]>(arg);
    }
#endif

template <class It> std::size_t hash_range(It, It);

template<class T, std::size_t N>
    std::size_t hash_value(const array<T,N>& arr)
    {
        return boost::hash_range(arr.begin(), arr.end());
    }

template <size_t Idx, typename T, size_t N>
   T &get(boost::array<T,N> &arr) BOOST_NOEXCEPT {
       BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(boost::array &) index out of range" );
       return arr[Idx];
       }
    
   template <size_t Idx, typename T, size_t N>
   const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT {
       BOOST_STATIC_ASSERT_MSG ( Idx < N, "boost::get<>(const boost::array &) index out of range" );
       return arr[Idx];
       }

} /* namespace boost */

#ifndef BOOST_NO_CXX11_HDR_ARRAY
//  If we don't have std::array, I'm assuming that we don't have std::get
namespace std {
   template <size_t Idx, typename T, size_t N>
   T &get(boost::array<T,N> &arr) BOOST_NOEXCEPT {
       BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(boost::array &) index out of range" );
       return arr[Idx];
       }
    
   template <size_t Idx, typename T, size_t N>
   const T &get(const boost::array<T,N> &arr) BOOST_NOEXCEPT {
       BOOST_STATIC_ASSERT_MSG ( Idx < N, "std::get<>(const boost::array &) index out of range" );
       return arr[Idx];
       }
}
#endif

#if BOOST_WORKAROUND(BOOST_MSVC, >= 1400)  
# pragma warning(pop)  
#endif

#endif /*BOOST_ARRAY_HPP*/

cmd: