| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2012 Google Inc. All rights reserved. | 2 * Copyright (C) 2012 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 * * Neither the name of Google Inc. nor the names of its | 10 * * Neither the name of Google Inc. nor the names of its |
| (...skipping 291 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 302 inline Node* ComposedTreeTraversal::traverseFirstChild(const Node& node) | 302 inline Node* ComposedTreeTraversal::traverseFirstChild(const Node& node) |
| 303 { | 303 { |
| 304 return traverseChild(node, TraversalDirectionForward); | 304 return traverseChild(node, TraversalDirectionForward); |
| 305 } | 305 } |
| 306 | 306 |
| 307 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node) | 307 inline Node* ComposedTreeTraversal::traverseLastChild(const Node& node) |
| 308 { | 308 { |
| 309 return traverseChild(node, TraversalDirectionBackward); | 309 return traverseChild(node, TraversalDirectionBackward); |
| 310 } | 310 } |
| 311 | 311 |
| 312 } // namespace | 312 } // namespace blink |
| 313 | 313 |
| 314 #endif | 314 #endif |
| OLD | NEW |