Export of internal Abseil changes.
-- ab1a58c85a462884413ec0022dc1fff19ccb8602 by Abseil Team <absl-team@google.com>: Clarified the documentation in str_format.h to say that use of absl::FormatSpec is ok for wrapper functions. Added tests that express this. PiperOrigin-RevId: 247657991 -- fef9481e58d579f1514babcb960ca60a51883fd8 by CJ Johnson <johnsoncj@google.com>: Adds exception safety tests for InlinedVector::InlinedVector() and InlinedVector::InlinedVector(const allocator_type&). PiperOrigin-RevId: 247617048 -- ef3217e1cd1e9a6ff5f2025e061b8ce3735af78f by Abseil Team <absl-team@google.com>: Internal change. PiperOrigin-RevId: 247614063 -- ed4c3345c4a04d8ec5c9e627058f17fce55925b1 by CJ Johnson <johnsoncj@google.com>: Update InlinedVector::clear() Introduces inlined_vector_exception_safety_test with the first test (clear), adds new benchmarks (for clear), and updates the implementation of clear. PiperOrigin-RevId: 247496049 -- 144a3a77c93bc8b2226da6f4b56166ee3d9868de by Derek Mauro <dmauro@google.com>: Internal change PiperOrigin-RevId: 247482532 -- 286bbb89e154d5424955b644edad5fe04be487f8 by Derek Mauro <dmauro@google.com>: Add scripts to run ASAN and TSAN on CI. PiperOrigin-RevId: 247479658 GitOrigin-RevId: ab1a58c85a462884413ec0022dc1fff19ccb8602 Change-Id: Ief4c5a62587d0c59d405735df469d498aa6bf101
This commit is contained in:
parent
27c2f6e2f3
commit
0cbdc774b9
18 changed files with 422 additions and 36 deletions
|
|
@ -16,6 +16,7 @@
|
|||
#define ABSL_CONTAINER_INTERNAL_INLINED_VECTOR_INTERNAL_H_
|
||||
|
||||
#include <cstddef>
|
||||
#include <cstring>
|
||||
#include <iterator>
|
||||
#include <memory>
|
||||
#include <utility>
|
||||
|
|
@ -31,6 +32,33 @@ using IsAtLeastForwardIterator = std::is_convertible<
|
|||
typename std::iterator_traits<Iterator>::iterator_category,
|
||||
std::forward_iterator_tag>;
|
||||
|
||||
template <typename AllocatorType, typename ValueType, typename SizeType>
|
||||
void DestroyElements(AllocatorType alloc, ValueType* destroy_first,
|
||||
SizeType destroy_size) {
|
||||
using AllocatorTraits = std::allocator_traits<AllocatorType>;
|
||||
|
||||
// Destroys `destroy_size` elements from `destroy_first`.
|
||||
//
|
||||
// Destroys the range
|
||||
// [`destroy_first`, `destroy_first + destroy_size`).
|
||||
//
|
||||
// NOTE: We assume destructors do not throw and thus make no attempt to roll
|
||||
// back.
|
||||
for (SizeType i = 0; i < destroy_size; ++i) {
|
||||
AllocatorTraits::destroy(alloc, destroy_first + i);
|
||||
}
|
||||
|
||||
#ifndef NDEBUG
|
||||
// Overwrite unused memory with `0xab` so we can catch uninitialized usage.
|
||||
//
|
||||
// Cast to `void*` to tell the compiler that we don't care that we might be
|
||||
// scribbling on a vtable pointer.
|
||||
void* memory = reinterpret_cast<void*>(destroy_first);
|
||||
size_t memory_size = sizeof(ValueType) * destroy_size;
|
||||
std::memset(memory, 0xab, memory_size);
|
||||
#endif // NDEBUG
|
||||
}
|
||||
|
||||
template <typename T, size_t N, typename A>
|
||||
class Storage {
|
||||
public:
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue