Source/core/dom/shadow/InsertionPoint.h - Issue 365673002: Pass a struct to ContainerNode::childrenChanged() instead of separate arguments

Side by Side Diff: Source/core/dom/shadow/InsertionPoint.h

Issue 365673002: Pass a struct to ContainerNode::childrenChanged() instead of separate arguments (Closed) Base URL: svn://svn.chromium.org/blink/trunk

Patch Set: Remove dead code Created 6 years, 5 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch | Annotate | Revision Log

« no previous file with comments | « Source/core/dom/Element.cpp ('k') | Source/core/dom/shadow/InsertionPoint.cpp » ('j') | Source/core/html/HTMLElement.cpp » ('J')

OLD	NEW
1 /*	1 /*

2 * Copyright (C) 2012 Google Inc. All rights reserved.	2 * Copyright (C) 2012 Google 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 are	5 * modification, are permitted provided that the following conditions are

6 * met:	6 * met:

7 *	7 *

8 * * Redistributions of source code must retain the above copyright	8 * * Redistributions of source code must retain the above copyright

9 * notice, this list of conditions and the following disclaimer.	9 * notice, this list of conditions and the following disclaimer.

10 * * Redistributions in binary form must reproduce the above	10 * * Redistributions in binary form must reproduce the above

(...skipping 54 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
65 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.f irst().get(); }	65 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.f irst().get(); }

66 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.la st().get(); }	66 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.la st().get(); }

67 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); }	67 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); }

68 Node* previousTo(const Node* node) const { return m_distribution.previousTo( node); }	68 Node* previousTo(const Node* node) const { return m_distribution.previousTo( node); }

69	69

70 virtual void trace(Visitor*) OVERRIDE;	70 virtual void trace(Visitor*) OVERRIDE;

71	71

72 protected:	72 protected:

73 InsertionPoint(const QualifiedName&, Document&);	73 InsertionPoint(const QualifiedName&, Document&);

74 virtual bool rendererIsNeeded(const RenderStyle&) OVERRIDE;	74 virtual bool rendererIsNeeded(const RenderStyle&) OVERRIDE;

75 virtual void childrenChanged(bool changedByParser, Node* beforeChange, Node* afterChange, int childCountDelta) OVERRIDE;	75 virtual void childrenChanged(const ChildrenChange&) OVERRIDE;

76 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE;	76 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE;

77 virtual void removedFrom(ContainerNode*) OVERRIDE;	77 virtual void removedFrom(ContainerNode*) OVERRIDE;

78 virtual void willRecalcStyle(StyleRecalcChange) OVERRIDE;	78 virtual void willRecalcStyle(StyleRecalcChange) OVERRIDE;

79	79

80 private:	80 private:

81 ContentDistribution m_distribution;	81 ContentDistribution m_distribution;

82 bool m_registeredWithShadowRoot;	82 bool m_registeredWithShadowRoot;

83 };	83 };

84	84

85 typedef WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> > DestinationInserti onPoints;	85 typedef WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> > DestinationInserti onPoints;

(...skipping 24 matching lines...) Expand all Loading...
110 return 0;	110 return 0;

111 }	111 }

112	112

113 const InsertionPoint* resolveReprojection(const Node*);	113 const InsertionPoint* resolveReprojection(const Node*);

114	114

115 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB eMember<InsertionPoint>, 8>& results);	115 void collectDestinationInsertionPoints(const Node&, WillBeHeapVector<RawPtrWillB eMember<InsertionPoint>, 8>& results);

116	116

117 } // namespace WebCore	117 } // namespace WebCore

118	118

119 #endif // InsertionPoint_h	119 #endif // InsertionPoint_h

OLD	NEW