Remove SpdyStringPiece; use QuicheStringPiece instead.
gfe-relnote: n/a, no functional change.
PiperOrigin-RevId: 288029999
Change-Id: If83322cadaac9647f246fa8ef18f5ce870995aa3
diff --git a/spdy/core/spdy_header_block_test.cc b/spdy/core/spdy_header_block_test.cc
index 7695aad..aad264c 100644
--- a/spdy/core/spdy_header_block_test.cc
+++ b/spdy/core/spdy_header_block_test.cc
@@ -17,11 +17,14 @@
class ValueProxyPeer {
public:
- static SpdyStringPiece key(SpdyHeaderBlock::ValueProxy* p) { return p->key_; }
+ static quiche::QuicheStringPiece key(SpdyHeaderBlock::ValueProxy* p) {
+ return p->key_;
+ }
};
-std::pair<SpdyStringPiece, SpdyStringPiece> Pair(SpdyStringPiece k,
- SpdyStringPiece v) {
+std::pair<quiche::QuicheStringPiece, quiche::QuicheStringPiece> Pair(
+ quiche::QuicheStringPiece k,
+ quiche::QuicheStringPiece v) {
return std::make_pair(k, v);
}
@@ -39,19 +42,20 @@
TEST(SpdyHeaderBlockTest, KeyMemoryReclaimedOnLookup) {
SpdyHeaderBlock block;
- SpdyStringPiece copied_key1;
+ quiche::QuicheStringPiece copied_key1;
{
auto proxy1 = block["some key name"];
copied_key1 = ValueProxyPeer::key(&proxy1);
}
- SpdyStringPiece copied_key2;
+ quiche::QuicheStringPiece copied_key2;
{
auto proxy2 = block["some other key name"];
copied_key2 = ValueProxyPeer::key(&proxy2);
}
// Because proxy1 was never used to modify the block, the memory used for the
// key could be reclaimed and used for the second call to operator[].
- // Therefore, we expect the pointers of the two SpdyStringPieces to be equal.
+ // Therefore, we expect the pointers of the two QuicheStringPieces to be
+ // equal.
EXPECT_EQ(copied_key1.data(), copied_key2.data());
{
@@ -189,25 +193,25 @@
EXPECT_EQ("singleton", block["h4"]);
}
-TEST(SpdyHeaderBlockTest, CompareValueToSpdyStringPiece) {
+TEST(SpdyHeaderBlockTest, CompareValueToStringPiece) {
SpdyHeaderBlock block;
block["foo"] = "foo";
block.AppendValueOrAddHeader("foo", "bar");
const auto& val = block["foo"];
const char expected[] = "foo\0bar";
- EXPECT_TRUE(SpdyStringPiece(expected, 7) == val);
- EXPECT_TRUE(val == SpdyStringPiece(expected, 7));
- EXPECT_FALSE(SpdyStringPiece(expected, 3) == val);
- EXPECT_FALSE(val == SpdyStringPiece(expected, 3));
+ EXPECT_TRUE(quiche::QuicheStringPiece(expected, 7) == val);
+ EXPECT_TRUE(val == quiche::QuicheStringPiece(expected, 7));
+ EXPECT_FALSE(quiche::QuicheStringPiece(expected, 3) == val);
+ EXPECT_FALSE(val == quiche::QuicheStringPiece(expected, 3));
const char not_expected[] = "foo\0barextra";
- EXPECT_FALSE(SpdyStringPiece(not_expected, 12) == val);
- EXPECT_FALSE(val == SpdyStringPiece(not_expected, 12));
+ EXPECT_FALSE(quiche::QuicheStringPiece(not_expected, 12) == val);
+ EXPECT_FALSE(val == quiche::QuicheStringPiece(not_expected, 12));
const auto& val2 = block["foo2"];
- EXPECT_FALSE(SpdyStringPiece(expected, 7) == val2);
- EXPECT_FALSE(val2 == SpdyStringPiece(expected, 7));
- EXPECT_FALSE(SpdyStringPiece("") == val2);
- EXPECT_FALSE(val2 == SpdyStringPiece(""));
+ EXPECT_FALSE(quiche::QuicheStringPiece(expected, 7) == val2);
+ EXPECT_FALSE(val2 == quiche::QuicheStringPiece(expected, 7));
+ EXPECT_FALSE(quiche::QuicheStringPiece("") == val2);
+ EXPECT_FALSE(val2 == quiche::QuicheStringPiece(""));
}
// This test demonstrates that the SpdyHeaderBlock data structure does not place