unique_ptr_modifiers.cpp 9.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381
  1. //////////////////////////////////////////////////////////////////////////////
  2. //
  3. // (C) Copyright Howard Hinnant 2009
  4. // (C) Copyright Ion Gaztanaga 2014-2014.
  5. //
  6. // Distributed under the Boost Software License, Version 1.0.
  7. // (See accompanying file LICENSE_1_0.txt or copy at
  8. // http://www.boost.org/LICENSE_1_0.txt)
  9. //
  10. // See http://www.boost.org/libs/move for documentation.
  11. //
  12. //////////////////////////////////////////////////////////////////////////////
  13. #include <boost/move/utility_core.hpp>
  14. #include <boost/move/unique_ptr.hpp>
  15. #include <boost/static_assert.hpp>
  16. #include <boost/move/adl_move_swap.hpp>
  17. #include <boost/core/lightweight_test.hpp>
  18. //////////////////////////////////////////////
  19. //
  20. // The initial implementation of these tests
  21. // was written by Howard Hinnant.
  22. //
  23. // These test were later refactored grouping
  24. // and porting them to Boost.Move.
  25. //
  26. // Many thanks to Howard for releasing his C++03
  27. // unique_ptr implementation with such detailed
  28. // test cases.
  29. //
  30. //////////////////////////////////////////////
  31. #include "unique_ptr_test_utils_beg.hpp"
  32. namespace bml = ::boost::movelib;
  33. ////////////////////////////////
  34. // unique_ptr_modifiers_release
  35. ////////////////////////////////
  36. namespace unique_ptr_modifiers_release{
  37. void test()
  38. {
  39. //Single unique_ptr
  40. {
  41. bml::unique_ptr<int> p(new int(3));
  42. int* i = p.get();
  43. int* j = p.release();
  44. BOOST_TEST(p.get() == 0);
  45. BOOST_TEST(i == j);
  46. p.reset(j);
  47. }
  48. //Unbounded array unique_ptr
  49. {
  50. bml::unique_ptr<int[]> p(new int[2]);
  51. int* i = p.get();
  52. int* j = p.release();
  53. BOOST_TEST(p.get() == 0);
  54. BOOST_TEST(i == j);
  55. p.reset(j);
  56. }
  57. //Bounded array unique_ptr
  58. {
  59. bml::unique_ptr<int[2]> p(new int[2]);
  60. int* i = p.get();
  61. int* j = p.release();
  62. BOOST_TEST(p.get() == 0);
  63. BOOST_TEST(i == j);
  64. p.reset(j);
  65. }
  66. }
  67. } //namespace unique_ptr_modifiers_release{
  68. ////////////////////////////////
  69. // unique_ptr_modifiers_reset
  70. ////////////////////////////////
  71. namespace unique_ptr_modifiers_reset{
  72. void test()
  73. {
  74. //Single unique_ptr
  75. {
  76. reset_counters();
  77. { //reset()
  78. bml::unique_ptr<A> p(new A);
  79. BOOST_TEST(A::count == 1);
  80. A* i = p.get();
  81. (void)i;
  82. p.reset();
  83. BOOST_TEST(A::count == 0);
  84. BOOST_TEST(p.get() == 0);
  85. }
  86. BOOST_TEST(A::count == 0);
  87. { //reset(p)
  88. bml::unique_ptr<A> p(new A);
  89. BOOST_TEST(A::count == 1);
  90. A* i = p.get();
  91. (void)i;
  92. p.reset(new A);
  93. BOOST_TEST(A::count == 1);
  94. }
  95. BOOST_TEST(A::count == 0);
  96. { //reset(0)
  97. bml::unique_ptr<A> p(new A);
  98. BOOST_TEST(A::count == 1);
  99. A* i = p.get();
  100. (void)i;
  101. p.reset(0);
  102. BOOST_TEST(A::count == 0);
  103. BOOST_TEST(p.get() == 0);
  104. }
  105. BOOST_TEST(A::count == 0);
  106. }
  107. //Unbounded array unique_ptr
  108. {
  109. reset_counters();
  110. { //reset()
  111. bml::unique_ptr<A[]> p(new A[2]);
  112. BOOST_TEST(A::count == 2);
  113. A* i = p.get();
  114. (void)i;
  115. p.reset();
  116. BOOST_TEST(A::count == 0);
  117. BOOST_TEST(p.get() == 0);
  118. }
  119. BOOST_TEST(A::count == 0);
  120. { //reset(p)
  121. bml::unique_ptr<A[]> p(new A[2]);
  122. BOOST_TEST(A::count == 2);
  123. A* i = p.get();
  124. (void)i;
  125. p.reset(new A[3]);
  126. BOOST_TEST(A::count == 3);
  127. }
  128. BOOST_TEST(A::count == 0);
  129. { //reset(0)
  130. bml::unique_ptr<A[]> p(new A[2]);
  131. BOOST_TEST(A::count == 2);
  132. A* i = p.get();
  133. (void)i;
  134. p.reset(0);
  135. BOOST_TEST(A::count == 0);
  136. BOOST_TEST(p.get() == 0);
  137. }
  138. BOOST_TEST(A::count == 0);
  139. }
  140. {
  141. //Bounded array unique_ptr
  142. reset_counters();
  143. { //reset()
  144. bml::unique_ptr<A[2]> p(new A[2]);
  145. BOOST_TEST(A::count == 2);
  146. A* i = p.get();
  147. (void)i;
  148. p.reset();
  149. BOOST_TEST(A::count == 0);
  150. BOOST_TEST(p.get() == 0);
  151. }
  152. BOOST_TEST(A::count == 0);
  153. { //reset(p)
  154. bml::unique_ptr<A[2]> p(new A[2]);
  155. BOOST_TEST(A::count == 2);
  156. A* i = p.get();
  157. (void)i;
  158. p.reset(new A[3]);
  159. BOOST_TEST(A::count == 3);
  160. }
  161. BOOST_TEST(A::count == 0);
  162. { //reset(0)
  163. bml::unique_ptr<A[2]> p(new A[2]);
  164. BOOST_TEST(A::count == 2);
  165. A* i = p.get();
  166. (void)i;
  167. p.reset(0);
  168. BOOST_TEST(A::count == 0);
  169. BOOST_TEST(p.get() == 0);
  170. }
  171. BOOST_TEST(A::count == 0);
  172. }
  173. }
  174. } //namespace unique_ptr_modifiers_reset{
  175. ////////////////////////////////
  176. // unique_ptr_modifiers_reset_convert
  177. ////////////////////////////////
  178. namespace unique_ptr_modifiers_reset_convert{
  179. void test()
  180. {
  181. //Single unique_ptr
  182. reset_counters();
  183. {
  184. bml::unique_ptr<A> p(new A);
  185. BOOST_TEST(A::count == 1);
  186. BOOST_TEST(B::count == 0);
  187. A* i = p.get();
  188. (void)i;
  189. p.reset(new B);
  190. BOOST_TEST(A::count == 1);
  191. BOOST_TEST(B::count == 1);
  192. }
  193. BOOST_TEST(A::count == 0);
  194. BOOST_TEST(B::count == 0);
  195. {
  196. bml::unique_ptr<A> p(new B);
  197. BOOST_TEST(A::count == 1);
  198. BOOST_TEST(B::count == 1);
  199. A* i = p.get();
  200. (void)i;
  201. p.reset(new B);
  202. BOOST_TEST(A::count == 1);
  203. BOOST_TEST(B::count == 1);
  204. }
  205. BOOST_TEST(A::count == 0);
  206. BOOST_TEST(B::count == 0);
  207. //Unbounded array unique_ptr
  208. reset_counters();
  209. {
  210. bml::unique_ptr<const volatile A[2]> p(new const A[2]);
  211. BOOST_TEST(A::count == 2);
  212. const volatile A* i = p.get();
  213. (void)i;
  214. p.reset(new volatile A[3]);
  215. BOOST_TEST(A::count == 3);
  216. }
  217. BOOST_TEST(A::count == 0);
  218. {
  219. bml::unique_ptr<const A[2]> p(new A[2]);
  220. BOOST_TEST(A::count == 2);
  221. const A* i = p.get();
  222. (void)i;
  223. p.reset(new const A[3]);
  224. BOOST_TEST(A::count == 3);
  225. }
  226. BOOST_TEST(A::count == 0);
  227. //Bounded array unique_ptr
  228. reset_counters();
  229. {
  230. bml::unique_ptr<const volatile A[2]> p(new const A[2]);
  231. BOOST_TEST(A::count == 2);
  232. const volatile A* i = p.get();
  233. (void)i;
  234. p.reset(new volatile A[3]);
  235. BOOST_TEST(A::count == 3);
  236. }
  237. BOOST_TEST(A::count == 0);
  238. {
  239. bml::unique_ptr<const A[2]> p(new A[2]);
  240. BOOST_TEST(A::count == 2);
  241. const A* i = p.get();
  242. (void)i;
  243. p.reset(new const A[3]);
  244. BOOST_TEST(A::count == 3);
  245. }
  246. BOOST_TEST(A::count == 0);
  247. }
  248. } //unique_ptr_modifiers_reset_convert
  249. ////////////////////////////////
  250. // unique_ptr_modifiers
  251. ////////////////////////////////
  252. namespace unique_ptr_modifiers_swap{
  253. // test swap
  254. void test()
  255. {
  256. //Single unique_ptr
  257. reset_counters();
  258. {
  259. A* p1 = new A(1);
  260. move_constr_deleter<A> d1(1);
  261. bml::unique_ptr<A, move_constr_deleter<A> > s1(p1, ::boost::move(d1));
  262. A* p2 = new A(2);
  263. move_constr_deleter<A> d2(2);
  264. bml::unique_ptr<A, move_constr_deleter<A> > s2(p2, ::boost::move(d2));
  265. BOOST_TEST(s1.get() == p1);
  266. BOOST_TEST(*s1 == A(1));
  267. BOOST_TEST(s1.get_deleter().state() == 1);
  268. BOOST_TEST(s2.get() == p2);
  269. BOOST_TEST(*s2 == A(2));
  270. BOOST_TEST(s2.get_deleter().state() == 2);
  271. boost::adl_move_swap(s1, s2);
  272. BOOST_TEST(s1.get() == p2);
  273. BOOST_TEST(*s1 == A(2));
  274. BOOST_TEST(s1.get_deleter().state() == 2);
  275. BOOST_TEST(s2.get() == p1);
  276. BOOST_TEST(*s2 == A(1));
  277. BOOST_TEST(s2.get_deleter().state() == 1);
  278. }
  279. //Unbounded array unique_ptr
  280. reset_counters();
  281. {
  282. A* p1 = new A[2];
  283. p1[0].set(1);
  284. p1[1].set(2);
  285. move_constr_deleter<A[]> d1(1);
  286. bml::unique_ptr<A[], move_constr_deleter<A[]> > s1(p1, ::boost::move(d1));
  287. A* p2 = new A[2];
  288. p2[0].set(3);
  289. p2[1].set(4);
  290. move_constr_deleter<A[]> d2(2);
  291. bml::unique_ptr<A[], move_constr_deleter<A[]> > s2(p2, ::boost::move(d2));
  292. BOOST_TEST(s1.get() == p1);
  293. BOOST_TEST(s1[0] == A(1));
  294. BOOST_TEST(s1[1] == A(2));
  295. BOOST_TEST(s1.get_deleter().state() == 1);
  296. BOOST_TEST(s2.get() == p2);
  297. BOOST_TEST(s2[0] == A(3));
  298. BOOST_TEST(s2[1] == A(4));
  299. BOOST_TEST(s2.get_deleter().state() == 2);
  300. swap(s1, s2);
  301. BOOST_TEST(s1.get() == p2);
  302. BOOST_TEST(s1[0] == A(3));
  303. BOOST_TEST(s1[1] == A(4));
  304. BOOST_TEST(s1.get_deleter().state() == 2);
  305. BOOST_TEST(s2.get() == p1);
  306. BOOST_TEST(s2[0] == A(1));
  307. BOOST_TEST(s2[1] == A(2));
  308. BOOST_TEST(s2.get_deleter().state() == 1);
  309. }
  310. //Bounded array unique_ptr
  311. reset_counters();
  312. {
  313. A* p1 = new A[2];
  314. p1[0].set(1);
  315. p1[1].set(2);
  316. move_constr_deleter<A[2]> d1(1);
  317. bml::unique_ptr<A[2], move_constr_deleter<A[2]> > s1(p1, ::boost::move(d1));
  318. A* p2 = new A[2];
  319. p2[0].set(3);
  320. p2[1].set(4);
  321. move_constr_deleter<A[2]> d2(2);
  322. bml::unique_ptr<A[2], move_constr_deleter<A[2]> > s2(p2, ::boost::move(d2));
  323. BOOST_TEST(s1.get() == p1);
  324. BOOST_TEST(s1[0] == A(1));
  325. BOOST_TEST(s1[1] == A(2));
  326. BOOST_TEST(s1.get_deleter().state() == 1);
  327. BOOST_TEST(s2.get() == p2);
  328. BOOST_TEST(s2[0] == A(3));
  329. BOOST_TEST(s2[1] == A(4));
  330. BOOST_TEST(s2.get_deleter().state() == 2);
  331. swap(s1, s2);
  332. BOOST_TEST(s1.get() == p2);
  333. BOOST_TEST(s1[0] == A(3));
  334. BOOST_TEST(s1[1] == A(4));
  335. BOOST_TEST(s1.get_deleter().state() == 2);
  336. BOOST_TEST(s2.get() == p1);
  337. BOOST_TEST(s2[0] == A(1));
  338. BOOST_TEST(s2[1] == A(2));
  339. BOOST_TEST(s2.get_deleter().state() == 1);
  340. }
  341. }
  342. } //namespace unique_ptr_modifiers_swap{
  343. ////////////////////////////////
  344. // main
  345. ////////////////////////////////
  346. int main()
  347. {
  348. //Modifiers
  349. unique_ptr_modifiers_release::test();
  350. unique_ptr_modifiers_reset::test();
  351. unique_ptr_modifiers_reset_convert::test();
  352. unique_ptr_modifiers_swap::test();
  353. //Test results
  354. return boost::report_errors();
  355. }
  356. #include "unique_ptr_test_utils_end.hpp"