StableVector.cpp 2.3 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576
  1. /*
  2. * This source file is part of RmlUi, the HTML/CSS Interface Middleware
  3. *
  4. * For the latest information, see http://github.com/mikke89/RmlUi
  5. *
  6. * Copyright (c) 2008-2010 CodePoint Ltd, Shift Technology Ltd
  7. * Copyright (c) 2019-2023 The RmlUi Team, and contributors
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a copy
  10. * of this software and associated documentation files (the "Software"), to deal
  11. * in the Software without restriction, including without limitation the rights
  12. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. * copies of the Software, and to permit persons to whom the Software is
  14. * furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. * THE SOFTWARE.
  26. *
  27. */
  28. #include <RmlUi/Core/StableVector.h>
  29. #include <doctest.h>
  30. using namespace Rml;
  31. TEST_CASE("StableVector")
  32. {
  33. StableVector<int> v;
  34. REQUIRE(v.empty() == true);
  35. REQUIRE(v.size() == 0);
  36. const int a = 3;
  37. const auto index_a = v.insert(a);
  38. REQUIRE(!v.empty());
  39. REQUIRE(v.size() == 1);
  40. const int b = 4;
  41. const auto index_b = v.insert(b);
  42. REQUIRE(!v.empty());
  43. REQUIRE(v.size() == 2);
  44. const int expected_values[] = {a, b};
  45. v.for_each([&, i = 0](int& value) mutable {
  46. REQUIRE(value == expected_values[i]);
  47. i++;
  48. });
  49. REQUIRE(v[index_a] == a);
  50. REQUIRE(v[index_b] == b);
  51. const int a_out = v.erase(index_a);
  52. REQUIRE(a_out == a);
  53. REQUIRE(v.size() == 1);
  54. REQUIRE(v[index_b] == b);
  55. const int b_out = v.erase(index_b);
  56. REQUIRE(b_out == b);
  57. REQUIRE(v.empty());
  58. REQUIRE(v.size() == 0);
  59. const int c = 5;
  60. const auto index_c = v.insert(c);
  61. REQUIRE(!v.empty());
  62. REQUIRE(v.size() == 1);
  63. REQUIRE(v[index_c] == c);
  64. v.for_each([&](int& value) { REQUIRE(value == c); });
  65. }