e9324d926a
-- 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
210 lines
6.5 KiB
C++
210 lines
6.5 KiB
C++
// Copyright 2018 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/container/internal/compressed_tuple.h"
|
|
|
|
#include <memory>
|
|
#include <string>
|
|
|
|
#include "gmock/gmock.h"
|
|
#include "gtest/gtest.h"
|
|
#include "absl/memory/memory.h"
|
|
#include "absl/utility/utility.h"
|
|
|
|
// These are declared at global scope purely so that error messages
|
|
// are smaller and easier to understand.
|
|
enum class CallType { kConstRef, kConstMove };
|
|
|
|
template <int>
|
|
struct Empty {
|
|
constexpr CallType value() const& { return CallType::kConstRef; }
|
|
constexpr CallType value() const&& { return CallType::kConstMove; }
|
|
};
|
|
|
|
template <typename T>
|
|
struct NotEmpty {
|
|
T value;
|
|
};
|
|
|
|
template <typename T, typename U>
|
|
struct TwoValues {
|
|
T value1;
|
|
U value2;
|
|
};
|
|
|
|
namespace absl {
|
|
namespace container_internal {
|
|
namespace {
|
|
|
|
TEST(CompressedTupleTest, Sizeof) {
|
|
EXPECT_EQ(sizeof(int), sizeof(CompressedTuple<int>));
|
|
EXPECT_EQ(sizeof(int), sizeof(CompressedTuple<int, Empty<0>>));
|
|
EXPECT_EQ(sizeof(int), sizeof(CompressedTuple<int, Empty<0>, Empty<1>>));
|
|
EXPECT_EQ(sizeof(int),
|
|
sizeof(CompressedTuple<int, Empty<0>, Empty<1>, Empty<2>>));
|
|
|
|
EXPECT_EQ(sizeof(TwoValues<int, double>),
|
|
sizeof(CompressedTuple<int, NotEmpty<double>>));
|
|
EXPECT_EQ(sizeof(TwoValues<int, double>),
|
|
sizeof(CompressedTuple<int, Empty<0>, NotEmpty<double>>));
|
|
EXPECT_EQ(sizeof(TwoValues<int, double>),
|
|
sizeof(CompressedTuple<int, Empty<0>, NotEmpty<double>, Empty<1>>));
|
|
}
|
|
|
|
TEST(CompressedTupleTest, Access) {
|
|
struct S {
|
|
std::string x;
|
|
};
|
|
CompressedTuple<int, Empty<0>, S> x(7, {}, S{"ABC"});
|
|
EXPECT_EQ(sizeof(x), sizeof(TwoValues<int, S>));
|
|
EXPECT_EQ(7, x.get<0>());
|
|
EXPECT_EQ("ABC", x.get<2>().x);
|
|
}
|
|
|
|
TEST(CompressedTupleTest, NonClasses) {
|
|
CompressedTuple<int, const char*> x(7, "ABC");
|
|
EXPECT_EQ(7, x.get<0>());
|
|
EXPECT_STREQ("ABC", x.get<1>());
|
|
}
|
|
|
|
TEST(CompressedTupleTest, MixClassAndNonClass) {
|
|
CompressedTuple<int, const char*, Empty<0>, NotEmpty<double>> x(7, "ABC", {},
|
|
{1.25});
|
|
struct Mock {
|
|
int v;
|
|
const char* p;
|
|
double d;
|
|
};
|
|
EXPECT_EQ(sizeof(x), sizeof(Mock));
|
|
EXPECT_EQ(7, x.get<0>());
|
|
EXPECT_STREQ("ABC", x.get<1>());
|
|
EXPECT_EQ(1.25, x.get<3>().value);
|
|
}
|
|
|
|
TEST(CompressedTupleTest, Nested) {
|
|
CompressedTuple<int, CompressedTuple<int>,
|
|
CompressedTuple<int, CompressedTuple<int>>>
|
|
x(1, CompressedTuple<int>(2),
|
|
CompressedTuple<int, CompressedTuple<int>>(3, CompressedTuple<int>(4)));
|
|
EXPECT_EQ(1, x.get<0>());
|
|
EXPECT_EQ(2, x.get<1>().get<0>());
|
|
EXPECT_EQ(3, x.get<2>().get<0>());
|
|
EXPECT_EQ(4, x.get<2>().get<1>().get<0>());
|
|
|
|
CompressedTuple<Empty<0>, Empty<0>,
|
|
CompressedTuple<Empty<0>, CompressedTuple<Empty<0>>>>
|
|
y;
|
|
std::set<Empty<0>*> empties{&y.get<0>(), &y.get<1>(), &y.get<2>().get<0>(),
|
|
&y.get<2>().get<1>().get<0>()};
|
|
#ifdef _MSC_VER
|
|
// MSVC has a bug where many instances of the same base class are layed out in
|
|
// the same address when using __declspec(empty_bases).
|
|
// This will be fixed in a future version of MSVC.
|
|
int expected = 1;
|
|
#else
|
|
int expected = 4;
|
|
#endif
|
|
EXPECT_EQ(expected, sizeof(y));
|
|
EXPECT_EQ(expected, empties.size());
|
|
EXPECT_EQ(sizeof(y), sizeof(Empty<0>) * empties.size());
|
|
|
|
EXPECT_EQ(4 * sizeof(char),
|
|
sizeof(CompressedTuple<CompressedTuple<char, char>,
|
|
CompressedTuple<char, char>>));
|
|
EXPECT_TRUE((std::is_empty<CompressedTuple<Empty<0>, Empty<1>>>::value));
|
|
|
|
// Make sure everything still works when things are nested.
|
|
struct CT_Empty : CompressedTuple<Empty<0>> {};
|
|
CompressedTuple<Empty<0>, CT_Empty> nested_empty;
|
|
auto contained = nested_empty.get<0>();
|
|
auto nested = nested_empty.get<1>().get<0>();
|
|
EXPECT_TRUE((std::is_same<decltype(contained), decltype(nested)>::value));
|
|
}
|
|
|
|
TEST(CompressedTupleTest, Reference) {
|
|
int i = 7;
|
|
std::string s = "Very long std::string that goes in the heap";
|
|
CompressedTuple<int, int&, std::string, std::string&> x(i, i, s, s);
|
|
|
|
// Sanity check. We should have not moved from `s`
|
|
EXPECT_EQ(s, "Very long std::string that goes in the heap");
|
|
|
|
EXPECT_EQ(x.get<0>(), x.get<1>());
|
|
EXPECT_NE(&x.get<0>(), &x.get<1>());
|
|
EXPECT_EQ(&x.get<1>(), &i);
|
|
|
|
EXPECT_EQ(x.get<2>(), x.get<3>());
|
|
EXPECT_NE(&x.get<2>(), &x.get<3>());
|
|
EXPECT_EQ(&x.get<3>(), &s);
|
|
}
|
|
|
|
TEST(CompressedTupleTest, NoElements) {
|
|
CompressedTuple<> x;
|
|
static_cast<void>(x); // Silence -Wunused-variable.
|
|
EXPECT_TRUE(std::is_empty<CompressedTuple<>>::value);
|
|
}
|
|
|
|
TEST(CompressedTupleTest, MoveOnlyElements) {
|
|
CompressedTuple<std::unique_ptr<std::string>> str_tup(
|
|
absl::make_unique<std::string>("str"));
|
|
|
|
CompressedTuple<CompressedTuple<std::unique_ptr<std::string>>,
|
|
std::unique_ptr<int>>
|
|
x(std::move(str_tup), absl::make_unique<int>(5));
|
|
|
|
EXPECT_EQ(*x.get<0>().get<0>(), "str");
|
|
EXPECT_EQ(*x.get<1>(), 5);
|
|
|
|
std::unique_ptr<std::string> x0 = std::move(x.get<0>()).get<0>();
|
|
std::unique_ptr<int> x1 = std::move(x).get<1>();
|
|
|
|
EXPECT_EQ(*x0, "str");
|
|
EXPECT_EQ(*x1, 5);
|
|
}
|
|
|
|
TEST(CompressedTupleTest, Constexpr) {
|
|
constexpr CompressedTuple<int, double, CompressedTuple<int>, Empty<0>> x(
|
|
7, 1.25, CompressedTuple<int>(5), {});
|
|
constexpr int x0 = x.get<0>();
|
|
constexpr double x1 = x.get<1>();
|
|
constexpr int x2 = x.get<2>().get<0>();
|
|
constexpr CallType x3 = x.get<3>().value();
|
|
|
|
EXPECT_EQ(x0, 7);
|
|
EXPECT_EQ(x1, 1.25);
|
|
EXPECT_EQ(x2, 5);
|
|
EXPECT_EQ(x3, CallType::kConstRef);
|
|
|
|
#if defined(__clang__)
|
|
// An apparent bug in earlier versions of gcc claims these are ambiguous.
|
|
constexpr int x2m = absl::move(x.get<2>()).get<0>();
|
|
constexpr CallType x3m = absl::move(x).get<3>().value();
|
|
EXPECT_EQ(x2m, 5);
|
|
EXPECT_EQ(x3m, CallType::kConstMove);
|
|
#endif
|
|
}
|
|
|
|
#if defined(__clang__) || defined(__GNUC__)
|
|
TEST(CompressedTupleTest, EmptyFinalClass) {
|
|
struct S final {
|
|
int f() const { return 5; }
|
|
};
|
|
CompressedTuple<S> x;
|
|
EXPECT_EQ(x.get<0>().f(), 5);
|
|
}
|
|
#endif
|
|
|
|
} // namespace
|
|
} // namespace container_internal
|
|
} // namespace absl
|