| 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 179 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 190 return 0; | 190 return 0; |
| 191 | 191 |
| 192 typename TreeNode<T>::NodeType* next = current->next(); | 192 typename TreeNode<T>::NodeType* next = current->next(); |
| 193 if (!next) | 193 if (!next) |
| 194 return current->parent(); | 194 return current->parent(); |
| 195 while (next->firstChild()) | 195 while (next->firstChild()) |
| 196 next = next->firstChild(); | 196 next = next->firstChild(); |
| 197 return next; | 197 return next; |
| 198 } | 198 } |
| 199 | 199 |
| 200 } | 200 } // namespace WTF |
| 201 | 201 |
| 202 using WTF::TreeNode; | 202 using WTF::TreeNode; |
| 203 using WTF::traverseNext; | 203 using WTF::traverseNext; |
| 204 using WTF::traverseNextPostOrder; | 204 using WTF::traverseNextPostOrder; |
| 205 | 205 |
| 206 #endif | 206 #endif |
| OLD | NEW |