| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2005, 2008 Apple Inc. All rights reserved. | 2 * Copyright (C) 2005, 2008 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 31 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 42 // NOTE: Various callers rely on the fact that the original node becomes | 42 // NOTE: Various callers rely on the fact that the original node becomes |
| 43 // the second node (i.e. the new node is inserted before the existing one). | 43 // the second node (i.e. the new node is inserted before the existing one). |
| 44 // That is not a fundamental dependency (i.e. it could be re-coded), but | 44 // That is not a fundamental dependency (i.e. it could be re-coded), but |
| 45 // rather is based on how this code happens to work. | 45 // rather is based on how this code happens to work. |
| 46 ASSERT(m_text2); | 46 ASSERT(m_text2); |
| 47 ASSERT(m_text2->length() > 0); | 47 ASSERT(m_text2->length() > 0); |
| 48 ASSERT(m_offset > 0); | 48 ASSERT(m_offset > 0); |
| 49 ASSERT(m_offset < m_text2->length()); | 49 ASSERT(m_offset < m_text2->length()); |
| 50 } | 50 } |
| 51 | 51 |
| 52 void SplitTextNodeCommand::doApply() | 52 void SplitTextNodeCommand::doApply(EditingState*) |
| 53 { | 53 { |
| 54 ContainerNode* parent = m_text2->parentNode(); | 54 ContainerNode* parent = m_text2->parentNode(); |
| 55 if (!parent || !parent->hasEditableStyle()) | 55 if (!parent || !parent->hasEditableStyle()) |
| 56 return; | 56 return; |
| 57 | 57 |
| 58 String prefixText = m_text2->substringData(0, m_offset, IGNORE_EXCEPTION); | 58 String prefixText = m_text2->substringData(0, m_offset, IGNORE_EXCEPTION); |
| 59 if (prefixText.isEmpty()) | 59 if (prefixText.isEmpty()) |
| 60 return; | 60 return; |
| 61 | 61 |
| 62 m_text1 = Text::create(document(), prefixText); | 62 m_text1 = Text::create(document(), prefixText); |
| (...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 103 } | 103 } |
| 104 | 104 |
| 105 DEFINE_TRACE(SplitTextNodeCommand) | 105 DEFINE_TRACE(SplitTextNodeCommand) |
| 106 { | 106 { |
| 107 visitor->trace(m_text1); | 107 visitor->trace(m_text1); |
| 108 visitor->trace(m_text2); | 108 visitor->trace(m_text2); |
| 109 SimpleEditCommand::trace(visitor); | 109 SimpleEditCommand::trace(visitor); |
| 110 } | 110 } |
| 111 | 111 |
| 112 } // namespace blink | 112 } // namespace blink |
| OLD | NEW |