// we expect the compiler to optimize things so that there's only one copy
// of the string literal "foo", even though we've got it in multiple places
- EXPECT_EQ(foo, foo2); // remember, this uses ==, not strcmp, so it's a ptr
- // comparison rather than lexical
+ EXPECT_EQ(foo, foo2); // remember, this uses ==, not strcmp, so it's a ptr
+ // comparison rather than lexical
// the string object creates copies though, so the c_str of these should be
// distinct
StringPiece s(foo);
EXPECT_EQ(s.size(), 3);
- EXPECT_EQ(s.start(), foo); // ptr comparison
- EXPECT_NE(s.start(), fooStr.c_str()); // ptr comparison
- EXPECT_NE(s.start(), foo2Str.c_str()); // ptr comparison
+ EXPECT_EQ(s.start(), foo); // ptr comparison
+ EXPECT_NE(s.start(), fooStr.c_str()); // ptr comparison
+ EXPECT_NE(s.start(), foo2Str.c_str()); // ptr comparison
- EXPECT_EQ(s.toString(), foo); // lexical comparison
- EXPECT_EQ(s.toString(), fooStr.c_str()); // lexical comparison
- EXPECT_EQ(s.toString(), foo2Str.c_str()); // lexical comparison
+ EXPECT_EQ(s.toString(), foo); // lexical comparison
+ EXPECT_EQ(s.toString(), fooStr.c_str()); // lexical comparison
+ EXPECT_EQ(s.toString(), foo2Str.c_str()); // lexical comparison
- EXPECT_EQ(s, foo); // lexical comparison
- EXPECT_EQ(s, fooStr); // lexical comparison
- EXPECT_EQ(s, foo2Str); // lexical comparison
+ EXPECT_EQ(s, foo); // lexical comparison
+ EXPECT_EQ(s, fooStr); // lexical comparison
+ EXPECT_EQ(s, foo2Str); // lexical comparison
EXPECT_EQ(foo, s);
// check using StringPiece to reference substrings
EXPECT_EQ(s.find("ba", 4), 6);
EXPECT_EQ(s.find("notfound"), StringPiece::npos);
EXPECT_EQ(s.find("notfound", 1), StringPiece::npos);
- EXPECT_EQ(s.find("bar", 4), StringPiece::npos); // starting position too far
+ EXPECT_EQ(s.find("bar", 4), StringPiece::npos); // starting position too far
// starting pos that is obviously past the end -- This works for std::string
EXPECT_EQ(s.toString().find("notfound", 55), StringPiece::npos);
EXPECT_EQ(s.find("z", s.size()), StringPiece::npos);
EXPECT_EQ(s.find('o', 2), 2);
EXPECT_EQ(s.find('y'), StringPiece::npos);
EXPECT_EQ(s.find('y', 1), StringPiece::npos);
- EXPECT_EQ(s.find('o', 4), StringPiece::npos); // starting position too far
+ EXPECT_EQ(s.find('o', 4), StringPiece::npos); // starting position too far
EXPECT_TRUE(s.contains('z'));
// starting pos that is obviously past the end -- This works for std::string
EXPECT_EQ(s.toString().find('y', 55), StringPiece::npos);
TEST(StringPiece, ToByteRange) {
StringPiece a("hello");
ByteRange b(a);
- EXPECT_EQ(static_cast<const void*>(a.begin()),
- static_cast<const void*>(b.begin()));
- EXPECT_EQ(static_cast<const void*>(a.end()),
- static_cast<const void*>(b.end()));
+ EXPECT_EQ(
+ static_cast<const void*>(a.begin()), static_cast<const void*>(b.begin()));
+ EXPECT_EQ(
+ static_cast<const void*>(a.end()), static_cast<const void*>(b.end()));
// and convert back again
StringPiece c(b);
EXPECT_EQ(s, p);
EXPECT_EQ(1, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 5), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("this", x);
- return 1;
- })));
+ EXPECT_EQ(std::next(s, 5), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("this", x);
+ return 1;
+ })));
EXPECT_EQ(2, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 8), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("is", x);
- return 2;
- })));
+ EXPECT_EQ(std::next(s, 8), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("is", x);
+ return 2;
+ })));
EXPECT_EQ(3, (p.split_step('u', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 10), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("j", x);
- return 3;
- })));
+ EXPECT_EQ(std::next(s, 10), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("j", x);
+ return 3;
+ })));
EXPECT_EQ(4, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 13), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("st", x);
- return 4;
- })));
+ EXPECT_EQ(std::next(s, 13), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("st", x);
+ return 4;
+ })));
EXPECT_EQ(5, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 14), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 5;
- })));
+ EXPECT_EQ(std::next(s, 14), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 5;
+ })));
EXPECT_EQ(6, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 16), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("a", x);
- return 6;
- })));
+ EXPECT_EQ(std::next(s, 16), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("a", x);
+ return 6;
+ })));
EXPECT_EQ(7, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 21), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("test", x);
- return 7;
- })));
+ EXPECT_EQ(std::next(s, 21), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("test", x);
+ return 7;
+ })));
EXPECT_EQ(8, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("string", x);
- return 8;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("string", x);
+ return 8;
+ })));
EXPECT_EQ(9, (p.split_step(' ', [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 9;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 9;
+ })));
- EXPECT_TRUE((std::is_same<
- void,
- decltype(p.split_step(' ', split_step_with_process_noop))
- >::value));
+ EXPECT_TRUE(
+ (std::is_same<
+ void,
+ decltype(p.split_step(' ', split_step_with_process_noop))>::value));
EXPECT_NO_THROW(p.split_step(' ', split_step_with_process_noop));
}
EXPECT_EQ(s, p);
EXPECT_EQ(1, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 6), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("this", x);
- return 1;
- })));
+ EXPECT_EQ(std::next(s, 6), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("this", x);
+ return 1;
+ })));
EXPECT_EQ(2, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 10), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("is", x);
- return 2;
- })));
+ EXPECT_EQ(std::next(s, 10), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("is", x);
+ return 2;
+ })));
EXPECT_EQ(3, (p.split_step("u", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 12), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("j", x);
- return 3;
- })));
+ EXPECT_EQ(std::next(s, 12), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("j", x);
+ return 3;
+ })));
EXPECT_EQ(4, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 16), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("st", x);
- return 4;
- })));
+ EXPECT_EQ(std::next(s, 16), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("st", x);
+ return 4;
+ })));
EXPECT_EQ(5, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 18), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 5;
- })));
+ EXPECT_EQ(std::next(s, 18), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 5;
+ })));
EXPECT_EQ(6, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 21), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("a", x);
- return 6;
- })));
+ EXPECT_EQ(std::next(s, 21), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("a", x);
+ return 6;
+ })));
EXPECT_EQ(7, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(std::next(s, 28), p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ(" test", x);
- return 7;
- })));
+ EXPECT_EQ(std::next(s, 28), p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ(" test", x);
+ return 7;
+ })));
EXPECT_EQ(8, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("string", x);
- return 8;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("string", x);
+ return 8;
+ })));
EXPECT_EQ(9, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 9;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 9;
+ })));
EXPECT_EQ(10, (p.split_step(" ", [&](folly::StringPiece x) {
- EXPECT_EQ(e, p.begin());
- EXPECT_EQ(e, p.end());
- EXPECT_EQ("", x);
- return 10;
- })));
+ EXPECT_EQ(e, p.begin());
+ EXPECT_EQ(e, p.end());
+ EXPECT_EQ("", x);
+ return 10;
+ })));
- EXPECT_TRUE((std::is_same<
- void,
- decltype(p.split_step(' ', split_step_with_process_noop))
- >::value));
+ EXPECT_TRUE(
+ (std::is_same<
+ void,
+ decltype(p.split_step(' ', split_step_with_process_noop))>::value));
EXPECT_NO_THROW(p.split_step(' ', split_step_with_process_noop));
}
EXPECT_EQ(e, p.end());
EXPECT_EQ(s, p);
- auto const functor = [](
- folly::StringPiece s,
- folly::StringPiece expected
- ) {
+ auto const functor = [](folly::StringPiece s, folly::StringPiece expected) {
EXPECT_EQ(expected, s);
return expected;
};
EXPECT_EQ(e, p.end());
EXPECT_EQ(s, p);
- auto const functor = [](
- folly::StringPiece s,
- folly::StringPiece expected
- ) {
+ auto const functor = [](folly::StringPiece s, folly::StringPiece expected) {
EXPECT_EQ(expected, s);
return expected;
};
TEST(StringPiece, NoInvalidImplicitConversions) {
struct IsString {
- bool operator()(folly::Range<int*>) { return false; }
- bool operator()(folly::StringPiece) { return true; }
+ bool operator()(folly::Range<int*>) {
+ return false;
+ }
+ bool operator()(folly::StringPiece) {
+ return true;
+ }
};
std::string s = "hello";
}
};
-typedef ::testing::Types<SseNeedleFinder,
- NoSseNeedleFinder,
- ByteSetNeedleFinder> NeedleFinders;
+using NeedleFinders =
+ ::testing::Types<SseNeedleFinder, NoSseNeedleFinder, ByteSetNeedleFinder>;
TYPED_TEST_CASE(NeedleFinderTest, NeedleFinders);
TYPED_TEST(NeedleFinderTest, Null) {
// string(s1.data(), s1.size()).c_str(), s1.size(),
// string(s2.data(), s2.size()).c_str(), s2.size());
auto r1 = this->find_first_byte_of(s1, s2);
- auto f1 = std::find_first_of(s1.begin(), s1.end(),
- s2.begin(), s2.end());
+ auto f1 =
+ std::find_first_of(s1.begin(), s1.end(), s2.begin(), s2.end());
auto e1 = (f1 == s1.end()) ? StringPiece::npos : f1 - s1.begin();
EXPECT_EQ(r1, e1);
auto r2 = this->find_first_byte_of(s2, s1);
- auto f2 = std::find_first_of(s2.begin(), s2.end(),
- s1.begin(), s1.end());
+ auto f2 =
+ std::find_first_of(s2.begin(), s2.end(), s1.begin(), s1.end());
auto e2 = (f2 == s2.end()) ? StringPiece::npos : f2 - s2.begin();
EXPECT_EQ(r2, e2);
freeProtectedBuf(buf1);
}
TEST(RangeFunc, CArray) {
- int x[] {1, 2, 3, 4};
+ int x[]{1, 2, 3, 4};
testRangeFunc(x, 4);
}
EXPECT_EQ(2, numCollRangeSize);
}
-std::string get_rand_str(size_t size,
- std::uniform_int_distribution<>& dist,
- std::mt19937& gen) {
+std::string get_rand_str(
+ size_t size,
+ std::uniform_int_distribution<>& dist,
+ std::mt19937& gen) {
std::string ret(size, '\0');
for (size_t i = 0; i < size; ++i) {
ret[i] = static_cast<char>(dist(gen));
std::mt19937 gen(rd());
std::uniform_int_distribution<> dist('a', 'z');
- for (int i=0; i < 100; ++i) {
+ for (int i = 0; i < 100; ++i) {
for (size_t j = 1; j <= msp.size(); ++j) {
auto replacement = get_rand_str(j, dist, gen);
for (size_t pos = 0; pos < msp.size() - j; ++pos) {
std::mt19937 gen(rd());
std::uniform_int_distribution<> dist('A', 'Z');
- for (int i=0; i < 100; ++i) {
+ for (int i = 0; i < 100; ++i) {
for (size_t j = 1; j <= orig.size(); ++j) {
auto replacement = get_rand_str(j, dist, gen);
for (size_t pos = 0; pos < msp.size() - j; ++pos) {
auto fst = "longer";
auto snd = "small";
char input[] = "meh meh meh";
- auto all = MutableStringPiece(input);
+ auto all = MutableStringPiece(input);
try {
all.replaceAll(fst, snd);
projects / folly.git / blobdiff