OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2004 Apple Computer, Inc. All rights reserved. | 2 * Copyright (C) 2004 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 46 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
57 bool isPlainTextMarkup(Node*); | 57 bool isPlainTextMarkup(Node*); |
58 | 58 |
59 // These methods are used by HTMLElement & ShadowRoot to replace the | 59 // These methods are used by HTMLElement & ShadowRoot to replace the |
60 // children with respected fragment/text. | 60 // children with respected fragment/text. |
61 void replaceChildrenWithFragment(ContainerNode*, PassRefPtrWillBeRawPtr<Document
Fragment>, ExceptionState&); | 61 void replaceChildrenWithFragment(ContainerNode*, PassRefPtrWillBeRawPtr<Document
Fragment>, ExceptionState&); |
62 void replaceChildrenWithText(ContainerNode*, const String&, ExceptionState&); | 62 void replaceChildrenWithText(ContainerNode*, const String&, ExceptionState&); |
63 | 63 |
64 String createMarkup(const Range*, WillBeHeapVector<RawPtrWillBeMember<Node> >* =
0, EAnnotateForInterchange = DoNotAnnotateForInterchange, bool convertBlocksToI
nlines = false, EAbsoluteURLs = DoNotResolveURLs, Node* constrainingAncestor = 0
); | 64 String createMarkup(const Range*, WillBeHeapVector<RawPtrWillBeMember<Node> >* =
0, EAnnotateForInterchange = DoNotAnnotateForInterchange, bool convertBlocksToI
nlines = false, EAbsoluteURLs = DoNotResolveURLs, Node* constrainingAncestor = 0
); |
65 String createMarkup(const Node*, EChildrenOnly = IncludeNode, WillBeHeapVector<R
awPtrWillBeMember<Node> >* = 0, EAbsoluteURLs = DoNotResolveURLs, Vector<Qualifi
edName>* tagNamesToSkip = 0); | 65 String createMarkup(const Node*, EChildrenOnly = IncludeNode, WillBeHeapVector<R
awPtrWillBeMember<Node> >* = 0, EAbsoluteURLs = DoNotResolveURLs, Vector<Qualifi
edName>* tagNamesToSkip = 0); |
66 | 66 |
67 String createFullMarkup(const Node*); | |
68 String createStyledMarkupForNavigationTransition(Node*); | 67 String createStyledMarkupForNavigationTransition(Node*); |
69 | 68 |
70 String urlToMarkup(const KURL&, const String& title); | 69 String urlToMarkup(const KURL&, const String& title); |
71 void mergeWithNextTextNode(Text*, ExceptionState&); | 70 void mergeWithNextTextNode(Text*, ExceptionState&); |
72 | 71 |
73 } | 72 } |
74 | 73 |
75 #endif // markup_h | 74 #endif // markup_h |
OLD | NEW |