79e0dc1151
--
990253454819ce26ff1dda9ab4bbc145b61d01e4 by Xiaoyi Zhang <zhangxy@google.com>:
Import github PR https://github.com/abseil/abseil-cpp/pull/645
PiperOrigin-RevId: 303119797
--
5ac845cb7929b7d1eaf59a309afd811db5001175 by Abseil Team <absl-team@google.com>:
Fix internal exception spec compatibility error
PiperOrigin-RevId: 303104081
--
3290595dd866eecab3c7044e2e3ca0adb74f1bf5 by Gennadiy Rozental <rogeeff@google.com>:
Use FlagValue<T> to represent the value of a flag. Place it directly after
FlagImpl and use a computed offset refer to it.
The offset is computed based on the assumption that the `value_` data member
is placed directly after the impl_ data member in Flag<T>.
This change will allow us to migrate to `T`-specific storage in the generic case.
This change decreases the overhead for int flags by 32 bytes.
PiperOrigin-RevId: 303038099
--
f2b37722cd7a6d3a60ef9713f0d2bbff56f3ddbf by Derek Mauro <dmauro@google.com>:
Minor correctness fix for an ABSL_HAVE_BUILTIN conditional
PiperOrigin-RevId: 302980666
--
39c079a6141ae1c5728af8bf33a39c8aff9deb9f by Abseil Team <absl-team@google.com>:
Use ABSL_HARDENING_ASSERT in b-tree and SwissTable iterators.
PiperOrigin-RevId: 302970075
--
9668a044e080c789df32bcaa1ffb5100831cd9fa by Benjamin Barenblat <bbaren@google.com>:
Correct `add_subdirectory` line in CMake googletest support
Commit bcefbdcdf6
added support for building with CMake against a local googletest checkout, but I missed a line when constructing the diff. Change the `add_subdirectory` line to reference the correct directories.
PiperOrigin-RevId: 302947488
--
0a3c10fabf80a43ca69ab8b1570030e55f2be741 by Andy Soffer <asoffer@google.com>:
Remove unused distribution format traits.
PiperOrigin-RevId: 302896176
--
0478f2f6270e5ed64c0e28ec09556ca90b2d46a9 by Samuel Benzaquen <sbenza@google.com>:
Fix for CWG:2310.
PiperOrigin-RevId: 302734089
--
3cb978dda5cae5905affdc0914dcc2d27671ed11 by Samuel Benzaquen <sbenza@google.com>:
Fix the Allocate/Deallocate functions to use the same underlying allocator type.
PiperOrigin-RevId: 302721804
--
ae38d3984fb68b4e3ddc165fa8d5c24d5936be52 by Matthew Brown <matthewbr@google.com>:
Internal Change
PiperOrigin-RevId: 302717314
--
7357cf7abd03cc60b6e82b5f28a8e34935c3b4dc by Andy Getzendanner <durandal@google.com>:
Fix typo: s/ABSL_HARDENED_ASSERT/ABSL_HARDENING_ASSERT/
PiperOrigin-RevId: 302532164
GitOrigin-RevId: 990253454819ce26ff1dda9ab4bbc145b61d01e4
Change-Id: Ie595a221c16e1e7e1255ad42e029b646c5f3e11d
203 lines
5.3 KiB
C++
203 lines
5.3 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.
|
|
|
|
#ifndef ABSL_CONTAINER_INTERNAL_CONTAINER_H_
|
|
#define ABSL_CONTAINER_INTERNAL_CONTAINER_H_
|
|
|
|
#include <cassert>
|
|
#include <type_traits>
|
|
|
|
#include "absl/meta/type_traits.h"
|
|
#include "absl/types/optional.h"
|
|
|
|
namespace absl {
|
|
ABSL_NAMESPACE_BEGIN
|
|
namespace container_internal {
|
|
|
|
template <class, class = void>
|
|
struct IsTransparent : std::false_type {};
|
|
template <class T>
|
|
struct IsTransparent<T, absl::void_t<typename T::is_transparent>>
|
|
: std::true_type {};
|
|
|
|
template <bool is_transparent>
|
|
struct KeyArg {
|
|
// Transparent. Forward `K`.
|
|
template <typename K, typename key_type>
|
|
using type = K;
|
|
};
|
|
|
|
template <>
|
|
struct KeyArg<false> {
|
|
// Not transparent. Always use `key_type`.
|
|
template <typename K, typename key_type>
|
|
using type = key_type;
|
|
};
|
|
|
|
// The node_handle concept from C++17.
|
|
// We specialize node_handle for sets and maps. node_handle_base holds the
|
|
// common API of both.
|
|
template <typename PolicyTraits, typename Alloc>
|
|
class node_handle_base {
|
|
protected:
|
|
using slot_type = typename PolicyTraits::slot_type;
|
|
|
|
public:
|
|
using allocator_type = Alloc;
|
|
|
|
constexpr node_handle_base() = default;
|
|
node_handle_base(node_handle_base&& other) noexcept {
|
|
*this = std::move(other);
|
|
}
|
|
~node_handle_base() { destroy(); }
|
|
node_handle_base& operator=(node_handle_base&& other) noexcept {
|
|
destroy();
|
|
if (!other.empty()) {
|
|
alloc_ = other.alloc_;
|
|
PolicyTraits::transfer(alloc(), slot(), other.slot());
|
|
other.reset();
|
|
}
|
|
return *this;
|
|
}
|
|
|
|
bool empty() const noexcept { return !alloc_; }
|
|
explicit operator bool() const noexcept { return !empty(); }
|
|
allocator_type get_allocator() const { return *alloc_; }
|
|
|
|
protected:
|
|
friend struct CommonAccess;
|
|
|
|
struct transfer_tag_t {};
|
|
node_handle_base(transfer_tag_t, const allocator_type& a, slot_type* s)
|
|
: alloc_(a) {
|
|
PolicyTraits::transfer(alloc(), slot(), s);
|
|
}
|
|
|
|
struct move_tag_t {};
|
|
node_handle_base(move_tag_t, const allocator_type& a, slot_type* s)
|
|
: alloc_(a) {
|
|
PolicyTraits::construct(alloc(), slot(), s);
|
|
}
|
|
|
|
void destroy() {
|
|
if (!empty()) {
|
|
PolicyTraits::destroy(alloc(), slot());
|
|
reset();
|
|
}
|
|
}
|
|
|
|
void reset() {
|
|
assert(alloc_.has_value());
|
|
alloc_ = absl::nullopt;
|
|
}
|
|
|
|
slot_type* slot() const {
|
|
assert(!empty());
|
|
return reinterpret_cast<slot_type*>(std::addressof(slot_space_));
|
|
}
|
|
allocator_type* alloc() { return std::addressof(*alloc_); }
|
|
|
|
private:
|
|
absl::optional<allocator_type> alloc_ = {};
|
|
alignas(slot_type) mutable unsigned char slot_space_[sizeof(slot_type)] = {};
|
|
};
|
|
|
|
// For sets.
|
|
template <typename Policy, typename PolicyTraits, typename Alloc,
|
|
typename = void>
|
|
class node_handle : public node_handle_base<PolicyTraits, Alloc> {
|
|
using Base = node_handle_base<PolicyTraits, Alloc>;
|
|
|
|
public:
|
|
using value_type = typename PolicyTraits::value_type;
|
|
|
|
constexpr node_handle() {}
|
|
|
|
value_type& value() const { return PolicyTraits::element(this->slot()); }
|
|
|
|
private:
|
|
friend struct CommonAccess;
|
|
|
|
using Base::Base;
|
|
};
|
|
|
|
// For maps.
|
|
template <typename Policy, typename PolicyTraits, typename Alloc>
|
|
class node_handle<Policy, PolicyTraits, Alloc,
|
|
absl::void_t<typename Policy::mapped_type>>
|
|
: public node_handle_base<PolicyTraits, Alloc> {
|
|
using Base = node_handle_base<PolicyTraits, Alloc>;
|
|
using slot_type = typename PolicyTraits::slot_type;
|
|
|
|
public:
|
|
using key_type = typename Policy::key_type;
|
|
using mapped_type = typename Policy::mapped_type;
|
|
|
|
constexpr node_handle() {}
|
|
|
|
auto key() const -> decltype(PolicyTraits::key(std::declval<slot_type*>())) {
|
|
return PolicyTraits::key(this->slot());
|
|
}
|
|
|
|
mapped_type& mapped() const {
|
|
return PolicyTraits::value(&PolicyTraits::element(this->slot()));
|
|
}
|
|
|
|
private:
|
|
friend struct CommonAccess;
|
|
|
|
using Base::Base;
|
|
};
|
|
|
|
// Provide access to non-public node-handle functions.
|
|
struct CommonAccess {
|
|
template <typename Node>
|
|
static auto GetSlot(const Node& node) -> decltype(node.slot()) {
|
|
return node.slot();
|
|
}
|
|
|
|
template <typename Node>
|
|
static void Destroy(Node* node) {
|
|
node->destroy();
|
|
}
|
|
|
|
template <typename Node>
|
|
static void Reset(Node* node) {
|
|
node->reset();
|
|
}
|
|
|
|
template <typename T, typename... Args>
|
|
static T Transfer(Args&&... args) {
|
|
return T(typename T::transfer_tag_t{}, std::forward<Args>(args)...);
|
|
}
|
|
|
|
template <typename T, typename... Args>
|
|
static T Move(Args&&... args) {
|
|
return T(typename T::move_tag_t{}, std::forward<Args>(args)...);
|
|
}
|
|
};
|
|
|
|
// Implement the insert_return_type<> concept of C++17.
|
|
template <class Iterator, class NodeType>
|
|
struct InsertReturnType {
|
|
Iterator position;
|
|
bool inserted;
|
|
NodeType node;
|
|
};
|
|
|
|
} // namespace container_internal
|
|
ABSL_NAMESPACE_END
|
|
} // namespace absl
|
|
|
|
#endif // ABSL_CONTAINER_INTERNAL_CONTAINER_H_
|