mirror of
https://github.com/boostorg/mpl.git
synced 2025-07-31 21:34:44 +02:00
Merge branch 'develop'
This commit is contained in:
@@ -5,7 +5,7 @@ it possible to decouple `algorithms`__ from concrete compile-time `sequence
|
||||
implementations`__. Under the hood, all MPL sequence algorithms are
|
||||
implemented in terms of iterators. In particular, that means that they
|
||||
will work on any custom compile-time sequence, given that the appropriate
|
||||
iterator inteface is provided.
|
||||
iterator interface is provided.
|
||||
|
||||
__ `Algorithms`_
|
||||
__ `label-Sequences-Classes`_
|
||||
@@ -14,6 +14,6 @@ __ `label-Sequences-Classes`_
|
||||
.. More?
|
||||
|
||||
|
||||
.. copyright:: Copyright <EFBFBD> 2001-2009 Aleksey Gurtovoy and David Abrahams
|
||||
.. copyright:: Copyright © 2001-2009 Aleksey Gurtovoy and David Abrahams
|
||||
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)
|
||||
|
@@ -59,7 +59,7 @@ namespace boost { namespace mpl
|
||||
#define BOOST_MPL_MULTICHAR_LENGTH(c) \
|
||||
(std::size_t)((c<CHAR_MIN) ? 4 : ((c>0xffffff)+(c>0xffff)+(c>0xff)+1))
|
||||
|
||||
#if defined(BOOST_ENDIAN_LITTLE_BYTE) && defined(__SUNPRO_CC)
|
||||
#if BOOST_ENDIAN_LITTLE_BYTE && defined(__SUNPRO_CC)
|
||||
|
||||
#define BOOST_MPL_MULTICHAR_AT(c,i) \
|
||||
(char)(0xff&((unsigned)(c)>>(8*(std::size_t)(i))))
|
||||
|
Reference in New Issue
Block a user