Searched refs:NodeExists (Results 1 - 4 of 4) sorted by relevance

/external/chromium_org/net/spdy/
H A Dspdy_priority_forest_test.cc15 EXPECT_FALSE(forest.NodeExists(1));
19 ASSERT_TRUE(forest.NodeExists(1));
21 EXPECT_FALSE(forest.NodeExists(5));
26 EXPECT_TRUE(forest.NodeExists(1));
27 ASSERT_TRUE(forest.NodeExists(5));
29 EXPECT_FALSE(forest.NodeExists(13));
33 EXPECT_TRUE(forest.NodeExists(1));
34 EXPECT_TRUE(forest.NodeExists(5));
35 ASSERT_TRUE(forest.NodeExists(13));
41 EXPECT_TRUE(forest.NodeExists(
[all...]
H A Dspdy_priority_forest.h42 bool NodeExists(NodeId node_id) const;
163 bool SpdyPriorityForest<NodeId, Priority>::NodeExists(NodeId node_id) const { function in class:net::SpdyPriorityForest
170 if (NodeExists(node_id)) {
182 if (NodeExists(node_id) || !NodeExists(parent_id)) {
200 if (!NodeExists(node_id)) {
208 DCHECK(NodeExists(node.depends_on.parent_id));
216 DCHECK(NodeExists(node.child));
279 if (!NodeExists(node_id)) {
286 DCHECK(NodeExists(nod
[all...]
H A Dspdy_priority_tree_test.cc30 EXPECT_TRUE(tree.NodeExists(0));
31 EXPECT_FALSE(tree.NodeExists(1));
35 ASSERT_TRUE(tree.NodeExists(1));
37 EXPECT_FALSE(tree.NodeExists(5));
43 EXPECT_TRUE(tree.NodeExists(1));
44 ASSERT_TRUE(tree.NodeExists(5));
46 EXPECT_FALSE(tree.NodeExists(13));
50 EXPECT_TRUE(tree.NodeExists(1));
51 EXPECT_TRUE(tree.NodeExists(5));
52 ASSERT_TRUE(tree.NodeExists(1
[all...]
H A Dspdy_priority_tree.h86 bool NodeExists(NodeId node_id) const;
202 bool SpdyPriorityTree<NodeId>::NodeExists(NodeId node_id) const { function in class:net::SpdyPriorityTree
211 if (NodeExists(node_id) || !NodeExists(parent_id)) {
246 if (node_id == static_cast<NodeId>(kRootNodeId) || !NodeExists(node_id)) {
251 DCHECK(NodeExists(node.parent_id));
313 if (!NodeExists(node_id)) {
333 if (!NodeExists(node_id) || !NodeExists(parent_id)) {
356 DCHECK(NodeExists(last_i
[all...]

Completed in 85 milliseconds