2 * Copyright 2014 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>
24 #include "folly/FBVector.h"
25 #include "folly/MapUtil.h"
26 #include "folly/Memory.h"
27 #include "folly/dynamic.h"
28 #include "folly/gen/Base.h"
29 #include "folly/experimental/TestUtil.h"
31 using namespace folly::gen;
32 using namespace folly;
33 using std::make_tuple;
39 using std::unique_ptr;
42 #define EXPECT_SAME(A, B) \
43 static_assert(std::is_same<A, B>::value, "Mismatched: " #A ", " #B)
44 EXPECT_SAME(int&&, typename ArgumentReference<int>::type);
45 EXPECT_SAME(int&, typename ArgumentReference<int&>::type);
46 EXPECT_SAME(const int&, typename ArgumentReference<const int&>::type);
47 EXPECT_SAME(const int&, typename ArgumentReference<const int>::type);
50 ostream& operator<<(ostream& os, const set<T>& values) {
51 return os << from(values);
55 ostream& operator<<(ostream& os, const vector<T>& values) {
57 for (auto& value : values) {
58 if (&value != &values.front()) {
66 auto square = [](int x) { return x * x; };
67 auto add = [](int a, int b) { return a + b; };
68 auto multiply = [](int a, int b) { return a * b; };
70 auto product = foldl(1, multiply);
72 template<typename A, typename B>
73 ostream& operator<<(ostream& os, const pair<A, B>& pair) {
74 return os << "(" << pair.first << ", " << pair.second << ")";
78 auto gen = seq(1, 10);
79 EXPECT_EQ(10, gen | count);
80 EXPECT_EQ(5, gen | take(5) | count);
84 auto gen = seq(1, 10);
85 EXPECT_EQ((1 + 10) * 10 / 2, gen | sum);
86 EXPECT_EQ((1 + 5) * 5 / 2, gen | take(5) | sum);
92 gen | [&](int x) { accum += x; };
95 gen | take(3) | [&](int x) { accum2 += x; };
100 auto expected = vector<int>{4, 9, 16};
101 auto gen = from({2, 3, 4}) | map(square);
102 EXPECT_EQ((vector<int>{4, 9, 16}), gen | as<vector>());
103 EXPECT_EQ((vector<int>{4, 9}), gen | take(2) | as<vector>());
108 Counter(int start = 0)
112 int count() const { return c; }
113 int incr() { return ++c; }
115 int& ref() { return c; }
116 const int& ref() const { return c; }
120 auto counters = seq(1, 10) | eachAs<Counter>() | as<vector>();
121 EXPECT_EQ(10 * (1 + 10) / 2,
123 | member(&Counter::count)
125 EXPECT_EQ(10 * (2 + 11) / 2,
127 | member(&Counter::incr)
129 EXPECT_EQ(10 * (2 + 11) / 2,
131 | member(&Counter::count)
134 // type-verifications
135 auto m = empty<Counter&>();
136 auto c = empty<const Counter&>();
137 m | member(&Counter::incr) | assert_type<int&&>();
138 m | member(&Counter::count) | assert_type<int&&>();
139 m | member(&Counter::count) | assert_type<int&&>();
140 m | member<Const>(&Counter::ref) | assert_type<const int&>();
141 m | member<Mutable>(&Counter::ref) | assert_type<int&>();
142 c | member<Const>(&Counter::ref) | assert_type<const int&>();
147 X() : a(2), b(3), c(4), d(b) {}
152 int& d; // can't access this with a field pointer.
155 std::vector<X> xs(1);
156 EXPECT_EQ(2, from(xs)
159 EXPECT_EQ(3, from(xs)
162 EXPECT_EQ(4, from(xs)
166 empty<X&>() | field(&X::a) | assert_type<const int&>();
167 empty<X&>() | field(&X::b) | assert_type<int&>();
168 empty<X&>() | field(&X::c) | assert_type<int&>();
169 empty<X&&>() | field(&X::a) | assert_type<const int&&>();
170 empty<X&&>() | field(&X::b) | assert_type<int&&>();
171 empty<X&&>() | field(&X::c) | assert_type<int&&>();
172 // references don't imply ownership so they're not moved
173 empty<const X&>() | field(&X::a) | assert_type<const int&>();
174 empty<const X&>() | field(&X::b) | assert_type<const int&>();
175 // 'mutable' has no effect on field pointers, by C++ spec
176 empty<const X&>() | field(&X::c) | assert_type<const int&>();
178 // can't form pointer-to-reference field: empty<X&>() | field(&X::d)
182 // cover the fenceposts of the loop unrolling
183 for (int n = 1; n < 100; ++n) {
184 EXPECT_EQ(n, seq(1, n) | count);
185 EXPECT_EQ(n + 1, seq(1) | take(n + 1) | count);
190 // cover the fenceposts of the loop unrolling
191 for (int n = 1; n < 100; ++n) {
192 EXPECT_EQ(gen::range(0, n) | count, n);
196 TEST(Gen, FromIterators) {
197 vector<int> source {2, 3, 5, 7, 11};
198 auto gen = from(folly::range(source.begin() + 1, source.end() - 1));
199 EXPECT_EQ(3 * 5 * 7, gen | product);
203 auto source = seq(0, 10)
204 | map([](int i) { return std::make_pair(i, i * i); })
205 | as<std::map<int, int>>();
206 auto gen = fromConst(source)
207 | map([&](const std::pair<const int, int>& p) {
208 return p.second - p.first;
210 EXPECT_EQ(330, gen | sum);
214 const auto expected = vector<int>{1, 2, 4, 5, 7, 8};
217 | filter([](int x) { return x % 3; })
219 EXPECT_EQ(expected, actual);
222 TEST(Gen, Contains) {
227 EXPECT_TRUE(gen | contains(49));
228 EXPECT_FALSE(gen | contains(50));
232 seq(1) // infinite, to prove laziness
234 | eachTo<std::string>();
236 // std::string gen, const char* needle
237 EXPECT_TRUE(gen | take(9999) | contains("49"));
243 auto expected = vector<int>{1, 4, 9, 16};
246 | mapped([](int x) { return x * x; })
249 EXPECT_EQ(expected, actual);
252 auto expected = vector<int>{ 0, 1, 4, 5, 8 };
254 = ((seq(0) | take(2)) +
259 EXPECT_EQ(expected, actual);
262 auto expected = vector<int>{ 0, 1, 4, 5, 8 };
266 return seq(i * 4) | take(2);
271 EXPECT_EQ(expected, actual);
276 std::mt19937 rnd(42);
281 std::unordered_map<int,int> hits;
282 const int kNumIters = 80;
283 for (int i = 0; i < kNumIters; i++) {
284 auto vec = sampler | as<vector<int>>();
285 EXPECT_EQ(vec.size(), 50);
286 auto uniq = fromConst(vec) | as<set<int>>();
287 EXPECT_EQ(uniq.size(), vec.size()); // sampling without replacement
293 // In 80 separate samples of our range, we should have seen every value
294 // at least once and no value all 80 times. (The odds of either of those
295 // events is 1/2^80).
296 EXPECT_EQ(hits.size(), 100);
297 for (auto hit: hits) {
298 EXPECT_GT(hit.second, 0);
299 EXPECT_LT(hit.second, kNumIters);
305 EXPECT_EQ((small | sum), 15);
306 EXPECT_EQ((small | take(3) | count), 3);
312 | mapped([](int x) { return x * x; })
315 EXPECT_EQ((vector<int>{25, 36, 49, 64}), gen | as<vector>());
320 auto expected = vector<int>{1, 4, 9, 16};
323 | mapped([](int x) { return x * x; })
324 | until([](int x) { return x > 20; })
326 EXPECT_EQ(expected, actual);
329 auto expected = vector<int>{ 0, 1, 4, 5, 8 };
331 = ((seq(0) | until([](int i) { return i > 1; })) +
332 (seq(4) | until([](int i) { return i > 5; })) +
333 (seq(8) | until([](int i) { return i > 9; })))
334 | until([](int i) { return i > 8; })
336 EXPECT_EQ(expected, actual);
340 auto expected = vector<int>{ 0, 1, 5, 6, 10 };
344 return seq(i * 5) | until([=](int j) { return j > i * 5 + 1; });
347 | until([](int i) { return i > 10; })
349 EXPECT_EQ(expected, actual);
354 TEST(Gen, Composed) {
355 // Operator, Operator
357 filter([](Optional<int>& o) { return o.hasValue(); })
358 | map([](Optional<int>& o) -> int& { return o.value(); });
359 std::vector<Optional<int>> opts {
360 none, 4, none, 6, none
362 EXPECT_EQ(4 * 4 + 6 * 6, from(opts) | valuesOf | map(square) | sum);
364 auto sumOpt = valuesOf | sum;
365 EXPECT_EQ(10, from(opts) | sumOpt);
369 std::vector<int> nums {2, 3, 5, 7};
370 std::map<int, int> mappings { { 3, 9}, {5, 25} };
371 auto gen = from(nums) + (from(mappings) | get<1>());
372 EXPECT_EQ(51, gen | sum);
373 EXPECT_EQ(5, gen | take(2) | sum);
374 EXPECT_EQ(26, gen | take(5) | sum);
378 std::vector<std::vector<int>> nums {{2, 3}, {5, 7}};
379 auto gen = from(nums) | rconcat;
380 EXPECT_EQ(17, gen | sum);
381 EXPECT_EQ(10, gen | take(3) | sum);
384 TEST(Gen, ConcatGen) {
385 auto gen = seq(1, 10)
386 | map([](int i) { return seq(1, i); })
388 EXPECT_EQ(220, gen | sum);
389 EXPECT_EQ(10, gen | take(6) | sum);
392 TEST(Gen, ConcatAlt) {
393 std::vector<std::vector<int>> nums {{2, 3}, {5, 7}};
394 auto actual = from(nums)
395 | map([](std::vector<int>& v) { return from(v); })
399 EXPECT_EQ(expected, actual);
403 auto expected = vector<int>{0, 3, 5, 6, 7, 8, 9};
405 from({8, 6, 7, 5, 3, 0, 9})
408 EXPECT_EQ(expected, actual);
411 TEST(Gen, OrderMoved) {
412 auto expected = vector<int>{0, 9, 25, 36, 49, 64, 81};
414 from({8, 6, 7, 5, 3, 0, 9})
419 EXPECT_EQ(expected, actual);
422 TEST(Gen, OrderTake) {
423 auto expected = vector<int>{9, 8, 7};
425 from({8, 6, 7, 5, 3, 0, 9})
426 | orderByDescending(square)
429 EXPECT_EQ(expected, actual);
432 TEST(Gen, Distinct) {
433 auto expected = vector<int>{3, 1, 2};
435 from({3, 1, 3, 2, 1, 2, 3})
438 EXPECT_EQ(expected, actual);
441 TEST(Gen, DistinctBy) { // 0 1 4 9 6 5 6 9 4 1 0
442 auto expected = vector<int>{0, 1, 2, 3, 4, 5};
445 | distinctBy([](int i) { return i * i % 10; })
447 EXPECT_EQ(expected, actual);
450 TEST(Gen, DistinctMove) { // 0 1 4 9 6 5 6 9 4 1 0
451 auto expected = vector<int>{0, 1, 2, 3, 4, 5};
454 | mapped([](int i) { return std::unique_ptr<int>(new int(i)); })
455 // see comment below about selector parameters for Distinct
456 | distinctBy([](const std::unique_ptr<int>& pi) { return *pi * *pi % 10; })
457 | mapped([](std::unique_ptr<int> pi) { return *pi; })
460 // NOTE(tjackson): the following line intentionally doesn't work:
461 // | distinctBy([](std::unique_ptr<int> pi) { return *pi * *pi % 10; })
462 // This is because distinctBy because the selector intentionally requires a
463 // const reference. If it required a move-reference, the value might get
464 // gutted by the selector before said value could be passed to downstream
466 EXPECT_EQ(expected, actual);
470 EXPECT_EQ(7, seq(1, 10)
471 | minBy([](int i) -> double {
478 auto gen = from({"three", "eleven", "four"});
480 EXPECT_EQ("eleven", gen | maxBy(&strlen));
484 string expected = "facebook";
485 string actual = "face";
486 from(StringPiece("book")) | appendTo(actual);
487 EXPECT_EQ(expected, actual);
490 TEST(Gen, FromRValue) {
492 // AFAICT The C++ Standard does not specify what happens to the rvalue
493 // reference of a std::vector when it is used as the 'other' for an rvalue
494 // constructor. Use fbvector because we're sure its size will be zero in
496 fbvector<int> v({1,2,3,4});
498 EXPECT_EQ(v.size(), 4); // ensure that the lvalue version was called!
499 auto expected = 1 * 2 * 3 * 4;
500 EXPECT_EQ(expected, q1 | product);
502 auto q2 = from(std::move(v));
503 EXPECT_EQ(v.size(), 0); // ensure that rvalue version was called
504 EXPECT_EQ(expected, q2 | product);
508 auto q = from([] {return vector<int>({3,7,5}); }());
509 EXPECT_EQ(expected, q | max);
512 for (auto size: {5, 1024, 16384, 1<<20}) {
513 auto q1 = from(vector<int>(size, 2));
514 auto q2 = from(vector<int>(size, 3));
515 // If the rvalue specialization is broken/gone, then the compiler will
516 // (disgustingly!) just store a *reference* to the temporary object,
517 // which is bad. Try to catch this by allocating two temporary vectors
518 // of the same size, so that they'll probably use the same underlying
519 // buffer if q1's vector is destructed before q2's vector is constructed.
520 EXPECT_EQ(size * 2 + size * 3, (q1 | sum) + (q2 | sum));
524 auto q = from(set<int>{1,2,3,2,1});
525 EXPECT_EQ(q | sum, 6);
530 auto expected = vector<int>{5, 6, 4, 7, 3, 8, 2, 9, 1, 10};
533 | orderBy([](int x) { return (5.1 - x) * (5.1 - x); })
535 EXPECT_EQ(expected, actual);
539 int expected = 2 * 3 * 4 * 5;
542 | foldl(1, multiply);
543 EXPECT_EQ(expected, actual);
547 int expected = 2 + 3 + 4 + 5;
548 auto actual = seq(2, 5) | reduce(add);
549 EXPECT_EQ(expected, actual);
552 TEST(Gen, ReduceBad) {
553 auto gen = seq(1) | take(0);
563 std::vector<unique_ptr<int>> ptrs;
564 ptrs.emplace_back(new int(1));
565 EXPECT_NE(ptrs.front().get(), nullptr);
566 auto ptrs2 = from(ptrs) | move | as<vector>();
567 EXPECT_EQ(ptrs.front().get(), nullptr);
568 EXPECT_EQ(**ptrs2.data(), 1);
574 | filter([](int x) { return x > 3; });
575 EXPECT_EQ(4, gen | first);
578 TEST(Gen, FromCopy) {
579 vector<int> v {3, 5};
581 auto copy = fromCopy(v);
582 EXPECT_EQ(8, src | sum);
583 EXPECT_EQ(8, copy | sum);
585 EXPECT_EQ(10, src | sum);
586 EXPECT_EQ(8, copy | sum);
590 std::map<int, int> pairs {
596 auto pairSrc = from(pairs);
597 auto keys = pairSrc | get<0>();
598 auto values = pairSrc | get<1>();
599 EXPECT_EQ(10, keys | sum);
600 EXPECT_EQ(30, values | sum);
601 EXPECT_EQ(30, keys | map(square) | sum);
603 EXPECT_EQ(15, keys | sum);
604 EXPECT_EQ(55, values | sum);
606 vector<tuple<int, int, int>> tuples {
609 make_tuple(3, 9, 27),
611 EXPECT_EQ(36, from(tuples) | get<2>() | sum);
615 EXPECT_TRUE(seq(0) | any);
616 EXPECT_TRUE(seq(0, 1) | any);
617 EXPECT_TRUE(seq(0, 10) | any([](int i) { return i == 7; }));
618 EXPECT_FALSE(seq(0, 10) | any([](int i) { return i == 11; }));
620 EXPECT_TRUE(from({1}) | any);
621 EXPECT_FALSE(gen::range(0, 0) | any);
622 EXPECT_FALSE(from({1}) | take(0) | any);
626 EXPECT_TRUE(seq(0, 10) | all([](int i) { return i < 11; }));
627 EXPECT_FALSE(seq(0, 10) | all([](int i) { return i < 5; }));
628 EXPECT_FALSE(seq(0) | take(9999) | all([](int i) { return i < 10; }));
630 // empty lists satisfies all
631 EXPECT_TRUE(seq(0) | take(0) | all([](int i) { return i < 50; }));
632 EXPECT_TRUE(seq(0) | take(0) | all([](int i) { return i > 50; }));
635 TEST(Gen, Yielders) {
636 auto gen = GENERATOR(int) {
637 for (int i = 1; i <= 5; ++i) {
641 for (int i = 3; ; ++i) {
645 vector<int> expected {
646 1, 2, 3, 4, 5, 7, 9, 16, 25
648 EXPECT_EQ(expected, gen | take(9) | as<vector>());
651 TEST(Gen, NestedYield) {
652 auto nums = GENERATOR(int) {
653 for (int i = 1; ; ++i) {
657 auto gen = GENERATOR(int) {
658 nums | take(10) | yield;
659 seq(1, 5) | [&](int i) {
663 EXPECT_EQ(70, gen | sum);
666 TEST(Gen, MapYielders) {
669 return GENERATOR(int) {
671 for (i = 1; i < n; ++i)
678 vector<int> expected {
683 1, 2, 3, 4, 5, 4, 3, 2, 1,
685 EXPECT_EQ(expected, gen | as<vector>());
688 TEST(Gen, VirtualGen) {
689 VirtualGen<int> v(seq(1, 10));
690 EXPECT_EQ(55, v | sum);
692 EXPECT_EQ(385, v | sum);
694 EXPECT_EQ(55, v | sum);
695 EXPECT_EQ(30, v | take(4) | sum);
699 TEST(Gen, CustomType) {
703 auto gen = from({Foo{2}, Foo{3}})
704 | map([](const Foo& f) { return f.y; });
705 EXPECT_EQ(5, gen | sum);
708 TEST(Gen, NoNeedlessCopies) {
710 | map([](int x) { return unique_ptr<int>(new int(x)); })
711 | map([](unique_ptr<int> p) { return p; })
712 | map([](unique_ptr<int>&& p) { return std::move(p); })
713 | map([](const unique_ptr<int>& p) { return *p; });
714 EXPECT_EQ(15, gen | sum);
715 EXPECT_EQ(6, gen | take(3) | sum);
720 class TestIntSeq : public GenImpl<int, TestIntSeq> {
724 template <class Body>
725 bool apply(Body&& body) const {
726 for (int i = 1; i < 6; ++i) {
734 TestIntSeq(TestIntSeq&&) = default;
735 TestIntSeq& operator=(TestIntSeq&&) = default;
736 TestIntSeq(const TestIntSeq&) = delete;
737 TestIntSeq& operator=(const TestIntSeq&) = delete;
742 TEST(Gen, NoGeneratorCopies) {
743 EXPECT_EQ(15, TestIntSeq() | sum);
744 auto x = TestIntSeq() | take(3);
745 EXPECT_EQ(6, std::move(x) | sum);
748 TEST(Gen, FromArray) {
749 int source[] = {2, 3, 5, 7};
750 auto gen = from(source);
751 EXPECT_EQ(2 * 3 * 5 * 7, gen | product);
754 TEST(Gen, FromStdArray) {
755 std::array<int,4> source {{2, 3, 5, 7}};
756 auto gen = from(source);
757 EXPECT_EQ(2 * 3 * 5 * 7, gen | product);
760 TEST(Gen, StringConcat) {
761 auto gen = seq(1, 10)
764 EXPECT_EQ("12345678910", gen | as<string>());
772 CopyCounter() : copies(0), moves(0) {
776 CopyCounter(CopyCounter&& source) {
777 *this = std::move(source);
781 CopyCounter(const CopyCounter& source) {
790 CopyCounter& operator=(const CopyCounter& source) {
791 this->copies = source.copies + 1;
792 this->moves = source.moves;
796 CopyCounter& operator=(CopyCounter&& source) {
797 this->copies = source.copies;
798 this->moves = source.moves + 1;
803 int CopyCounter::alive = 0;
805 TEST(Gen, CopyCount) {
806 vector<CopyCounter> originals;
807 originals.emplace_back();
808 EXPECT_EQ(1, originals.size());
809 EXPECT_EQ(0, originals.back().copies);
811 vector<CopyCounter> copies = from(originals) | as<vector>();
812 EXPECT_EQ(1, copies.back().copies);
813 EXPECT_EQ(0, copies.back().moves);
815 vector<CopyCounter> moves = from(originals) | move | as<vector>();
816 EXPECT_EQ(0, moves.back().copies);
817 EXPECT_EQ(1, moves.back().moves);
820 // test dynamics with various layers of nested arrays.
822 dynamic array1 = {1, 2};
823 EXPECT_EQ(dynamic(3), from(array1) | sum);
824 dynamic array2 = {{1}, {1, 2}};
825 EXPECT_EQ(dynamic(4), from(array2) | rconcat | sum);
826 dynamic array3 = {{{1}}, {{1}, {1, 2}}};
827 EXPECT_EQ(dynamic(5), from(array3) | rconcat | rconcat | sum);
830 TEST(Gen, DynamicObject) {
831 const dynamic obj = dynamic::object(1, 2)(3, 4);
832 EXPECT_EQ(dynamic(4), from(obj.keys()) | sum);
833 EXPECT_EQ(dynamic(6), from(obj.values()) | sum);
834 EXPECT_EQ(dynamic(4), from(obj.items()) | get<0>() | sum);
835 EXPECT_EQ(dynamic(6), from(obj.items()) | get<1>() | sum);
839 auto s = from({7, 6, 5, 4, 3}) | as<set<int>>();
840 EXPECT_EQ(s.size(), 5);
846 auto s = from({1, 2});
847 EXPECT_EQ((vector<int> { 1, 2, 1, 2, 1 }),
848 s | cycle | take(5) | as<vector>());
851 auto s = from({1, 2});
852 EXPECT_EQ((vector<int> { 1, 2, 1, 2 }),
853 s | cycle(2) | as<vector>());
856 auto s = from({1, 2, 3});
857 EXPECT_EQ((vector<int> { 1, 2, 1, 2, 1 }),
858 s | take(2) | cycle | take(5) | as<vector>());
861 auto s = empty<int>();
862 EXPECT_EQ((vector<int> { }),
863 s | cycle | take(4) | as<vector>());
867 int* pcount = &count;
868 auto countdown = GENERATOR(int) {
869 ASSERT_GE(*pcount, 0)
870 << "Cycle should have stopped when it didnt' get values!";
871 for (int i = 1; i <= *pcount; ++i) {
877 EXPECT_EQ((vector<int> { 1, 2, 3, 1, 2, 1}),
878 s | cycle | as<vector>());
882 TEST(Gen, Dereference) {
884 const int x = 4, y = 2;
885 auto s = from(std::initializer_list<const int*>({&x, nullptr, &y}));
886 EXPECT_EQ(6, s | dereference | sum);
889 vector<int> a { 1, 2 };
890 vector<int> b { 3, 4 };
891 vector<vector<int>*> pv { &a, nullptr, &b };
894 | [&](vector<int>& v) {
897 EXPECT_EQ(3, a.size());
898 EXPECT_EQ(3, b.size());
899 EXPECT_EQ(5, a.back());
900 EXPECT_EQ(5, b.back());
903 vector<std::map<int, int>> maps {
920 | map([](std::map<int, int>& m) {
921 return get_ptr(m, 3);
927 vector<unique_ptr<int>> ups;
928 ups.emplace_back(new int(3));
930 ups.emplace_back(new int(7));
931 EXPECT_EQ(10, from(ups) | dereference | sum);
932 EXPECT_EQ(10, from(ups) | move | dereference | sum);
937 using std::runtime_error;
938 EXPECT_THROW(from({"1", "a", "3"})
943 from({"1", "a", "3"})
944 | guard<runtime_error>([](runtime_error&, const char*) {
945 return true; // continue
950 from({"1", "a", "3"})
951 | guard<runtime_error>([](runtime_error&, const char*) {
952 return false; // break
956 EXPECT_THROW(from({"1", "a", "3"})
957 | guard<runtime_error>([](runtime_error&, const char* v) {
969 EXPECT_EQ((vector<vector<int>> { {1} }),
970 seq(1, 1) | batch(5) | as<vector>());
971 EXPECT_EQ((vector<vector<int>> { {1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11} }),
972 seq(1, 11) | batch(3) | as<vector>());
973 EXPECT_THROW(seq(1, 1) | batch(0) | as<vector>(),
974 std::invalid_argument);
977 TEST(Gen, BatchMove) {
978 auto expected = vector<vector<int>>{ {0, 1}, {2, 3}, {4} };
981 | mapped([](int i) { return std::unique_ptr<int>(new int(i)); })
983 | mapped([](std::vector<std::unique_ptr<int>>& pVector) {
984 std::vector<int> iVector;
985 for (const auto& p : pVector) {
986 iVector.push_back(*p);
991 EXPECT_EQ(expected, actual);
994 int main(int argc, char *argv[]) {
995 testing::InitGoogleTest(&argc, argv);
996 google::ParseCommandLineFlags(&argc, &argv, true);
997 return RUN_ALL_TESTS();