Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 /* | 1 /* |
| 2 * Copyright (C) 2004, 2006, 2008 Apple Inc. All rights reserved. | 2 * Copyright (C) 2004, 2006, 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 54 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 65 | 65 |
| 66 // This file contains a set of helper functions used by the editing commands | 66 // This file contains a set of helper functions used by the editing commands |
| 67 | 67 |
| 68 CORE_EXPORT bool needsLayoutTreeUpdate(const Node&); | 68 CORE_EXPORT bool needsLayoutTreeUpdate(const Node&); |
| 69 CORE_EXPORT bool needsLayoutTreeUpdate(const Position&); | 69 CORE_EXPORT bool needsLayoutTreeUpdate(const Position&); |
| 70 | 70 |
| 71 // ------------------------------------------------------------------------- | 71 // ------------------------------------------------------------------------- |
| 72 // Node | 72 // Node |
| 73 // ------------------------------------------------------------------------- | 73 // ------------------------------------------------------------------------- |
| 74 | 74 |
| 75 // Functions returning Node | 75 CORE_EXPORT bool isContentEditable(const Node&); |
|
tkent
2016/07/27 06:26:41
Can you clarify differences between
- isContentEd
| |
| 76 | 76 CORE_EXPORT bool isContentRichlyEditable(const Node&); |
| 77 CORE_EXPORT bool hasEditableStyle(const Node&, EditableType = ContentIsEditable) ; | |
| 78 CORE_EXPORT bool layoutObjectIsRichlyEditable(const Node&, EditableType = Conten tIsEditable); | |
| 79 CORE_EXPORT bool isRootEditableElement(const Node&); | |
| 80 CORE_EXPORT Element* rootEditableElement(const Node&); | |
| 81 CORE_EXPORT Element* rootEditableElement(const Node&, EditableType); | |
| 77 // highestEditableRoot returns the highest editable node. If the | 82 // highestEditableRoot returns the highest editable node. If the |
| 78 // rootEditableElement of the speicified Position is <body>, this returns the | 83 // rootEditableElement of the speicified Position is <body>, this returns the |
| 79 // <body>. Otherwise, this searches ancestors for the highest editable node in | 84 // <body>. Otherwise, this searches ancestors for the highest editable node in |
| 80 // defiance of editing boundaries. This returns a Document if designMode="on" | 85 // defiance of editing boundaries. This returns a Document if designMode="on" |
| 81 // and the specified Position is not in the <body>. | 86 // and the specified Position is not in the <body>. |
| 82 CORE_EXPORT ContainerNode* highestEditableRoot(const Position&, EditableType = C ontentIsEditable); | 87 CORE_EXPORT ContainerNode* highestEditableRoot(const Position&, EditableType = C ontentIsEditable); |
| 83 ContainerNode* highestEditableRoot(const PositionInFlatTree&, EditableType = Con tentIsEditable); | 88 ContainerNode* highestEditableRoot(const PositionInFlatTree&, EditableType = Con tentIsEditable); |
| 84 | 89 |
| 85 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Nod e*), | 90 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Nod e*), |
| 86 EditingBoundaryCrossingRule = CannotCrossEditingBoundary, Node* stayWithin = nullptr); | 91 EditingBoundaryCrossingRule = CannotCrossEditingBoundary, Node* stayWithin = nullptr); |
| (...skipping 268 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 355 // ------------------------------------------------------------------------- | 360 // ------------------------------------------------------------------------- |
| 356 | 361 |
| 357 // Functions dispatch InputEvent | 362 // Functions dispatch InputEvent |
| 358 DispatchEventResult dispatchBeforeInputInsertText(EventTarget*, const String& da ta); | 363 DispatchEventResult dispatchBeforeInputInsertText(EventTarget*, const String& da ta); |
| 359 DispatchEventResult dispatchBeforeInputFromComposition(EventTarget*, InputEvent: :InputType, const String& data, InputEvent::EventCancelable); | 364 DispatchEventResult dispatchBeforeInputFromComposition(EventTarget*, InputEvent: :InputType, const String& data, InputEvent::EventCancelable); |
| 360 DispatchEventResult dispatchBeforeInputEditorCommand(EventTarget*, InputEvent::I nputType, const String& data, const RangeVector*); | 365 DispatchEventResult dispatchBeforeInputEditorCommand(EventTarget*, InputEvent::I nputType, const String& data, const RangeVector*); |
| 361 | 366 |
| 362 } // namespace blink | 367 } // namespace blink |
| 363 | 368 |
| 364 #endif | 369 #endif |
| OLD | NEW |