OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2013 Google Inc. All rights reserved. | 2 * Copyright (C) 2013 Google Inc. All rights reserved. |
3 * | 3 * |
4 * Redistribution and use in source and binary forms, with or without | 4 * Redistribution and use in source and binary forms, with or without |
5 * modification, are permitted provided that the following conditions are | 5 * modification, are permitted provided that the following conditions are |
6 * met: | 6 * met: |
7 * | 7 * |
8 * * Redistributions of source code must retain the above copyright | 8 * * Redistributions of source code must retain the above copyright |
9 * notice, this list of conditions and the following disclaimer. | 9 * notice, this list of conditions and the following disclaimer. |
10 * * Redistributions in binary form must reproduce the above | 10 * * Redistributions in binary form must reproduce the above |
(...skipping 13 matching lines...) Expand all Loading... |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #ifndef TreeNode_h | 31 #ifndef TreeNode_h |
32 #define TreeNode_h | 32 #define TreeNode_h |
33 | 33 |
34 #include "wtf/Assertions.h" | 34 #include "platform/wtf/Assertions.h" |
35 | 35 |
36 namespace WTF { | 36 namespace WTF { |
37 | 37 |
38 // | 38 // |
39 // TreeNode is generic, ContainerNode-like linked tree data structure. | 39 // TreeNode is generic, ContainerNode-like linked tree data structure. |
40 // There are a few notable difference between TreeNode and Node: | 40 // There are a few notable difference between TreeNode and Node: |
41 // | 41 // |
42 // * Each TreeNode node is NOT ref counted. The user have to retain its | 42 // * Each TreeNode node is NOT ref counted. The user have to retain its |
43 // lifetime somehow. | 43 // lifetime somehow. |
44 // FIXME: lifetime management could be parameterized so that ref counted | 44 // FIXME: lifetime management could be parameterized so that ref counted |
(...skipping 158 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
203 return next; | 203 return next; |
204 } | 204 } |
205 | 205 |
206 } // namespace WTF | 206 } // namespace WTF |
207 | 207 |
208 using WTF::TreeNode; | 208 using WTF::TreeNode; |
209 using WTF::traverseNext; | 209 using WTF::traverseNext; |
210 using WTF::traverseNextPostOrder; | 210 using WTF::traverseNextPostOrder; |
211 | 211 |
212 #endif | 212 #endif |
OLD | NEW |