2 * Copyright 2017 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>
24 #include <folly/FBVector.h>
25 #include <folly/MapUtil.h>
26 #include <folly/Memory.h>
27 #include <folly/String.h>
28 #include <folly/dynamic.h>
29 #include <folly/experimental/TestUtil.h>
30 #include <folly/gen/Base.h>
31 #include <folly/portability/GTest.h>
33 using namespace folly::gen;
34 using namespace folly;
35 using std::make_tuple;
41 using std::unique_ptr;
44 #define EXPECT_SAME(A, B) \
45 static_assert(std::is_same<A, B>::value, "Mismatched: " #A ", " #B)
46 EXPECT_SAME(int&&, typename ArgumentReference<int>::type);
47 EXPECT_SAME(int&, typename ArgumentReference<int&>::type);
48 EXPECT_SAME(const int&, typename ArgumentReference<const int&>::type);
49 EXPECT_SAME(const int&, typename ArgumentReference<const int>::type);
52 ostream& operator<<(ostream& os, const set<T>& values) {
53 return os << from(values);
57 ostream& operator<<(ostream& os, const vector<T>& values) {
59 for (auto& value : values) {
60 if (&value != &values.front()) {
68 auto square = [](int x) { return x * x; };
69 auto add = [](int a, int b) { return a + b; };
70 auto multiply = [](int a, int b) { return a * b; };
72 auto product = foldl(1, multiply);
74 template<typename A, typename B>
75 ostream& operator<<(ostream& os, const pair<A, B>& pair) {
76 return os << "(" << pair.first << ", " << pair.second << ")";
80 auto gen = seq(1, 10);
81 EXPECT_EQ(10, gen | count);
82 EXPECT_EQ(5, gen | take(5) | count);
86 auto gen = seq(1, 10);
87 EXPECT_EQ((1 + 10) * 10 / 2, gen | sum);
88 EXPECT_EQ((1 + 5) * 5 / 2, gen | take(5) | sum);
94 gen | [&](int x) { accum += x; };
97 gen | take(3) | [&](int x) { accum2 += x; };
102 auto expected = vector<int>{4, 9, 16};
103 auto gen = from({2, 3, 4}) | map(square);
104 EXPECT_EQ((vector<int>{4, 9, 16}), gen | as<vector>());
105 EXPECT_EQ((vector<int>{4, 9}), gen | take(2) | as<vector>());
110 Counter(int start = 0)
114 int count() const { return c; }
115 int incr() { return ++c; }
117 int& ref() { return c; }
118 const int& ref() const { return c; }
122 auto counters = seq(1, 10) | eachAs<Counter>() | as<vector>();
123 EXPECT_EQ(10 * (1 + 10) / 2,
125 | member(&Counter::count)
127 EXPECT_EQ(10 * (1 + 10) / 2,
130 | member(&Counter::count)
132 EXPECT_EQ(10 * (2 + 11) / 2,
134 | member(&Counter::incr)
136 EXPECT_EQ(10 * (3 + 12) / 2,
139 | member(&Counter::incr)
141 EXPECT_EQ(10 * (3 + 12) / 2,
143 | member(&Counter::count)
146 // type-verifications
147 auto m = empty<Counter&>();
148 auto c = empty<const Counter&>();
149 m | member(&Counter::incr) | assert_type<int&&>();
150 m | member(&Counter::count) | assert_type<int&&>();
151 m | member(&Counter::count) | assert_type<int&&>();
152 m | member<Const>(&Counter::ref) | assert_type<const int&>();
153 m | member<Mutable>(&Counter::ref) | assert_type<int&>();
154 c | member<Const>(&Counter::ref) | assert_type<const int&>();
159 X() : a(2), b(3), c(4), d(b) {}
164 int& d; // can't access this with a field pointer.
167 std::vector<X> xs(1);
168 EXPECT_EQ(2, from(xs)
171 EXPECT_EQ(3, from(xs)
174 EXPECT_EQ(4, from(xs)
177 EXPECT_EQ(2, seq(&xs[0], &xs[0])
181 empty<X&>() | field(&X::a) | assert_type<const int&>();
182 empty<X*>() | field(&X::a) | assert_type<const int&>();
183 empty<X&>() | field(&X::b) | assert_type<int&>();
184 empty<X*>() | field(&X::b) | assert_type<int&>();
185 empty<X&>() | field(&X::c) | assert_type<int&>();
186 empty<X*>() | field(&X::c) | assert_type<int&>();
188 empty<X&&>() | field(&X::a) | assert_type<const int&&>();
189 empty<X&&>() | field(&X::b) | assert_type<int&&>();
190 empty<X&&>() | field(&X::c) | assert_type<int&&>();
191 // references don't imply ownership so they're not moved
193 empty<const X&>() | field(&X::a) | assert_type<const int&>();
194 empty<const X*>() | field(&X::a) | assert_type<const int&>();
195 empty<const X&>() | field(&X::b) | assert_type<const int&>();
196 empty<const X*>() | field(&X::b) | assert_type<const int&>();
197 // 'mutable' has no effect on field pointers, by C++ spec
198 empty<const X&>() | field(&X::c) | assert_type<const int&>();
199 empty<const X*>() | field(&X::c) | assert_type<const int&>();
201 // can't form pointer-to-reference field: empty<X&>() | field(&X::d)
205 // cover the fenceposts of the loop unrolling
206 for (int n = 1; n < 100; ++n) {
207 EXPECT_EQ(n, seq(1, n) | count);
208 EXPECT_EQ(n + 1, seq(1) | take(n + 1) | count);
212 TEST(Gen, SeqWithStep) {
213 EXPECT_EQ(75, seq(5, 25, 5) | sum);
216 TEST(Gen, SeqWithStepArray) {
217 const std::array<int, 6> arr{{1, 2, 3, 4, 5, 6}};
218 EXPECT_EQ(9, seq(&arr[0], &arr[5], 2)
219 | map([](const int *i) { return *i; })
224 // cover the fenceposts of the loop unrolling
225 for (int n = 1; n < 100; ++n) {
226 EXPECT_EQ(gen::range(0, n) | count, n);
230 TEST(Gen, RangeWithStep) {
231 EXPECT_EQ(50, range(5, 25, 5) | sum);
234 TEST(Gen, FromIterators) {
235 vector<int> source {2, 3, 5, 7, 11};
236 auto gen = from(folly::range(source.begin() + 1, source.end() - 1));
237 EXPECT_EQ(3 * 5 * 7, gen | product);
241 auto source = seq(0, 10)
242 | map([](int i) { return std::make_pair(i, i * i); })
243 | as<std::map<int, int>>();
244 auto gen = fromConst(source)
245 | map([&](const std::pair<const int, int>& p) {
246 return p.second - p.first;
248 EXPECT_EQ(330, gen | sum);
252 const auto expected = vector<int>{1, 2, 4, 5, 7, 8};
255 | filter([](int x) { return x % 3; })
257 EXPECT_EQ(expected, actual);
260 TEST(Gen, FilterDefault) {
262 // Default filter should remove 0s
263 const auto expected = vector<int>{1, 1, 2, 3};
265 from({0, 1, 1, 0, 2, 3, 0})
268 EXPECT_EQ(expected, actual);
271 // Default filter should remove nullptrs
275 const auto expected = vector<int*>{&a, &b, &c};
277 from({(int*)nullptr, &a, &b, &c, (int*)nullptr})
280 EXPECT_EQ(expected, actual);
283 // Default filter on Optionals should remove folly::null
284 const auto expected =
285 vector<Optional<int>>{Optional<int>(5), Optional<int>(0)};
287 from({Optional<int>(5), Optional<int>(), Optional<int>(0)})
290 EXPECT_EQ(expected, actual);
294 TEST(Gen, FilterSink) {
297 | map([](int x) { return vector<int>{x}; })
298 | filter([](vector<int> v) { return !v.empty(); })
300 EXPECT_FALSE(from(actual) | rconcat | isEmpty);
303 TEST(Gen, Contains) {
308 EXPECT_TRUE(gen | contains(49));
309 EXPECT_FALSE(gen | contains(50));
313 seq(1) // infinite, to prove laziness
315 | eachTo<std::string>();
317 // std::string gen, const char* needle
318 EXPECT_TRUE(gen | take(9999) | contains("49"));
324 auto expected = vector<int>{1, 4, 9, 16};
327 | mapped([](int x) { return x * x; })
330 EXPECT_EQ(expected, actual);
333 auto expected = vector<int>{ 0, 1, 4, 5, 8 };
335 = ((seq(0) | take(2)) +
340 EXPECT_EQ(expected, actual);
343 auto expected = vector<int>{ 0, 1, 4, 5, 8 };
347 return seq(i * 4) | take(2);
352 EXPECT_EQ(expected, actual);
357 EXPECT_THROW(take(limit - 6), std::invalid_argument);
364 EXPECT_THROW(stride(0), std::invalid_argument);
367 auto expected = vector<int>{1, 2, 3, 4};
372 EXPECT_EQ(expected, actual);
375 auto expected = vector<int>{1, 3, 5, 7};
380 EXPECT_EQ(expected, actual);
383 auto expected = vector<int>{1, 4, 7, 10};
388 EXPECT_EQ(expected, actual);
391 auto expected = vector<int>{1, 3, 5, 7, 9, 1, 4, 7, 10};
393 = ((seq(1, 10) | stride(2)) +
394 (seq(1, 10) | stride(3)))
396 EXPECT_EQ(expected, actual);
398 EXPECT_EQ(500, seq(1) | take(1000) | stride(2) | count);
399 EXPECT_EQ(10, seq(1) | take(1000) | stride(2) | take(10) | count);
403 std::mt19937 rnd(42);
408 std::unordered_map<int,int> hits;
409 const int kNumIters = 80;
410 for (int i = 0; i < kNumIters; i++) {
411 auto vec = sampler | as<vector<int>>();
412 EXPECT_EQ(vec.size(), 50);
413 auto uniq = fromConst(vec) | as<set<int>>();
414 EXPECT_EQ(uniq.size(), vec.size()); // sampling without replacement
420 // In 80 separate samples of our range, we should have seen every value
421 // at least once and no value all 80 times. (The odds of either of those
422 // events is 1/2^80).
423 EXPECT_EQ(hits.size(), 100);
424 for (auto hit: hits) {
425 EXPECT_GT(hit.second, 0);
426 EXPECT_LT(hit.second, kNumIters);
432 EXPECT_EQ((small | sum), 15);
433 EXPECT_EQ((small | take(3) | count), 3);
439 | mapped([](int x) { return x * x; })
442 EXPECT_EQ((vector<int>{25, 36, 49, 64}), gen | as<vector>());
447 auto expected = vector<int>{1, 4, 9, 16};
450 | mapped([](int x) { return x * x; })
451 | until([](int x) { return x > 20; })
453 EXPECT_EQ(expected, actual);
456 auto expected = vector<int>{ 0, 1, 4, 5, 8 };
458 = ((seq(0) | until([](int i) { return i > 1; })) +
459 (seq(4) | until([](int i) { return i > 5; })) +
460 (seq(8) | until([](int i) { return i > 9; })))
461 | until([](int i) { return i > 8; })
463 EXPECT_EQ(expected, actual);
467 auto expected = vector<int>{ 0, 1, 5, 6, 10 };
471 return seq(i * 5) | until([=](int j) { return j > i * 5 + 1; });
474 | until([](int i) { return i > 10; })
476 EXPECT_EQ(expected, actual);
481 TEST(Gen, Composed) {
482 // Operator, Operator
484 filter([](Optional<int>& o) { return o.hasValue(); })
485 | map([](Optional<int>& o) -> int& { return o.value(); });
486 std::vector<Optional<int>> opts {
487 none, 4, none, 6, none
489 EXPECT_EQ(4 * 4 + 6 * 6, from(opts) | valuesOf | map(square) | sum);
491 auto sumOpt = valuesOf | sum;
492 EXPECT_EQ(10, from(opts) | sumOpt);
496 std::vector<int> nums {2, 3, 5, 7};
497 std::map<int, int> mappings { { 3, 9}, {5, 25} };
498 auto gen = from(nums) + (from(mappings) | get<1>());
499 EXPECT_EQ(51, gen | sum);
500 EXPECT_EQ(5, gen | take(2) | sum);
501 EXPECT_EQ(26, gen | take(5) | sum);
505 std::vector<std::vector<int>> nums {{2, 3}, {5, 7}};
506 auto gen = from(nums) | rconcat;
507 EXPECT_EQ(17, gen | sum);
508 EXPECT_EQ(10, gen | take(3) | sum);
511 TEST(Gen, ConcatGen) {
512 auto gen = seq(1, 10)
513 | map([](int i) { return seq(1, i); })
515 EXPECT_EQ(220, gen | sum);
516 EXPECT_EQ(10, gen | take(6) | sum);
519 TEST(Gen, ConcatAlt) {
520 std::vector<std::vector<int>> nums {{2, 3}, {5, 7}};
521 auto actual = from(nums)
522 | map([](std::vector<int>& v) { return from(v); })
526 EXPECT_EQ(expected, actual);
530 auto expected = vector<int>{0, 3, 5, 6, 7, 8, 9};
532 from({8, 6, 7, 5, 3, 0, 9})
535 EXPECT_EQ(expected, actual);
538 TEST(Gen, OrderMoved) {
539 auto expected = vector<int>{0, 9, 25, 36, 49, 64, 81};
541 from({8, 6, 7, 5, 3, 0, 9})
546 EXPECT_EQ(expected, actual);
549 TEST(Gen, OrderTake) {
550 auto expected = vector<int>{9, 8, 7};
552 from({8, 6, 7, 5, 3, 0, 9})
553 | orderByDescending(square)
556 EXPECT_EQ(expected, actual);
559 TEST(Gen, Distinct) {
560 auto expected = vector<int>{3, 1, 2};
562 from({3, 1, 3, 2, 1, 2, 3})
565 EXPECT_EQ(expected, actual);
568 TEST(Gen, DistinctBy) { // 0 1 4 9 6 5 6 9 4 1 0
569 auto expected = vector<int>{0, 1, 2, 3, 4, 5};
572 | distinctBy([](int i) { return i * i % 10; })
574 EXPECT_EQ(expected, actual);
577 TEST(Gen, DistinctMove) { // 0 1 4 9 6 5 6 9 4 1 0
578 auto expected = vector<int>{0, 1, 2, 3, 4, 5};
581 | mapped([](int i) { return std::unique_ptr<int>(new int(i)); })
582 // see comment below about selector parameters for Distinct
583 | distinctBy([](const std::unique_ptr<int>& pi) { return *pi * *pi % 10; })
584 | mapped([](std::unique_ptr<int> pi) { return *pi; })
587 // NOTE(tjackson): the following line intentionally doesn't work:
588 // | distinctBy([](std::unique_ptr<int> pi) { return *pi * *pi % 10; })
589 // This is because distinctBy because the selector intentionally requires a
590 // const reference. If it required a move-reference, the value might get
591 // gutted by the selector before said value could be passed to downstream
593 EXPECT_EQ(expected, actual);
596 TEST(Gen, DistinctInfinite) {
597 // distinct should be able to handle an infinite sequence, provided that, of
598 // of cource, is it eventually made finite before returning the result.
599 auto expected = seq(0) | take(5) | as<vector>(); // 0 1 2 3 4
602 seq(0) // 0 1 2 3 4 5 6 7 ...
603 | mapped([](int i) { return i / 2; }) // 0 0 1 1 2 2 3 3 ...
604 | distinct // 0 1 2 3 4 5 6 7 ...
605 | take(5) // 0 1 2 3 4
608 EXPECT_EQ(expected, actual);
611 TEST(Gen, DistinctByInfinite) {
612 // Similarly to the DistinctInfinite test case, distinct by should be able to
613 // handle infinite sequences. Note that depending on how many values we take()
614 // at the end, the sequence may infinite loop. This is fine becasue we cannot
615 // solve the halting problem.
616 auto expected = vector<int>{1, 2};
618 seq(1) // 1 2 3 4 5 6 7 8 ...
619 | distinctBy([](int i) { return i % 2; }) // 1 2 (but might by infinite)
622 // Note that if we had take(3), this would infinite loop
624 EXPECT_EQ(expected, actual);
628 EXPECT_EQ(7, seq(1, 10)
629 | minBy([](int i) -> double {
637 auto gen = from({"three", "eleven", "four"});
639 EXPECT_EQ("eleven", gen | maxBy(&strlen) | unwrap);
643 auto odds = seq(2,10) | filter([](int i){ return i % 2; });
645 EXPECT_EQ(3, odds | min);
649 auto odds = seq(2,10) | filter([](int i){ return i % 2; });
651 EXPECT_EQ(9, odds | max);
655 string expected = "facebook";
656 string actual = "face";
657 from(StringPiece("book")) | appendTo(actual);
658 EXPECT_EQ(expected, actual);
661 TEST(Gen, FromRValue) {
663 // AFAICT The C++ Standard does not specify what happens to the rvalue
664 // reference of a std::vector when it is used as the 'other' for an rvalue
665 // constructor. Use fbvector because we're sure its size will be zero in
667 fbvector<int> v({1,2,3,4});
669 EXPECT_EQ(v.size(), 4); // ensure that the lvalue version was called!
670 auto expected = 1 * 2 * 3 * 4;
671 EXPECT_EQ(expected, q1 | product);
673 auto q2 = from(std::move(v));
674 EXPECT_EQ(v.size(), 0); // ensure that rvalue version was called
675 EXPECT_EQ(expected, q2 | product);
679 auto q = from([] {return vector<int>({3,7,5}); }());
680 EXPECT_EQ(expected, q | max);
683 for (auto size: {5, 1024, 16384, 1<<20}) {
684 auto q1 = from(vector<int>(size, 2));
685 auto q2 = from(vector<int>(size, 3));
686 // If the rvalue specialization is broken/gone, then the compiler will
687 // (disgustingly!) just store a *reference* to the temporary object,
688 // which is bad. Try to catch this by allocating two temporary vectors
689 // of the same size, so that they'll probably use the same underlying
690 // buffer if q1's vector is destructed before q2's vector is constructed.
691 EXPECT_EQ(size * 2 + size * 3, (q1 | sum) + (q2 | sum));
695 auto q = from(set<int>{1,2,3,2,1});
696 EXPECT_EQ(q | sum, 6);
701 auto expected = vector<int>{5, 6, 4, 7, 3, 8, 2, 9, 1, 10};
704 | orderBy([](int x) { return (5.1 - x) * (5.1 - x); })
706 EXPECT_EQ(expected, actual);
708 expected = seq(1, 10) | as<vector>();
711 | map([] (int x) { return 11 - x; })
714 EXPECT_EQ(expected, actual);
718 int expected = 2 * 3 * 4 * 5;
721 | foldl(1, multiply);
722 EXPECT_EQ(expected, actual);
726 int expected = 2 + 3 + 4 + 5;
727 auto actual = seq(2, 5) | reduce(add);
728 EXPECT_EQ(expected, actual | unwrap);
731 TEST(Gen, ReduceBad) {
732 auto gen = seq(1) | take(0);
733 auto actual = gen | reduce(add);
734 EXPECT_FALSE(actual); // Empty sequences are okay, they just yeild 'none'
738 std::vector<unique_ptr<int>> ptrs;
739 ptrs.emplace_back(new int(1));
740 EXPECT_NE(ptrs.front().get(), nullptr);
741 auto ptrs2 = from(ptrs) | move | as<vector>();
742 EXPECT_EQ(ptrs.front().get(), nullptr);
743 EXPECT_EQ(**ptrs2.data(), 1);
747 auto gen = seq(0) | filter([](int x) { return x > 3; });
748 EXPECT_EQ(4, gen | first | unwrap);
751 TEST(Gen, FromCopy) {
752 vector<int> v {3, 5};
754 auto copy = fromCopy(v);
755 EXPECT_EQ(8, src | sum);
756 EXPECT_EQ(8, copy | sum);
758 EXPECT_EQ(10, src | sum);
759 EXPECT_EQ(8, copy | sum);
763 std::map<int, int> pairs {
769 auto pairSrc = from(pairs);
770 auto keys = pairSrc | get<0>();
771 auto values = pairSrc | get<1>();
772 EXPECT_EQ(10, keys | sum);
773 EXPECT_EQ(30, values | sum);
774 EXPECT_EQ(30, keys | map(square) | sum);
776 EXPECT_EQ(15, keys | sum);
777 EXPECT_EQ(55, values | sum);
779 vector<tuple<int, int, int>> tuples {
782 make_tuple(3, 9, 27),
784 EXPECT_EQ(36, from(tuples) | get<2>() | sum);
787 TEST(Gen, notEmpty) {
788 EXPECT_TRUE(seq(0, 1) | notEmpty);
789 EXPECT_TRUE(just(1) | notEmpty);
790 EXPECT_FALSE(gen::range(0, 0) | notEmpty);
791 EXPECT_FALSE(from({1}) | take(0) | notEmpty);
795 EXPECT_FALSE(seq(0, 1) | isEmpty);
796 EXPECT_FALSE(just(1) | isEmpty);
797 EXPECT_TRUE(gen::range(0, 0) | isEmpty);
798 EXPECT_TRUE(from({1}) | take(0) | isEmpty);
802 EXPECT_TRUE(seq(0, 10) | any([](int i) { return i == 7; }));
803 EXPECT_FALSE(seq(0, 10) | any([](int i) { return i == 11; }));
807 EXPECT_TRUE(seq(0, 10) | all([](int i) { return i < 11; }));
808 EXPECT_FALSE(seq(0, 10) | all([](int i) { return i < 5; }));
809 EXPECT_FALSE(seq(0) | take(9999) | all([](int i) { return i < 10; }));
811 // empty lists satisfies all
812 EXPECT_TRUE(seq(0) | take(0) | all([](int i) { return i < 50; }));
813 EXPECT_TRUE(seq(0) | take(0) | all([](int i) { return i > 50; }));
816 TEST(Gen, Yielders) {
817 auto gen = GENERATOR(int) {
818 for (int i = 1; i <= 5; ++i) {
822 for (int i = 3; ; ++i) {
826 vector<int> expected {
827 1, 2, 3, 4, 5, 7, 9, 16, 25
829 EXPECT_EQ(expected, gen | take(9) | as<vector>());
832 TEST(Gen, NestedYield) {
833 auto nums = GENERATOR(int) {
834 for (int i = 1; ; ++i) {
838 auto gen = GENERATOR(int) {
839 nums | take(10) | yield;
840 seq(1, 5) | [&](int i) {
844 EXPECT_EQ(70, gen | sum);
847 TEST(Gen, MapYielders) {
850 return GENERATOR(int) {
852 for (i = 1; i < n; ++i)
859 vector<int> expected {
864 1, 2, 3, 4, 5, 4, 3, 2, 1,
866 EXPECT_EQ(expected, gen | as<vector>());
869 TEST(Gen, VirtualGen) {
870 VirtualGen<int> v(seq(1, 10));
871 EXPECT_EQ(55, v | sum);
873 EXPECT_EQ(385, v | sum);
875 EXPECT_EQ(55, v | sum);
876 EXPECT_EQ(30, v | take(4) | sum);
880 TEST(Gen, CustomType) {
884 auto gen = from({Foo{2}, Foo{3}})
885 | map([](const Foo& f) { return f.y; });
886 EXPECT_EQ(5, gen | sum);
889 TEST(Gen, NoNeedlessCopies) {
891 | map([](int x) { return unique_ptr<int>(new int(x)); })
892 | map([](unique_ptr<int> p) { return p; })
893 | map([](unique_ptr<int>&& p) { return std::move(p); })
894 | map([](const unique_ptr<int>& p) { return *p; });
895 EXPECT_EQ(15, gen | sum);
896 EXPECT_EQ(6, gen | take(3) | sum);
901 class TestIntSeq : public GenImpl<int, TestIntSeq> {
905 template <class Body>
906 bool apply(Body&& body) const {
907 for (int i = 1; i < 6; ++i) {
915 TestIntSeq(TestIntSeq&&) noexcept = default;
916 TestIntSeq& operator=(TestIntSeq&&) noexcept = default;
917 TestIntSeq(const TestIntSeq&) = delete;
918 TestIntSeq& operator=(const TestIntSeq&) = delete;
923 TEST(Gen, NoGeneratorCopies) {
924 EXPECT_EQ(15, TestIntSeq() | sum);
925 auto x = TestIntSeq() | take(3);
926 EXPECT_EQ(6, std::move(x) | sum);
929 TEST(Gen, FromArray) {
930 int source[] = {2, 3, 5, 7};
931 auto gen = from(source);
932 EXPECT_EQ(2 * 3 * 5 * 7, gen | product);
935 TEST(Gen, FromStdArray) {
936 std::array<int,4> source {{2, 3, 5, 7}};
937 auto gen = from(source);
938 EXPECT_EQ(2 * 3 * 5 * 7, gen | product);
941 TEST(Gen, StringConcat) {
942 auto gen = seq(1, 10)
945 EXPECT_EQ("12345678910", gen | as<string>());
953 CopyCounter() : copies(0), moves(0) {
957 CopyCounter(CopyCounter&& source) noexcept {
958 *this = std::move(source);
962 CopyCounter(const CopyCounter& source) {
971 CopyCounter& operator=(const CopyCounter& source) {
972 this->copies = source.copies + 1;
973 this->moves = source.moves;
977 CopyCounter& operator=(CopyCounter&& source) {
978 this->copies = source.copies;
979 this->moves = source.moves + 1;
984 int CopyCounter::alive = 0;
986 TEST(Gen, CopyCount) {
987 vector<CopyCounter> originals;
988 originals.emplace_back();
989 EXPECT_EQ(1, originals.size());
990 EXPECT_EQ(0, originals.back().copies);
992 vector<CopyCounter> copies = from(originals) | as<vector>();
993 EXPECT_EQ(1, copies.back().copies);
994 EXPECT_EQ(0, copies.back().moves);
996 vector<CopyCounter> moves = from(originals) | move | as<vector>();
997 EXPECT_EQ(0, moves.back().copies);
998 EXPECT_EQ(1, moves.back().moves);
1001 // test dynamics with various layers of nested arrays.
1002 TEST(Gen, Dynamic) {
1003 dynamic array1 = dynamic::array(1, 2);
1004 EXPECT_EQ(dynamic(3), from(array1) | sum);
1005 dynamic array2 = folly::dynamic::array(
1006 folly::dynamic::array(1), folly::dynamic::array(1, 2));
1007 EXPECT_EQ(dynamic(4), from(array2) | rconcat | sum);
1008 dynamic array3 = folly::dynamic::array(
1009 folly::dynamic::array(folly::dynamic::array(1)),
1010 folly::dynamic::array(
1011 folly::dynamic::array(1), folly::dynamic::array(1, 2)));
1012 EXPECT_EQ(dynamic(5), from(array3) | rconcat | rconcat | sum);
1015 TEST(Gen, DynamicObject) {
1016 const dynamic obj = dynamic::object(1, 2)(3, 4);
1017 EXPECT_EQ(dynamic(4), from(obj.keys()) | sum);
1018 EXPECT_EQ(dynamic(6), from(obj.values()) | sum);
1019 EXPECT_EQ(dynamic(4), from(obj.items()) | get<0>() | sum);
1020 EXPECT_EQ(dynamic(6), from(obj.items()) | get<1>() | sum);
1023 TEST(Gen, Collect) {
1024 auto s = from({7, 6, 5, 4, 3}) | as<set<int>>();
1025 EXPECT_EQ(s.size(), 5);
1031 auto s = from({1, 2});
1032 EXPECT_EQ((vector<int> { 1, 2, 1, 2, 1 }),
1033 s | cycle | take(5) | as<vector>());
1036 auto s = from({1, 2});
1037 EXPECT_EQ((vector<int> { 1, 2, 1, 2 }),
1038 s | cycle(2) | as<vector>());
1041 auto s = from({1, 2, 3});
1042 EXPECT_EQ((vector<int> { 1, 2, 1, 2, 1 }),
1043 s | take(2) | cycle | take(5) | as<vector>());
1046 auto s = empty<int>();
1047 EXPECT_EQ((vector<int> { }),
1048 s | cycle | take(4) | as<vector>());
1052 int* pcount = &count;
1053 auto countdown = GENERATOR(int) {
1054 ASSERT_GE(*pcount, 0)
1055 << "Cycle should have stopped when it didnt' get values!";
1056 for (int i = 1; i <= *pcount; ++i) {
1062 EXPECT_EQ((vector<int> { 1, 2, 3, 1, 2, 1}),
1063 s | cycle | take(7) | as<vector>());
1064 // take necessary as cycle returns an infinite generator
1068 TEST(Gen, Dereference) {
1070 const int x = 4, y = 2;
1071 auto s = from(std::initializer_list<const int*>({&x, nullptr, &y}));
1072 EXPECT_EQ(6, s | dereference | sum);
1075 vector<int> a { 1, 2 };
1076 vector<int> b { 3, 4 };
1077 vector<vector<int>*> pv { &a, nullptr, &b };
1080 | [&](vector<int>& v) {
1083 EXPECT_EQ(3, a.size());
1084 EXPECT_EQ(3, b.size());
1085 EXPECT_EQ(5, a.back());
1086 EXPECT_EQ(5, b.back());
1089 vector<std::map<int, int>> maps {
1106 | map([](std::map<int, int>& m) {
1107 return get_ptr(m, 3);
1113 vector<unique_ptr<int>> ups;
1114 ups.emplace_back(new int(3));
1116 ups.emplace_back(new int(7));
1117 EXPECT_EQ(10, from(ups) | dereference | sum);
1118 EXPECT_EQ(10, from(ups) | move | dereference | sum);
1123 struct DereferenceWrapper {
1125 string& operator*() & {
1128 string&& operator*() && {
1129 return std::move(data);
1131 explicit operator bool() {
1135 bool operator==(const DereferenceWrapper& a, const DereferenceWrapper& b) {
1136 return a.data == b.data;
1138 void PrintTo(const DereferenceWrapper& a, std::ostream* o) {
1139 *o << "Wrapper{\"" << cEscape<string>(a.data) << "\"}";
1143 TEST(Gen, DereferenceWithLValueRef) {
1144 auto original = vector<DereferenceWrapper>{{"foo"}, {"bar"}};
1145 auto copy = original;
1146 auto expected = vector<string>{"foo", "bar"};
1147 auto actual = from(original) | dereference | as<vector>();
1148 EXPECT_EQ(expected, actual);
1149 EXPECT_EQ(copy, original);
1152 TEST(Gen, DereferenceWithRValueRef) {
1153 auto original = vector<DereferenceWrapper>{{"foo"}, {"bar"}};
1154 auto empty = vector<DereferenceWrapper>{{}, {}};
1155 auto expected = vector<string>{"foo", "bar"};
1156 auto actual = from(original) | move | dereference | as<vector>();
1157 EXPECT_EQ(expected, actual);
1158 EXPECT_EQ(empty, original);
1161 TEST(Gen, Indirect) {
1163 EXPECT_EQ(&vs[0], from(vs) | indirect | first | unwrap);
1167 using std::runtime_error;
1168 EXPECT_THROW(from({"1", "a", "3"})
1173 from({"1", "a", "3"})
1174 | guard<runtime_error>([](runtime_error&, const char*) {
1175 return true; // continue
1180 from({"1", "a", "3"})
1181 | guard<runtime_error>([](runtime_error&, const char*) {
1182 return false; // break
1186 EXPECT_THROW(from({"1", "a", "3"})
1187 | guard<runtime_error>([](runtime_error&, const char* v) {
1199 EXPECT_EQ((vector<vector<int>> { {1} }),
1200 seq(1, 1) | batch(5) | as<vector>());
1201 EXPECT_EQ((vector<vector<int>> { {1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11} }),
1202 seq(1, 11) | batch(3) | as<vector>());
1203 EXPECT_THROW(seq(1, 1) | batch(0) | as<vector>(),
1204 std::invalid_argument);
1207 TEST(Gen, BatchMove) {
1208 auto expected = vector<vector<int>>{ {0, 1}, {2, 3}, {4} };
1211 | mapped([](int i) { return std::unique_ptr<int>(new int(i)); })
1213 | mapped([](std::vector<std::unique_ptr<int>>& pVector) {
1214 std::vector<int> iVector;
1215 for (const auto& p : pVector) {
1216 iVector.push_back(*p);
1221 EXPECT_EQ(expected, actual);
1228 EXPECT_EQ(&x, j | indirect | first | unwrap);
1230 EXPECT_EQ(4, j | sum);
1236 EXPECT_EQ(&x, j | indirect | first | unwrap);
1238 EXPECT_EQ(5, j | sum);
1242 auto j = just(std::move(x));
1243 EXPECT_NE(&x, j | indirect | first | unwrap);
1245 EXPECT_EQ(3, j | sum);
1249 TEST(Gen, GroupBy) {
1250 vector<string> strs{"zero", "one", "two", "three", "four",
1251 "five", "six", "seven", "eight", "nine"};
1253 auto gb = from(strs) | groupBy([](const string& str) { return str.size(); });
1255 EXPECT_EQ(10, gb | mapOp(count) | sum);
1256 EXPECT_EQ(3, gb | count);
1258 vector<string> mode{"zero", "four", "five", "nine"};
1260 gb | maxBy([](const Group<size_t, string>& g) { return g.size(); })
1264 vector<string> largest{"three", "seven", "eight"};
1266 gb | maxBy([](const Group<size_t, string>& g) { return g.key(); })
1274 EXPECT_EQ(4, o | unwrap);
1275 EXPECT_THROW(e | unwrap, OptionalEmptyException);
1277 auto oup = folly::make_optional(folly::make_unique<int>(5));
1278 // optional has a value, and that value is non-null
1279 EXPECT_TRUE(bool(oup | unwrap));
1280 EXPECT_EQ(5, *(oup | unwrap));
1281 EXPECT_TRUE(oup.hasValue()); // still has a pointer (null or not)
1282 EXPECT_TRUE(bool(oup.value())); // that value isn't null
1284 auto moved1 = std::move(oup) | unwrapOr(folly::make_unique<int>(6));
1285 // oup still has a value, but now it's now nullptr since the pointer was moved
1287 EXPECT_TRUE(oup.hasValue());
1288 EXPECT_FALSE(oup.value());
1289 EXPECT_TRUE(bool(moved1));
1290 EXPECT_EQ(5, *moved1);
1292 auto moved2 = std::move(oup) | unwrapOr(folly::make_unique<int>(7));
1293 // oup's still-valid nullptr value wins here, the pointer to 7 doesn't apply
1294 EXPECT_FALSE(moved2);
1297 auto moved3 = std::move(oup) | unwrapOr(folly::make_unique<int>(8));
1298 // oup is empty now, so the unwrapOr comes into play.
1299 EXPECT_TRUE(bool(moved3));
1300 EXPECT_EQ(8, *moved3);
1303 // mixed types, with common type matching optional
1304 Optional<double> full(3.3);
1305 decltype(full) empty;
1306 auto fallback = unwrapOr(4);
1307 EXPECT_EQ(3.3, full | fallback);
1308 EXPECT_EQ(3.3, std::move(full) | fallback);
1309 EXPECT_EQ(3.3, full | std::move(fallback));
1310 EXPECT_EQ(3.3, std::move(full) | std::move(fallback));
1311 EXPECT_EQ(4.0, empty | fallback);
1312 EXPECT_EQ(4.0, std::move(empty) | fallback);
1313 EXPECT_EQ(4.0, empty | std::move(fallback));
1314 EXPECT_EQ(4.0, std::move(empty) | std::move(fallback));
1318 // mixed types, with common type matching fallback
1319 Optional<int> full(3);
1320 decltype(full) empty;
1321 auto fallback = unwrapOr(5.0); // type: double
1322 // if we chose 'int' as the common type, we'd see truncation here
1323 EXPECT_EQ(1.5, (full | fallback) / 2);
1324 EXPECT_EQ(1.5, (std::move(full) | fallback) / 2);
1325 EXPECT_EQ(1.5, (full | std::move(fallback)) / 2);
1326 EXPECT_EQ(1.5, (std::move(full) | std::move(fallback)) / 2);
1327 EXPECT_EQ(2.5, (empty | fallback) / 2);
1328 EXPECT_EQ(2.5, (std::move(empty) | fallback) / 2);
1329 EXPECT_EQ(2.5, (empty | std::move(fallback)) / 2);
1330 EXPECT_EQ(2.5, (std::move(empty) | std::move(fallback)) / 2);
1334 auto opt = folly::make_optional(std::make_shared<int>(8));
1335 auto fallback = unwrapOr(folly::make_unique<int>(9));
1336 // fallback must be std::move'd to be used
1337 EXPECT_EQ(8, *(opt | std::move(fallback)));
1338 EXPECT_TRUE(bool(opt.value())); // shared_ptr copied out, not moved
1339 EXPECT_TRUE(bool(opt)); // value still present
1340 EXPECT_TRUE(bool(fallback.value())); // fallback value not needed
1342 EXPECT_EQ(8, *(std::move(opt) | std::move(fallback)));
1343 EXPECT_FALSE(opt.value()); // shared_ptr moved out
1344 EXPECT_TRUE(bool(opt)); // gutted value still present
1345 EXPECT_TRUE(bool(fallback.value())); // fallback value not needed
1349 EXPECT_FALSE(opt); // opt is empty now
1350 EXPECT_EQ(9, *(std::move(opt) | std::move(fallback)));
1351 EXPECT_FALSE(fallback.value()); // fallback moved out!
1355 // test with nullptr
1356 vector<int> v{1, 2};
1357 EXPECT_EQ(&v[1], from(v) | indirect | max | unwrap);
1359 EXPECT_FALSE(from(v) | indirect | max | unwrapOr(nullptr));
1363 // mixed type determined by fallback
1364 Optional<std::nullptr_t> empty;
1366 EXPECT_EQ(&x, empty | unwrapOr(&x));
1370 int main(int argc, char *argv[]) {
1371 testing::InitGoogleTest(&argc, argv);
1372 gflags::ParseCommandLineFlags(&argc, &argv, true);
1373 return RUN_ALL_TESTS();