seq.cxx 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222
  1. # /* **************************************************************************
  2. # * *
  3. # * (C) Copyright Paul Mensonides 2002.
  4. # * Distributed under the Boost Software License, Version 1.0. (See
  5. # * accompanying file LICENSE_1_0.txt or copy at
  6. # * http://www.boost.org/LICENSE_1_0.txt)
  7. # * *
  8. # ************************************************************************** */
  9. #
  10. # /* Revised by Edward Diener (2011) */
  11. #
  12. # /* See http://www.boost.org for most recent version. */
  13. #
  14. # include <boost/preprocessor/arithmetic/add.hpp>
  15. # include <boost/preprocessor/arithmetic/mod.hpp>
  16. # include <boost/preprocessor/arithmetic/sub.hpp>
  17. # include <boost/preprocessor/cat.hpp>
  18. # include <boost/preprocessor/comparison/equal.hpp>
  19. # include <boost/preprocessor/comparison/less.hpp>
  20. # include <boost/preprocessor/control/iif.hpp>
  21. # include <boost/preprocessor/facilities/is_empty.hpp>
  22. # include <boost/preprocessor/logical/not.hpp>
  23. # include <boost/preprocessor/seq.hpp>
  24. # include <boost/preprocessor/array/elem.hpp>
  25. # include <boost/preprocessor/array/size.hpp>
  26. # include <boost/preprocessor/tuple/elem.hpp>
  27. # include <boost/preprocessor/tuple/size.hpp>
  28. # include <boost/preprocessor/list/at.hpp>
  29. # include <boost/preprocessor/list/size.hpp>
  30. # include <boost/preprocessor/variadic/elem.hpp>
  31. # include <boost/preprocessor/variadic/size.hpp>
  32. # include <libs/preprocessor/test/test.h>
  33. # define SEQ_NONE ()
  34. # define SEQ (4)(1)(5)(2)
  35. # define SEQ_100 \
  36. (1)(2)(3)(4)(5)(6)(7)(8)(9) \
  37. (10)(11)(12)(13)(14)(15)(16)(17)(18)(19) \
  38. (20)(21)(22)(23)(24)(25)(26)(27)(28)(29) \
  39. (30)(31)(32)(33)(34)(35)(36)(37)(38)(39) \
  40. (40)(41)(42)(43)(44)(45)(46)(47)(48)(49) \
  41. (50)(51)(52)(53)(54)(55)(56)(57)(58)(59) \
  42. (60)(61)(62)(63)(64)(65)(66)(67)(68)(69) \
  43. (70)(71)(72)(73)(74)(75)(76)(77)(78)(79) \
  44. (80)(81)(82)(83)(84)(85)(86)(87)(88)(89) \
  45. (90)(91)(92)(93)(94)(95)(96)(97)(98)(99) \
  46. (100)
  47. # define SEQ_255 \
  48. (1)(2)(3)(4)(5)(6)(7)(8)(9) \
  49. (10)(11)(12)(13)(14)(15)(16)(17)(18)(19) \
  50. (20)(21)(22)(23)(24)(25)(26)(27)(28)(29) \
  51. (30)(31)(32)(33)(34)(35)(36)(37)(38)(39) \
  52. (40)(41)(42)(43)(44)(45)(46)(47)(48)(49) \
  53. (50)(51)(52)(53)(54)(55)(56)(57)(58)(59) \
  54. (60)(61)(62)(63)(64)(65)(66)(67)(68)(69) \
  55. (70)(71)(72)(73)(74)(75)(76)(77)(78)(79) \
  56. (80)(81)(82)(83)(84)(85)(86)(87)(88)(89) \
  57. (90)(91)(92)(93)(94)(95)(96)(97)(98)(99) \
  58. (100)(101)(102)(103)(104)(105)(106)(107)(108)(109) \
  59. (110)(111)(112)(113)(114)(115)(116)(117)(118)(119) \
  60. (120)(121)(122)(123)(124)(125)(126)(127)(128)(129) \
  61. (130)(131)(132)(133)(134)(135)(136)(137)(138)(139) \
  62. (140)(141)(142)(143)(144)(145)(146)(147)(148)(149) \
  63. (150)(151)(152)(153)(154)(155)(156)(157)(158)(159) \
  64. (160)(161)(162)(163)(164)(165)(166)(167)(168)(169) \
  65. (170)(171)(172)(173)(174)(175)(176)(177)(178)(179) \
  66. (180)(181)(182)(183)(184)(185)(186)(187)(188)(189) \
  67. (190)(191)(192)(193)(194)(195)(196)(197)(198)(199) \
  68. (200)(201)(202)(203)(204)(205)(206)(207)(208)(209) \
  69. (210)(211)(212)(213)(214)(215)(216)(217)(218)(219) \
  70. (220)(221)(222)(223)(224)(225)(226)(227)(228)(229) \
  71. (230)(231)(232)(233)(234)(235)(236)(237)(238)(239) \
  72. (240)(241)(242)(243)(244)(245)(246)(247)(248)(249) \
  73. (250)(251)(252)(253)(254)(255)
  74. # define SEQ_256 SEQ_255(256)
  75. # define SEQVAR (4,5,8,3,61)(1,0)(5,22,43)(2)(17,45,33)
  76. # define REVERSAL(s, x, y) BOOST_PP_SUB(y, x)
  77. # define SUB_S(s, x, y) BOOST_PP_SUB(x, y)
  78. # define ADD_S(s, x, y) BOOST_PP_ADD(x, y)
  79. # define CAT_S(s, x, y) BOOST_PP_CAT(x, BOOST_PP_IS_EMPTY(y))
  80. BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_HEAD(SEQ_NONE)) == 1 END
  81. BEGIN BOOST_PP_SEQ_HEAD(SEQ) == 4 END
  82. BEGIN BOOST_PP_SEQ_HEAD(SEQ_255) == 1 END
  83. BEGIN BOOST_PP_SEQ_HEAD(SEQ_256) == 1 END
  84. BEGIN BOOST_PP_SEQ_FOLD_LEFT(CAT_S, 1, SEQ_NONE) == 11 END
  85. BEGIN BOOST_PP_SEQ_FOLD_LEFT(SUB_S, 22, SEQ) == 10 END
  86. BEGIN BOOST_PP_SEQ_FOLD_RIGHT(CAT_S, 2, SEQ_NONE) == 21 END
  87. BEGIN BOOST_PP_SEQ_FOLD_RIGHT(ADD_S, 0, SEQ) == 12 END
  88. BEGIN BOOST_PP_SEQ_FOLD_RIGHT(REVERSAL, 0, SEQ) == 4 END
  89. BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REVERSE(SEQ_NONE))) == 1 END
  90. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REVERSE(SEQ)) == 2514 END
  91. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REST_N(2, SEQ)) == 52 END
  92. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REST_N(99, SEQ_100)) == 100 END
  93. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REST_N(255, SEQ_256)) == 256 END
  94. BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_FIRST_N(1, SEQ_NONE))) == 1 END
  95. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_FIRST_N(2, SEQ)) == 41 END
  96. BEGIN BOOST_PP_SEQ_ELEM(50,BOOST_PP_SEQ_FIRST_N(100, SEQ_100)) == 51 END
  97. BEGIN BOOST_PP_SEQ_ELEM(100,BOOST_PP_SEQ_FIRST_N(255, SEQ_255)) == 101 END
  98. BEGIN BOOST_PP_SEQ_ELEM(200,BOOST_PP_SEQ_FIRST_N(256, SEQ_256)) == 201 END
  99. BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_SEQ_ELEM(0, SEQ_NONE)) == 1 END
  100. BEGIN BOOST_PP_SEQ_SIZE(SEQ_NONE) == 1 END
  101. BEGIN BOOST_PP_SEQ_ELEM(2, SEQ) == 5 END
  102. BEGIN BOOST_PP_SEQ_ELEM(20, SEQ_255) == 21 END
  103. BEGIN BOOST_PP_SEQ_ELEM(254, SEQ_255) == 255 END
  104. BEGIN BOOST_PP_SEQ_ELEM(220, SEQ_256) == 221 END
  105. BEGIN BOOST_PP_SEQ_ELEM(255, SEQ_256) == 256 END
  106. BEGIN BOOST_PP_SEQ_SIZE(SEQ) == 4 END
  107. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_TRANSFORM(CAT_S, 13, SEQ_NONE)) == 131 END
  108. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_TRANSFORM(ADD_S, 2, SEQ)) == 6374 END
  109. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_TAIL(SEQ) SEQ) == 1524152 END
  110. # define F1(r, state, x) + x + state
  111. # define FI2(r, state, i, x) BOOST_PP_IIF(BOOST_PP_EQUAL(i,2),+ x + x + state,+ x + state)
  112. BEGIN BOOST_PP_SEQ_FOR_EACH(F1, 1, SEQ) == 16 END
  113. BEGIN BOOST_PP_SEQ_FOR_EACH_I(FI2, 1, SEQ) == 21 END
  114. BEGIN BOOST_PP_TUPLE_ELEM(4, 3, BOOST_PP_SEQ_TO_TUPLE(SEQ)) == 2 END
  115. BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_TUPLE_ELEM(1, 0, BOOST_PP_SEQ_TO_TUPLE(SEQ_NONE))) == 1 END
  116. #if BOOST_PP_VARIADICS
  117. BEGIN BOOST_PP_TUPLE_SIZE(BOOST_PP_SEQ_TO_TUPLE(SEQ_NONE)) == 1 END
  118. #endif
  119. BEGIN BOOST_PP_ARRAY_ELEM(3, BOOST_PP_SEQ_TO_ARRAY(SEQ)) == 2 END
  120. BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_ARRAY_ELEM(0, BOOST_PP_SEQ_TO_ARRAY(SEQ_NONE))) == 1 END
  121. BEGIN BOOST_PP_ARRAY_SIZE(BOOST_PP_SEQ_TO_ARRAY(SEQ_NONE)) == 1 END
  122. # define LESS_S(s, x, y) BOOST_PP_LESS(x, y)
  123. # define FILTER_MOD_S(s, data, elem) BOOST_PP_NOT(BOOST_PP_MOD(elem,data))
  124. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_FILTER(LESS_S, 3, SEQ)) == 45 END
  125. BEGIN BOOST_PP_SEQ_ELEM(4,BOOST_PP_SEQ_FILTER(FILTER_MOD_S, 20, SEQ_100)) == 100 END
  126. BEGIN BOOST_PP_SEQ_ELEM(2,BOOST_PP_SEQ_FILTER(FILTER_MOD_S, 30, SEQ_100)) == 90 END
  127. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_INSERT(SEQ_NONE, 0, 7)) == 7 END
  128. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_INSERT(SEQ, 0, 3)) == 34152 END
  129. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_INSERT(SEQ, 2, 3)) == 41352 END
  130. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_INSERT(SEQ, 4, 3)) == 41523 END
  131. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_INSERT(SEQ_255, 0, 100)) == 256 END
  132. BEGIN BOOST_PP_SEQ_ELEM(255,BOOST_PP_SEQ_INSERT(SEQ_255, 0, 100)) == 255 END
  133. BEGIN BOOST_PP_SEQ_ELEM(0,BOOST_PP_SEQ_INSERT(SEQ_255, 0, 113)) == 113 END
  134. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_POP_BACK(SEQ)) == 415 END
  135. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_POP_BACK(SEQ_256)) == 255 END
  136. BEGIN BOOST_PP_SEQ_ELEM(254,BOOST_PP_SEQ_POP_BACK(SEQ_256)) == 255 END
  137. BEGIN BOOST_PP_SEQ_ELEM(100,BOOST_PP_SEQ_POP_BACK(SEQ_256)) == 101 END
  138. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_POP_FRONT(SEQ)) == 152 END
  139. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_POP_FRONT(SEQ_256)) == 255 END
  140. BEGIN BOOST_PP_SEQ_ELEM(0,BOOST_PP_SEQ_POP_FRONT(SEQ_256)) == 2 END
  141. BEGIN BOOST_PP_SEQ_ELEM(254,BOOST_PP_SEQ_POP_FRONT(SEQ_256)) == 256 END
  142. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_PUSH_FRONT(SEQ_NONE, 145)) == 145 END
  143. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_PUSH_FRONT(SEQ, 3)) == 34152 END
  144. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_PUSH_FRONT(SEQ_255, 57)) == 256 END
  145. BEGIN BOOST_PP_SEQ_ELEM(0,BOOST_PP_SEQ_PUSH_FRONT(SEQ_255, 222)) == 222 END
  146. BEGIN BOOST_PP_SEQ_ELEM(255,BOOST_PP_SEQ_PUSH_FRONT(SEQ_255, 111)) == 255 END
  147. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_PUSH_BACK(SEQ_NONE, 79)) == 79 END
  148. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_PUSH_BACK(SEQ, 3)) == 41523 END
  149. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_PUSH_BACK(SEQ_255, 199)) == 256 END
  150. BEGIN BOOST_PP_SEQ_ELEM(254,BOOST_PP_SEQ_PUSH_BACK(SEQ_255, 99)) == 255 END
  151. BEGIN BOOST_PP_SEQ_ELEM(255,BOOST_PP_SEQ_PUSH_BACK(SEQ_255, 99)) == 99 END
  152. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REMOVE(SEQ, 0)) == 152 END
  153. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REMOVE(SEQ, 2)) == 412 END
  154. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REMOVE(SEQ, 3)) == 415 END
  155. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_REMOVE(SEQ_255, 254)) == 254 END
  156. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_REMOVE(SEQ_256, 255)) == 255 END
  157. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REPLACE(SEQ_NONE, 0, 22)) == 22 END
  158. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REPLACE(SEQ, 0, 3)) == 3152 END
  159. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REPLACE(SEQ, 1, 3)) == 4352 END
  160. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_REPLACE(SEQ, 3, 3)) == 4153 END
  161. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_REPLACE(SEQ_256, 255, 22)) == 256 END
  162. BEGIN BOOST_PP_SEQ_ELEM(233,BOOST_PP_SEQ_REPLACE(SEQ_256, 255, 22)) == 234 END
  163. BEGIN BOOST_PP_SEQ_ELEM(255,BOOST_PP_SEQ_REPLACE(SEQ_256, 255, 22)) == 22 END
  164. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_SUBSEQ(SEQ, 0, 4)) == 4152 END
  165. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_SUBSEQ(SEQ, 0, 2)) == 41 END
  166. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_SUBSEQ(SEQ, 1, 2)) == 15 END
  167. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_SUBSEQ(SEQ, 2, 2)) == 52 END
  168. # define F2(r, x) + BOOST_PP_SEQ_ELEM(0, x) + 2 - BOOST_PP_SEQ_ELEM(1, x)
  169. #define ADD_NIL(x) x(nil)
  170. BEGIN BOOST_PP_SEQ_FOR_EACH_PRODUCT(F2, ((1)(0)) ((2)(3))) == 0 END
  171. # define L1 (0)(x)
  172. # define L2 (a)(1)(b)(2)
  173. # define L3 (c)(3)(d)
  174. # define LL (L1)(L2)(L3)
  175. #define SEQ_APPEND(s, state, elem) state elem
  176. BEGIN BOOST_PP_SEQ_CAT(BOOST_PP_SEQ_TAIL(BOOST_PP_SEQ_FOLD_LEFT(SEQ_APPEND, (~), LL))) == 0x0a1b2c3d END
  177. BEGIN BOOST_PP_SEQ_SIZE(BOOST_PP_SEQ_TAIL(BOOST_PP_SEQ_FOLD_LEFT(SEQ_APPEND, (~), LL))) == 9 END
  178. BEGIN BOOST_PP_LIST_AT(BOOST_PP_SEQ_TO_LIST(SEQ), 2) == 5 END
  179. BEGIN BOOST_PP_IS_EMPTY(BOOST_PP_LIST_AT(BOOST_PP_SEQ_TO_LIST(SEQ_NONE),0)) == 1 END
  180. BEGIN BOOST_PP_LIST_SIZE(BOOST_PP_SEQ_TO_LIST(SEQ_NONE)) == 1 END
  181. #if BOOST_PP_VARIADICS
  182. BEGIN BOOST_PP_VARIADIC_SIZE(BOOST_PP_SEQ_ENUM(SEQ_NONE)) == 1 END
  183. BEGIN BOOST_PP_VARIADIC_ELEM(0,BOOST_PP_SEQ_ENUM(SEQ)) == 4 END
  184. BEGIN BOOST_PP_TUPLE_ELEM(2,BOOST_PP_SEQ_ELEM(0,BOOST_PP_VARIADIC_SEQ_TO_SEQ(SEQVAR))) == 8 END
  185. #endif