Chromium Code Reviews| 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 882 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 893 || node.hasTagName(hrTag) | 893 || node.hasTagName(hrTag) |
| 894 || node.hasTagName(liTag) | 894 || node.hasTagName(liTag) |
| 895 || node.hasTagName(listingTag) | 895 || node.hasTagName(listingTag) |
| 896 || node.hasTagName(olTag) | 896 || node.hasTagName(olTag) |
| 897 || node.hasTagName(pTag) | 897 || node.hasTagName(pTag) |
| 898 || node.hasTagName(preTag) | 898 || node.hasTagName(preTag) |
| 899 || node.hasTagName(trTag) | 899 || node.hasTagName(trTag) |
| 900 || node.hasTagName(ulTag)); | 900 || node.hasTagName(ulTag)); |
| 901 } | 901 } |
| 902 | 902 |
| 903 // Need to make an exception for option and optgroup, because we want to | |
| 904 // keep the legacy behavior before we added renderers to them. | |
| 905 if (isHTMLOptionElement(&node) || isHTMLOptGroupElement(&node)) | |
|
tkent
2014/07/08 04:43:45
&s are unnecessary.
keishi
2014/07/10 09:48:03
Done.
| |
| 906 return false; | |
| 907 | |
| 903 // Need to make an exception for table cells, because they are blocks, but w e | 908 // Need to make an exception for table cells, because they are blocks, but w e |
| 904 // want them tab-delimited rather than having newlines before and after. | 909 // want them tab-delimited rather than having newlines before and after. |
| 905 if (isTableCell(&node)) | 910 if (isTableCell(&node)) |
| 906 return false; | 911 return false; |
| 907 | 912 |
| 908 // Need to make an exception for table row elements, because they are neithe r | 913 // Need to make an exception for table row elements, because they are neithe r |
| 909 // "inline" or "RenderBlock", but we want newlines for them. | 914 // "inline" or "RenderBlock", but we want newlines for them. |
| 910 if (r->isTableRow()) { | 915 if (r->isTableRow()) { |
| 911 RenderTable* t = toRenderTableRow(r)->table(); | 916 RenderTable* t = toRenderTableRow(r)->table(); |
| 912 if (t && !t->isInline()) | 917 if (t && !t->isInline()) |
| (...skipping 1297 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 2210 resultEnd = collapseTo; | 2215 resultEnd = collapseTo; |
| 2211 return; | 2216 return; |
| 2212 } | 2217 } |
| 2213 } | 2218 } |
| 2214 | 2219 |
| 2215 CharacterIterator computeRangeIterator(inputStart, inputEnd, iteratorFlagsFo rFindPlainText); | 2220 CharacterIterator computeRangeIterator(inputStart, inputEnd, iteratorFlagsFo rFindPlainText); |
| 2216 calculateCharacterSubrange(computeRangeIterator, matchStart, matchLength, re sultStart, resultEnd); | 2221 calculateCharacterSubrange(computeRangeIterator, matchStart, matchLength, re sultStart, resultEnd); |
| 2217 } | 2222 } |
| 2218 | 2223 |
| 2219 } | 2224 } |
| OLD | NEW |