memory_allocator_unittest.cc 2.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778
  1. // Copyright 2015 The Chromium Authors. All rights reserved.
  2. // Use of this source code is governed by a BSD-style license that can be
  3. // found in the LICENSE file.
  4. #include "courgette/memory_allocator.h"
  5. #include <stddef.h>
  6. #include <algorithm>
  7. #include "testing/gtest/include/gtest/gtest.h"
  8. TEST(MemoryAllocatorTest, NoThrowBuffer) {
  9. const size_t size_list[] = {0U, 1U, 2U, 11U, 15U, 16U};
  10. // Repeat test for different sizes.
  11. for (size_t idx = 0; idx < std::size(size_list); ++idx) {
  12. size_t size = size_list[idx];
  13. courgette::NoThrowBuffer<size_t> buf1;
  14. EXPECT_EQ(0U, buf1.size());
  15. EXPECT_TRUE(buf1.empty());
  16. // Ensure reserve() should not affect size.
  17. EXPECT_TRUE(buf1.reserve(size / 2));
  18. EXPECT_EQ(0U, buf1.size());
  19. EXPECT_TRUE(buf1.empty());
  20. // Populate with integers from |size| - 1 to 0.
  21. for (size_t i = 0; i < size; ++i) {
  22. size_t new_value = size - 1 - i;
  23. EXPECT_TRUE(buf1.push_back(new_value));
  24. EXPECT_EQ(new_value, buf1.back());
  25. EXPECT_EQ(i + 1, buf1.size());
  26. EXPECT_FALSE(buf1.empty());
  27. }
  28. // Sort, and verify that list is indeed sorted.
  29. std::sort(buf1.begin(), buf1.end());
  30. for (size_t i = 0; i < size; ++i)
  31. EXPECT_EQ(i, buf1[i]);
  32. // Test operator[] for read and write.
  33. for (size_t i = 0; i < size; ++i)
  34. buf1[i] = buf1[i] * 2;
  35. // Test append().
  36. courgette::NoThrowBuffer<size_t> buf2;
  37. if (size > 0) {
  38. EXPECT_TRUE(buf2.append(&buf1[0], size));
  39. EXPECT_EQ(size, buf2.size());
  40. for (size_t i = 0; i < size; ++i)
  41. EXPECT_EQ(buf1[i], buf2[i]);
  42. }
  43. // Test shrinking by resize().
  44. const size_t kNewValue = 137;
  45. size_t new_size = size / 2;
  46. EXPECT_TRUE(buf2.resize(new_size, kNewValue));
  47. EXPECT_EQ(new_size, buf2.size());
  48. for (size_t i = 0; i < new_size; ++i)
  49. EXPECT_EQ(buf1[i], buf2[i]);
  50. // Test expanding by resize().
  51. EXPECT_TRUE(buf2.resize(size, kNewValue));
  52. EXPECT_EQ(size, buf2.size());
  53. for (size_t i = 0; i < new_size; ++i)
  54. EXPECT_EQ(buf1[i], buf2[i]);
  55. for (size_t i = new_size; i < size; ++i)
  56. EXPECT_EQ(kNewValue, buf2[i]);
  57. // Test clear().
  58. buf2.clear();
  59. EXPECT_EQ(0U, buf2.size());
  60. EXPECT_TRUE(buf2.empty());
  61. }
  62. }