mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-22 02:33:06 +01:00
51 lines
1.2 KiB
C++
51 lines
1.2 KiB
C++
//===- llvm/unittest/ADT/SetVector.cpp ------------------------------===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// SetVector unit tests.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/ADT/SetVector.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace llvm;
|
|
|
|
TEST(SetVector, EraseTest) {
|
|
SetVector<int> S;
|
|
S.insert(0);
|
|
S.insert(1);
|
|
S.insert(2);
|
|
|
|
auto I = S.erase(std::next(S.begin()));
|
|
|
|
// Test that the returned iterator is the expected one-after-erase
|
|
// and the size/contents is the expected sequence {0, 2}.
|
|
EXPECT_EQ(std::next(S.begin()), I);
|
|
EXPECT_EQ(2u, S.size());
|
|
EXPECT_EQ(0, *S.begin());
|
|
EXPECT_EQ(2, *std::next(S.begin()));
|
|
}
|
|
|
|
TEST(SetVector, ContainsTest) {
|
|
SetVector<int> S;
|
|
S.insert(0);
|
|
S.insert(1);
|
|
S.insert(2);
|
|
|
|
EXPECT_TRUE(S.contains(0));
|
|
EXPECT_TRUE(S.contains(1));
|
|
EXPECT_TRUE(S.contains(2));
|
|
EXPECT_FALSE(S.contains(-1));
|
|
|
|
S.insert(2);
|
|
EXPECT_TRUE(S.contains(2));
|
|
|
|
S.remove(2);
|
|
EXPECT_FALSE(S.contains(2));
|
|
}
|