mirror of
https://github.com/RPCS3/llvm.git
synced 2025-04-05 06:41:51 +00:00
3c0d60785c
clang-format (https://reviews.llvm.org/D33932) to keep primary headers at the top and handle new utility headers like 'gmock' consistently with other utility headers. No other change was made. I did no manual edits, all of this is clang-format. This should allow other changes to have more clear and focused diffs, and is especially motivated by moving some headers into more focused libraries. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@304786 91177308-0d34-0410-b5e6-96231b3b80d8
53 lines
1.6 KiB
C++
53 lines
1.6 KiB
C++
//===- llvm/unittest/ADT/ReverseIterationTest.cpp ------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// ReverseIteration unit tests.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/ADT/SmallPtrSet.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
#if LLVM_ENABLE_ABI_BREAKING_CHECKS
|
|
using namespace llvm;
|
|
|
|
TEST(ReverseIterationTest, SmallPtrSetTest) {
|
|
|
|
SmallPtrSet<void*, 4> Set;
|
|
void *Ptrs[] = { (void*)0x1, (void*)0x2, (void*)0x3, (void*)0x4 };
|
|
void *ReversePtrs[] = { (void*)0x4, (void*)0x3, (void*)0x2, (void*)0x1 };
|
|
|
|
for (auto *Ptr: Ptrs)
|
|
Set.insert(Ptr);
|
|
|
|
// Check forward iteration.
|
|
ReverseIterate<bool>::value = false;
|
|
for (const auto &Tuple : zip(Set, Ptrs))
|
|
ASSERT_EQ(std::get<0>(Tuple), std::get<1>(Tuple));
|
|
|
|
// Check operator++ (post-increment) in forward iteration.
|
|
int i = 0;
|
|
for (auto begin = Set.begin(), end = Set.end();
|
|
begin != end; i++)
|
|
ASSERT_EQ(*begin++, Ptrs[i]);
|
|
|
|
// Check reverse iteration.
|
|
ReverseIterate<bool>::value = true;
|
|
for (const auto &Tuple : zip(Set, ReversePtrs))
|
|
ASSERT_EQ(std::get<0>(Tuple), std::get<1>(Tuple));
|
|
|
|
// Check operator++ (post-increment) in reverse iteration.
|
|
i = 0;
|
|
for (auto begin = Set.begin(), end = Set.end();
|
|
begin != end; i++)
|
|
ASSERT_EQ(*begin++, ReversePtrs[i]);
|
|
|
|
}
|
|
#endif
|