#include <folly/container/Merge.h>
#include <map>
#include <vector>
#include <folly/portability/GTest.h>
Go to the source code of this file.
|
| TEST (MergeTest, NonOverlapping) |
|
| TEST (MergeTest, OverlappingInSingleInputRange) |
|
| TEST (MergeTest, OverlappingInDifferentInputRange) |
|
TEST |
( |
MergeTest |
, |
|
|
NonOverlapping |
|
|
) |
| |
Definition at line 24 of file MergeTest.cpp.
References a, b, c, EXPECT_EQ, i, and folly::merge().
25 std::vector<int>
a = {0, 2, 4, 6};
26 std::vector<int>
b = {1, 3, 5, 7};
29 folly::merge(a.begin(), a.end(), b.begin(), b.end(), std::back_inserter(c));
31 for (
size_t i = 0;
i < 8; ++
i) {
OutputIt merge(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first, Compare comp)
#define EXPECT_EQ(val1, val2)
TEST |
( |
MergeTest |
, |
|
|
OverlappingInSingleInputRange |
|
|
) |
| |
Definition at line 36 of file MergeTest.cpp.
References a, b, c, EXPECT_EQ, and folly::merge().
37 std::vector<std::pair<int, int>>
a = {{0, 0}, {0, 1}};
38 std::vector<std::pair<int, int>>
b = {{2, 2}, {3, 3}};
42 a.begin(), a.end(), b.begin(), b.end(), std::inserter(c, c.begin()));
OutputIt merge(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first, Compare comp)
#define EXPECT_EQ(val1, val2)
TEST |
( |
MergeTest |
, |
|
|
OverlappingInDifferentInputRange |
|
|
) |
| |
Definition at line 52 of file MergeTest.cpp.
References a, b, c, EXPECT_EQ, and folly::merge().
53 std::vector<std::pair<int, int>>
a = {{0, 0}, {1, 1}};
54 std::vector<std::pair<int, int>>
b = {{0, 2}, {3, 3}};
58 a.begin(), a.end(), b.begin(), b.end(), std::inserter(c, c.begin()));
OutputIt merge(InputIt1 first1, InputIt1 last1, InputIt2 first2, InputIt2 last2, OutputIt d_first, Compare comp)
#define EXPECT_EQ(val1, val2)