d902eb869b
-- babbb6421068af3831870fd5995444437ace6769 by Derek Mauro <dmauro@google.com>: Rollback of: Make raw_hash_set_test less flaky. Split the timing loop into chunks so that we are less suceptible to antogantistic processes. PiperOrigin-RevId: 243854490 -- a2711f17a712f6d09799bf32363d67526737b486 by CJ Johnson <johnsoncj@google.com>: Relocates IsAtLeastForwardIterator to internal/inlined_vector.h PiperOrigin-RevId: 243846090 -- 6c14cdbeb9a61022c27f8957654f930d8abf2fc1 by Matt Kulukundis <kfm@google.com>: Make raw_hash_set_test less flaky. Split the timing loop into chunks so that we are less suceptible to antogantistic processes. PiperOrigin-RevId: 243824289 -- ee6072a6b6e0ac653622524ceb09db3b9e870f96 by Samuel Benzaquen <sbenza@google.com>: Improve format parser performance. Replace the main switch with a lookup in the existing tag table. Improve the ABI of ConsumeUnboundConversion a little. PiperOrigin-RevId: 243824112 -- 24b9e6476dfa4be8d644359eab8ac6816492f187 by Abseil Team <absl-team@google.com>: Fix DR numbers: 3800 ? 3080, 3801 ? 3081. PiperOrigin-RevId: 243804213 -- 0660404074707e197684f07cc0bffe4a9c35cd2f by Abseil Team <absl-team@google.com>: Internal change. PiperOrigin-RevId: 243757359 -- ba0f5bb9b8584d75c4ffc44ff3cb8c691796ffc6 by Xiaoyi Zhang <zhangxy@google.com>: Consolidate ABSL_INTERNAL_UNALIGNED_* implementation into memcpy. The compiler should be good enough to optimize these operations. See https://github.com/abseil/abseil-cpp/issues/269 for background. PiperOrigin-RevId: 243323941 -- 00853a8756548df7217513c562d604b4ee5c6ab9 by Eric Fiselier <ericwf@google.com>: Reexport memory.h from optional.h for compatibility between libc++ and libstdc++. PiperOrigin-RevId: 243313425 GitOrigin-RevId: babbb6421068af3831870fd5995444437ace6769 Change-Id: Ic53c127ad857a431ad60c98b27cc585fed50a3e3
146 lines
4.4 KiB
C++
146 lines
4.4 KiB
C++
// Copyright 2019 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_INLINED_VECTOR_INTERNAL_H_
|
|
#define ABSL_CONTAINER_INTERNAL_INLINED_VECTOR_INTERNAL_H_
|
|
|
|
#include <cstddef>
|
|
#include <iterator>
|
|
#include <memory>
|
|
#include <utility>
|
|
|
|
#include "absl/container/internal/compressed_tuple.h"
|
|
#include "absl/meta/type_traits.h"
|
|
|
|
namespace absl {
|
|
namespace inlined_vector_internal {
|
|
|
|
template <typename Iterator>
|
|
using IsAtLeastForwardIterator = std::is_convertible<
|
|
typename std::iterator_traits<Iterator>::iterator_category,
|
|
std::forward_iterator_tag>;
|
|
|
|
template <typename InlinedVector>
|
|
class Storage;
|
|
|
|
template <template <typename, size_t, typename> class InlinedVector, typename T,
|
|
size_t N, typename A>
|
|
class Storage<InlinedVector<T, N, A>> {
|
|
public:
|
|
using allocator_type = A;
|
|
using value_type = typename allocator_type::value_type;
|
|
using pointer = typename allocator_type::pointer;
|
|
using const_pointer = typename allocator_type::const_pointer;
|
|
using reference = typename allocator_type::reference;
|
|
using const_reference = typename allocator_type::const_reference;
|
|
using rvalue_reference = typename allocator_type::value_type&&;
|
|
using size_type = typename allocator_type::size_type;
|
|
using difference_type = typename allocator_type::difference_type;
|
|
using iterator = pointer;
|
|
using const_iterator = const_pointer;
|
|
using reverse_iterator = std::reverse_iterator<iterator>;
|
|
using const_reverse_iterator = std::reverse_iterator<const_iterator>;
|
|
using AllocatorTraits = std::allocator_traits<allocator_type>;
|
|
|
|
explicit Storage(const allocator_type& alloc)
|
|
: metadata_(alloc, /* empty and inlined */ 0) {}
|
|
|
|
size_type GetSize() const { return GetSizeAndIsAllocated() >> 1; }
|
|
|
|
bool GetIsAllocated() const { return GetSizeAndIsAllocated() & 1; }
|
|
|
|
pointer GetInlinedData() {
|
|
return reinterpret_cast<pointer>(
|
|
std::addressof(data_.inlined.inlined_data[0]));
|
|
}
|
|
|
|
const_pointer GetInlinedData() const {
|
|
return reinterpret_cast<const_pointer>(
|
|
std::addressof(data_.inlined.inlined_data[0]));
|
|
}
|
|
|
|
pointer GetAllocatedData() { return data_.allocated.allocated_data; }
|
|
|
|
const_pointer GetAllocatedData() const {
|
|
return data_.allocated.allocated_data;
|
|
}
|
|
|
|
size_type GetAllocatedCapacity() const {
|
|
return data_.allocated.allocated_capacity;
|
|
}
|
|
|
|
allocator_type& GetAllocator() { return metadata_.template get<0>(); }
|
|
|
|
const allocator_type& GetAllocator() const {
|
|
return metadata_.template get<0>();
|
|
}
|
|
|
|
void SetAllocatedSize(size_type size) {
|
|
GetSizeAndIsAllocated() = (size << 1) | static_cast<size_type>(1);
|
|
}
|
|
|
|
void SetInlinedSize(size_type size) { GetSizeAndIsAllocated() = size << 1; }
|
|
|
|
void AddSize(size_type count) { GetSizeAndIsAllocated() += count << 1; }
|
|
|
|
void SetAllocatedData(pointer data) { data_.allocated.allocated_data = data; }
|
|
|
|
void SetAllocatedCapacity(size_type capacity) {
|
|
data_.allocated.allocated_capacity = capacity;
|
|
}
|
|
|
|
void SwapSizeAndIsAllocated(Storage* other) {
|
|
using std::swap;
|
|
swap(GetSizeAndIsAllocated(), other->GetSizeAndIsAllocated());
|
|
}
|
|
|
|
void SwapAllocatedSizeAndCapacity(Storage* other) {
|
|
using std::swap;
|
|
swap(data_.allocated, other->data_.allocated);
|
|
}
|
|
|
|
private:
|
|
size_type& GetSizeAndIsAllocated() { return metadata_.template get<1>(); }
|
|
|
|
const size_type& GetSizeAndIsAllocated() const {
|
|
return metadata_.template get<1>();
|
|
}
|
|
|
|
using Metadata =
|
|
container_internal::CompressedTuple<allocator_type, size_type>;
|
|
|
|
struct Allocated {
|
|
pointer allocated_data;
|
|
size_type allocated_capacity;
|
|
};
|
|
|
|
struct Inlined {
|
|
using InlinedDataElement =
|
|
absl::aligned_storage_t<sizeof(value_type), alignof(value_type)>;
|
|
InlinedDataElement inlined_data[N];
|
|
};
|
|
|
|
union Data {
|
|
Allocated allocated;
|
|
Inlined inlined;
|
|
};
|
|
|
|
Metadata metadata_;
|
|
Data data_;
|
|
};
|
|
|
|
} // namespace inlined_vector_internal
|
|
} // namespace absl
|
|
|
|
#endif // ABSL_CONTAINER_INTERNAL_INLINED_VECTOR_INTERNAL_H_
|