Test dead code.

net/spdy/spdy_priority_tree_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/spdy_priority_tree.h"
 
 #include "base/basictypes.h"
+#include "testing/gmock/include/gmock/gmock.h"
 #include "testing/gtest/include/gtest/gtest.h"
 
 namespace net {
 
 namespace test {
 
 template <typename NodeId>
 class SpdyPriorityTreePeer {
  public:
   explicit SpdyPriorityTreePeer(SpdyPriorityTree<NodeId>* tree) : tree_(tree) {}
@@ skipping 10 matching lines @@
   SpdyPriorityTree<uint32> tree;
   EXPECT_EQ(1, tree.num_nodes());
   EXPECT_TRUE(tree.NodeExists(0));
   EXPECT_FALSE(tree.NodeExists(1));
 
   EXPECT_TRUE(tree.AddNode(1, 0, 100, false));
   EXPECT_EQ(2, tree.num_nodes());
   ASSERT_TRUE(tree.NodeExists(1));
   EXPECT_EQ(100, tree.GetWeight(1));
   EXPECT_FALSE(tree.NodeExists(5));
+  EXPECT_THAT(tree.GetChildren(0),
+              ::testing::Pointee(::testing::ElementsAre(1)));
 
   EXPECT_TRUE(tree.AddNode(5, 0, 50, false));
   // Should not be able to add a node with an id that already exists.
   EXPECT_FALSE(tree.AddNode(5, 1, 50, false));
   EXPECT_EQ(3, tree.num_nodes());
   EXPECT_TRUE(tree.NodeExists(1));
   ASSERT_TRUE(tree.NodeExists(5));
   EXPECT_EQ(50, tree.GetWeight(5));
   EXPECT_FALSE(tree.NodeExists(13));
 
@@ skipping 16 matching lines @@
 
   // The parent node 19 doesn't exist, so this should fail:
   EXPECT_FALSE(tree.AddNode(7, 19, 70, false));
   // This should succeed, creating node 7:
   EXPECT_TRUE(tree.AddNode(7, 13, 70, false));
   // Now node 7 already exists, so this should fail:
   EXPECT_FALSE(tree.AddNode(7, 1, 70, false));
   // Try adding a second child to node 13:
   EXPECT_TRUE(tree.AddNode(17, 13, 170, false));
 
+  // TODO(birenroy): Add a separate test that verifies weight invariants when
+  // SetWeight is called.
+  EXPECT_TRUE(tree.SetWeight(17, 150));
+  EXPECT_EQ(150, tree.GetWeight(17));
+
   ASSERT_TRUE(tree.ValidateInvariantsForTests());
 }
 
 TEST(SpdyPriorityTreeTest, SetParent) {
   SpdyPriorityTree<uint32> tree;
   tree.AddNode(1, 0, 100, false);
   tree.AddNode(2, 1, 20, false);
   tree.AddNode(3, 2, 30, false);
   tree.AddNode(5, 3, 50, false);
   tree.AddNode(7, 5, 70, false);
@@ skipping 306 matching lines @@
   EXPECT_EQ(3, tree.GetWeight(4));
   EXPECT_EQ(3, tree.GetWeight(5));
   // 2.5 rounded up = 3.
   EXPECT_EQ(3, tree.GetWeight(6));
   EXPECT_EQ(3, tree.GetWeight(7));
   // 0 is not a valid weight, so round up to 1.
   EXPECT_EQ(1, tree.GetWeight(8));
 }
 }  // namespace test
 }  // namespace gfe_spdy