Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(4)

Side by Side Diff: core/fpdfapi/parser/cpdf_array_unittest.cpp

Issue 2384883003: Remove CPDF_Object::Release() in favor of direct delete (Closed)
Patch Set: rebase Created 4 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
« no previous file with comments | « core/fpdfapi/parser/cpdf_array.cpp ('k') | core/fpdfapi/parser/cpdf_data_avail.cpp » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 // Copyright 2016 PDFium Authors. All rights reserved. 1 // Copyright 2016 PDFium Authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #include "core/fpdfapi/parser/cpdf_array.h" 5 #include "core/fpdfapi/parser/cpdf_array.h"
6 #include "core/fpdfapi/parser/cpdf_number.h" 6 #include "core/fpdfapi/parser/cpdf_number.h"
7 #include "core/fpdfapi/parser/cpdf_reference.h" 7 #include "core/fpdfapi/parser/cpdf_reference.h"
8 8
9 #include <memory> 9 #include <memory>
10 10
11 #include "testing/gtest/include/gtest/gtest.h" 11 #include "testing/gtest/include/gtest/gtest.h"
12 12
13 namespace {
14
15 using ScopedArray = std::unique_ptr<CPDF_Array, ReleaseDeleter<CPDF_Array>>;
16
17 } // namespace
18
19 TEST(cpdf_array, RemoveAt) { 13 TEST(cpdf_array, RemoveAt) {
20 { 14 {
21 int elems[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; 15 int elems[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
22 ScopedArray arr(new CPDF_Array); 16 std::unique_ptr<CPDF_Array> arr(new CPDF_Array);
23 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 17 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
24 arr->AddInteger(elems[i]); 18 arr->AddInteger(elems[i]);
25 arr->RemoveAt(3, 3); 19 arr->RemoveAt(3, 3);
26 int expected[] = {1, 2, 3, 7, 8, 9, 10}; 20 int expected[] = {1, 2, 3, 7, 8, 9, 10};
27 EXPECT_EQ(FX_ArraySize(expected), arr->GetCount()); 21 EXPECT_EQ(FX_ArraySize(expected), arr->GetCount());
28 for (size_t i = 0; i < FX_ArraySize(expected); ++i) 22 for (size_t i = 0; i < FX_ArraySize(expected); ++i)
29 EXPECT_EQ(expected[i], arr->GetIntegerAt(i)); 23 EXPECT_EQ(expected[i], arr->GetIntegerAt(i));
30 arr->RemoveAt(4, 2); 24 arr->RemoveAt(4, 2);
31 int expected2[] = {1, 2, 3, 7, 10}; 25 int expected2[] = {1, 2, 3, 7, 10};
32 EXPECT_EQ(FX_ArraySize(expected2), arr->GetCount()); 26 EXPECT_EQ(FX_ArraySize(expected2), arr->GetCount());
33 for (size_t i = 0; i < FX_ArraySize(expected2); ++i) 27 for (size_t i = 0; i < FX_ArraySize(expected2); ++i)
34 EXPECT_EQ(expected2[i], arr->GetIntegerAt(i)); 28 EXPECT_EQ(expected2[i], arr->GetIntegerAt(i));
35 } 29 }
36 { 30 {
37 // When the range is out of bound, RemoveAt has no effect. 31 // When the range is out of bound, RemoveAt has no effect.
38 int elems[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; 32 int elems[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
39 ScopedArray arr(new CPDF_Array); 33 std::unique_ptr<CPDF_Array> arr(new CPDF_Array);
40 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 34 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
41 arr->AddInteger(elems[i]); 35 arr->AddInteger(elems[i]);
42 arr->RemoveAt(8, 5); 36 arr->RemoveAt(8, 5);
43 EXPECT_EQ(FX_ArraySize(elems), arr->GetCount()); 37 EXPECT_EQ(FX_ArraySize(elems), arr->GetCount());
44 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 38 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
45 EXPECT_EQ(elems[i], arr->GetIntegerAt(i)); 39 EXPECT_EQ(elems[i], arr->GetIntegerAt(i));
46 arr->RemoveAt(0, 12); 40 arr->RemoveAt(0, 12);
47 EXPECT_EQ(FX_ArraySize(elems), arr->GetCount()); 41 EXPECT_EQ(FX_ArraySize(elems), arr->GetCount());
48 arr->RemoveAt(11, 1); 42 arr->RemoveAt(11, 1);
49 EXPECT_EQ(FX_ArraySize(elems), arr->GetCount()); 43 EXPECT_EQ(FX_ArraySize(elems), arr->GetCount());
50 } 44 }
51 } 45 }
52 46
53 TEST(cpdf_array, InsertAt) { 47 TEST(cpdf_array, InsertAt) {
54 { 48 {
55 int elems[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; 49 int elems[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
56 ScopedArray arr(new CPDF_Array); 50 std::unique_ptr<CPDF_Array> arr(new CPDF_Array);
57 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 51 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
58 arr->InsertAt(i, new CPDF_Number(elems[i])); 52 arr->InsertAt(i, new CPDF_Number(elems[i]));
59 EXPECT_EQ(FX_ArraySize(elems), arr->GetCount()); 53 EXPECT_EQ(FX_ArraySize(elems), arr->GetCount());
60 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 54 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
61 EXPECT_EQ(elems[i], arr->GetIntegerAt(i)); 55 EXPECT_EQ(elems[i], arr->GetIntegerAt(i));
62 arr->InsertAt(3, new CPDF_Number(33)); 56 arr->InsertAt(3, new CPDF_Number(33));
63 arr->InsertAt(6, new CPDF_Number(55)); 57 arr->InsertAt(6, new CPDF_Number(55));
64 arr->InsertAt(12, new CPDF_Number(12)); 58 arr->InsertAt(12, new CPDF_Number(12));
65 int expected[] = {1, 2, 3, 33, 4, 5, 55, 6, 7, 8, 9, 10, 12}; 59 int expected[] = {1, 2, 3, 33, 4, 5, 55, 6, 7, 8, 9, 10, 12};
66 EXPECT_EQ(FX_ArraySize(expected), arr->GetCount()); 60 EXPECT_EQ(FX_ArraySize(expected), arr->GetCount());
67 for (size_t i = 0; i < FX_ArraySize(expected); ++i) 61 for (size_t i = 0; i < FX_ArraySize(expected); ++i)
68 EXPECT_EQ(expected[i], arr->GetIntegerAt(i)); 62 EXPECT_EQ(expected[i], arr->GetIntegerAt(i));
69 } 63 }
70 { 64 {
71 // When the position to insert is beyond the upper bound, 65 // When the position to insert is beyond the upper bound,
72 // an element is inserted at that position while other unfilled 66 // an element is inserted at that position while other unfilled
73 // positions have nullptr. 67 // positions have nullptr.
74 int elems[] = {1, 2}; 68 int elems[] = {1, 2};
75 ScopedArray arr(new CPDF_Array); 69 std::unique_ptr<CPDF_Array> arr(new CPDF_Array);
76 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 70 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
77 arr->InsertAt(i, new CPDF_Number(elems[i])); 71 arr->InsertAt(i, new CPDF_Number(elems[i]));
78 arr->InsertAt(10, new CPDF_Number(10)); 72 arr->InsertAt(10, new CPDF_Number(10));
79 EXPECT_EQ(11u, arr->GetCount()); 73 EXPECT_EQ(11u, arr->GetCount());
80 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 74 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
81 EXPECT_EQ(elems[i], arr->GetIntegerAt(i)); 75 EXPECT_EQ(elems[i], arr->GetIntegerAt(i));
82 for (size_t i = FX_ArraySize(elems); i < 10; ++i) 76 for (size_t i = FX_ArraySize(elems); i < 10; ++i)
83 EXPECT_EQ(nullptr, arr->GetObjectAt(i)); 77 EXPECT_EQ(nullptr, arr->GetObjectAt(i));
84 EXPECT_EQ(10, arr->GetIntegerAt(10)); 78 EXPECT_EQ(10, arr->GetIntegerAt(10));
85 } 79 }
86 } 80 }
87 81
88 TEST(cpdf_array, Clone) { 82 TEST(cpdf_array, Clone) {
89 { 83 {
90 // Basic case. 84 // Basic case.
91 int elems[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; 85 int elems[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
92 ScopedArray arr(new CPDF_Array); 86 std::unique_ptr<CPDF_Array> arr(new CPDF_Array);
93 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 87 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
94 arr->InsertAt(i, new CPDF_Number(elems[i])); 88 arr->InsertAt(i, new CPDF_Number(elems[i]));
95 ScopedArray arr2(arr->Clone()->AsArray()); 89 std::unique_ptr<CPDF_Array> arr2(arr->Clone()->AsArray());
96 EXPECT_EQ(arr->GetCount(), arr2->GetCount()); 90 EXPECT_EQ(arr->GetCount(), arr2->GetCount());
97 for (size_t i = 0; i < FX_ArraySize(elems); ++i) { 91 for (size_t i = 0; i < FX_ArraySize(elems); ++i) {
98 // Clone() always create new objects. 92 // Clone() always create new objects.
99 EXPECT_NE(arr->GetObjectAt(i), arr2->GetObjectAt(i)); 93 EXPECT_NE(arr->GetObjectAt(i), arr2->GetObjectAt(i));
100 EXPECT_EQ(arr->GetIntegerAt(i), arr2->GetIntegerAt(i)); 94 EXPECT_EQ(arr->GetIntegerAt(i), arr2->GetIntegerAt(i));
101 } 95 }
102 } 96 }
103 { 97 {
104 // Clone() with and without dereferencing reference objects. 98 // Clone() with and without dereferencing reference objects.
105 static const size_t kNumOfRows = 3; 99 static const size_t kNumOfRows = 3;
106 static const size_t kNumOfRowElems = 5; 100 static const size_t kNumOfRowElems = 5;
107 int elems[kNumOfRows][kNumOfRowElems] = { 101 int elems[kNumOfRows][kNumOfRowElems] = {
108 {1, 2, 3, 4, 5}, {10, 9, 8, 7, 6}, {11, 12, 13, 14, 15}}; 102 {1, 2, 3, 4, 5}, {10, 9, 8, 7, 6}, {11, 12, 13, 14, 15}};
109 ScopedArray arr(new CPDF_Array); 103 std::unique_ptr<CPDF_Array> arr(new CPDF_Array);
110 // Indirect references to indirect objects. 104 // Indirect references to indirect objects.
111 std::unique_ptr<CPDF_IndirectObjectHolder> obj_holder( 105 std::unique_ptr<CPDF_IndirectObjectHolder> obj_holder(
112 new CPDF_IndirectObjectHolder()); 106 new CPDF_IndirectObjectHolder());
113 for (size_t i = 0; i < kNumOfRows; ++i) { 107 for (size_t i = 0; i < kNumOfRows; ++i) {
114 CPDF_Array* arr_elem = new CPDF_Array; 108 CPDF_Array* arr_elem = new CPDF_Array;
115 for (size_t j = 0; j < kNumOfRowElems; ++j) { 109 for (size_t j = 0; j < kNumOfRowElems; ++j) {
116 CPDF_Number* obj = new CPDF_Number(elems[i][j]); 110 CPDF_Number* obj = new CPDF_Number(elems[i][j]);
117 // Starts object number from 1. 111 // Starts object number from 1.
118 int obj_num = i * kNumOfRowElems + j + 1; 112 int obj_num = i * kNumOfRowElems + j + 1;
119 obj_holder->ReplaceIndirectObjectIfHigherGeneration(obj_num, obj); 113 obj_holder->ReplaceIndirectObjectIfHigherGeneration(obj_num, obj);
120 arr_elem->InsertAt(j, new CPDF_Reference(obj_holder.get(), obj_num)); 114 arr_elem->InsertAt(j, new CPDF_Reference(obj_holder.get(), obj_num));
121 } 115 }
122 arr->InsertAt(i, arr_elem); 116 arr->InsertAt(i, arr_elem);
123 } 117 }
124 ASSERT_EQ(kNumOfRows, arr->GetCount()); 118 ASSERT_EQ(kNumOfRows, arr->GetCount());
125 // Not dereferencing reference objects means just creating new references 119 // Not dereferencing reference objects means just creating new references
126 // instead of new copies of direct objects. 120 // instead of new copies of direct objects.
127 ScopedArray arr1(arr->Clone()->AsArray()); 121 std::unique_ptr<CPDF_Array> arr1(arr->Clone()->AsArray());
128 EXPECT_EQ(arr->GetCount(), arr1->GetCount()); 122 EXPECT_EQ(arr->GetCount(), arr1->GetCount());
129 // Dereferencing reference objects creates new copies of direct objects. 123 // Dereferencing reference objects creates new copies of direct objects.
130 ScopedArray arr2(arr->CloneDirectObject()->AsArray()); 124 std::unique_ptr<CPDF_Array> arr2(arr->CloneDirectObject()->AsArray());
131 EXPECT_EQ(arr->GetCount(), arr2->GetCount()); 125 EXPECT_EQ(arr->GetCount(), arr2->GetCount());
132 for (size_t i = 0; i < kNumOfRows; ++i) { 126 for (size_t i = 0; i < kNumOfRows; ++i) {
133 CPDF_Array* arr_elem = arr->GetObjectAt(i)->AsArray(); 127 CPDF_Array* arr_elem = arr->GetObjectAt(i)->AsArray();
134 CPDF_Array* arr1_elem = arr1->GetObjectAt(i)->AsArray(); 128 CPDF_Array* arr1_elem = arr1->GetObjectAt(i)->AsArray();
135 CPDF_Array* arr2_elem = arr2->GetObjectAt(i)->AsArray(); 129 CPDF_Array* arr2_elem = arr2->GetObjectAt(i)->AsArray();
136 EXPECT_NE(arr_elem, arr1_elem); 130 EXPECT_NE(arr_elem, arr1_elem);
137 EXPECT_NE(arr_elem, arr2_elem); 131 EXPECT_NE(arr_elem, arr2_elem);
138 for (size_t j = 0; j < kNumOfRowElems; ++j) { 132 for (size_t j = 0; j < kNumOfRowElems; ++j) {
139 auto elem_obj = arr_elem->GetObjectAt(j); 133 auto elem_obj = arr_elem->GetObjectAt(j);
140 auto elem_obj1 = arr1_elem->GetObjectAt(j); 134 auto elem_obj1 = arr1_elem->GetObjectAt(j);
(...skipping 23 matching lines...) Expand all
164 EXPECT_EQ(elems[i][j], 158 EXPECT_EQ(elems[i][j],
165 arr2->GetObjectAt(i)->AsArray()->GetIntegerAt(j)); 159 arr2->GetObjectAt(i)->AsArray()->GetIntegerAt(j));
166 } 160 }
167 } 161 }
168 } 162 }
169 } 163 }
170 164
171 TEST(cpdf_array, Iterator) { 165 TEST(cpdf_array, Iterator) {
172 int elems[] = {-23, -11, 3, 455, 2345877, 166 int elems[] = {-23, -11, 3, 455, 2345877,
173 0, 7895330, -12564334, 10000, -100000}; 167 0, 7895330, -12564334, 10000, -100000};
174 ScopedArray arr(new CPDF_Array); 168 std::unique_ptr<CPDF_Array> arr(new CPDF_Array);
175 for (size_t i = 0; i < FX_ArraySize(elems); ++i) 169 for (size_t i = 0; i < FX_ArraySize(elems); ++i)
176 arr->InsertAt(i, new CPDF_Number(elems[i])); 170 arr->InsertAt(i, new CPDF_Number(elems[i]));
177 size_t index = 0; 171 size_t index = 0;
178 for (const auto& it : *arr) 172 for (const auto& it : *arr)
179 EXPECT_EQ(elems[index++], it->AsNumber()->GetInteger()); 173 EXPECT_EQ(elems[index++], it->AsNumber()->GetInteger());
180 } 174 }
OLDNEW
« no previous file with comments | « core/fpdfapi/parser/cpdf_array.cpp ('k') | core/fpdfapi/parser/cpdf_data_avail.cpp » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698