| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. | 2 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2012 Apple Inc. All r
ights reserved. |
| 3 * Copyright (C) 2005 Alexey Proskuryakov. | 3 * Copyright (C) 2005 Alexey Proskuryakov. |
| 4 * | 4 * |
| 5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
| 6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
| 7 * are met: | 7 * are met: |
| 8 * 1. Redistributions of source code must retain the above copyright | 8 * 1. 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 * 2. Redistributions in binary form must reproduce the above copyright | 10 * 2. Redistributions in binary form must reproduce the above copyright |
| (...skipping 303 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 314 else if (Node* child = NodeTraversal::childAt(*startContainer, startOffset)) | 314 else if (Node* child = NodeTraversal::childAt(*startContainer, startOffset)) |
| 315 m_node = child; | 315 m_node = child; |
| 316 else if (!startOffset) | 316 else if (!startOffset) |
| 317 m_node = startContainer; | 317 m_node = startContainer; |
| 318 else | 318 else |
| 319 m_node = NodeTraversal::nextSkippingChildren(*startContainer); | 319 m_node = NodeTraversal::nextSkippingChildren(*startContainer); |
| 320 | 320 |
| 321 if (!m_node) | 321 if (!m_node) |
| 322 return; | 322 return; |
| 323 | 323 |
| 324 m_node->document().updateLayoutIgnorePendingStylesheets(); | 324 m_node->document().updateLayout(); |
| 325 | 325 |
| 326 setUpFullyClippedStack(m_fullyClippedStack, m_node); | 326 setUpFullyClippedStack(m_fullyClippedStack, m_node); |
| 327 m_offset = m_node == m_startContainer ? m_startOffset : 0; | 327 m_offset = m_node == m_startContainer ? m_startOffset : 0; |
| 328 m_iterationProgress = HandledNone; | 328 m_iterationProgress = HandledNone; |
| 329 | 329 |
| 330 // Calculate first out of bounds node. | 330 // Calculate first out of bounds node. |
| 331 m_pastEndNode = nextInPreOrderCrossingShadowBoundaries(endContainer, endOffs
et); | 331 m_pastEndNode = nextInPreOrderCrossingShadowBoundaries(endContainer, endOffs
et); |
| 332 | 332 |
| 333 // Identify the first run. | 333 // Identify the first run. |
| 334 advance(); | 334 advance(); |
| (...skipping 1547 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1882 resultEnd = collapseTo; | 1882 resultEnd = collapseTo; |
| 1883 return; | 1883 return; |
| 1884 } | 1884 } |
| 1885 } | 1885 } |
| 1886 | 1886 |
| 1887 CharacterIterator computeRangeIterator(inputStart, inputEnd, iteratorFlagsFo
rFindPlainText); | 1887 CharacterIterator computeRangeIterator(inputStart, inputEnd, iteratorFlagsFo
rFindPlainText); |
| 1888 calculateCharacterSubrange(computeRangeIterator, matchStart, matchLength, re
sultStart, resultEnd); | 1888 calculateCharacterSubrange(computeRangeIterator, matchStart, matchLength, re
sultStart, resultEnd); |
| 1889 } | 1889 } |
| 1890 | 1890 |
| 1891 } | 1891 } |
| OLD | NEW |