Avoid string construction overhead for lookup-only HpackEntry objects.

net/spdy/hpack/hpack_header_table_test.cc

 // Copyright 2014 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "net/spdy/hpack/hpack_header_table.h"
 
 #include <algorithm>
 #include <set>
 #include <string>
 #include <vector>
@@ skipping 61 matching lines @@
  protected:
   typedef std::vector<HpackEntry> HpackEntryVector;
 
   HpackHeaderTableTest() : table_(), peer_(&table_) {}
 
   // Returns an entry whose Size() is equal to the given one.
   static HpackEntry MakeEntryOfSize(uint32 size) {
     EXPECT_GE(size, HpackEntry::kSizeOverhead);
     string name((size - HpackEntry::kSizeOverhead) / 2, 'n');
     string value(size - HpackEntry::kSizeOverhead - name.size(), 'v');
-    HpackEntry entry(name, value);
+    HpackEntry entry(name, value, false, 0);
     EXPECT_EQ(size, entry.Size());
     return entry;
   }
 
   // Returns a vector of entries whose total size is equal to the given
   // one.
   static HpackEntryVector MakeEntriesOfTotalSize(uint32 total_size) {
     EXPECT_GE(total_size, HpackEntry::kSizeOverhead);
     uint32 entry_size = HpackEntry::kSizeOverhead;
     uint32 remaining_size = total_size;
@@ skipping 342 matching lines @@
   HpackEntry entry2(DynamicEntry("name", "value"));
 
   HpackHeaderTable::EntryComparator comparator;
   EXPECT_FALSE(comparator(&entry1, &entry1));
   EXPECT_FALSE(comparator(&entry2, &entry2));
 }
 
 }  // namespace
 
 }  // namespace net