From 862f64c45ced71bfab9d4fdf7d5f50d0da43439c Mon Sep 17 00:00:00 2001 From: Edward Diener Date: Mon, 18 May 2015 17:02:48 -0400 Subject: [PATCH] Updated documentation about undefined behavior. --- doc/ref/seq_rest_n.html | 118 ++++++++++++++++++---------------------- 1 file changed, 53 insertions(+), 65 deletions(-) diff --git a/doc/ref/seq_rest_n.html b/doc/ref/seq_rest_n.html index 16a53df..808ef9b 100644 --- a/doc/ref/seq_rest_n.html +++ b/doc/ref/seq_rest_n.html @@ -1,67 +1,55 @@ - - BOOST_PP_SEQ_REST_N - - - -
- The BOOST_PP_SEQ_REST_N macro expands to a seq of all but the - first n elements of a seq. -
-

- Usage -

-
- BOOST_PP_SEQ_REST_N(n, seq) -
-

- Arguments -

-
-
n
-
- The number of elements to remove. -
-
seq
-
- The seq from which the elements are to be removed. -
-
-

- Remarks -

-
- This macro extracts n elements from the beginning of seq and - returns the remainder of seq as a new seq -
-

- See Also -

- -

- Requirements -

-
- Header:  <boost/preprocessor/seq/rest_n.hpp> -
-

- Sample Code -

-
-
#include <boost/preprocessor/arithmetic/inc.hpp>
#include <boost/preprocessor/seq/elem.hpp>
#include <boost/preprocessor/seq/first_n.hpp>
#include <boost/preprocessor/seq/rest_n.hpp>
#include <boost/preprocessor/seq/size.hpp>

#define NUMBERS \
(0)(1)(2)(3)(4)(5)(6)(7)(8)(9) \
(10)(11)(12)(13)(14)(15)(16)(17)(18)(19) \
(20)(21)(22)(23)(24)(25)(26)(27)(28)(29) \
(30)(31)(32)(33)(34)(35)(36)(37)(38)(39) \
(40)(41)(42)(43)(44)(45)(46)(47)(48)(49) \
(50)(51)(52)(53)(54)(55)(56)(57)(58)(59) \
(60)(61)(62)(63)(64)(65)(66)(67)(68)(69) \
(70)(71)(72)(73)(74)(75)(76)(77)(78)(79) \
(80)(81)(82)(83)(84)(85)(86)(87)(88)(89) \
(90)(91)(92)(93)(94)(95)(96)(97)(98)(99) \
(100)(101)(102)(103)(104)(105)(106)(107)(108)(109) \
(110)(111)(112)(113)(114)(115)(116)(117)(118)(119) \
(120)(121)(122)(123)(124)(125)(126)(127)(128)(129) \
(130)(131)(132)(133)(134)(135)(136)(137)(138)(139) \
(140)(141)(142)(143)(144)(145)(146)(147)(148)(149) \
(150)(151)(152)(153)(154)(155)(156)(157)(158)(159) \
(160)(161)(162)(163)(164)(165)(166)(167)(168)(169) \
(170)(171)(172)(173)(174)(175)(176)(177)(178)(179) \
(180)(181)(182)(183)(184)(185)(186)(187)(188)(189) \
(190)(191)(192)(193)(194)(195)(196)(197)(198)(199) \
(200)(201)(202)(203)(204)(205)(206)(207)(208)(209) \
(210)(211)(212)(213)(214)(215)(216)(217)(218)(219) \
(220)(221)(222)(223)(224)(225)(226)(227)(228)(229) \
(230)(231)(232)(233)(234)(235)(236)(237)(238)(239) \
(240)(241)(242)(243)(244)(245)(246)(247)(248)(249) \
(250)(251)(252)(253)(254)(255)(256) \
/**/

#define SUPER_ADD(x, y) BOOST_PP_SEQ_ELEM(y, BOOST_PP_SEQ_REST_N(x, NUMBERS))

SUPER_ADD(100, 100) // expands to 200

#define SUPER_SUB(x, y) \
BOOST_PP_SEQ_SIZE( \
BOOST_PP_SEQ_REST_N( \
BOOST_PP_INC(y), \
BOOST_PP_SEQ_FIRST_N( \
BOOST_PP_INC(x), NUMBERS \
) \
) \
) \
/**/

SUPER_SUB(67, 25) // expands to 42
-
-
-
- © Copyright Housemarque Oy 2002 -
© Copyright Paul Mensonides 2002 -
-
-

Distributed under the Boost Software License, Version 1.0. (See - accompanying file LICENSE_1_0.txt or - copy at www.boost.org/LICENSE_1_0.txt)

-
- + + + BOOST_PP_SEQ_REST_N + + + +
The BOOST_PP_SEQ_REST_N macro + expands to a seq of all but the first n elements of a seq. +
+

Usage

+
BOOST_PP_SEQ_REST_N(n, seq)
+

Arguments

+
+
n
+
The number of elements to remove.
+
seq
+
The seq from which the elements are to be removed.
+
+

Remarks

+
This macro extracts n elements from the beginning of seq + and returns the remainder of seq as a new seq.
+
+
It is undefined behavior if n is greater or equal to the size + of the seq.
+

See Also

+ +

Requirements

+
Header:  <boost/preprocessor/seq/rest_n.hpp> +
+

Sample Code

+
+
#include <boost/preprocessor/arithmetic/inc.hpp>
#include <boost/preprocessor/seq/elem.hpp>
#include <boost/preprocessor/seq/first_n.hpp>
#include <boost/preprocessor/seq/rest_n.hpp>
#include <boost/preprocessor/seq/size.hpp>

#define NUMBERS \
(0)(1)(2)(3)(4)(5)(6)(7)(8)(9) \
(10)(11)(12)(13)(14)(15)(16)(17)(18)(19) \
(20)(21)(22)(23)(24)(25)(26)(27)(28)(29) \
(30)(31)(32)(33)(34)(35)(36)(37)(38)(39) \
(40)(41)(42)(43)(44)(45)(46)(47)(48)(49) \
(50)(51)(52)(53)(54)(55)(56)(57)(58)(59) \
(60)(61)(62)(63)(64)(65)(66)(67)(68)(69) \
(70)(71)(72)(73)(74)(75)(76)(77)(78)(79) \
(80)(81)(82)(83)(84)(85)(86)(87)(88)(89) \
(90)(91)(92)(93)(94)(95)(96)(97)(98)(99) \
(100)(101)(102)(103)(104)(105)(106)(107)(108)(109) \
(110)(111)(112)(113)(114)(115)(116)(117)(118)(119) \
(120)(121)(122)(123)(124)(125)(126)(127)(128)(129) \
(130)(131)(132)(133)(134)(135)(136)(137)(138)(139) \
(140)(141)(142)(143)(144)(145)(146)(147)(148)(149) \
(150)(151)(152)(153)(154)(155)(156)(157)(158)(159) \
(160)(161)(162)(163)(164)(165)(166)(167)(168)(169) \
(170)(171)(172)(173)(174)(175)(176)(177)(178)(179) \
(180)(181)(182)(183)(184)(185)(186)(187)(188)(189) \
(190)(191)(192)(193)(194)(195)(196)(197)(198)(199) \
(200)(201)(202)(203)(204)(205)(206)(207)(208)(209) \
(210)(211)(212)(213)(214)(215)(216)(217)(218)(219) \
(220)(221)(222)(223)(224)(225)(226)(227)(228)(229) \
(230)(231)(232)(233)(234)(235)(236)(237)(238)(239) \
(240)(241)(242)(243)(244)(245)(246)(247)(248)(249) \
(250)(251)(252)(253)(254)(255)(256) \
/**/

#define SUPER_ADD(x, y) BOOST_PP_SEQ_ELEM(y, BOOST_PP_SEQ_REST_N(x, NUMBERS))

SUPER_ADD(100, 100) // expands to 200

#define SUPER_SUB(x, y) \
BOOST_PP_SEQ_SIZE( \
BOOST_PP_SEQ_REST_N( \
BOOST_PP_INC(y), \
BOOST_PP_SEQ_FIRST_N( \
BOOST_PP_INC(x), NUMBERS \
) \
) \
) \
/**/

SUPER_SUB(67, 25) // expands to 42
+
+
+
© Copyright Housemarque Oy 2002
+ © Copyright Paul Mensonides 2002
+
+

Distributed under the Boost Software License, Version 1.0. (See + accompanying file LICENSE_1_0.txt + or copy at www.boost.org/LICENSE_1_0.txt)

+
+