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 | 10 |
11 #include "base/basictypes.h" | 11 #include "base/basictypes.h" |
12 #include "base/hash_tables.h" | 12 #include "base/containers/hash_tables.h" |
13 #include "base/logging.h" | 13 #include "base/logging.h" |
14 #include "base/memory/scoped_ptr.h" | 14 #include "base/memory/scoped_ptr.h" |
15 #include "base/rand_util.h" | 15 #include "base/rand_util.h" |
16 | 16 |
17 namespace net { | 17 namespace net { |
18 | 18 |
19 // This data structure implements the SPDY prioriziation data structures | 19 // This data structure implements the SPDY prioriziation data structures |
20 // defined in this document: http://go/spdy4-prioritization | 20 // defined in this document: http://go/spdy4-prioritization |
21 // | 21 // |
22 // Nodes can be added and removed, and dependencies between them defined. Each | 22 // Nodes can be added and removed, and dependencies between them defined. Each |
(...skipping 495 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
518 child_id = GetChild(child_id); | 518 child_id = GetChild(child_id); |
519 ++count; | 519 ++count; |
520 } | 520 } |
521 } | 521 } |
522 return true; | 522 return true; |
523 } | 523 } |
524 | 524 |
525 } // namespace net | 525 } // namespace net |
526 | 526 |
527 #endif // NET_SPDY_SPDY_PRIORITY_FOREST_H_ | 527 #endif // NET_SPDY_SPDY_PRIORITY_FOREST_H_ |
OLD | NEW |