mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 11:42:57 +01:00
da38ee93c5
This is a little class template that just builds an inheritance chain of empty classes. Despite how simple this is, it can be used to really nicely create ranked overload sets. I've added a unittest as much to document this as test it. You can pass an object of this type as an argument to a function overload set an it will call the first viable and enabled candidate at or below the rank of the object. I'm planning to use this in a subsequent commit to more clearly rank overload candidates used for SFINAE. All credit for this technique and both lines of code here to Richard Smith who was helping me rewrite the SFINAE check in question to much more effectively capture the intended set of checks. llvm-svn: 279197
41 lines
1.0 KiB
C++
41 lines
1.0 KiB
C++
//===- STLExtrasTest.cpp - Unit tests for STL extras ----------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/ADT/STLExtras.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace llvm;
|
|
|
|
namespace {
|
|
|
|
int f(rank<0>) { return 0; }
|
|
int f(rank<1>) { return 1; }
|
|
int f(rank<2>) { return 2; }
|
|
int f(rank<4>) { return 4; }
|
|
|
|
TEST(STLExtrasTest, Rank) {
|
|
// We shouldn't get ambiguities and should select the overload of the same
|
|
// rank as the argument.
|
|
EXPECT_EQ(0, f(rank<0>()));
|
|
EXPECT_EQ(1, f(rank<1>()));
|
|
EXPECT_EQ(2, f(rank<2>()));
|
|
|
|
// This overload is missing so we end up back at 2.
|
|
EXPECT_EQ(2, f(rank<3>()));
|
|
|
|
// But going past 3 should work fine.
|
|
EXPECT_EQ(4, f(rank<4>()));
|
|
|
|
// And we can even go higher and just fall back to the last overload.
|
|
EXPECT_EQ(4, f(rank<5>()));
|
|
EXPECT_EQ(4, f(rank<6>()));
|
|
}
|
|
|
|
}
|