fb855eb941
This has been done using the following command
find libcxx/test -type f -exec perl -pi -e 's|^([^/]+?)((?<!::)size_t)|\1std::\2|' \{} \;
And manually removed some false positives in std/depr/depr.c.headers.
The `std` module doesn't export `::size_t`, this is a preparation for that module.
Reviewed By: ldionne, #libc, EricWF, philnik
Differential Revision: https://reviews.llvm.org/D146088
48 lines
1.4 KiB
C++
48 lines
1.4 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef CHECK_CONSECUTIVE_H
|
|
#define CHECK_CONSECUTIVE_H
|
|
|
|
// <unordered_multiset>
|
|
// <unordered_multimap>
|
|
|
|
#include <cassert>
|
|
#include <set>
|
|
#include <stddef.h>
|
|
|
|
// Check consecutive equal values in an unordered_multiset iterator
|
|
template <typename Iter>
|
|
void CheckConsecutiveValues(Iter pos, Iter end, typename Iter::value_type value, std::size_t count)
|
|
{
|
|
for ( std::size_t i = 0; i < count; ++i )
|
|
{
|
|
assert(pos != end);
|
|
assert(*pos == value);
|
|
++pos;
|
|
}
|
|
assert(pos == end || *pos != value);
|
|
}
|
|
|
|
// Check consecutive equal keys in an unordered_multimap iterator
|
|
template <typename Iter>
|
|
void CheckConsecutiveKeys(Iter pos, Iter end, typename Iter::value_type::first_type key, std::multiset<typename Iter::value_type::second_type>& values)
|
|
{
|
|
while (!values.empty())
|
|
{
|
|
assert(pos != end);
|
|
assert(pos->first == key);
|
|
assert(values.find(pos->second) != values.end());
|
|
values.erase(values.find(pos->second));
|
|
++pos;
|
|
}
|
|
assert(pos == end || pos->first != key);
|
|
}
|
|
|
|
#endif
|