Home Explore Help
Register Sign In
devn00b
/
EQ2EMu
9
3
Fork 0
Files Issues 59 Pull Requests 0 Wiki
Tree: 3d54fd32f3
Branches Tags
EQ2EMu
/
EQ2
/
source
/
depends
/
boost_1_72_0
/
libs
/
preprocessor
/
doc
/
ref
/
seq_rest_n.html

seq_rest_n.html 4.3 KB
History Raw

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455 
  1. <html>
    2. 

  2.   <head>
    3. 

  3.     <meta content="text/html; charset=windows-1252" http-equiv="content-type">
    4. 

  4.     <title>BOOST_PP_SEQ_REST_N</title>
    5. 

  5.     <link rel="stylesheet" type="text/css" href="../styles.css">
    6. 

  6.   </head>
    7. 

  7.   <body>
    8. 

  8.     <div style="margin-left: 0px;"> The <b>BOOST_PP_SEQ_REST_N</b> macro
    9. 

  9.       expands to a <i>seq</i> of all but the first <i>n</i> elements of a <i>seq</i>.
    10. 

  10.     </div>
    11. 

  11.     <h4> Usage </h4>
    12. 

  12.     <div class="code"> <b>BOOST_PP_SEQ_REST_N</b>(<i>n</i>, <i>seq</i>) </div>
    13. 

  13.     <h4> Arguments </h4>
    14. 

  14.     <dl>
    15. 

  15.       <dt>n</dt>
    16. 

  16.       <dd> The number of elements to remove. </dd>
    17. 

  17.       <dt>seq</dt>
    18. 

  18.       <dd> The <i>seq</i> from which the elements are to be removed. </dd>
    19. 

  19.     </dl>
    20. 

  20.     <h4> Remarks </h4>
    21. 

  21.     <div> This macro extracts <i>n</i> elements from the beginning of <i>seq</i>
    22. 

  22.       and returns the remainder of <i>seq</i> as a new <i>seq.<br>
    23. 

  23.         <br>
    24. 

  24.       </i>It is undefined behavior if <i>n </i>is greater or equal to the size
    25. 

  25.       of the <i>seq</i>. </div>
    26. 

  26.     <h4> See Also </h4>
    27. 

  27.     <ul>
    28. 

  28.       <li> <a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a></li>
    29. 

  29.     </ul>
    30. 

  30.     <h4> Requirements </h4>
    31. 

  31.     <div> <b>Header:</b> &nbsp;<a href="../headers/seq/rest_n.html">&lt;boost/preprocessor/seq/rest_n.hpp&gt;</a>
    32. 

  32.     </div>
    33. 

  33.     <h4> Sample Code </h4>
    34. 

  34.     <div>
    35. 

  35.       <pre>#include &lt;<a href="../headers/arithmetic/inc.html">boost/preprocessor/arithmetic/inc.hpp</a>&gt;<br>#include &lt;<a
    36. 

  36. href="../headers/seq/elem.html">boost/preprocessor/seq/elem.hpp</a>&gt;<br>#include &lt;<a
    37. 

  37. href="../headers/seq/first_n.html">boost/preprocessor/seq/first_n.hpp</a>&gt;<br>#include &lt;<a
    38. 

  38. href="../headers/seq/rest_n.html">boost/preprocessor/seq/rest_n.hpp</a>&gt;<br>#include &lt;<a
    39. 

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

  40. href="seq_elem.html">BOOST_PP_SEQ_ELEM</a>(y, <a href="seq_rest_n.html">BOOST_PP_SEQ_REST_N</a>(x, NUMBERS))<br><br>SUPER_ADD(100, 100) // expands to 200<br><br>#define SUPER_SUB(x, y) \<br>   <a
    41. 

  41. href="seq_size.html">BOOST_PP_SEQ_SIZE</a>( \<br>      <a href="seq_rest_n.html">BOOST_PP_SEQ_REST_N</a>( \<br>         <a
    42. 

  42. href="inc.html">BOOST_PP_INC</a>(y), \<br>         <a href="seq_first_n.html">BOOST_PP_SEQ_FIRST_N</a>( \<br>            <a
    43. 

  43. href="inc.html">BOOST_PP_INC</a>(x), NUMBERS \<br>         ) \<br>      ) \<br>   ) \<br>   /**/<br><br>SUPER_SUB(67, 25) // expands to 42</pre>
    44. 

  44.     </div>
    45. 

  45.     <hr size="1">
    46. 

  46.     <div style="margin-left: 0px;"> <i>© Copyright <a href="http://www.housemarque.com"
    47. 

  47.           target="_top">Housemarque Oy</a> 2002</i> <br>
    48. 

  48.       <i>© Copyright Paul Mensonides 2002</i> </div>
    49. 

  49.     <div style="margin-left: 0px;">
    50. 

  50.       <p><small>Distributed under the Boost Software License, Version 1.0. (See
    51. 

  51.           accompanying file <a href="../../../../LICENSE_1_0.txt">LICENSE_1_0.txt</a>
    52. 

  52.           or copy at <a href="http://www.boost.org/LICENSE_1_0.txt">www.boost.org/LICENSE_1_0.txt</a>)</small></p>
    53. 

  53.     </div>
    54. 

  54.   </body>
    55. 

  55. </html>
    56.