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 48 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
59 | 59 |
60 // These methods are used by HTMLElement & ShadowRoot to replace the | 60 // These methods are used by HTMLElement & ShadowRoot to replace the |
61 // children with respected fragment/text. | 61 // children with respected fragment/text. |
62 void replaceChildrenWithFragment(ContainerNode*, PassRefPtrWillBeRawPtr<Document Fragment>, ExceptionState&); | 62 void replaceChildrenWithFragment(ContainerNode*, PassRefPtrWillBeRawPtr<Document Fragment>, ExceptionState&); |
63 void replaceChildrenWithText(ContainerNode*, const String&, ExceptionState&); | 63 void replaceChildrenWithText(ContainerNode*, const String&, ExceptionState&); |
64 | 64 |
65 String createMarkup(const Range*, WillBeHeapVector<RawPtrWillBeMember<Node> >* = 0, EAnnotateForInterchange = DoNotAnnotateForInterchange, bool convertBlocksToI nlines = false, EAbsoluteURLs = DoNotResolveURLs, Node* constrainingAncestor = 0 ); | 65 String createMarkup(const Range*, WillBeHeapVector<RawPtrWillBeMember<Node> >* = 0, EAnnotateForInterchange = DoNotAnnotateForInterchange, bool convertBlocksToI nlines = false, EAbsoluteURLs = DoNotResolveURLs, Node* constrainingAncestor = 0 ); |
66 String createMarkup(const Node*, EChildrenOnly = IncludeNode, WillBeHeapVector<R awPtrWillBeMember<Node> >* = 0, EAbsoluteURLs = DoNotResolveURLs, Vector<Qualifi edName>* tagNamesToSkip = 0); | 66 String createMarkup(const Node*, EChildrenOnly = IncludeNode, WillBeHeapVector<R awPtrWillBeMember<Node> >* = 0, EAbsoluteURLs = DoNotResolveURLs, Vector<Qualifi edName>* tagNamesToSkip = 0); |
67 | 67 |
68 String createFullMarkup(const Node*); | 68 String createFullMarkup(const Node*); |
69 String createStyledMarkupForNavigationTransition(Node*); | |
esprehn
2014/06/26 09:32:55
const Node* ? Why do you need to mutate it?
oystein (OOO til 10th of July)
2014/06/26 23:13:43
StyledMarkupAccumulator::serializeNodes takes a no
| |
69 | 70 |
70 String urlToMarkup(const KURL&, const String& title); | 71 String urlToMarkup(const KURL&, const String& title); |
71 void mergeWithNextTextNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&); | 72 void mergeWithNextTextNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&); |
72 | 73 |
73 } | 74 } |
74 | 75 |
75 #endif // markup_h | 76 #endif // markup_h |
OLD | NEW |