OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2001 Peter Kelly (pmk@post.com) | 2 * Copyright (C) 2001 Peter Kelly (pmk@post.com) |
3 * Copyright (C) 2001 Tobias Anton (anton@stud.fbi.fh-darmstadt.de) | 3 * Copyright (C) 2001 Tobias Anton (anton@stud.fbi.fh-darmstadt.de) |
4 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) | 4 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com) |
5 * Copyright (C) 2003, 2004, 2005, 2006, 2008 Apple Inc. All rights reserved. | 5 * Copyright (C) 2003, 2004, 2005, 2006, 2008 Apple Inc. All rights reserved. |
6 * | 6 * |
7 * This library is free software; you can redistribute it and/or | 7 * This library is free software; you can redistribute it and/or |
8 * modify it under the terms of the GNU Library General Public | 8 * modify it under the terms of the GNU Library General Public |
9 * License as published by the Free Software Foundation; either | 9 * License as published by the Free Software Foundation; either |
10 * version 2 of the License, or (at your option) any later version. | 10 * version 2 of the License, or (at your option) any later version. |
(...skipping 21 matching lines...) Expand all Loading... |
32 class MutationEvent FINAL : public Event { | 32 class MutationEvent FINAL : public Event { |
33 public: | 33 public: |
34 virtual ~MutationEvent(); | 34 virtual ~MutationEvent(); |
35 | 35 |
36 enum attrChangeType { | 36 enum attrChangeType { |
37 MODIFICATION = 1, | 37 MODIFICATION = 1, |
38 ADDITION = 2, | 38 ADDITION = 2, |
39 REMOVAL = 3 | 39 REMOVAL = 3 |
40 }; | 40 }; |
41 | 41 |
42 static PassRefPtr<MutationEvent> create() | 42 static PassRefPtrWillBeRawPtr<MutationEvent> create() |
43 { | 43 { |
44 return adoptRef(new MutationEvent); | 44 return adoptRefWillBeRefCountedGarbageCollected(new MutationEvent); |
45 } | 45 } |
46 | 46 |
47 static PassRefPtr<MutationEvent> create(const AtomicString& type, bool c
anBubble, PassRefPtr<Node> relatedNode = nullptr, | 47 static PassRefPtrWillBeRawPtr<MutationEvent> create(const AtomicString&
type, bool canBubble, PassRefPtr<Node> relatedNode = nullptr, |
48 const String& prevValue = String(), const String& newValue = String(
), const String& attrName = String(), unsigned short attrChange = 0) | 48 const String& prevValue = String(), const String& newValue = String(
), const String& attrName = String(), unsigned short attrChange = 0) |
49 { | 49 { |
50 return adoptRef(new MutationEvent(type, canBubble, false, relatedNod
e, prevValue, newValue, attrName, attrChange)); | 50 return adoptRefWillBeRefCountedGarbageCollected(new MutationEvent(ty
pe, canBubble, false, relatedNode, prevValue, newValue, attrName, attrChange)); |
51 } | 51 } |
52 | 52 |
53 void initMutationEvent(const AtomicString& type, bool canBubble, bool ca
ncelable, PassRefPtr<Node> relatedNode, | 53 void initMutationEvent(const AtomicString& type, bool canBubble, bool ca
ncelable, PassRefPtr<Node> relatedNode, |
54 const String& prevValue, const String& newValue, | 54 const String& prevValue, const String& newValue, |
55 const String& attrName, unsigned short attrChange
); | 55 const String& attrName, unsigned short attrChange
); |
56 | 56 |
57 Node* relatedNode() const { return m_relatedNode.get(); } | 57 Node* relatedNode() const { return m_relatedNode.get(); } |
58 String prevValue() const { return m_prevValue; } | 58 String prevValue() const { return m_prevValue; } |
59 String newValue() const { return m_newValue; } | 59 String newValue() const { return m_newValue; } |
60 String attrName() const { return m_attrName; } | 60 String attrName() const { return m_attrName; } |
(...skipping 12 matching lines...) Expand all Loading... |
73 RefPtr<Node> m_relatedNode; | 73 RefPtr<Node> m_relatedNode; |
74 String m_prevValue; | 74 String m_prevValue; |
75 String m_newValue; | 75 String m_newValue; |
76 String m_attrName; | 76 String m_attrName; |
77 unsigned short m_attrChange; | 77 unsigned short m_attrChange; |
78 }; | 78 }; |
79 | 79 |
80 } // namespace WebCore | 80 } // namespace WebCore |
81 | 81 |
82 #endif // MutationEvent_h | 82 #endif // MutationEvent_h |
OLD | NEW |