2 * Copyright 2012 Facebook, Inc.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
17 #include <glog/logging.h>
18 #include <gtest/gtest.h>
22 #include "folly/experimental/Gen.h"
23 #include "folly/FBVector.h"
24 #include "folly/dynamic.h"
26 using namespace folly::gen;
27 using namespace folly;
31 using std::unique_ptr;
34 using std::make_tuple;
35 //using std::unordered_map;
37 #define EXPECT_SAME(A, B) \
38 static_assert(std::is_same<A, B>::value, "Mismatched: " #A ", " #B)
39 EXPECT_SAME(int&&, typename ArgumentReference<int>::type);
40 EXPECT_SAME(int&, typename ArgumentReference<int&>::type);
41 EXPECT_SAME(const int&, typename ArgumentReference<const int&>::type);
42 EXPECT_SAME(const int&, typename ArgumentReference<const int>::type);
45 ostream& operator<<(ostream& os, const set<T>& values) {
46 return os << from(values);
50 ostream& operator<<(ostream& os, const vector<T>& values) {
52 for (auto& value : values) {
53 if (&value != &values.front()) {
61 auto square = [](int x) { return x * x; };
62 auto add = [](int a, int b) { return a + b; };
63 auto multiply = [](int a, int b) { return a * b; };
65 auto product = foldl(1, multiply);
67 template<typename A, typename B>
68 ostream& operator<<(ostream& os, const pair<A, B>& pair) {
69 return os << "(" << pair.first << ", " << pair.second << ")";
73 auto gen = seq(1, 10);
74 EXPECT_EQ(10, gen | count);
75 EXPECT_EQ(5, gen | take(5) | count);
79 auto gen = seq(1, 10);
80 EXPECT_EQ((1 + 10) * 10 / 2, gen | sum);
81 EXPECT_EQ((1 + 5) * 5 / 2, gen | take(5) | sum);
87 gen | [&](int x) { accum += x; };
90 gen | take(3) | [&](int x) { accum2 += x; };
95 auto expected = vector<int>{4, 9, 16};
96 auto gen = from({2, 3, 4}) | map(square);
97 EXPECT_EQ((vector<int>{4, 9, 16}), gen | as<vector>());
98 EXPECT_EQ((vector<int>{4, 9}), gen | take(2) | as<vector>());
102 // cover the fenceposts of the loop unrolling
103 for (int n = 1; n < 100; ++n) {
104 EXPECT_EQ(n, seq(1, n) | count);
105 EXPECT_EQ(n + 1, seq(1) | take(n + 1) | count);
110 // cover the fenceposts of the loop unrolling
111 for (int n = 1; n < 100; ++n) {
112 EXPECT_EQ(range(0, n) | count, n);
116 TEST(Gen, FromIterators) {
117 vector<int> source {2, 3, 5, 7, 11};
118 auto gen = from(makeRange(source.begin() + 1, source.end() - 1));
119 EXPECT_EQ(3 * 5 * 7, gen | product);
123 auto source = seq(0, 10)
124 | map([](int i) { return std::make_pair(i, i * i); })
125 | as<std::map<int, int>>();
126 auto gen = fromConst(source)
127 | map([&](const std::pair<const int, int>& p) {
128 return p.second - p.first;
130 EXPECT_EQ(330, gen | sum);
134 const auto expected = vector<int>{1, 2, 4, 5, 7, 8};
137 | filter([](int x) { return x % 3; })
139 EXPECT_EQ(expected, actual);
143 auto expected = vector<int>{1, 4, 9, 16};
146 | mapped([](int x) { return x * x; })
149 EXPECT_EQ(expected, actual);
155 | mapped([](int x) { return x * x; })
158 EXPECT_EQ((vector<int>{25, 36, 49, 64}), gen | as<vector>());
164 | mapped([](int x) { return x * x; })
165 | until([](int x) { return x >= 1000; });
166 EXPECT_EQ(31, gen | count);
171 std::vector<int> nums {2, 3, 5, 7};
172 std::map<int, int> mappings { { 3, 9}, {5, 25} };
173 auto gen = from(nums) + (from(mappings) | get<1>());
174 EXPECT_EQ(51, gen | sum);
175 EXPECT_EQ(5, gen | take(2) | sum);
176 EXPECT_EQ(26, gen | take(5) | sum);
180 std::vector<std::vector<int>> nums {{2, 3}, {5, 7}};
181 auto gen = from(nums) | rconcat;
182 EXPECT_EQ(17, gen | sum);
183 EXPECT_EQ(10, gen | take(3) | sum);
186 TEST(Gen, ConcatGen) {
187 auto gen = seq(1, 10)
188 | map([](int i) { return seq(1, i); })
190 EXPECT_EQ(220, gen | sum);
191 EXPECT_EQ(10, gen | take(6) | sum);
194 TEST(Gen, ConcatAlt) {
195 std::vector<std::vector<int>> nums {{2, 3}, {5, 7}};
196 auto actual = from(nums)
197 | map([](std::vector<int>& v) { return from(v); })
201 EXPECT_EQ(expected, actual);
205 auto expected = vector<int>{0, 3, 5, 6, 7, 8, 9};
207 from({8, 6, 7, 5, 3, 0, 9})
210 EXPECT_EQ(expected, actual);
213 TEST(Gen, OrderMoved) {
214 auto expected = vector<int>{0, 9, 25, 36, 49, 64, 81};
216 from({8, 6, 7, 5, 3, 0, 9})
221 EXPECT_EQ(expected, actual);
224 TEST(Gen, OrderTake) {
225 auto expected = vector<int>{9, 8, 7};
227 from({8, 6, 7, 5, 3, 0, 9})
228 | orderByDescending(square)
231 EXPECT_EQ(expected, actual);
235 EXPECT_EQ(7, seq(1, 10)
243 auto gen = from({"three", "eleven", "four"});
245 EXPECT_EQ("eleven", gen | maxBy(&strlen));
249 fbstring expected = "facebook";
250 fbstring actual = "face";
251 from(StringPiece("book")) | appendTo(actual);
252 EXPECT_EQ(expected, actual);
255 TEST(Gen, FromRValue) {
257 // AFAICT The C++ Standard does not specify what happens to the rvalue
258 // reference of a std::vector when it is used as the 'other' for an rvalue
259 // constructor. Use fbvector because we're sure its size will be zero in
261 folly::fbvector<int> v({1,2,3,4});
263 EXPECT_EQ(v.size(), 4); // ensure that the lvalue version was called!
264 auto expected = 1 * 2 * 3 * 4;
265 EXPECT_EQ(expected, q1 | product);
267 auto q2 = from(std::move(v));
268 EXPECT_EQ(v.size(), 0); // ensure that rvalue version was called
269 EXPECT_EQ(expected, q2 | product);
273 auto q = from([] {return vector<int>({3,7,5}); }());
274 EXPECT_EQ(expected, q | max);
277 for (auto size: {5, 1024, 16384, 1<<20}) {
278 auto q1 = from(vector<int>(size, 2));
279 auto q2 = from(vector<int>(size, 3));
280 // If the rvalue specialization is broken/gone, then the compiler will
281 // (disgustingly!) just store a *reference* to the temporary object,
282 // which is bad. Try to catch this by allocating two temporary vectors
283 // of the same size, so that they'll probably use the same underlying
284 // buffer if q1's vector is destructed before q2's vector is constructed.
285 EXPECT_EQ(size * 2 + size * 3, (q1 | sum) + (q2 | sum));
289 auto q = from(set<int>{1,2,3,2,1});
290 EXPECT_EQ(q | sum, 6);
295 auto expected = vector<int>{5, 6, 4, 7, 3, 8, 2, 9, 1, 10};
298 | orderBy([](int x) { return (5.1 - x) * (5.1 - x); })
300 EXPECT_EQ(expected, actual);
304 int expected = 2 * 3 * 4 * 5;
307 | foldl(1, multiply);
308 EXPECT_EQ(expected, actual);
312 int expected = 2 + 3 + 4 + 5;
313 auto actual = seq(2, 5) | reduce(add);
314 EXPECT_EQ(expected, actual);
317 TEST(Gen, ReduceBad) {
318 auto gen = seq(1) | take(0);
328 std::vector<unique_ptr<int>> ptrs;
329 ptrs.emplace_back(new int(1));
330 EXPECT_NE(ptrs.front().get(), nullptr);
331 auto ptrs2 = from(ptrs) | move | as<vector>();
332 EXPECT_EQ(ptrs.front().get(), nullptr);
333 EXPECT_EQ(**ptrs2.data(), 1);
339 | filter([](int x) { return x > 3; });
340 EXPECT_EQ(4, gen | first);
343 TEST(Gen, FromCopy) {
344 vector<int> v {3, 5};
346 auto copy = fromCopy(v);
347 EXPECT_EQ(8, src | sum);
348 EXPECT_EQ(8, copy | sum);
350 EXPECT_EQ(10, src | sum);
351 EXPECT_EQ(8, copy | sum);
355 std::map<int, int> pairs {
361 auto pairSrc = from(pairs);
362 auto keys = pairSrc | get<0>();
363 auto values = pairSrc | get<1>();
364 EXPECT_EQ(10, keys | sum);
365 EXPECT_EQ(30, values | sum);
366 EXPECT_EQ(30, keys | map(square) | sum);
368 EXPECT_EQ(15, keys | sum);
369 EXPECT_EQ(55, values | sum);
371 vector<tuple<int, int, int>> tuples {
374 make_tuple(3, 9, 27),
376 EXPECT_EQ(36, from(tuples) | get<2>() | sum);
380 EXPECT_TRUE(seq(0) | any);
381 EXPECT_TRUE(seq(0, 1) | any);
382 EXPECT_TRUE(from({1}) | any);
383 EXPECT_FALSE(range(0, 0) | any);
384 EXPECT_FALSE(from({1}) | take(0) | any);
387 TEST(Gen, Yielders) {
388 auto gen = GENERATOR(int, {
389 for (int i = 1; i <= 5; ++i) {
393 for (int i = 3; ; ++i) {
397 vector<int> expected {
398 1, 2, 3, 4, 5, 7, 9, 16, 25
400 EXPECT_EQ(expected, gen | take(9) | as<vector>());
403 TEST(Gen, NestedYield) {
404 auto nums = GENERATOR(int, {
405 for (int i = 1; ; ++i) {
409 auto gen = GENERATOR(int, {
410 nums | take(10) | yield;
411 seq(1, 5) | [&](int i) {
415 EXPECT_EQ(70, gen | sum);
418 TEST(Gen, MapYielders) {
421 return GENERATOR(int, {
423 for (i = 1; i < n; ++i)
430 vector<int> expected {
435 1, 2, 3, 4, 5, 4, 3, 2, 1,
437 EXPECT_EQ(expected, gen | as<vector>());
440 TEST(Gen, VirtualGen) {
441 VirtualGen<int> v(seq(1, 10));
442 EXPECT_EQ(55, v | sum);
444 EXPECT_EQ(385, v | sum);
446 EXPECT_EQ(55, v | sum);
447 EXPECT_EQ(30, v | take(4) | sum);
451 TEST(Gen, CustomType) {
455 auto gen = from({Foo{2}, Foo{3}})
456 | map([](const Foo& f) { return f.y; });
457 EXPECT_EQ(5, gen | sum);
460 TEST(Gen, NoNeedlessCopies) {
462 | map([](int x) { return unique_ptr<int>(new int(x)); })
463 | map([](unique_ptr<int> p) { return p; })
464 | map([](unique_ptr<int>&& p) { return std::move(p); })
465 | map([](const unique_ptr<int>& p) { return *p; });
466 EXPECT_EQ(15, gen | sum);
467 EXPECT_EQ(6, gen | take(3) | sum);
470 TEST(Gen, FromArray) {
471 int source[] = {2, 3, 5, 7};
472 auto gen = from(source);
473 EXPECT_EQ(2 * 3 * 5 * 7, gen | product);
476 TEST(Gen, FromStdArray) {
477 std::array<int,4> source {{2, 3, 5, 7}};
478 auto gen = from(source);
479 EXPECT_EQ(2 * 3 * 5 * 7, gen | product);
482 TEST(Gen, StringConcat) {
483 auto gen = seq(1, 10)
484 | map([](int n) { return folly::to<fbstring>(n); })
486 EXPECT_EQ("12345678910", gen | as<fbstring>());
494 CopyCounter() : copies(0), moves(0) {
498 CopyCounter(CopyCounter&& source) {
499 *this = std::move(source);
503 CopyCounter(const CopyCounter& source) {
512 CopyCounter& operator=(const CopyCounter& source) {
513 this->copies = source.copies + 1;
514 this->moves = source.moves;
518 CopyCounter& operator=(CopyCounter&& source) {
519 this->copies = source.copies;
520 this->moves = source.moves + 1;
525 int CopyCounter::alive = 0;
527 TEST(Gen, CopyCount) {
528 vector<CopyCounter> originals;
529 originals.emplace_back();
530 EXPECT_EQ(1, originals.size());
531 EXPECT_EQ(0, originals.back().copies);
533 vector<CopyCounter> copies = from(originals) | as<vector>();
534 EXPECT_EQ(1, copies.back().copies);
535 EXPECT_EQ(0, copies.back().moves);
537 vector<CopyCounter> moves = from(originals) | move | as<vector>();
538 EXPECT_EQ(0, moves.back().copies);
539 EXPECT_EQ(1, moves.back().moves);
542 // test dynamics with various layers of nested arrays.
544 dynamic array1 = {1, 2};
545 EXPECT_EQ(dynamic(3), from(array1) | sum);
546 dynamic array2 = {{1}, {1, 2}};
547 EXPECT_EQ(dynamic(4), from(array2) | rconcat | sum);
548 dynamic array3 = {{{1}}, {{1}, {1, 2}}};
549 EXPECT_EQ(dynamic(5), from(array3) | rconcat | rconcat | sum);
552 int main(int argc, char *argv[]) {
553 testing::InitGoogleTest(&argc, argv);
554 google::ParseCommandLineFlags(&argc, &argv, true);
555 return RUN_ALL_TESTS();