| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2006, 2009 Apple Inc. All rights reserved. | 2 * Copyright (C) 2004, 2006, 2009 Apple 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 | 5 * modification, are permitted provided that the following conditions |
| 6 * are met: | 6 * are met: |
| 7 * 1. Redistributions of source code must retain the above copyright | 7 * 1. Redistributions of source code must retain the above copyright |
| 8 * notice, this list of conditions and the following disclaimer. | 8 * notice, this list of conditions and the following disclaimer. |
| 9 * 2. Redistributions in binary form must reproduce the above copyright | 9 * 2. Redistributions in binary form must reproduce the above copyright |
| 10 * notice, this list of conditions and the following disclaimer in the | 10 * notice, this list of conditions and the following disclaimer in the |
| (...skipping 212 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 223 // The range. | 223 // The range. |
| 224 Member<Node> start_container_; | 224 Member<Node> start_container_; |
| 225 int start_offset_; | 225 int start_offset_; |
| 226 Member<Node> end_container_; | 226 Member<Node> end_container_; |
| 227 int end_offset_; | 227 int end_offset_; |
| 228 // |m_endNode| stores |Strategy::childAt(*m_endContainer, m_endOffset - 1)|, | 228 // |m_endNode| stores |Strategy::childAt(*m_endContainer, m_endOffset - 1)|, |
| 229 // if it exists, or |nullptr| otherwise. | 229 // if it exists, or |nullptr| otherwise. |
| 230 Member<Node> end_node_; | 230 Member<Node> end_node_; |
| 231 Member<Node> past_end_node_; | 231 Member<Node> past_end_node_; |
| 232 | 232 |
| 233 // The current text node, from which text is being emitted. |
| 234 Member<Text> text_node_; |
| 235 |
| 233 // Used when there is still some pending text from the current node; when | 236 // Used when there is still some pending text from the current node; when |
| 234 // these are false and 0, we go back to normal iterating. | 237 // these are false and 0, we go back to normal iterating. |
| 235 bool needs_another_newline_; | 238 bool needs_another_newline_; |
| 236 InlineTextBox* text_box_; | 239 InlineTextBox* text_box_; |
| 237 // Used when iteration over :first-letter text to save pointer to | 240 // Used when iteration over :first-letter text to save pointer to |
| 238 // remaining text box. | 241 // remaining text box. |
| 239 InlineTextBox* remaining_text_box_; | 242 InlineTextBox* remaining_text_box_; |
| 240 // Used to point to LayoutText object for :first-letter. | 243 // Used to point to LayoutText object for :first-letter. |
| 241 LayoutText* first_letter_text_; | 244 LayoutText* first_letter_text_; |
| 242 | 245 |
| (...skipping 27 matching lines...) Expand all Loading... |
| 270 TextIteratorAlgorithm<EditingStrategy>; | 273 TextIteratorAlgorithm<EditingStrategy>; |
| 271 extern template class CORE_EXTERN_TEMPLATE_EXPORT | 274 extern template class CORE_EXTERN_TEMPLATE_EXPORT |
| 272 TextIteratorAlgorithm<EditingInFlatTreeStrategy>; | 275 TextIteratorAlgorithm<EditingInFlatTreeStrategy>; |
| 273 | 276 |
| 274 using TextIterator = TextIteratorAlgorithm<EditingStrategy>; | 277 using TextIterator = TextIteratorAlgorithm<EditingStrategy>; |
| 275 using TextIteratorInFlatTree = TextIteratorAlgorithm<EditingInFlatTreeStrategy>; | 278 using TextIteratorInFlatTree = TextIteratorAlgorithm<EditingInFlatTreeStrategy>; |
| 276 | 279 |
| 277 } // namespace blink | 280 } // namespace blink |
| 278 | 281 |
| 279 #endif // TextIterator_h | 282 #endif // TextIterator_h |
| OLD | NEW |