OLD | NEW |
1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2013 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #ifndef NET_SPDY_SPDY_PRIORITY_FOREST_H_ | 5 #ifndef NET_SPDY_SPDY_PRIORITY_FOREST_H_ |
6 #define NET_SPDY_SPDY_PRIORITY_FOREST_H_ | 6 #define NET_SPDY_SPDY_PRIORITY_FOREST_H_ |
7 | 7 |
8 #include <map> | 8 #include <map> |
9 #include <set> | 9 #include <set> |
| 10 #include <vector> |
10 | 11 |
11 #include "base/basictypes.h" | 12 #include "base/basictypes.h" |
12 #include "base/containers/hash_tables.h" | 13 #include "base/containers/hash_tables.h" |
13 #include "base/logging.h" | 14 #include "base/logging.h" |
14 #include "base/memory/scoped_ptr.h" | 15 #include "base/memory/scoped_ptr.h" |
15 #include "base/rand_util.h" | 16 #include "base/rand_util.h" |
16 | 17 |
17 namespace net { | 18 namespace net { |
18 | 19 |
19 // This data structure implements the SPDY prioriziation data structures | 20 // This data structure implements the SPDY prioriziation data structures |
(...skipping 498 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
518 child_id = GetChild(child_id); | 519 child_id = GetChild(child_id); |
519 ++count; | 520 ++count; |
520 } | 521 } |
521 } | 522 } |
522 return true; | 523 return true; |
523 } | 524 } |
524 | 525 |
525 } // namespace net | 526 } // namespace net |
526 | 527 |
527 #endif // NET_SPDY_SPDY_PRIORITY_FOREST_H_ | 528 #endif // NET_SPDY_SPDY_PRIORITY_FOREST_H_ |
OLD | NEW |