| /* |
| * Copyright 2015 Facebook, Inc. |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| /** |
| * This file is supposed to be included from within |
| * FBVectorTest. Do not use otherwise. |
| */ |
| |
| TESTFUN(clause_23_3_6_1_1) { |
| VECTOR v; |
| EXPECT_TRUE(v.empty()); |
| VECTOR::allocator_type a; |
| VECTOR v1(a); |
| EXPECT_TRUE(v1.empty()); |
| } |
| |
| TESTFUN(clause_23_3_6_1_3) { |
| auto const n = random(0U, 10000U); |
| VECTOR v(n); |
| EXPECT_EQ(v.size(), n); |
| FOR_EACH (i, v) { |
| EXPECT_EQ(*i, VECTOR::value_type()); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_1_9) { |
| // Insert with iterators |
| list<VECTOR::value_type> lst; |
| auto const n = random(0U, 10000U); |
| FOR_EACH_RANGE (i, 0, n) { |
| lst.push_back(randomObject<VECTOR::value_type>()); |
| } |
| VECTOR v(lst.begin(), lst.end()); |
| EXPECT_EQ(v.size(), lst.size()); |
| size_t j = 0; |
| FOR_EACH (i, lst) { |
| EXPECT_EQ(v[j], *i); |
| j++; |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_1_11) { |
| // assign with iterators |
| list<VECTOR::value_type> lst; |
| auto const n = random(0U, 10000U); |
| FOR_EACH_RANGE (i, 0, n) { |
| lst.push_back(randomObject<VECTOR::value_type>()); |
| } |
| VECTOR v; |
| v.assign(lst.begin(), lst.end()); |
| EXPECT_EQ(v.size(), lst.size()); |
| size_t j = 0; |
| FOR_EACH (i, lst) { |
| EXPECT_EQ(v[j], *i); |
| j++; |
| } |
| |
| // aliased assign |
| v.assign(v.begin(), v.begin() + v.size() / 2); |
| EXPECT_EQ(v.size(), lst.size() / 2); |
| j = 0; |
| FOR_EACH (i, lst) { |
| if (j == v.size()) break; |
| EXPECT_EQ(v[j], *i); |
| j++; |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_1_12) { |
| VECTOR v; |
| auto const n = random(0U, 10000U); |
| auto const obj = randomObject<VECTOR::value_type>(); |
| v.assign(n, obj); |
| EXPECT_EQ(v.size(), n); |
| FOR_EACH (i, v) { |
| EXPECT_EQ(*i, obj); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_2_1) { |
| VECTOR v; |
| auto const n = random(0U, 10000U); |
| v.reserve(n); |
| EXPECT_GE(v.capacity(), n); |
| } |
| |
| TESTFUN(clause_23_3_6_2_7) { |
| auto const n1 = random(0U, 10000U); |
| auto const n2 = random(0U, 10000U); |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| auto const obj2 = randomObject<VECTOR::value_type>(); |
| VECTOR v1(n1, obj1), v2(n2, obj2); |
| v1.swap(v2); |
| EXPECT_EQ(v1.size(), n2); |
| EXPECT_EQ(v2.size(), n1); |
| FOR_EACH (i, v1) { |
| EXPECT_EQ(*i, obj2); |
| } |
| FOR_EACH (i, v2) { |
| EXPECT_EQ(*i, obj1); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_2_9) { |
| VECTOR v; |
| auto const n1 = random(0U, 10000U); |
| v.resize(n1); |
| FOR_EACH (i, v) { |
| EXPECT_EQ(*i, VECTOR::value_type()); |
| } |
| auto const n2 = random(0U, 10000U); |
| FOR_EACH (i, v) { |
| EXPECT_EQ(*i, VECTOR::value_type()); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_2_11) { |
| VECTOR v; |
| auto const n1 = random(0U, 10000U); |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| v.resize(n1, obj1); |
| FOR_EACH (i, v) { |
| EXPECT_EQ(*i, obj1); |
| } |
| auto const n2 = random(0U, 10000U); |
| auto const obj2 = randomObject<VECTOR::value_type>(); |
| v.resize(n2, obj2); |
| if (n1 < n2) { |
| FOR_EACH_RANGE (i, n1, n2) { |
| EXPECT_EQ(v[i], obj2); |
| } |
| } |
| } |
| |
| TESTFUN(clause_absent_element_access) { |
| VECTOR v; |
| auto const n1 = random(1U, 10000U); |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| v.resize(n1, obj1); |
| auto const n = random(0U, v.size() - 1); |
| EXPECT_EQ(v[n], v.at(n)); |
| auto const obj2 = randomObject<VECTOR::value_type>(); |
| v[n] = obj2; |
| EXPECT_EQ(v[n], v.at(n)); |
| EXPECT_EQ(v[n], obj2); |
| auto const obj3 = randomObject<VECTOR::value_type>(); |
| v.at(n) = obj3; |
| EXPECT_EQ(v[n], v.at(n)); |
| EXPECT_EQ(v[n], obj3); |
| } |
| |
| TESTFUN(clause_23_3_6_3_1) { |
| VECTOR v; |
| auto const n1 = random(1U, 10000U); |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| v.resize(n1, obj1); |
| EXPECT_EQ(v.data(), &v.front()); |
| } |
| |
| TESTFUN(clause_23_3_6_4_1_a) { |
| VECTOR v, w; |
| auto const n1 = random(1U, 10000U); |
| FOR_EACH_RANGE (i, 0, n1) { |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| v.push_back(obj1); |
| w.push_back(obj1); |
| } |
| auto const n2 = random(0U, n1 - 1); |
| auto pos = v.begin() + n2; |
| auto const obj2 = randomObject<VECTOR::value_type>(); |
| |
| auto r = v.insert(pos, obj2); |
| |
| EXPECT_EQ(v.size(), w.size() + 1); |
| EXPECT_EQ(r - v.begin(), n2); |
| EXPECT_EQ(*r, obj2); |
| FOR_EACH_RANGE (i, 0, r - v.begin()) { |
| EXPECT_EQ(v[i], w[i]); |
| } |
| FOR_EACH_RANGE (i, r - v.begin() + 1, v.size()) { |
| EXPECT_EQ(v[i], w[i - 1]); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_4_1_c) { |
| // This test only works for fbvector |
| fbvector<VECTOR::value_type> v, w; |
| auto const n1 = random(1U, 10000U); |
| FOR_EACH_RANGE (i, 0, n1) { |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| v.push_back(obj1); |
| w.push_back(obj1); |
| } |
| auto const n2 = random(0U, n1-1); |
| auto pos = v.begin() + n2; |
| auto const obj2 = randomObject<VECTOR::value_type>(); |
| auto const n3 = random(0U, 10000U); |
| |
| auto r = v.insert(pos, n3, obj2); |
| |
| EXPECT_EQ(v.size(), w.size() + n3); |
| EXPECT_EQ(r - v.begin(), n2); |
| FOR_EACH_RANGE (i, 0, r - v.begin()) { |
| EXPECT_EQ(v[i], w[i]); |
| } |
| FOR_EACH_RANGE (i, r - v.begin(), r - v.begin() + n3) { |
| EXPECT_EQ(v[i], obj2); |
| } |
| FOR_EACH_RANGE (i, r - v.begin() + n3, v.size()) { |
| EXPECT_EQ(v[i], w[i - n3]); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_4_1_d) { |
| VECTOR v, w; |
| auto const n1 = random(0U, 10000U); |
| FOR_EACH_RANGE (i, 0, n1) { |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| v.push_back(obj1); |
| w.push_back(obj1); |
| } |
| EXPECT_EQ(v.size(), n1); |
| |
| auto const obj2 = randomObject<VECTOR::value_type>(); |
| v.push_back(obj2); |
| EXPECT_EQ(v.back(), obj2); |
| EXPECT_EQ(v.size(), w.size() + 1); |
| |
| FOR_EACH_RANGE (i, 0, w.size()) { |
| EXPECT_EQ(v[i], w[i]); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_4_3) { |
| VECTOR v, w; |
| auto const n1 = random(1U, 10000U); |
| FOR_EACH_RANGE (i, 0, n1) { |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| v.push_back(obj1); |
| w.push_back(obj1); |
| } |
| EXPECT_EQ(v.size(), n1); |
| |
| auto const n2 = random(0U, n1 - 1); |
| auto it = v.erase(v.begin() + n2); |
| EXPECT_EQ(v.size() + 1, w.size()); |
| |
| FOR_EACH_RANGE (i, 0, it - v.begin()) { |
| EXPECT_EQ(v[i], w[i]); |
| } |
| |
| FOR_EACH_RANGE (i, it - v.begin(), v.size()) { |
| EXPECT_EQ(v[i], w[i + 1]); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_4_4) { |
| VECTOR v, w; |
| auto const n1 = random(1U, 10000U); |
| FOR_EACH_RANGE (i, 0, n1) { |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| v.push_back(obj1); |
| w.push_back(obj1); |
| } |
| EXPECT_EQ(v.size(), n1); |
| |
| auto const n2 = random(0U, n1 - 1); |
| auto const n3 = random(n2, n1 - 1); |
| auto it = v.erase(v.begin() + n2, v.begin() + n3); |
| EXPECT_EQ(v.size() + (n3 - n2), w.size()); |
| |
| FOR_EACH_RANGE (i, 0, it - v.begin()) { |
| EXPECT_EQ(v[i], w[i]); |
| } |
| |
| FOR_EACH_RANGE (i, it - v.begin(), v.size()) { |
| EXPECT_EQ(v[i], w[i + (n3 - n2)]); |
| } |
| } |
| |
| TESTFUN(clause_23_3_6_4_clear) { |
| VECTOR v; |
| v.clear(); |
| EXPECT_TRUE(v.empty()); |
| v.resize(random(0U, 10000U)); |
| auto c = v.capacity(); |
| v.clear(); |
| EXPECT_TRUE(v.empty()); |
| EXPECT_EQ(v.capacity(), c); |
| } |
| |
| BENCHMARK(BENCHFUN(zzInitRNG), iters) { |
| //LOG(INFO) << "\nTesting with type " << typeid(VECTOR).name() << "\n"; |
| srand(seed); |
| } |
| |
| BENCHMARK(BENCHFUN(defaultCtor), iters) { |
| FOR_EACH_RANGE (i, 0, iters) { |
| VECTOR v[4096]; |
| doNotOptimizeAway(&v); |
| } |
| } |
| |
| void BENCHFUN(sizeCtor)(int iters, int size) { |
| FOR_EACH_RANGE (i, 0, iters) { |
| VECTOR v(size); |
| doNotOptimizeAway(&v); |
| } |
| } |
| BENCHMARK_PARAM(BENCHFUN(sizeCtor), 128); |
| BENCHMARK_PARAM(BENCHFUN(sizeCtor), 1024); |
| BENCHMARK_PARAM(BENCHFUN(sizeCtor), 1048576); |
| |
| void BENCHFUN(fillCtor)(int iters, int size) { |
| FOR_EACH_RANGE (i, 0, iters) { |
| VECTOR v(size_t(size), randomObject<VECTOR::value_type>()); |
| doNotOptimizeAway(&v); |
| } |
| } |
| BENCHMARK_PARAM(BENCHFUN(fillCtor), 128); |
| BENCHMARK_PARAM(BENCHFUN(fillCtor), 1024); |
| BENCHMARK_PARAM(BENCHFUN(fillCtor), 10240); |
| |
| void BENCHFUN(pushBack)(int iters, int size) { |
| auto const obj = randomObject<VECTOR::value_type>(); |
| FOR_EACH_RANGE (i, 0, iters) { |
| VECTOR v; |
| FOR_EACH_RANGE (j, 0, size) { |
| v.push_back(obj); |
| } |
| } |
| } |
| BENCHMARK_PARAM(BENCHFUN(pushBack), 128); |
| BENCHMARK_PARAM(BENCHFUN(pushBack), 1024); |
| BENCHMARK_PARAM(BENCHFUN(pushBack), 10240); |
| BENCHMARK_PARAM(BENCHFUN(pushBack), 102400); |
| BENCHMARK_PARAM(BENCHFUN(pushBack), 512000); |
| |
| void BENCHFUN(reserve)(int iters, int size) { |
| auto const obj = randomObject<VECTOR::value_type>(); |
| VECTOR v(random(0U, 10000U), obj); |
| FOR_EACH_RANGE (i, 0, iters) { |
| v.reserve(random(0U, 100000U)); |
| } |
| } |
| BENCHMARK_PARAM(BENCHFUN(reserve), 128); |
| BENCHMARK_PARAM(BENCHFUN(reserve), 1024); |
| BENCHMARK_PARAM(BENCHFUN(reserve), 10240); |
| |
| void BENCHFUN(insert)(int iters, int size) { |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| auto const obj2 = randomObject<VECTOR::value_type>(); |
| VECTOR v(random(0U, 1U), obj1); |
| FOR_EACH_RANGE (i, 0, iters / 100) { |
| v.insert(v.begin(), obj2); |
| } |
| } |
| BENCHMARK_PARAM(BENCHFUN(insert), 100); |
| |
| void BENCHFUN(erase)(int iters, int size) { |
| auto const obj1 = randomObject<VECTOR::value_type>(); |
| VECTOR v(random(0U, 100U), obj1); |
| FOR_EACH_RANGE (i, 0, iters) { |
| if (v.empty()) continue; |
| v.erase(v.begin()); |
| } |
| } |
| BENCHMARK_PARAM(BENCHFUN(erase), 1024); |