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 340 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
351 | 351 |
352 Node& ComposedTreeTraversal::lastWithinOrSelf(const Node& node) | 352 Node& ComposedTreeTraversal::lastWithinOrSelf(const Node& node) |
353 { | 353 { |
354 assertPrecondition(node); | 354 assertPrecondition(node); |
355 Node* lastDescendant = lastWithin(node); | 355 Node* lastDescendant = lastWithin(node); |
356 Node& result = lastDescendant ? *lastDescendant : const_cast<Node&>(node); | 356 Node& result = lastDescendant ? *lastDescendant : const_cast<Node&>(node); |
357 assertPostcondition(&result); | 357 assertPostcondition(&result); |
358 return result; | 358 return result; |
359 } | 359 } |
360 | 360 |
361 } // namespace | 361 } // namespace blink |
OLD | NEW |