-- 7a6ff16a85beb730c172d5d25cf1b5e1be885c56 by Laramie Leavitt <lar@google.com>: Internal change. PiperOrigin-RevId: 254454546 -- ff8f9bafaefc26d451f576ea4a06d150aed63f6f by Andy Soffer <asoffer@google.com>: Internal changes PiperOrigin-RevId: 254451562 -- deefc5b651b479ce36f0b4ef203e119c0c8936f2 by CJ Johnson <johnsoncj@google.com>: Account for subtracting unsigned values from the size of InlinedVector PiperOrigin-RevId: 254450625 -- 3c677316a27bcadc17e41957c809ca472d5fef14 by Andy Soffer <asoffer@google.com>: Add C++17's std::make_from_tuple to absl/utility/utility.h PiperOrigin-RevId: 254411573 -- 4ee3536a918830eeec402a28fc31a62c7c90b940 by CJ Johnson <johnsoncj@google.com>: Adds benchmark for the rest of the InlinedVector public API PiperOrigin-RevId: 254408378 -- e5a21a00700ee83498ff1efbf649169756463ee4 by CJ Johnson <johnsoncj@google.com>: Updates the definition of InlinedVector::shrink_to_fit() to be exception safe and adds exception safety tests for it. PiperOrigin-RevId: 254401387 -- 2ea82e72b86d82d78b4e4712a63a55981b53c64b by Laramie Leavitt <lar@google.com>: Use absl::InsecureBitGen in place of std::mt19937 in tests absl/random/...distribution_test.cc PiperOrigin-RevId: 254289444 -- fa099e02c413a7ffda732415e8105cad26a90337 by Andy Soffer <asoffer@google.com>: Internal changes PiperOrigin-RevId: 254286334 -- ce34b7f36933b30cfa35b9c9a5697a792b5666e4 by Andy Soffer <asoffer@google.com>: Internal changes PiperOrigin-RevId: 254273059 -- 6f9c473da7c2090c2e85a37c5f00622e8a912a89 by Jorg Brown <jorg@google.com>: Change absl::container_internal::CompressedTuple to instantiate its internal Storage class with the name of the type it's holding, rather than the name of the Tuple. This is not an externally-visible change, other than less compiler memory is used and less debug information is generated. PiperOrigin-RevId: 254269285 -- 8bd3c186bf2fc0c55d8a2dd6f28a5327502c9fba by Andy Soffer <asoffer@google.com>: Adding short-hand IntervalClosed for IntervalClosedClosed and IntervalOpen for IntervalOpenOpen. PiperOrigin-RevId: 254252419 -- ea957f99b6a04fccd42aa05605605f3b44b1ecfd by Abseil Team <absl-team@google.com>: Do not directly use __SIZEOF_INT128__. In order to avoid linker errors when building with clang-cl (__fixunsdfti, __udivti3 and __fixunssfti are undefined), this CL uses ABSL_HAVE_INTRINSIC_INT128 which is not defined for clang-cl. PiperOrigin-RevId: 254250739 -- 89ab385cd26b34d64130bce856253aaba96d2345 by Andy Soffer <asoffer@google.com>: Internal changes PiperOrigin-RevId: 254242321 -- cffc793d93eca6d6bdf7de733847b6ab4a255ae9 by CJ Johnson <johnsoncj@google.com>: Adds benchmark for InlinedVector::reserve(size_type) PiperOrigin-RevId: 254199226 -- c90c7a9fa3c8f0c9d5114036979548b055ea2f2a by Gennadiy Rozental <rogeeff@google.com>: Import of CCTZ from GitHub. PiperOrigin-RevId: 254072387 -- c4c388beae016c9570ab54ffa1d52660e4a85b7b by Laramie Leavitt <lar@google.com>: Internal cleanup. PiperOrigin-RevId: 254062381 -- d3c992e221cc74e5372d0c8fa410170b6a43c062 by Tom Manshreck <shreck@google.com>: Update distributions.h to Abseil standards PiperOrigin-RevId: 254054946 -- d15ad0035c34ef11b14fadc5a4a2d3ec415f5518 by CJ Johnson <johnsoncj@google.com>: Removes functions with only one caller from the implementation details of InlinedVector by manually inlining the definitions PiperOrigin-RevId: 254005427 -- 2f37e807efc3a8ef1f4b539bdd379917d4151520 by Andy Soffer <asoffer@google.com>: Initial release of Abseil Random PiperOrigin-RevId: 253999861 -- 24ed1694b6430791d781ed533a8f8ccf6cac5856 by CJ Johnson <johnsoncj@google.com>: Updates the definition of InlinedVector::assign(...)/InlinedVector::operator=(...) to new, exception-safe implementations with exception safety tests to boot PiperOrigin-RevId: 253993691 -- 5613d95f5a7e34a535cfaeadce801441e990843e by CJ Johnson <johnsoncj@google.com>: Adds benchmarks for InlinedVector::shrink_to_fit() PiperOrigin-RevId: 253989647 -- 2a96ddfdac40bbb8cb6a7f1aeab90917067c6e63 by Abseil Team <absl-team@google.com>: Initial release of Abseil Random PiperOrigin-RevId: 253927497 -- bf1aff8fc9ffa921ad74643e9525ecf25b0d8dc1 by Andy Soffer <asoffer@google.com>: Initial release of Abseil Random PiperOrigin-RevId: 253920512 -- bfc03f4a3dcda3cf3a4b84bdb84cda24e3394f41 by Laramie Leavitt <lar@google.com>: Internal change. PiperOrigin-RevId: 253886486 -- 05036cfcc078ca7c5f581a00dfb0daed568cbb69 by Eric Fiselier <ericwf@google.com>: Don't include `winsock2.h` because it drags in `windows.h` and friends, and they define awful macros like OPAQUE, ERROR, and more. This has the potential to break abseil users. Instead we only forward declare `timeval` and require Windows users include `winsock2.h` themselves. This is both inconsistent and poor QoI, but so including 'windows.h' is bad too. PiperOrigin-RevId: 253852615 GitOrigin-RevId: 7a6ff16a85beb730c172d5d25cf1b5e1be885c56 Change-Id: Icd6aff87da26f29ec8915da856f051129987cef6
		
			
				
	
	
		
			376 lines
		
	
	
	
		
			13 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			376 lines
		
	
	
	
		
			13 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| // Copyright 2017 The Abseil Authors.
 | |
| //
 | |
| // 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
 | |
| //
 | |
| //      https://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.
 | |
| 
 | |
| #include "absl/utility/utility.h"
 | |
| 
 | |
| #include <sstream>
 | |
| #include <string>
 | |
| #include <tuple>
 | |
| #include <type_traits>
 | |
| #include <vector>
 | |
| 
 | |
| #include "gmock/gmock.h"
 | |
| #include "gtest/gtest.h"
 | |
| #include "absl/base/attributes.h"
 | |
| #include "absl/memory/memory.h"
 | |
| #include "absl/strings/str_cat.h"
 | |
| 
 | |
| namespace {
 | |
| 
 | |
| #ifdef _MSC_VER
 | |
| // Warnings for unused variables in this test are false positives.  On other
 | |
| // platforms, they are suppressed by ABSL_ATTRIBUTE_UNUSED, but that doesn't
 | |
| // work on MSVC.
 | |
| // Both the unused variables and the name length warnings are due to calls
 | |
| // to absl::make_index_sequence with very large values, creating very long type
 | |
| // names. The resulting warnings are so long they make build output unreadable.
 | |
| #pragma warning( push )
 | |
| #pragma warning( disable : 4503 )  // decorated name length exceeded
 | |
| #pragma warning( disable : 4101 )  // unreferenced local variable
 | |
| #endif  // _MSC_VER
 | |
| 
 | |
| using ::testing::ElementsAre;
 | |
| using ::testing::Pointee;
 | |
| using ::testing::StaticAssertTypeEq;
 | |
| 
 | |
| TEST(IntegerSequenceTest, ValueType) {
 | |
|   StaticAssertTypeEq<int, absl::integer_sequence<int>::value_type>();
 | |
|   StaticAssertTypeEq<char, absl::integer_sequence<char>::value_type>();
 | |
| }
 | |
| 
 | |
| TEST(IntegerSequenceTest, Size) {
 | |
|   EXPECT_EQ(0, (absl::integer_sequence<int>::size()));
 | |
|   EXPECT_EQ(1, (absl::integer_sequence<int, 0>::size()));
 | |
|   EXPECT_EQ(1, (absl::integer_sequence<int, 1>::size()));
 | |
|   EXPECT_EQ(2, (absl::integer_sequence<int, 1, 2>::size()));
 | |
|   EXPECT_EQ(3, (absl::integer_sequence<int, 0, 1, 2>::size()));
 | |
|   EXPECT_EQ(3, (absl::integer_sequence<int, -123, 123, 456>::size()));
 | |
|   constexpr size_t sz = absl::integer_sequence<int, 0, 1>::size();
 | |
|   EXPECT_EQ(2, sz);
 | |
| }
 | |
| 
 | |
| TEST(IntegerSequenceTest, MakeIndexSequence) {
 | |
|   StaticAssertTypeEq<absl::index_sequence<>, absl::make_index_sequence<0>>();
 | |
|   StaticAssertTypeEq<absl::index_sequence<0>, absl::make_index_sequence<1>>();
 | |
|   StaticAssertTypeEq<absl::index_sequence<0, 1>,
 | |
|                      absl::make_index_sequence<2>>();
 | |
|   StaticAssertTypeEq<absl::index_sequence<0, 1, 2>,
 | |
|                      absl::make_index_sequence<3>>();
 | |
| }
 | |
| 
 | |
| TEST(IntegerSequenceTest, MakeIntegerSequence) {
 | |
|   StaticAssertTypeEq<absl::integer_sequence<int>,
 | |
|                      absl::make_integer_sequence<int, 0>>();
 | |
|   StaticAssertTypeEq<absl::integer_sequence<int, 0>,
 | |
|                      absl::make_integer_sequence<int, 1>>();
 | |
|   StaticAssertTypeEq<absl::integer_sequence<int, 0, 1>,
 | |
|                      absl::make_integer_sequence<int, 2>>();
 | |
|   StaticAssertTypeEq<absl::integer_sequence<int, 0, 1, 2>,
 | |
|                      absl::make_integer_sequence<int, 3>>();
 | |
| }
 | |
| 
 | |
| template <typename... Ts>
 | |
| class Counter {};
 | |
| 
 | |
| template <size_t... Is>
 | |
| void CountAll(absl::index_sequence<Is...>) {
 | |
|   // We only need an alias here, but instantiate a variable to silence warnings
 | |
|   // for unused typedefs in some compilers.
 | |
|   ABSL_ATTRIBUTE_UNUSED Counter<absl::make_index_sequence<Is>...> seq;
 | |
| }
 | |
| 
 | |
| // This test verifies that absl::make_index_sequence can handle large arguments
 | |
| // without blowing up template instantiation stack, going OOM or taking forever
 | |
| // to compile (there is hard 15 minutes limit imposed by forge).
 | |
| TEST(IntegerSequenceTest, MakeIndexSequencePerformance) {
 | |
|   // O(log N) template instantiations.
 | |
|   // We only need an alias here, but instantiate a variable to silence warnings
 | |
|   // for unused typedefs in some compilers.
 | |
|   ABSL_ATTRIBUTE_UNUSED absl::make_index_sequence<(1 << 16) - 1> seq;
 | |
|   // O(N) template instantiations.
 | |
|   CountAll(absl::make_index_sequence<(1 << 8) - 1>());
 | |
| }
 | |
| 
 | |
| template <typename F, typename Tup, size_t... Is>
 | |
| auto ApplyFromTupleImpl(F f, const Tup& tup, absl::index_sequence<Is...>)
 | |
|     -> decltype(f(std::get<Is>(tup)...)) {
 | |
|   return f(std::get<Is>(tup)...);
 | |
| }
 | |
| 
 | |
| template <typename Tup>
 | |
| using TupIdxSeq = absl::make_index_sequence<std::tuple_size<Tup>::value>;
 | |
| 
 | |
| template <typename F, typename Tup>
 | |
| auto ApplyFromTuple(F f, const Tup& tup)
 | |
|     -> decltype(ApplyFromTupleImpl(f, tup, TupIdxSeq<Tup>{})) {
 | |
|   return ApplyFromTupleImpl(f, tup, TupIdxSeq<Tup>{});
 | |
| }
 | |
| 
 | |
| template <typename T>
 | |
| std::string Fmt(const T& x) {
 | |
|   std::ostringstream os;
 | |
|   os << x;
 | |
|   return os.str();
 | |
| }
 | |
| 
 | |
| struct PoorStrCat {
 | |
|   template <typename... Args>
 | |
|   std::string operator()(const Args&... args) const {
 | |
|     std::string r;
 | |
|     for (const auto& e : {Fmt(args)...}) r += e;
 | |
|     return r;
 | |
|   }
 | |
| };
 | |
| 
 | |
| template <typename Tup, size_t... Is>
 | |
| std::vector<std::string> TupStringVecImpl(const Tup& tup,
 | |
|                                           absl::index_sequence<Is...>) {
 | |
|   return {Fmt(std::get<Is>(tup))...};
 | |
| }
 | |
| 
 | |
| template <typename... Ts>
 | |
| std::vector<std::string> TupStringVec(const std::tuple<Ts...>& tup) {
 | |
|   return TupStringVecImpl(tup, absl::index_sequence_for<Ts...>());
 | |
| }
 | |
| 
 | |
| TEST(MakeIndexSequenceTest, ApplyFromTupleExample) {
 | |
|   PoorStrCat f{};
 | |
|   EXPECT_EQ("12abc3.14", f(12, "abc", 3.14));
 | |
|   EXPECT_EQ("12abc3.14", ApplyFromTuple(f, std::make_tuple(12, "abc", 3.14)));
 | |
| }
 | |
| 
 | |
| TEST(IndexSequenceForTest, Basic) {
 | |
|   StaticAssertTypeEq<absl::index_sequence<>, absl::index_sequence_for<>>();
 | |
|   StaticAssertTypeEq<absl::index_sequence<0>, absl::index_sequence_for<int>>();
 | |
|   StaticAssertTypeEq<absl::index_sequence<0, 1, 2, 3>,
 | |
|                      absl::index_sequence_for<int, void, char, int>>();
 | |
| }
 | |
| 
 | |
| TEST(IndexSequenceForTest, Example) {
 | |
|   EXPECT_THAT(TupStringVec(std::make_tuple(12, "abc", 3.14)),
 | |
|               ElementsAre("12", "abc", "3.14"));
 | |
| }
 | |
| 
 | |
| int Function(int a, int b) { return a - b; }
 | |
| 
 | |
| int Sink(std::unique_ptr<int> p) { return *p; }
 | |
| 
 | |
| std::unique_ptr<int> Factory(int n) { return absl::make_unique<int>(n); }
 | |
| 
 | |
| void NoOp() {}
 | |
| 
 | |
| struct ConstFunctor {
 | |
|   int operator()(int a, int b) const { return a - b; }
 | |
| };
 | |
| 
 | |
| struct MutableFunctor {
 | |
|   int operator()(int a, int b) { return a - b; }
 | |
| };
 | |
| 
 | |
| struct EphemeralFunctor {
 | |
|   EphemeralFunctor() {}
 | |
|   EphemeralFunctor(const EphemeralFunctor&) {}
 | |
|   EphemeralFunctor(EphemeralFunctor&&) {}
 | |
|   int operator()(int a, int b) && { return a - b; }
 | |
| };
 | |
| 
 | |
| struct OverloadedFunctor {
 | |
|   OverloadedFunctor() {}
 | |
|   OverloadedFunctor(const OverloadedFunctor&) {}
 | |
|   OverloadedFunctor(OverloadedFunctor&&) {}
 | |
|   template <typename... Args>
 | |
|   std::string operator()(const Args&... args) & {
 | |
|     return absl::StrCat("&", args...);
 | |
|   }
 | |
|   template <typename... Args>
 | |
|   std::string operator()(const Args&... args) const& {
 | |
|     return absl::StrCat("const&", args...);
 | |
|   }
 | |
|   template <typename... Args>
 | |
|   std::string operator()(const Args&... args) && {
 | |
|     return absl::StrCat("&&", args...);
 | |
|   }
 | |
| };
 | |
| 
 | |
| struct Class {
 | |
|   int Method(int a, int b) { return a - b; }
 | |
|   int ConstMethod(int a, int b) const { return a - b; }
 | |
| 
 | |
|   int member;
 | |
| };
 | |
| 
 | |
| struct FlipFlop {
 | |
|   int ConstMethod() const { return member; }
 | |
|   FlipFlop operator*() const { return {-member}; }
 | |
| 
 | |
|   int member;
 | |
| };
 | |
| 
 | |
| TEST(ApplyTest, Function) {
 | |
|   EXPECT_EQ(1, absl::apply(Function, std::make_tuple(3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(&Function, std::make_tuple(3, 2)));
 | |
| }
 | |
| 
 | |
| TEST(ApplyTest, NonCopyableArgument) {
 | |
|   EXPECT_EQ(42, absl::apply(Sink, std::make_tuple(absl::make_unique<int>(42))));
 | |
| }
 | |
| 
 | |
| TEST(ApplyTest, NonCopyableResult) {
 | |
|   EXPECT_THAT(absl::apply(Factory, std::make_tuple(42)),
 | |
|               ::testing::Pointee(42));
 | |
| }
 | |
| 
 | |
| TEST(ApplyTest, VoidResult) { absl::apply(NoOp, std::tuple<>()); }
 | |
| 
 | |
| TEST(ApplyTest, ConstFunctor) {
 | |
|   EXPECT_EQ(1, absl::apply(ConstFunctor(), std::make_tuple(3, 2)));
 | |
| }
 | |
| 
 | |
| TEST(ApplyTest, MutableFunctor) {
 | |
|   MutableFunctor f;
 | |
|   EXPECT_EQ(1, absl::apply(f, std::make_tuple(3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(MutableFunctor(), std::make_tuple(3, 2)));
 | |
| }
 | |
| TEST(ApplyTest, EphemeralFunctor) {
 | |
|   EphemeralFunctor f;
 | |
|   EXPECT_EQ(1, absl::apply(std::move(f), std::make_tuple(3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(EphemeralFunctor(), std::make_tuple(3, 2)));
 | |
| }
 | |
| TEST(ApplyTest, OverloadedFunctor) {
 | |
|   OverloadedFunctor f;
 | |
|   const OverloadedFunctor& cf = f;
 | |
| 
 | |
|   EXPECT_EQ("&", absl::apply(f, std::tuple<>{}));
 | |
|   EXPECT_EQ("& 42", absl::apply(f, std::make_tuple(" 42")));
 | |
| 
 | |
|   EXPECT_EQ("const&", absl::apply(cf, std::tuple<>{}));
 | |
|   EXPECT_EQ("const& 42", absl::apply(cf, std::make_tuple(" 42")));
 | |
| 
 | |
|   EXPECT_EQ("&&", absl::apply(std::move(f), std::tuple<>{}));
 | |
|   OverloadedFunctor f2;
 | |
|   EXPECT_EQ("&& 42", absl::apply(std::move(f2), std::make_tuple(" 42")));
 | |
| }
 | |
| 
 | |
| TEST(ApplyTest, ReferenceWrapper) {
 | |
|   ConstFunctor cf;
 | |
|   MutableFunctor mf;
 | |
|   EXPECT_EQ(1, absl::apply(std::cref(cf), std::make_tuple(3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(std::ref(cf), std::make_tuple(3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(std::ref(mf), std::make_tuple(3, 2)));
 | |
| }
 | |
| 
 | |
| TEST(ApplyTest, MemberFunction) {
 | |
|   std::unique_ptr<Class> p(new Class);
 | |
|   std::unique_ptr<const Class> cp(new Class);
 | |
|   EXPECT_EQ(
 | |
|       1, absl::apply(&Class::Method,
 | |
|                      std::tuple<std::unique_ptr<Class>&, int, int>(p, 3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(&Class::Method,
 | |
|                            std::tuple<Class*, int, int>(p.get(), 3, 2)));
 | |
|   EXPECT_EQ(
 | |
|       1, absl::apply(&Class::Method, std::tuple<Class&, int, int>(*p, 3, 2)));
 | |
| 
 | |
|   EXPECT_EQ(
 | |
|       1, absl::apply(&Class::ConstMethod,
 | |
|                      std::tuple<std::unique_ptr<Class>&, int, int>(p, 3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(&Class::ConstMethod,
 | |
|                            std::tuple<Class*, int, int>(p.get(), 3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(&Class::ConstMethod,
 | |
|                            std::tuple<Class&, int, int>(*p, 3, 2)));
 | |
| 
 | |
|   EXPECT_EQ(1, absl::apply(&Class::ConstMethod,
 | |
|                            std::tuple<std::unique_ptr<const Class>&, int, int>(
 | |
|                                cp, 3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(&Class::ConstMethod,
 | |
|                            std::tuple<const Class*, int, int>(cp.get(), 3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(&Class::ConstMethod,
 | |
|                            std::tuple<const Class&, int, int>(*cp, 3, 2)));
 | |
| 
 | |
|   EXPECT_EQ(1, absl::apply(&Class::Method,
 | |
|                            std::make_tuple(absl::make_unique<Class>(), 3, 2)));
 | |
|   EXPECT_EQ(1, absl::apply(&Class::ConstMethod,
 | |
|                            std::make_tuple(absl::make_unique<Class>(), 3, 2)));
 | |
|   EXPECT_EQ(
 | |
|       1, absl::apply(&Class::ConstMethod,
 | |
|                      std::make_tuple(absl::make_unique<const Class>(), 3, 2)));
 | |
| }
 | |
| 
 | |
| TEST(ApplyTest, DataMember) {
 | |
|   std::unique_ptr<Class> p(new Class{42});
 | |
|   std::unique_ptr<const Class> cp(new Class{42});
 | |
|   EXPECT_EQ(
 | |
|       42, absl::apply(&Class::member, std::tuple<std::unique_ptr<Class>&>(p)));
 | |
|   EXPECT_EQ(42, absl::apply(&Class::member, std::tuple<Class&>(*p)));
 | |
|   EXPECT_EQ(42, absl::apply(&Class::member, std::tuple<Class*>(p.get())));
 | |
| 
 | |
|   absl::apply(&Class::member, std::tuple<std::unique_ptr<Class>&>(p)) = 42;
 | |
|   absl::apply(&Class::member, std::tuple<Class*>(p.get())) = 42;
 | |
|   absl::apply(&Class::member, std::tuple<Class&>(*p)) = 42;
 | |
| 
 | |
|   EXPECT_EQ(42, absl::apply(&Class::member,
 | |
|                             std::tuple<std::unique_ptr<const Class>&>(cp)));
 | |
|   EXPECT_EQ(42, absl::apply(&Class::member, std::tuple<const Class&>(*cp)));
 | |
|   EXPECT_EQ(42,
 | |
|             absl::apply(&Class::member, std::tuple<const Class*>(cp.get())));
 | |
| }
 | |
| 
 | |
| TEST(ApplyTest, FlipFlop) {
 | |
|   FlipFlop obj = {42};
 | |
|   // This call could resolve to (obj.*&FlipFlop::ConstMethod)() or
 | |
|   // ((*obj).*&FlipFlop::ConstMethod)(). We verify that it's the former.
 | |
|   EXPECT_EQ(42, absl::apply(&FlipFlop::ConstMethod, std::make_tuple(obj)));
 | |
|   EXPECT_EQ(42, absl::apply(&FlipFlop::member, std::make_tuple(obj)));
 | |
| }
 | |
| 
 | |
| TEST(ExchangeTest, MoveOnly) {
 | |
|   auto a = Factory(1);
 | |
|   EXPECT_EQ(1, *a);
 | |
|   auto b = absl::exchange(a, Factory(2));
 | |
|   EXPECT_EQ(2, *a);
 | |
|   EXPECT_EQ(1, *b);
 | |
| }
 | |
| 
 | |
| TEST(MakeFromTupleTest, String) {
 | |
|   EXPECT_EQ(
 | |
|       absl::make_from_tuple<std::string>(std::make_tuple("hello world", 5)),
 | |
|       "hello");
 | |
| }
 | |
| 
 | |
| TEST(MakeFromTupleTest, MoveOnlyParameter) {
 | |
|   struct S {
 | |
|     S(std::unique_ptr<int> n, std::unique_ptr<int> m) : value(*n + *m) {}
 | |
|     int value = 0;
 | |
|   };
 | |
|   auto tup =
 | |
|       std::make_tuple(absl::make_unique<int>(3), absl::make_unique<int>(4));
 | |
|   auto s = absl::make_from_tuple<S>(std::move(tup));
 | |
|   EXPECT_EQ(s.value, 7);
 | |
| }
 | |
| 
 | |
| TEST(MakeFromTupleTest, NoParameters) {
 | |
|   struct S {
 | |
|     S() : value(1) {}
 | |
|     int value = 2;
 | |
|   };
 | |
|   EXPECT_EQ(absl::make_from_tuple<S>(std::make_tuple()).value, 1);
 | |
| }
 | |
| 
 | |
| TEST(MakeFromTupleTest, Pair) {
 | |
|   EXPECT_EQ(
 | |
|       (absl::make_from_tuple<std::pair<bool, int>>(std::make_tuple(true, 17))),
 | |
|       std::make_pair(true, 17));
 | |
| }
 | |
| 
 | |
| }  // namespace
 | |
| 
 |