Skip to content

Commit

Permalink
fix: ignore cpplint for external file
Browse files Browse the repository at this point in the history 
Signed-off-by: Ryohsuke Mitsudome <[email protected]>
  • Loading branch information
@mitsudome-r
mitsudome-r committed Apr 22, 2024
1 parent b191e3b commit 21593a5
Showing 1 changed file with 38 additions and 42 deletions.
80 changes: 38 additions & 42 deletions sensing/pointcloud_preprocessor/src/downsample_filter/robin_hood.h
View file
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
// NOLINTBEGIN
// Copyright (c) 2018-2021 Martin Ankerl <http://martin.ankerl.com>
// ______ _____ ______ _________
// ______________ ___ /_ ___(_)_______ ___ /_ ______ ______ ______ /
// __ ___/_ __ \__ __ \__ / __ __ \ __ __ \_ __ \_ __ \_ __ /
Expand Down Expand Up @@ -31,6 +31,9 @@
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
// SOFTWARE.

// clang-format off
// (because it messes up the whole file and this is a external file)

#ifndef DOWNSAMPLE_FILTER__ROBIN_HOOD_H_
#define DOWNSAMPLE_FILTER__ROBIN_HOOD_H_

Expand Down Expand Up @@ -148,7 +151,7 @@ static Counts & counts()
#pragma intrinsic(ROBIN_HOOD(BITSCANFORWARD))
#define ROBIN_HOOD_COUNT_TRAILING_ZEROES(x) \
[](size_t mask) noexcept -> int { \
unsigned long index; \
unsigned long index; \ // NOLINT
return ROBIN_HOOD(BITSCANFORWARD)(&index, mask) ? static_cast<int>(index) \
: ROBIN_HOOD(BITNESS); \
}(x)
Expand Down Expand Up @@ -350,7 +353,7 @@ template <typename E, typename... Args>
#if ROBIN_HOOD(HAS_EXCEPTIONS)
void doThrow(Args &&... args)
{
// NOLINTNEXTLINE(cppcoreguidelines-pro-bounds-array-to-pointer-decay)
// NOLINTNEXTLINE (cppcoreguidelines-pro-bounds-array-to-pointer-decay)
throw E(std::forward<Args>(args)...);
}
#else
Expand Down Expand Up @@ -411,7 +414,7 @@ class BulkPoolAllocator
}

BulkPoolAllocator &
// NOLINTNEXTLINE(bugprone-unhandled-self-assignment,cert-oop54-cpp)
// NOLINTNEXTLINE (bugprone-unhandled-self-assignment,cert-oop54-cpp)
operator=(const BulkPoolAllocator & ROBIN_HOOD_UNUSED(o) /*unused*/) noexcept
{
// does not do anything
Expand Down Expand Up @@ -680,12 +683,7 @@ struct pair
forward<U1>(std::get<I1>(
std::declval<std::tuple<
U1...> &>()))...)) && noexcept(T2(std::
forward<
U2>(std::get<
I2>(
std::declval<
std::tuple<
U2...> &>()))...)))
forward<U2>(std::get<I2>(std::declval<std::tuple<U2...> &>()))...))) // NOLINT
: first(std::forward<U1>(std::get<I1>(a))...), second(std::forward<U2>(std::get<I2>(b))...)
{
// make visual studio compiler happy about warning about unused a & b.
Expand All @@ -702,8 +700,8 @@ struct pair
swap(second, o.second);
}

T1 first; // NOLINT(misc-non-private-member-variables-in-classes)
T2 second; // NOLINT(misc-non-private-member-variables-in-classes)
T1 first; // NOLINT (misc-non-private-member-variables-in-classes)
T2 second; // NOLINT (misc-non-private-member-variables-in-classes)
};

template <typename A, typename B>
Expand Down Expand Up @@ -912,14 +910,14 @@ ROBIN_HOOD_HASH_INT(char32_t);
#if ROBIN_HOOD(HAS_NATIVE_WCHART)
ROBIN_HOOD_HASH_INT(wchar_t);
#endif
ROBIN_HOOD_HASH_INT(short);
ROBIN_HOOD_HASH_INT(unsigned short);
ROBIN_HOOD_HASH_INT(short); // NOLINT
ROBIN_HOOD_HASH_INT(unsigned short); // NOLINT
ROBIN_HOOD_HASH_INT(int);
ROBIN_HOOD_HASH_INT(unsigned int);
ROBIN_HOOD_HASH_INT(long);
ROBIN_HOOD_HASH_INT(long long);
ROBIN_HOOD_HASH_INT(unsigned long);
ROBIN_HOOD_HASH_INT(unsigned long long);
ROBIN_HOOD_HASH_INT(long); // NOLINT
ROBIN_HOOD_HASH_INT(long long); // NOLINT
ROBIN_HOOD_HASH_INT(unsigned long); // NOLINT
ROBIN_HOOD_HASH_INT(unsigned long long); // NOLINT
#if defined(__GNUC__) && !defined(__clang__)
#pragma GCC diagnostic pop
#endif
Expand Down Expand Up @@ -1319,7 +1317,7 @@ class Table

// generic iterator for both const_iterator and iterator.
template <bool IsConst>
// NOLINTNEXTLINE(hicpp-special-member-functions,cppcoreguidelines-special-member-functions)
// NOLINTNEXTLINE (hicpp-special-member-functions,cppcoreguidelines-special-member-functions)
class Iter
{
private:
Expand All @@ -1341,7 +1339,7 @@ class Table

// Conversion constructor from iterator to const_iterator.
template <bool OtherIsConst, typename = typename std::enable_if<IsConst && !OtherIsConst>::type>
// NOLINTNEXTLINE(hicpp-explicit-conversions)
// NOLINTNEXTLINE (hicpp-explicit-conversions)
Iter(Iter<OtherIsConst> const & other) noexcept : mKeyVals(other.mKeyVals), mInfo(other.mInfo)
{
}
Expand Down Expand Up @@ -1719,7 +1717,7 @@ class Table

// Creates a copy of the given map. Copy constructor of each entry is used.
// Not sure why clang-tidy thinks this doesn't handle self assignment, it does
// NOLINTNEXTLINE(bugprone-unhandled-self-assignment,cert-oop54-cpp)
// NOLINTNEXTLINE (bugprone-unhandled-self-assignment,cert-oop54-cpp)
Table & operator=(Table const & o)
{
ROBIN_HOOD_TRACE(this)
Expand Down Expand Up @@ -2023,7 +2021,7 @@ class Table

// Returns 1 if key is found, 0 otherwise.
size_t count(const key_type & key) const
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
auto kv = mKeyVals + findIdx(key);
if (kv != reinterpret_cast_no_cast_align_warning<Node *>(mInfo)) {
Expand All @@ -2033,7 +2031,7 @@ class Table
}

template <typename OtherKey, typename Self_ = Self>
// NOLINTNEXTLINE(modernize-use-nodiscard)
// NOLINTNEXTLINE (modernize-use-nodiscard)
typename std::enable_if<Self_::is_transparent, size_t>::type count(const OtherKey & key) const
{
ROBIN_HOOD_TRACE(this)
Expand All @@ -2045,12 +2043,12 @@ class Table
}

bool contains(const key_type & key) const
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
return 1U == count(key);
}

template <typename OtherKey, typename Self_ = Self>
// NOLINTNEXTLINE(modernize-use-nodiscard)
// NOLINTNEXTLINE (modernize-use-nodiscard)
typename std::enable_if<Self_::is_transparent, bool>::type contains(const OtherKey & key) const
{
return 1U == count(key);
Expand All @@ -2059,7 +2057,7 @@ class Table
// Returns a reference to the value found for key.
// Throws std::out_of_range if element cannot be found
template <typename Q = mapped_type>
// NOLINTNEXTLINE(modernize-use-nodiscard)
// NOLINTNEXTLINE (modernize-use-nodiscard)
typename std::enable_if<!std::is_void<Q>::value, Q &>::type at(key_type const & key)
{
ROBIN_HOOD_TRACE(this)
Expand All @@ -2073,7 +2071,7 @@ class Table
// Returns a reference to the value found for key.
// Throws std::out_of_range if element cannot be found
template <typename Q = mapped_type>
// NOLINTNEXTLINE(modernize-use-nodiscard)
// NOLINTNEXTLINE (modernize-use-nodiscard)
typename std::enable_if<!std::is_void<Q>::value, Q const &>::type at(key_type const & key) const
{
ROBIN_HOOD_TRACE(this)
Expand All @@ -2085,7 +2083,7 @@ class Table
}

const_iterator find(const key_type & key) const
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
const size_t idx = findIdx(key);
return const_iterator{mKeyVals + idx, mInfo + idx};
Expand All @@ -2101,10 +2099,10 @@ class Table

template <typename OtherKey, typename Self_ = Self>
typename std::enable_if<
Self_::is_transparent, // NOLINT(modernize-use-nodiscard)
const_iterator>::type // NOLINT(modernize-use-nodiscard)
Self_::is_transparent, // NOLINT (modernize-use-nodiscard)
const_iterator>::type // NOLINT (modernize-use-nodiscard)
find(const OtherKey & key) const
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
const size_t idx = findIdx(key);
return const_iterator{mKeyVals + idx, mInfo + idx};
Expand Down Expand Up @@ -2142,12 +2140,12 @@ class Table
return iterator(mKeyVals, mInfo, fast_forward_tag{});
}
const_iterator begin() const
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
return cbegin();
}
const_iterator cbegin() const
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
if (empty()) {
return cend();
Expand All @@ -2163,12 +2161,12 @@ class Table
return iterator{reinterpret_cast_no_cast_align_warning<Node *>(mInfo), nullptr};
}
const_iterator end() const
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
return cend();
}
const_iterator cend() const
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
return const_iterator{reinterpret_cast_no_cast_align_warning<Node *>(mInfo), nullptr};
}
Expand All @@ -2177,7 +2175,7 @@ class Table
{
ROBIN_HOOD_TRACE(this)
// its safe to perform const cast here
// NOLINTNEXTLINE(cppcoreguidelines-pro-type-const-cast)
// NOLINTNEXTLINE (cppcoreguidelines-pro-type-const-cast)
return erase(iterator{const_cast<Node *>(pos.mKeyVals), const_cast<uint8_t *>(pos.mInfo)});
}

Expand Down Expand Up @@ -2260,13 +2258,13 @@ class Table
}

size_type size() const noexcept
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
return mNumElements;
}

size_type max_size() const noexcept
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
return static_cast<size_type>(-1);
}
Expand All @@ -2278,14 +2276,14 @@ class Table
}

float max_load_factor() const noexcept
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
return MaxLoadFactor100 / 100.0F;
}

// Average number of elements per bucket. Since we allow only 1 per bucket
float load_factor() const noexcept
{ // NOLINT(modernize-use-nodiscard)
{ // NOLINT (modernize-use-nodiscard)
ROBIN_HOOD_TRACE(this)
return static_cast<float>(size()) / static_cast<float>(mMask + 1);
}
Expand Down Expand Up @@ -2732,5 +2730,3 @@ using unordered_set = detail::Table<
} // namespace robin_hood

#endif // DOWNSAMPLE_FILTER__ROBIN_HOOD_H_

// NOLINTEND

0 comments on commit 21593a5

Please sign in to comment.