test_flat_set.cpp 4.1 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136
  1. //---------------------------------------------------------------------------//
  2. // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
  3. //
  4. // Distributed under the Boost Software License, Version 1.0
  5. // See accompanying file LICENSE_1_0.txt or copy at
  6. // http://www.boost.org/LICENSE_1_0.txt
  7. //
  8. // See http://boostorg.github.com/compute for more information.
  9. //---------------------------------------------------------------------------//
  10. #define BOOST_TEST_MODULE TestFlatSet
  11. #include <boost/test/unit_test.hpp>
  12. #include <utility>
  13. #include <boost/concept_check.hpp>
  14. #include <boost/compute/system.hpp>
  15. #include <boost/compute/command_queue.hpp>
  16. #include <boost/compute/container/flat_set.hpp>
  17. #include "context_setup.hpp"
  18. namespace bc = boost::compute;
  19. BOOST_AUTO_TEST_CASE(concept_check)
  20. {
  21. BOOST_CONCEPT_ASSERT((boost::Container<bc::flat_set<int> >));
  22. // BOOST_CONCEPT_ASSERT((boost::SimpleAssociativeContainer<bc::flat_set<int> >));
  23. // BOOST_CONCEPT_ASSERT((boost::UniqueAssociativeContainer<bc::flat_set<int> >));
  24. BOOST_CONCEPT_ASSERT((boost::RandomAccessIterator<bc::flat_set<int>::iterator>));
  25. BOOST_CONCEPT_ASSERT((boost::RandomAccessIterator<bc::flat_set<int>::const_iterator>));
  26. }
  27. BOOST_AUTO_TEST_CASE(insert)
  28. {
  29. bc::flat_set<int> set(context);
  30. typedef bc::flat_set<int>::iterator iterator;
  31. std::pair<iterator, bool> location = set.insert(12, queue);
  32. queue.finish();
  33. BOOST_CHECK(location.first == set.begin());
  34. BOOST_CHECK(location.second == true);
  35. BOOST_CHECK_EQUAL(*location.first, 12);
  36. BOOST_CHECK_EQUAL(set.size(), size_t(1));
  37. location = set.insert(12, queue);
  38. queue.finish();
  39. BOOST_CHECK(location.first == set.begin());
  40. BOOST_CHECK(location.second == false);
  41. BOOST_CHECK_EQUAL(set.size(), size_t(1));
  42. location = set.insert(4, queue);
  43. queue.finish();
  44. BOOST_CHECK(location.first == set.begin());
  45. BOOST_CHECK(location.second == true);
  46. BOOST_CHECK_EQUAL(set.size(), size_t(2));
  47. location = set.insert(12, queue);
  48. queue.finish();
  49. BOOST_CHECK(location.first == set.begin() + 1);
  50. BOOST_CHECK(location.second == false);
  51. BOOST_CHECK_EQUAL(set.size(), size_t(2));
  52. location = set.insert(9, queue);
  53. queue.finish();
  54. BOOST_CHECK(location.first == set.begin() + 1);
  55. BOOST_CHECK(location.second == true);
  56. BOOST_CHECK_EQUAL(set.size(), size_t(3));
  57. }
  58. BOOST_AUTO_TEST_CASE(erase)
  59. {
  60. bc::flat_set<int> set(context);
  61. typedef bc::flat_set<int>::iterator iterator;
  62. set.insert(1, queue);
  63. set.insert(2, queue);
  64. set.insert(3, queue);
  65. set.insert(4, queue);
  66. set.insert(5, queue);
  67. queue.finish();
  68. BOOST_CHECK_EQUAL(set.size(), size_t(5));
  69. iterator i = set.erase(set.begin(), queue);
  70. queue.finish();
  71. BOOST_CHECK(i == set.begin() + 1);
  72. BOOST_CHECK_EQUAL(set.size(), size_t(4));
  73. BOOST_CHECK_EQUAL(*set.begin(), 2);
  74. size_t count = set.erase(3, queue);
  75. queue.finish();
  76. BOOST_CHECK_EQUAL(count, size_t(1));
  77. BOOST_CHECK_EQUAL(set.size(), size_t(3));
  78. BOOST_CHECK_EQUAL(*set.begin(), 2);
  79. count = set.erase(9, queue);
  80. queue.finish();
  81. BOOST_CHECK_EQUAL(count, size_t(0));
  82. BOOST_CHECK_EQUAL(set.size(), size_t(3));
  83. BOOST_CHECK_EQUAL(*set.begin(), 2);
  84. i = set.erase(set.begin() + 1, queue);
  85. queue.finish();
  86. BOOST_CHECK(i == set.begin() + 2);
  87. BOOST_CHECK_EQUAL(set.size(), size_t(2));
  88. BOOST_CHECK_EQUAL(*set.begin(), 2);
  89. BOOST_CHECK_EQUAL(*(set.end() - 1), 5);
  90. set.erase(set.begin(), set.end(), queue);
  91. queue.finish();
  92. BOOST_CHECK_EQUAL(set.size(), size_t(0));
  93. }
  94. BOOST_AUTO_TEST_CASE(clear)
  95. {
  96. bc::flat_set<float> set;
  97. BOOST_CHECK(set.empty() == true);
  98. BOOST_CHECK_EQUAL(set.size(), size_t(0));
  99. set.clear();
  100. BOOST_CHECK(set.empty() == true);
  101. BOOST_CHECK_EQUAL(set.size(), size_t(0));
  102. set.insert(3.14f);
  103. BOOST_CHECK(set.empty() == false);
  104. BOOST_CHECK_EQUAL(set.size(), size_t(1));
  105. set.insert(4.184f);
  106. BOOST_CHECK(set.empty() == false);
  107. BOOST_CHECK_EQUAL(set.size(), size_t(2));
  108. set.clear();
  109. BOOST_CHECK(set.empty() == true);
  110. BOOST_CHECK_EQUAL(set.size(), size_t(0));
  111. }
  112. BOOST_AUTO_TEST_SUITE_END()