This introduces `Predicate` and `IfNotPredicate` case selection to
StringSwitch to allow use cases like
```
StringSwitch<...>(..)
.Case("foo", FooTok)
.Predicate([](StringRef Str){ ... }, IdentifierTok)
...
```
This is mostly useful for improving conciseness and clarity when
processing generated strings, diagnostics, and similar.
289 lines
9.2 KiB
C++
289 lines
9.2 KiB
C++
//===- llvm/unittest/ADT/StringSwitchTest.cpp - StringSwitch unit tests ---===//
|
|
//
|
|
// 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
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/ADT/StringSwitch.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace llvm;
|
|
|
|
TEST(StringSwitchTest, Case) {
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<int>(S)
|
|
.Case("0", 0)
|
|
.Case("1", 1)
|
|
.Case("2", 2)
|
|
.Case("3", 3)
|
|
.Case("4", 4)
|
|
.Case("5", 5)
|
|
.Case("6", 6)
|
|
.Case("7", 7)
|
|
.Case("8", 8)
|
|
.Case("9", 9)
|
|
.Case("A", 10)
|
|
.Case("B", 11)
|
|
.Case("C", 12)
|
|
.Case("D", 13)
|
|
.Case("E", 14)
|
|
.Case("F", 15)
|
|
.Default(-1);
|
|
};
|
|
EXPECT_EQ(1, Translate("1"));
|
|
EXPECT_EQ(2, Translate("2"));
|
|
EXPECT_EQ(11, Translate("B"));
|
|
EXPECT_EQ(-1, Translate("b"));
|
|
EXPECT_EQ(-1, Translate(""));
|
|
EXPECT_EQ(-1, Translate("Test"));
|
|
}
|
|
|
|
TEST(StringSwitchTest, CaseLower) {
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<int>(S)
|
|
.Case("0", 0)
|
|
.Case("1", 1)
|
|
.Case("2", 2)
|
|
.Case("3", 3)
|
|
.Case("4", 4)
|
|
.Case("5", 5)
|
|
.Case("6", 6)
|
|
.Case("7", 7)
|
|
.Case("8", 8)
|
|
.Case("9", 9)
|
|
.CaseLower("A", 10)
|
|
.CaseLower("B", 11)
|
|
.CaseLower("C", 12)
|
|
.CaseLower("D", 13)
|
|
.CaseLower("E", 14)
|
|
.CaseLower("F", 15)
|
|
.Default(-1);
|
|
};
|
|
EXPECT_EQ(1, Translate("1"));
|
|
EXPECT_EQ(2, Translate("2"));
|
|
EXPECT_EQ(11, Translate("B"));
|
|
EXPECT_EQ(11, Translate("b"));
|
|
|
|
EXPECT_EQ(-1, Translate(""));
|
|
EXPECT_EQ(-1, Translate("Test"));
|
|
}
|
|
|
|
TEST(StringSwitchTest, StartsWith) {
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<std::function<int(int, int)>>(S)
|
|
.StartsWith("add", [](int X, int Y) { return X + Y; })
|
|
.StartsWith("sub", [](int X, int Y) { return X - Y; })
|
|
.StartsWith("mul", [](int X, int Y) { return X * Y; })
|
|
.StartsWith("div", [](int X, int Y) { return X / Y; })
|
|
.Default([](int X, int Y) { return 0; });
|
|
};
|
|
|
|
EXPECT_EQ(15, Translate("adder")(10, 5));
|
|
EXPECT_EQ(5, Translate("subtracter")(10, 5));
|
|
EXPECT_EQ(50, Translate("multiplier")(10, 5));
|
|
EXPECT_EQ(2, Translate("divider")(10, 5));
|
|
|
|
EXPECT_EQ(0, Translate("nothing")(10, 5));
|
|
EXPECT_EQ(0, Translate("ADDER")(10, 5));
|
|
}
|
|
|
|
TEST(StringSwitchTest, StartsWithLower) {
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<std::function<int(int, int)>>(S)
|
|
.StartsWithLower("add", [](int X, int Y) { return X + Y; })
|
|
.StartsWithLower("sub", [](int X, int Y) { return X - Y; })
|
|
.StartsWithLower("mul", [](int X, int Y) { return X * Y; })
|
|
.StartsWithLower("div", [](int X, int Y) { return X / Y; })
|
|
.Default([](int X, int Y) { return 0; });
|
|
};
|
|
|
|
EXPECT_EQ(15, Translate("adder")(10, 5));
|
|
EXPECT_EQ(5, Translate("subtracter")(10, 5));
|
|
EXPECT_EQ(50, Translate("multiplier")(10, 5));
|
|
EXPECT_EQ(2, Translate("divider")(10, 5));
|
|
|
|
EXPECT_EQ(15, Translate("AdDeR")(10, 5));
|
|
EXPECT_EQ(5, Translate("SuBtRaCtEr")(10, 5));
|
|
EXPECT_EQ(50, Translate("MuLtIpLiEr")(10, 5));
|
|
EXPECT_EQ(2, Translate("DiViDeR")(10, 5));
|
|
|
|
EXPECT_EQ(0, Translate("nothing")(10, 5));
|
|
}
|
|
|
|
TEST(StringSwitchTest, EndsWith) {
|
|
enum class Suffix { Possible, PastTense, Process, InProgressAction, Unknown };
|
|
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<Suffix>(S)
|
|
.EndsWith("able", Suffix::Possible)
|
|
.EndsWith("ed", Suffix::PastTense)
|
|
.EndsWith("ation", Suffix::Process)
|
|
.EndsWith("ing", Suffix::InProgressAction)
|
|
.Default(Suffix::Unknown);
|
|
};
|
|
|
|
EXPECT_EQ(Suffix::Possible, Translate("optimizable"));
|
|
EXPECT_EQ(Suffix::PastTense, Translate("optimized"));
|
|
EXPECT_EQ(Suffix::Process, Translate("optimization"));
|
|
EXPECT_EQ(Suffix::InProgressAction, Translate("optimizing"));
|
|
EXPECT_EQ(Suffix::Unknown, Translate("optimizer"));
|
|
EXPECT_EQ(Suffix::Unknown, Translate("OPTIMIZABLE"));
|
|
}
|
|
|
|
TEST(StringSwitchTest, EndsWithLower) {
|
|
enum class Suffix { Possible, PastTense, Process, InProgressAction, Unknown };
|
|
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<Suffix>(S)
|
|
.EndsWithLower("able", Suffix::Possible)
|
|
.EndsWithLower("ed", Suffix::PastTense)
|
|
.EndsWithLower("ation", Suffix::Process)
|
|
.EndsWithLower("ing", Suffix::InProgressAction)
|
|
.Default(Suffix::Unknown);
|
|
};
|
|
|
|
EXPECT_EQ(Suffix::Possible, Translate("optimizable"));
|
|
EXPECT_EQ(Suffix::Possible, Translate("OPTIMIZABLE"));
|
|
EXPECT_EQ(Suffix::PastTense, Translate("optimized"));
|
|
EXPECT_EQ(Suffix::Process, Translate("optimization"));
|
|
EXPECT_EQ(Suffix::InProgressAction, Translate("optimizing"));
|
|
EXPECT_EQ(Suffix::Unknown, Translate("optimizer"));
|
|
}
|
|
|
|
TEST(StringSwitchTest, Cases) {
|
|
enum class OSType { Windows, Linux, MacOS, Unknown };
|
|
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<OSType>(S)
|
|
.Cases({StringLiteral::withInnerNUL("wind\0ws"), "win32", "winnt"},
|
|
OSType::Windows)
|
|
.Cases({"linux", "unix", "*nix", "posix"}, OSType::Linux)
|
|
.Cases({"macos", "osx"}, OSType::MacOS)
|
|
.Default(OSType::Unknown);
|
|
};
|
|
|
|
EXPECT_EQ(OSType::Windows, Translate(llvm::StringRef("wind\0ws", 7)));
|
|
EXPECT_EQ(OSType::Windows, Translate("win32"));
|
|
EXPECT_EQ(OSType::Windows, Translate("winnt"));
|
|
|
|
EXPECT_EQ(OSType::Linux, Translate("linux"));
|
|
EXPECT_EQ(OSType::Linux, Translate("unix"));
|
|
EXPECT_EQ(OSType::Linux, Translate("*nix"));
|
|
EXPECT_EQ(OSType::Linux, Translate("posix"));
|
|
|
|
EXPECT_EQ(OSType::MacOS, Translate("macos"));
|
|
EXPECT_EQ(OSType::MacOS, Translate("osx"));
|
|
|
|
// Note that the whole null-terminator embedded string is required for the
|
|
// case to match.
|
|
EXPECT_EQ(OSType::Unknown, Translate("wind"));
|
|
EXPECT_EQ(OSType::Unknown, Translate("Windows"));
|
|
EXPECT_EQ(OSType::Unknown, Translate("MacOS"));
|
|
EXPECT_EQ(OSType::Unknown, Translate(""));
|
|
}
|
|
|
|
TEST(StringSwitchTest, CasesLower) {
|
|
enum class OSType { Windows, Linux, MacOS, Unknown };
|
|
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<OSType>(S)
|
|
.CasesLower({StringLiteral::withInnerNUL("wind\0ws"), "win32", "winnt"},
|
|
OSType::Windows)
|
|
.CasesLower({"linux", "unix", "*nix", "posix"}, OSType::Linux)
|
|
.CasesLower({"macos", "osx"}, OSType::MacOS)
|
|
.Default(OSType::Unknown);
|
|
};
|
|
|
|
EXPECT_EQ(OSType::Windows, Translate(llvm::StringRef("WIND\0WS", 7)));
|
|
EXPECT_EQ(OSType::Windows, Translate("WIN32"));
|
|
EXPECT_EQ(OSType::Windows, Translate("WINNT"));
|
|
|
|
EXPECT_EQ(OSType::Linux, Translate("LINUX"));
|
|
EXPECT_EQ(OSType::Linux, Translate("UNIX"));
|
|
EXPECT_EQ(OSType::Linux, Translate("*NIX"));
|
|
EXPECT_EQ(OSType::Linux, Translate("POSIX"));
|
|
|
|
EXPECT_EQ(OSType::Windows, Translate(llvm::StringRef("wind\0ws", 7)));
|
|
EXPECT_EQ(OSType::Linux, Translate("linux"));
|
|
|
|
EXPECT_EQ(OSType::MacOS, Translate("macOS"));
|
|
EXPECT_EQ(OSType::MacOS, Translate("OSX"));
|
|
|
|
EXPECT_EQ(OSType::Unknown, Translate("wind"));
|
|
EXPECT_EQ(OSType::Unknown, Translate(""));
|
|
}
|
|
|
|
TEST(StringSwitchTest, CasesCopies) {
|
|
struct Copyable {
|
|
unsigned &NumCopies;
|
|
Copyable(unsigned &Value) : NumCopies(Value) {}
|
|
Copyable(const Copyable &Other) : NumCopies(Other.NumCopies) {
|
|
++NumCopies;
|
|
}
|
|
Copyable &operator=(const Copyable &Other) {
|
|
++NumCopies;
|
|
return *this;
|
|
}
|
|
};
|
|
|
|
// Check that evaluating multiple cases does not cause unnecessary copies.
|
|
unsigned NumCopies = 0;
|
|
llvm::StringSwitch<Copyable, void>("baz").Cases({"foo", "bar", "baz", "qux"},
|
|
Copyable{NumCopies});
|
|
EXPECT_EQ(NumCopies, 1u);
|
|
|
|
NumCopies = 0;
|
|
llvm::StringSwitch<Copyable, void>("baz").CasesLower(
|
|
{"Foo", "Bar", "Baz", "Qux"}, Copyable{NumCopies});
|
|
EXPECT_EQ(NumCopies, 1u);
|
|
}
|
|
|
|
TEST(StringSwitchTest, StringSwitchMultipleMatches) {
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<int>(S)
|
|
.CaseLower("A", 0)
|
|
.Case("b", 1)
|
|
.Case("a", 2)
|
|
.CasesLower({"a", "b"}, 3)
|
|
.DefaultUnreachable();
|
|
};
|
|
|
|
// Check that the value of the first match is returned.
|
|
EXPECT_EQ(0, Translate("A"));
|
|
EXPECT_EQ(0, Translate("a"));
|
|
EXPECT_EQ(3, Translate("B"));
|
|
EXPECT_EQ(1, Translate("b"));
|
|
}
|
|
|
|
TEST(StringPredicateTest, Predicate) {
|
|
auto MatchFn = [](StringRef Str) { return Str == "abc" || Str == "def"; };
|
|
auto PredicateMatch = [&](StringRef S) {
|
|
return llvm::StringSwitch<int>(S)
|
|
.Case("abc", 0)
|
|
.Predicate(MatchFn, 1)
|
|
.Case("def", 2)
|
|
.Default(3);
|
|
};
|
|
EXPECT_EQ(0, PredicateMatch("abc"));
|
|
EXPECT_EQ(1, PredicateMatch("def"));
|
|
EXPECT_EQ(3, PredicateMatch("ghi"));
|
|
}
|
|
|
|
TEST(StringSwitchTest, DefaultUnreachable) {
|
|
auto Translate = [](StringRef S) {
|
|
return llvm::StringSwitch<int>(S)
|
|
.Case("A", 0)
|
|
.Case("B", 1)
|
|
.DefaultUnreachable("Unhandled case");
|
|
};
|
|
|
|
EXPECT_EQ(0, Translate("A"));
|
|
EXPECT_EQ(1, Translate("B"));
|
|
|
|
#if defined(GTEST_HAS_DEATH_TEST) && !defined(NDEBUG)
|
|
EXPECT_DEATH((void)Translate("C"), "Unhandled case");
|
|
#endif
|
|
}
|