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 #include "net/quic/crypto/strike_register.h" | 5 #include "net/quic/crypto/strike_register.h" |
6 | 6 |
| 7 #include <algorithm> |
7 #include <limits> | 8 #include <limits> |
8 | 9 |
9 #include "base/logging.h" | 10 #include "base/logging.h" |
10 | 11 |
11 using std::pair; | 12 using std::pair; |
12 using std::set; | 13 using std::set; |
13 using std::vector; | 14 using std::vector; |
14 | 15 |
15 namespace net { | 16 namespace net { |
16 | 17 |
(...skipping 491 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
508 CHECK_EQ(free_internal_nodes.count(inter), 0u); | 509 CHECK_EQ(free_internal_nodes.count(inter), 0u); |
509 CHECK_EQ(used_internal_nodes->count(inter), 0u); | 510 CHECK_EQ(used_internal_nodes->count(inter), 0u); |
510 used_internal_nodes->insert(inter); | 511 used_internal_nodes->insert(inter); |
511 ValidateTree(inter, bit, bits, free_internal_nodes, free_external_nodes, | 512 ValidateTree(inter, bit, bits, free_internal_nodes, free_external_nodes, |
512 used_internal_nodes, used_external_nodes); | 513 used_internal_nodes, used_external_nodes); |
513 } | 514 } |
514 } | 515 } |
515 } | 516 } |
516 | 517 |
517 } // namespace net | 518 } // namespace net |
OLD | NEW |