OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2005, 2006, 2007 Apple, Inc. All rights reserved. | 2 * Copyright (C) 2005, 2006, 2007 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 92 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
103 m_startingSelection = parent->m_endingSelection; | 103 m_startingSelection = parent->m_endingSelection; |
104 m_endingSelection = parent->m_endingSelection; | 104 m_endingSelection = parent->m_endingSelection; |
105 } | 105 } |
106 } | 106 } |
107 | 107 |
108 void SimpleEditCommand::doReapply() | 108 void SimpleEditCommand::doReapply() |
109 { | 109 { |
110 doApply(); | 110 doApply(); |
111 } | 111 } |
112 | 112 |
113 #ifndef NDEBUG | |
114 void SimpleEditCommand::addNodeAndDescendants(Node* startNode, HashSet<Node*>& n
odes) | |
115 { | |
116 for (Node* node = startNode; node; node = NodeTraversal::next(node, startNod
e)) | |
117 nodes.add(node); | |
118 } | |
119 #endif | |
120 | |
121 } // namespace WebCore | 113 } // namespace WebCore |
OLD | NEW |