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