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
229 lines
8 KiB
C++
229 lines
8 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.
|
|
//
|
|
// Helper class to perform the Empty Base Optimization.
|
|
// Ts can contain classes and non-classes, empty or not. For the ones that
|
|
// are empty classes, we perform the optimization. If all types in Ts are empty
|
|
// classes, then CompressedTuple<Ts...> is itself an empty class.
|
|
//
|
|
// To access the members, use member get<N>() function.
|
|
//
|
|
// Eg:
|
|
// absl::container_internal::CompressedTuple<int, T1, T2, T3> value(7, t1, t2,
|
|
// t3);
|
|
// assert(value.get<0>() == 7);
|
|
// T1& t1 = value.get<1>();
|
|
// const T2& t2 = value.get<2>();
|
|
// ...
|
|
//
|
|
// https://en.cppreference.com/w/cpp/language/ebo
|
|
|
|
#ifndef ABSL_CONTAINER_INTERNAL_COMPRESSED_TUPLE_H_
|
|
#define ABSL_CONTAINER_INTERNAL_COMPRESSED_TUPLE_H_
|
|
|
|
#include <initializer_list>
|
|
#include <tuple>
|
|
#include <type_traits>
|
|
#include <utility>
|
|
|
|
#include "absl/utility/utility.h"
|
|
|
|
#if defined(_MSC_VER) && !defined(__NVCC__)
|
|
// We need to mark these classes with this declspec to ensure that
|
|
// CompressedTuple happens.
|
|
#define ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC __declspec(empty_bases)
|
|
#else
|
|
#define ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC
|
|
#endif
|
|
|
|
namespace absl {
|
|
namespace container_internal {
|
|
|
|
template <typename... Ts>
|
|
class CompressedTuple;
|
|
|
|
namespace internal_compressed_tuple {
|
|
|
|
template <typename D, size_t I>
|
|
struct Elem;
|
|
template <typename... B, size_t I>
|
|
struct Elem<CompressedTuple<B...>, I>
|
|
: std::tuple_element<I, std::tuple<B...>> {};
|
|
template <typename D, size_t I>
|
|
using ElemT = typename Elem<D, I>::type;
|
|
|
|
// Use the __is_final intrinsic if available. Where it's not available, classes
|
|
// declared with the 'final' specifier cannot be used as CompressedTuple
|
|
// elements.
|
|
// TODO(sbenza): Replace this with std::is_final in C++14.
|
|
template <typename T>
|
|
constexpr bool IsFinal() {
|
|
#if defined(__clang__) || defined(__GNUC__)
|
|
return __is_final(T);
|
|
#else
|
|
return false;
|
|
#endif
|
|
}
|
|
|
|
// We can't use EBCO on other CompressedTuples because that would mean that we
|
|
// derive from multiple Storage<> instantiations with the same I parameter,
|
|
// and potentially from multiple identical Storage<> instantiations. So anytime
|
|
// we use type inheritance rather than encapsulation, we mark
|
|
// CompressedTupleImpl, to make this easy to detect.
|
|
struct uses_inheritance {};
|
|
|
|
template <typename T>
|
|
constexpr bool ShouldUseBase() {
|
|
return std::is_class<T>::value && std::is_empty<T>::value && !IsFinal<T>() &&
|
|
!std::is_base_of<uses_inheritance, T>::value;
|
|
}
|
|
|
|
// The storage class provides two specializations:
|
|
// - For empty classes, it stores T as a base class.
|
|
// - For everything else, it stores T as a member.
|
|
template <typename T, size_t I,
|
|
#if defined(_MSC_VER)
|
|
bool UseBase =
|
|
ShouldUseBase<typename std::enable_if<true, T>::type>()>
|
|
#else
|
|
bool UseBase = ShouldUseBase<T>()>
|
|
#endif
|
|
struct Storage {
|
|
T value;
|
|
constexpr Storage() = default;
|
|
explicit constexpr Storage(T&& v) : value(absl::forward<T>(v)) {}
|
|
constexpr const T& get() const& { return value; }
|
|
T& get() & { return value; }
|
|
constexpr const T&& get() const&& { return absl::move(*this).value; }
|
|
T&& get() && { return std::move(*this).value; }
|
|
};
|
|
|
|
template <typename T, size_t I>
|
|
struct ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC Storage<T, I, true> : T {
|
|
constexpr Storage() = default;
|
|
explicit constexpr Storage(T&& v) : T(absl::forward<T>(v)) {}
|
|
constexpr const T& get() const& { return *this; }
|
|
T& get() & { return *this; }
|
|
constexpr const T&& get() const&& { return absl::move(*this); }
|
|
T&& get() && { return std::move(*this); }
|
|
};
|
|
|
|
template <typename D, typename I, bool ShouldAnyUseBase>
|
|
struct ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC CompressedTupleImpl;
|
|
|
|
template <typename... Ts, size_t... I, bool ShouldAnyUseBase>
|
|
struct ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC CompressedTupleImpl<
|
|
CompressedTuple<Ts...>, absl::index_sequence<I...>, ShouldAnyUseBase>
|
|
// We use the dummy identity function through std::integral_constant to
|
|
// convince MSVC of accepting and expanding I in that context. Without it
|
|
// you would get:
|
|
// error C3548: 'I': parameter pack cannot be used in this context
|
|
: uses_inheritance,
|
|
Storage<Ts, std::integral_constant<size_t, I>::value>... {
|
|
constexpr CompressedTupleImpl() = default;
|
|
explicit constexpr CompressedTupleImpl(Ts&&... args)
|
|
: Storage<Ts, I>(absl::forward<Ts>(args))... {}
|
|
friend CompressedTuple<Ts...>;
|
|
};
|
|
|
|
template <typename... Ts, size_t... I>
|
|
struct ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC CompressedTupleImpl<
|
|
CompressedTuple<Ts...>, absl::index_sequence<I...>, false>
|
|
// We use the dummy identity function as above...
|
|
: Storage<Ts, std::integral_constant<size_t, I>::value, false>... {
|
|
constexpr CompressedTupleImpl() = default;
|
|
explicit constexpr CompressedTupleImpl(Ts&&... args)
|
|
: Storage<Ts, I, false>(absl::forward<Ts>(args))... {}
|
|
friend CompressedTuple<Ts...>;
|
|
};
|
|
|
|
std::false_type Or(std::initializer_list<std::false_type>);
|
|
std::true_type Or(std::initializer_list<bool>);
|
|
|
|
// MSVC requires this to be done separately rather than within the declaration
|
|
// of CompressedTuple below.
|
|
template <typename... Ts>
|
|
constexpr bool ShouldAnyUseBase() {
|
|
return decltype(
|
|
Or({std::integral_constant<bool, ShouldUseBase<Ts>()>()...})){};
|
|
}
|
|
|
|
} // namespace internal_compressed_tuple
|
|
|
|
// Helper class to perform the Empty Base Class Optimization.
|
|
// Ts can contain classes and non-classes, empty or not. For the ones that
|
|
// are empty classes, we perform the CompressedTuple. If all types in Ts are
|
|
// empty classes, then CompressedTuple<Ts...> is itself an empty class. (This
|
|
// does not apply when one or more of those empty classes is itself an empty
|
|
// CompressedTuple.)
|
|
//
|
|
// To access the members, use member .get<N>() function.
|
|
//
|
|
// Eg:
|
|
// absl::container_internal::CompressedTuple<int, T1, T2, T3> value(7, t1, t2,
|
|
// t3);
|
|
// assert(value.get<0>() == 7);
|
|
// T1& t1 = value.get<1>();
|
|
// const T2& t2 = value.get<2>();
|
|
// ...
|
|
//
|
|
// https://en.cppreference.com/w/cpp/language/ebo
|
|
template <typename... Ts>
|
|
class ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC CompressedTuple
|
|
: private internal_compressed_tuple::CompressedTupleImpl<
|
|
CompressedTuple<Ts...>, absl::index_sequence_for<Ts...>,
|
|
internal_compressed_tuple::ShouldAnyUseBase<Ts...>()> {
|
|
private:
|
|
template <int I>
|
|
using ElemT = internal_compressed_tuple::ElemT<CompressedTuple, I>;
|
|
|
|
public:
|
|
constexpr CompressedTuple() = default;
|
|
explicit constexpr CompressedTuple(Ts... base)
|
|
: CompressedTuple::CompressedTupleImpl(absl::forward<Ts>(base)...) {}
|
|
|
|
template <int I>
|
|
ElemT<I>& get() & {
|
|
return internal_compressed_tuple::Storage<ElemT<I>, I>::get();
|
|
}
|
|
|
|
template <int I>
|
|
constexpr const ElemT<I>& get() const& {
|
|
return internal_compressed_tuple::Storage<ElemT<I>, I>::get();
|
|
}
|
|
|
|
template <int I>
|
|
ElemT<I>&& get() && {
|
|
return std::move(*this)
|
|
.internal_compressed_tuple::template Storage<ElemT<I>, I>::get();
|
|
}
|
|
|
|
template <int I>
|
|
constexpr const ElemT<I>&& get() const&& {
|
|
return absl::move(*this)
|
|
.internal_compressed_tuple::template Storage<ElemT<I>, I>::get();
|
|
}
|
|
};
|
|
|
|
// Explicit specialization for a zero-element tuple
|
|
// (needed to avoid ambiguous overloads for the default constructor).
|
|
template <>
|
|
class ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC CompressedTuple<> {};
|
|
|
|
} // namespace container_internal
|
|
} // namespace absl
|
|
|
|
#undef ABSL_INTERNAL_COMPRESSED_TUPLE_DECLSPEC
|
|
|
|
#endif // ABSL_CONTAINER_INTERNAL_COMPRESSED_TUPLE_H_
|