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 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
51 // Node | 51 // Node |
52 // ------------------------------------------------------------------------- | 52 // ------------------------------------------------------------------------- |
53 | 53 |
54 // Functions returning Node | 54 // Functions returning Node |
55 | 55 |
56 Node* highestAncestor(Node*); | 56 Node* highestAncestor(Node*); |
57 Node* highestEditableRoot(const Position&, EditableType = ContentIsEditable); | 57 Node* highestEditableRoot(const Position&, EditableType = ContentIsEditable); |
58 | 58 |
59 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Nod
e*), | 59 Node* highestEnclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Nod
e*), |
60 EditingBoundaryCrossingRule = CannotCrossEditingBoundary, Node* stayWithin =
0); | 60 EditingBoundaryCrossingRule = CannotCrossEditingBoundary, Node* stayWithin =
0); |
61 Node* highestNodeToRemoveInPruning(Node*); | 61 Node* highestNodeToRemoveInPruning(Node*, Node* excludeNode = 0); |
62 Node* lowestEditableAncestor(Node*); | 62 Node* lowestEditableAncestor(Node*); |
63 | 63 |
64 Element* enclosingBlock(Node*, EditingBoundaryCrossingRule = CannotCrossEditingB
oundary); | 64 Element* enclosingBlock(Node*, EditingBoundaryCrossingRule = CannotCrossEditingB
oundary); |
65 Node* enclosingTableCell(const Position&); | 65 Node* enclosingTableCell(const Position&); |
66 Node* enclosingEmptyListItem(const VisiblePosition&); | 66 Node* enclosingEmptyListItem(const VisiblePosition&); |
67 Element* enclosingAnchorElement(const Position&); | 67 Element* enclosingAnchorElement(const Position&); |
68 Node* enclosingNodeWithTag(const Position&, const QualifiedName&); | 68 Node* enclosingNodeWithTag(const Position&, const QualifiedName&); |
69 Node* enclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Node*), Ed
itingBoundaryCrossingRule = CannotCrossEditingBoundary); | 69 Node* enclosingNodeOfType(const Position&, bool (*nodeIsOfType)(const Node*), Ed
itingBoundaryCrossingRule = CannotCrossEditingBoundary); |
70 | 70 |
71 Node* tabSpanNode(const Node*); | 71 Node* tabSpanNode(const Node*); |
(...skipping 180 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
252 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. | 252 // FIXME: this is required until 6853027 is fixed and text checking can do t
his for us. |
253 return character == '\'' || character == rightSingleQuotationMark || charact
er == hebrewPunctuationGershayim; | 253 return character == '\'' || character == rightSingleQuotationMark || charact
er == hebrewPunctuationGershayim; |
254 } | 254 } |
255 | 255 |
256 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); | 256 String stringWithRebalancedWhitespace(const String&, bool startIsStartOfParagrap
h, bool endIsEndOfParagraph); |
257 const String& nonBreakingSpaceString(); | 257 const String& nonBreakingSpaceString(); |
258 | 258 |
259 } | 259 } |
260 | 260 |
261 #endif | 261 #endif |
OLD | NEW |