| OLD | NEW |
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2005, 2006 Apple Computer, Inc. All rights reserved. | 2 * Copyright (C) 2004, 2005, 2006 Apple Computer, 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 200 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 211 return 0; | 211 return 0; |
| 212 Document& d = n->document(); | 212 Document& d = n->document(); |
| 213 Node* de = d.documentElement(); | 213 Node* de = d.documentElement(); |
| 214 if (!de) | 214 if (!de) |
| 215 return 0; | 215 return 0; |
| 216 Node* boundary = n->enclosingBlockFlowElement(); | 216 Node* boundary = n->enclosingBlockFlowElement(); |
| 217 if (!boundary) | 217 if (!boundary) |
| 218 return 0; | 218 return 0; |
| 219 | 219 |
| 220 RefPtr<Range> searchRange(Range::create(d)); | 220 RefPtr<Range> searchRange(Range::create(d)); |
| 221 TrackExceptionState es; | 221 TrackExceptionState exceptionState; |
| 222 | 222 |
| 223 Position start(pos.parentAnchoredEquivalent()); | 223 Position start(pos.parentAnchoredEquivalent()); |
| 224 searchRange->selectNodeContents(boundary, es); | 224 searchRange->selectNodeContents(boundary, exceptionState); |
| 225 searchRange->setStart(start.containerNode(), start.offsetInContainerNode(),
es); | 225 searchRange->setStart(start.containerNode(), start.offsetInContainerNode(),
exceptionState); |
| 226 | 226 |
| 227 ASSERT(!es.hadException()); | 227 ASSERT(!exceptionState.hadException()); |
| 228 if (es.hadException()) | 228 if (exceptionState.hadException()) |
| 229 return 0; | 229 return 0; |
| 230 | 230 |
| 231 return searchRange.release(); | 231 return searchRange.release(); |
| 232 } | 232 } |
| 233 | 233 |
| 234 bool VisibleSelection::isAll(EditingBoundaryCrossingRule rule) const | 234 bool VisibleSelection::isAll(EditingBoundaryCrossingRule rule) const |
| 235 { | 235 { |
| 236 return !nonBoundaryShadowTreeRootNode() && visibleStart().previous(rule).isN
ull() && visibleEnd().next(rule).isNull(); | 236 return !nonBoundaryShadowTreeRootNode() && visibleStart().previous(rule).isN
ull() && visibleEnd().next(rule).isNull(); |
| 237 } | 237 } |
| 238 | 238 |
| (...skipping 501 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 740 sel.showTreeForThis(); | 740 sel.showTreeForThis(); |
| 741 } | 741 } |
| 742 | 742 |
| 743 void showTree(const WebCore::VisibleSelection* sel) | 743 void showTree(const WebCore::VisibleSelection* sel) |
| 744 { | 744 { |
| 745 if (sel) | 745 if (sel) |
| 746 sel->showTreeForThis(); | 746 sel->showTreeForThis(); |
| 747 } | 747 } |
| 748 | 748 |
| 749 #endif | 749 #endif |
| OLD | NEW |