Lines Matching full:data
29 Array<TestData> Data(A); in TEST() local
30 (void)Data; in TEST()
36 Array<TestData> data(A); in TEST() local
37 ASSERT_NE(data.Append(TestData{0, 0}), nullptr); in TEST()
38 ASSERT_NE(data.Append(TestData{1, 1}), nullptr); in TEST()
39 ASSERT_EQ(data.size(), 2u); in TEST()
45 Array<TestData> data(A); in TEST() local
46 ASSERT_NE(data.Append(TestData{0, 1}), nullptr); in TEST()
47 ASSERT_EQ(data.size(), 1u); in TEST()
48 ASSERT_EQ(data[0].First, 0); in TEST()
49 ASSERT_EQ(data[0].Second, 1); in TEST()
55 Array<TestData> data(A); in TEST() local
58 ASSERT_NE(data.Append(TestData{I, I + 1}), nullptr); in TEST()
60 ASSERT_EQ(data.size(), kMaxElements); in TEST()
62 ASSERT_EQ(data[I].First, I); in TEST()
63 ASSERT_EQ(data[I].Second, I + 1); in TEST()
70 Array<TestData> data(A); in TEST() local
71 ASSERT_NE(data.AppendEmplace(1, 1), nullptr); in TEST()
72 ASSERT_EQ(data[0].First, 1); in TEST()
73 ASSERT_EQ(data[0].Second, 1); in TEST()
79 Array<TestData> data(A); in TEST() local
80 ASSERT_NE(data.AppendEmplace(1, 1), nullptr); in TEST()
81 ASSERT_EQ(data.size(), 1u); in TEST()
82 data.trim(1); in TEST()
83 ASSERT_EQ(data.size(), 0u); in TEST()
84 ASSERT_TRUE(data.empty()); in TEST()
90 Array<TestData> data(A); in TEST() local
91 ASSERT_TRUE(data.empty()); in TEST()
92 ASSERT_EQ(data.begin(), data.end()); in TEST()
93 auto I0 = data.begin(); in TEST()
94 ASSERT_EQ(I0++, data.begin()); in TEST()
95 ASSERT_NE(I0, data.begin()); in TEST()
96 for (const auto &D : data) { in TEST()
100 ASSERT_NE(data.AppendEmplace(1, 1), nullptr); in TEST()
101 ASSERT_EQ(data.size(), 1u); in TEST()
102 ASSERT_NE(data.begin(), data.end()); in TEST()
103 auto &D0 = *data.begin(); in TEST()
111 Array<TestData> data(A); in TEST() local
112 ASSERT_TRUE(data.empty()); in TEST()
113 ASSERT_EQ(data.begin(), data.end()); in TEST()
114 ASSERT_NE(data.AppendEmplace(1, 1), nullptr); in TEST()
115 ASSERT_EQ(data.size(), 1u); in TEST()
116 ASSERT_NE(data.begin(), data.end()); in TEST()
117 auto &D0 = *data.begin(); in TEST()
121 auto I0 = data.end(); in TEST()
122 ASSERT_EQ(I0--, data.end()); in TEST()
123 ASSERT_NE(I0, data.end()); in TEST()
124 ASSERT_EQ(I0, data.begin()); in TEST()
132 Array<TestData> Data(A); in TEST() local
133 ASSERT_TRUE(Data.empty()); in TEST()
134 auto I0Begin = Data.begin(), I0End = Data.end(); in TEST()
135 // Add enough elements in Data to have more than one chunk. in TEST()
139 Data.AppendEmplace(static_cast<s64>(i), static_cast<s64>(i)); in TEST()
141 ASSERT_EQ(Data.size(), SegmentX2); in TEST()
143 auto &Back = Data.back(); in TEST()
149 Data.trim(Segment); in TEST()
150 ASSERT_EQ(Data.size(), Segment); in TEST()
154 auto &Back = Data.back(); in TEST()
160 Data.trim(Segment); in TEST()
161 ASSERT_TRUE(Data.empty()); in TEST()
164 auto I1Begin = Data.begin(), I1End = Data.end(); in TEST()
170 Data.AppendEmplace(static_cast<s64>(i), static_cast<s64>(i)); in TEST()
172 EXPECT_EQ(Data.size(), SegmentX2); in TEST()
180 Array<TestData> Data(A); in TEST() local
182 EXPECT_NE(Data.AppendEmplace(static_cast<s64>(i), static_cast<s64>(i)), in TEST()
184 EXPECT_EQ(Data.AppendEmplace(0, 0), nullptr); in TEST()
185 EXPECT_THAT(Data, SizeIs(MaxElements)); in TEST()
188 Data.trim(MaxElements + 1); in TEST()
189 EXPECT_THAT(Data, SizeIs(0u)); in TEST()
201 Array<ShadowStackEntry> Data(A); in TEST() local
206 auto P = Data.Append({i, &Dummy}); in TEST()
209 auto &Back = Data.back(); in TEST()
214 // Simulate a stack by checking the data from the end as we're trimming. in TEST()
216 ASSERT_EQ(Data.size(), size_t(Max)); in TEST()
217 while (!Data.empty()) { in TEST()
218 const auto &Top = Data.back(); in TEST()
221 Data.trim(1); in TEST()
223 ASSERT_EQ(Data.size(), size_t(Counter)); in TEST()
235 auto *Data = reinterpret_cast<Array<ShadowStackEntry> *>(&ArrayStorage); in TEST() local
241 auto P = Data->Append({i, &Dummy}); in TEST()
244 auto &Back = Data->back(); in TEST()
249 // Simulate a stack by checking the data from the end as we're trimming. in TEST()
251 ASSERT_EQ(Data->size(), size_t(Max)); in TEST()
252 while (!Data->empty()) { in TEST()
253 const auto &Top = Data->back(); in TEST()
256 Data->trim(1); in TEST()
258 ASSERT_EQ(Data->size(), size_t(Counter)); in TEST()
263 auto P = Data->Append({i, &Dummy}); in TEST()
266 auto &Back = Data->back(); in TEST()
273 Data->~Array(); in TEST()
276 new (Data) Array<ShadowStackEntry>(*A); in TEST()
280 auto P = Data->Append({i, &Dummy}); in TEST()
283 auto &Back = Data->back(); in TEST()
288 // Simulate a stack by checking the data from the end as we're trimming. in TEST()
290 ASSERT_EQ(Data->size(), size_t(Max)); in TEST()
291 while (!Data->empty()) { in TEST()
292 const auto &Top = Data->back(); in TEST()
295 Data->trim(1); in TEST()
297 ASSERT_EQ(Data->size(), size_t(Counter)); in TEST()
302 auto P = Data->Append({i, &Dummy}); in TEST()
305 auto &Back = Data->back(); in TEST()