-- 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
		
			
				
	
	
		
			348 lines
		
	
	
	
		
			11 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			348 lines
		
	
	
	
		
			11 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.
 | |
| //
 | |
| // This header file contains C++11 versions of standard <utility> header
 | |
| // abstractions available within C++14 and C++17, and are designed to be drop-in
 | |
| // replacement for code compliant with C++14 and C++17.
 | |
| //
 | |
| // The following abstractions are defined:
 | |
| //
 | |
| //   * integer_sequence<T, Ints...>  == std::integer_sequence<T, Ints...>
 | |
| //   * index_sequence<Ints...>       == std::index_sequence<Ints...>
 | |
| //   * make_integer_sequence<T, N>   == std::make_integer_sequence<T, N>
 | |
| //   * make_index_sequence<N>        == std::make_index_sequence<N>
 | |
| //   * index_sequence_for<Ts...>     == std::index_sequence_for<Ts...>
 | |
| //   * apply<Functor, Tuple>         == std::apply<Functor, Tuple>
 | |
| //   * exchange<T>                   == std::exchange<T>
 | |
| //   * make_from_tuple<T>            == std::make_from_tuple<T>
 | |
| //
 | |
| // This header file also provides the tag types `in_place_t`, `in_place_type_t`,
 | |
| // and `in_place_index_t`, as well as the constant `in_place`, and
 | |
| // `constexpr` `std::move()` and `std::forward()` implementations in C++11.
 | |
| //
 | |
| // References:
 | |
| //
 | |
| //  https://en.cppreference.com/w/cpp/utility/integer_sequence
 | |
| //  https://en.cppreference.com/w/cpp/utility/apply
 | |
| //  http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2013/n3658.html
 | |
| 
 | |
| #ifndef ABSL_UTILITY_UTILITY_H_
 | |
| #define ABSL_UTILITY_UTILITY_H_
 | |
| 
 | |
| #include <cstddef>
 | |
| #include <cstdlib>
 | |
| #include <tuple>
 | |
| #include <utility>
 | |
| 
 | |
| #include "absl/base/config.h"
 | |
| #include "absl/base/internal/inline_variable.h"
 | |
| #include "absl/base/internal/invoke.h"
 | |
| #include "absl/meta/type_traits.h"
 | |
| 
 | |
| namespace absl {
 | |
| 
 | |
| // integer_sequence
 | |
| //
 | |
| // Class template representing a compile-time integer sequence. An instantiation
 | |
| // of `integer_sequence<T, Ints...>` has a sequence of integers encoded in its
 | |
| // type through its template arguments (which is a common need when
 | |
| // working with C++11 variadic templates). `absl::integer_sequence` is designed
 | |
| // to be a drop-in replacement for C++14's `std::integer_sequence`.
 | |
| //
 | |
| // Example:
 | |
| //
 | |
| //   template< class T, T... Ints >
 | |
| //   void user_function(integer_sequence<T, Ints...>);
 | |
| //
 | |
| //   int main()
 | |
| //   {
 | |
| //     // user_function's `T` will be deduced to `int` and `Ints...`
 | |
| //     // will be deduced to `0, 1, 2, 3, 4`.
 | |
| //     user_function(make_integer_sequence<int, 5>());
 | |
| //   }
 | |
| template <typename T, T... Ints>
 | |
| struct integer_sequence {
 | |
|   using value_type = T;
 | |
|   static constexpr size_t size() noexcept { return sizeof...(Ints); }
 | |
| };
 | |
| 
 | |
| // index_sequence
 | |
| //
 | |
| // A helper template for an `integer_sequence` of `size_t`,
 | |
| // `absl::index_sequence` is designed to be a drop-in replacement for C++14's
 | |
| // `std::index_sequence`.
 | |
| template <size_t... Ints>
 | |
| using index_sequence = integer_sequence<size_t, Ints...>;
 | |
| 
 | |
| namespace utility_internal {
 | |
| 
 | |
| template <typename Seq, size_t SeqSize, size_t Rem>
 | |
| struct Extend;
 | |
| 
 | |
| // Note that SeqSize == sizeof...(Ints). It's passed explicitly for efficiency.
 | |
| template <typename T, T... Ints, size_t SeqSize>
 | |
| struct Extend<integer_sequence<T, Ints...>, SeqSize, 0> {
 | |
|   using type = integer_sequence<T, Ints..., (Ints + SeqSize)...>;
 | |
| };
 | |
| 
 | |
| template <typename T, T... Ints, size_t SeqSize>
 | |
| struct Extend<integer_sequence<T, Ints...>, SeqSize, 1> {
 | |
|   using type = integer_sequence<T, Ints..., (Ints + SeqSize)..., 2 * SeqSize>;
 | |
| };
 | |
| 
 | |
| // Recursion helper for 'make_integer_sequence<T, N>'.
 | |
| // 'Gen<T, N>::type' is an alias for 'integer_sequence<T, 0, 1, ... N-1>'.
 | |
| template <typename T, size_t N>
 | |
| struct Gen {
 | |
|   using type =
 | |
|       typename Extend<typename Gen<T, N / 2>::type, N / 2, N % 2>::type;
 | |
| };
 | |
| 
 | |
| template <typename T>
 | |
| struct Gen<T, 0> {
 | |
|   using type = integer_sequence<T>;
 | |
| };
 | |
| 
 | |
| template <typename T>
 | |
| struct InPlaceTypeTag {
 | |
|   explicit InPlaceTypeTag() = delete;
 | |
|   InPlaceTypeTag(const InPlaceTypeTag&) = delete;
 | |
|   InPlaceTypeTag& operator=(const InPlaceTypeTag&) = delete;
 | |
| };
 | |
| 
 | |
| template <size_t I>
 | |
| struct InPlaceIndexTag {
 | |
|   explicit InPlaceIndexTag() = delete;
 | |
|   InPlaceIndexTag(const InPlaceIndexTag&) = delete;
 | |
|   InPlaceIndexTag& operator=(const InPlaceIndexTag&) = delete;
 | |
| };
 | |
| 
 | |
| }  // namespace utility_internal
 | |
| 
 | |
| // Compile-time sequences of integers
 | |
| 
 | |
| // make_integer_sequence
 | |
| //
 | |
| // This template alias is equivalent to
 | |
| // `integer_sequence<int, 0, 1, ..., N-1>`, and is designed to be a drop-in
 | |
| // replacement for C++14's `std::make_integer_sequence`.
 | |
| template <typename T, T N>
 | |
| using make_integer_sequence = typename utility_internal::Gen<T, N>::type;
 | |
| 
 | |
| // make_index_sequence
 | |
| //
 | |
| // This template alias is equivalent to `index_sequence<0, 1, ..., N-1>`,
 | |
| // and is designed to be a drop-in replacement for C++14's
 | |
| // `std::make_index_sequence`.
 | |
| template <size_t N>
 | |
| using make_index_sequence = make_integer_sequence<size_t, N>;
 | |
| 
 | |
| // index_sequence_for
 | |
| //
 | |
| // Converts a typename pack into an index sequence of the same length, and
 | |
| // is designed to be a drop-in replacement for C++14's
 | |
| // `std::index_sequence_for()`
 | |
| template <typename... Ts>
 | |
| using index_sequence_for = make_index_sequence<sizeof...(Ts)>;
 | |
| 
 | |
| // Tag types
 | |
| 
 | |
| #ifdef ABSL_HAVE_STD_OPTIONAL
 | |
| 
 | |
| using std::in_place_t;
 | |
| using std::in_place;
 | |
| 
 | |
| #else  // ABSL_HAVE_STD_OPTIONAL
 | |
| 
 | |
| // in_place_t
 | |
| //
 | |
| // Tag type used to specify in-place construction, such as with
 | |
| // `absl::optional`, designed to be a drop-in replacement for C++17's
 | |
| // `std::in_place_t`.
 | |
| struct in_place_t {};
 | |
| 
 | |
| ABSL_INTERNAL_INLINE_CONSTEXPR(in_place_t, in_place, {});
 | |
| 
 | |
| #endif  // ABSL_HAVE_STD_OPTIONAL
 | |
| 
 | |
| #if defined(ABSL_HAVE_STD_ANY) || defined(ABSL_HAVE_STD_VARIANT)
 | |
| using std::in_place_type;
 | |
| using std::in_place_type_t;
 | |
| #else
 | |
| 
 | |
| // in_place_type_t
 | |
| //
 | |
| // Tag type used for in-place construction when the type to construct needs to
 | |
| // be specified, such as with `absl::any`, designed to be a drop-in replacement
 | |
| // for C++17's `std::in_place_type_t`.
 | |
| template <typename T>
 | |
| using in_place_type_t = void (*)(utility_internal::InPlaceTypeTag<T>);
 | |
| 
 | |
| template <typename T>
 | |
| void in_place_type(utility_internal::InPlaceTypeTag<T>) {}
 | |
| #endif  // ABSL_HAVE_STD_ANY || ABSL_HAVE_STD_VARIANT
 | |
| 
 | |
| #ifdef ABSL_HAVE_STD_VARIANT
 | |
| using std::in_place_index;
 | |
| using std::in_place_index_t;
 | |
| #else
 | |
| 
 | |
| // in_place_index_t
 | |
| //
 | |
| // Tag type used for in-place construction when the type to construct needs to
 | |
| // be specified, such as with `absl::any`, designed to be a drop-in replacement
 | |
| // for C++17's `std::in_place_index_t`.
 | |
| template <size_t I>
 | |
| using in_place_index_t = void (*)(utility_internal::InPlaceIndexTag<I>);
 | |
| 
 | |
| template <size_t I>
 | |
| void in_place_index(utility_internal::InPlaceIndexTag<I>) {}
 | |
| #endif  // ABSL_HAVE_STD_VARIANT
 | |
| 
 | |
| // Constexpr move and forward
 | |
| 
 | |
| // move()
 | |
| //
 | |
| // A constexpr version of `std::move()`, designed to be a drop-in replacement
 | |
| // for C++14's `std::move()`.
 | |
| template <typename T>
 | |
| constexpr absl::remove_reference_t<T>&& move(T&& t) noexcept {
 | |
|   return static_cast<absl::remove_reference_t<T>&&>(t);
 | |
| }
 | |
| 
 | |
| // forward()
 | |
| //
 | |
| // A constexpr version of `std::forward()`, designed to be a drop-in replacement
 | |
| // for C++14's `std::forward()`.
 | |
| template <typename T>
 | |
| constexpr T&& forward(
 | |
|     absl::remove_reference_t<T>& t) noexcept {  // NOLINT(runtime/references)
 | |
|   return static_cast<T&&>(t);
 | |
| }
 | |
| 
 | |
| namespace utility_internal {
 | |
| // Helper method for expanding tuple into a called method.
 | |
| template <typename Functor, typename Tuple, std::size_t... Indexes>
 | |
| auto apply_helper(Functor&& functor, Tuple&& t, index_sequence<Indexes...>)
 | |
|     -> decltype(absl::base_internal::Invoke(
 | |
|         absl::forward<Functor>(functor),
 | |
|         std::get<Indexes>(absl::forward<Tuple>(t))...)) {
 | |
|   return absl::base_internal::Invoke(
 | |
|       absl::forward<Functor>(functor),
 | |
|       std::get<Indexes>(absl::forward<Tuple>(t))...);
 | |
| }
 | |
| 
 | |
| }  // namespace utility_internal
 | |
| 
 | |
| // apply
 | |
| //
 | |
| // Invokes a Callable using elements of a tuple as its arguments.
 | |
| // Each element of the tuple corresponds to an argument of the call (in order).
 | |
| // Both the Callable argument and the tuple argument are perfect-forwarded.
 | |
| // For member-function Callables, the first tuple element acts as the `this`
 | |
| // pointer. `absl::apply` is designed to be a drop-in replacement for C++17's
 | |
| // `std::apply`. Unlike C++17's `std::apply`, this is not currently `constexpr`.
 | |
| //
 | |
| // Example:
 | |
| //
 | |
| //   class Foo {
 | |
| //    public:
 | |
| //     void Bar(int);
 | |
| //   };
 | |
| //   void user_function1(int, std::string);
 | |
| //   void user_function2(std::unique_ptr<Foo>);
 | |
| //   auto user_lambda = [](int, int) {};
 | |
| //
 | |
| //   int main()
 | |
| //   {
 | |
| //       std::tuple<int, std::string> tuple1(42, "bar");
 | |
| //       // Invokes the first user function on int, std::string.
 | |
| //       absl::apply(&user_function1, tuple1);
 | |
| //
 | |
| //       std::tuple<std::unique_ptr<Foo>> tuple2(absl::make_unique<Foo>());
 | |
| //       // Invokes the user function that takes ownership of the unique
 | |
| //       // pointer.
 | |
| //       absl::apply(&user_function2, std::move(tuple2));
 | |
| //
 | |
| //       auto foo = absl::make_unique<Foo>();
 | |
| //       std::tuple<Foo*, int> tuple3(foo.get(), 42);
 | |
| //       // Invokes the method Bar on foo with one argument, 42.
 | |
| //       absl::apply(&Foo::Bar, tuple3);
 | |
| //
 | |
| //       std::tuple<int, int> tuple4(8, 9);
 | |
| //       // Invokes a lambda.
 | |
| //       absl::apply(user_lambda, tuple4);
 | |
| //   }
 | |
| template <typename Functor, typename Tuple>
 | |
| auto apply(Functor&& functor, Tuple&& t)
 | |
|     -> decltype(utility_internal::apply_helper(
 | |
|         absl::forward<Functor>(functor), absl::forward<Tuple>(t),
 | |
|         absl::make_index_sequence<std::tuple_size<
 | |
|             typename std::remove_reference<Tuple>::type>::value>{})) {
 | |
|   return utility_internal::apply_helper(
 | |
|       absl::forward<Functor>(functor), absl::forward<Tuple>(t),
 | |
|       absl::make_index_sequence<std::tuple_size<
 | |
|           typename std::remove_reference<Tuple>::type>::value>{});
 | |
| }
 | |
| 
 | |
| // exchange
 | |
| //
 | |
| // Replaces the value of `obj` with `new_value` and returns the old value of
 | |
| // `obj`.  `absl::exchange` is designed to be a drop-in replacement for C++14's
 | |
| // `std::exchange`.
 | |
| //
 | |
| // Example:
 | |
| //
 | |
| //   Foo& operator=(Foo&& other) {
 | |
| //     ptr1_ = absl::exchange(other.ptr1_, nullptr);
 | |
| //     int1_ = absl::exchange(other.int1_, -1);
 | |
| //     return *this;
 | |
| //   }
 | |
| template <typename T, typename U = T>
 | |
| T exchange(T& obj, U&& new_value) {
 | |
|   T old_value = absl::move(obj);
 | |
|   obj = absl::forward<U>(new_value);
 | |
|   return old_value;
 | |
| }
 | |
| 
 | |
| namespace utility_internal {
 | |
| template <typename T, typename Tuple, size_t... I>
 | |
| T make_from_tuple_impl(Tuple&& tup, absl::index_sequence<I...>) {
 | |
|   return T(std::get<I>(std::forward<Tuple>(tup))...);
 | |
| }
 | |
| }  // namespace utility_internal
 | |
| 
 | |
| // make_from_tuple
 | |
| //
 | |
| // Given the template parameter type `T` and a tuple of arguments
 | |
| // `std::tuple(arg0, arg1, ..., argN)` constructs an object of type `T` as if by
 | |
| // calling `T(arg0, arg1, ..., argN)`.
 | |
| //
 | |
| // Example:
 | |
| //
 | |
| //   std::tuple<const char*, size_t> args("hello world", 5);
 | |
| //   auto s = absl::make_from_tuple<std::string>(args);
 | |
| //   assert(s == "hello");
 | |
| //
 | |
| template <typename T, typename Tuple>
 | |
| constexpr T make_from_tuple(Tuple&& tup) {
 | |
|   return utility_internal::make_from_tuple_impl<T>(
 | |
|       std::forward<Tuple>(tup),
 | |
|       absl::make_index_sequence<
 | |
|           std::tuple_size<absl::decay_t<Tuple>>::value>{});
 | |
| }
 | |
| 
 | |
| }  // namespace absl
 | |
| 
 | |
| #endif  // ABSL_UTILITY_UTILITY_H_
 |