OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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 SANDBOX_LINUX_BPF_DSL_CONS_H_ | 5 #ifndef SANDBOX_LINUX_BPF_DSL_CONS_H_ |
6 #define SANDBOX_LINUX_BPF_DSL_CONS_H_ | 6 #define SANDBOX_LINUX_BPF_DSL_CONS_H_ |
7 | 7 |
| 8 #include "base/macros.h" |
8 #include "base/memory/ref_counted.h" | 9 #include "base/memory/ref_counted.h" |
9 #include "sandbox/sandbox_export.h" | 10 #include "sandbox/sandbox_export.h" |
10 | 11 |
11 namespace sandbox { | 12 namespace sandbox { |
12 namespace cons { | 13 namespace cons { |
13 | 14 |
14 // Namespace cons provides an abstraction for immutable "cons list" | 15 // Namespace cons provides an abstraction for immutable "cons list" |
15 // data structures as commonly provided in functional programming | 16 // data structures as commonly provided in functional programming |
16 // languages like Lisp or Haskell. | 17 // languages like Lisp or Haskell. |
17 // | 18 // |
(...skipping 111 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
129 | 130 |
130 template <typename T> | 131 template <typename T> |
131 bool operator!=(const ListIterator<T>& lhs, const ListIterator<T>& rhs) { | 132 bool operator!=(const ListIterator<T>& lhs, const ListIterator<T>& rhs) { |
132 return !(lhs == rhs); | 133 return !(lhs == rhs); |
133 } | 134 } |
134 | 135 |
135 } // namespace cons | 136 } // namespace cons |
136 } // namespace sandbox | 137 } // namespace sandbox |
137 | 138 |
138 #endif // SANDBOX_LINUX_BPF_DSL_CONS_H_ | 139 #endif // SANDBOX_LINUX_BPF_DSL_CONS_H_ |
OLD | NEW |