Source/core/dom/shadow/InsertionPoint.h - Issue 1033943002: Rename LayoutStyle to papayawhip

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

Issue 1033943002: Rename LayoutStyle to papayawhip (Closed) Base URL: svn://svn.chromium.org/blink/trunk

Patch Set: ensureComputedStyle Created 5 years, 8 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/VisitedLinkState.h ('k') | Source/core/dom/shadow/InsertionPoint.cpp » ('j') | no next file with comments »

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 53 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
64 Node* distributedNodeAt(size_t index) const { return m_distributedNodes.at( index).get(); }	64 Node* distributedNodeAt(size_t index) const { return m_distributedNodes.at( index).get(); }

65 Node* firstDistributedNode() const { return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.first().get(); }	65 Node* firstDistributedNode() const { return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.first().get(); }

66 Node* lastDistributedNode() const { return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.last().get(); }	66 Node* lastDistributedNode() const { return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.last().get(); }

67 Node* distributedNodeNextTo(const Node* node) const { return m_distributedNo des.nextTo(node); }	67 Node* distributedNodeNextTo(const Node* node) const { return m_distributedNo des.nextTo(node); }

68 Node* distributedNodePreviousTo(const Node* node) const { return m_distribut edNodes.previousTo(node); }	68 Node* distributedNodePreviousTo(const Node* node) const { return m_distribut edNodes.previousTo(node); }

69	69

70 DECLARE_VIRTUAL_TRACE();	70 DECLARE_VIRTUAL_TRACE();

71	71

72 protected:	72 protected:

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

74 virtual bool layoutObjectIsNeeded(const LayoutStyle&) override;	74 virtual bool layoutObjectIsNeeded(const ComputedStyle&) override;

75 virtual void childrenChanged(const ChildrenChange&) 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 bool isInsertionPoint() const = delete; // This will catch anyone doing an u nnecessary check.	81 bool isInsertionPoint() const = delete; // This will catch anyone doing an u nnecessary check.

82	82

83 DistributedNodes m_distributedNodes;	83 DistributedNodes m_distributedNodes;

84 bool m_registeredWithShadowRoot;	84 bool m_registeredWithShadowRoot;

(...skipping 27 matching lines...) Expand all Loading...
112 return 0;	112 return 0;

113 }	113 }

114	114

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

116	116

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

118	118

119 } // namespace blink	119 } // namespace blink

120	120

121 #endif // InsertionPoint_h	121 #endif // InsertionPoint_h

OLD	NEW