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 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
60 bool shouldUseFallbackElements() const; | 60 bool shouldUseFallbackElements() const; |
61 | 61 |
62 size_t size() const { return m_distribution.size(); } | 62 size_t size() const { return m_distribution.size(); } |
63 Node* at(size_t index) const { return m_distribution.at(index).get(); } | 63 Node* at(size_t index) const { return m_distribution.at(index).get(); } |
64 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.f
irst().get(); } | 64 Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.f
irst().get(); } |
65 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.la
st().get(); } | 65 Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.la
st().get(); } |
66 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); } | 66 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); } |
67 Node* previousTo(const Node* node) const { return m_distribution.previousTo(
node); } | 67 Node* previousTo(const Node* node) const { return m_distribution.previousTo(
node); } |
68 | 68 |
69 protected: | 69 protected: |
70 InsertionPoint(const QualifiedName&, Document*); | 70 InsertionPoint(const QualifiedName&, Document&); |
71 virtual bool rendererIsNeeded(const NodeRenderingContext&) OVERRIDE; | 71 virtual bool rendererIsNeeded(const NodeRenderingContext&) OVERRIDE; |
72 virtual void childrenChanged(bool changedByParser, Node* beforeChange, Node*
afterChange, int childCountDelta) OVERRIDE; | 72 virtual void childrenChanged(bool changedByParser, Node* beforeChange, Node*
afterChange, int childCountDelta) OVERRIDE; |
73 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE; | 73 virtual InsertionNotificationRequest insertedInto(ContainerNode*) OVERRIDE; |
74 virtual void removedFrom(ContainerNode*) OVERRIDE; | 74 virtual void removedFrom(ContainerNode*) OVERRIDE; |
75 virtual void parseAttribute(const QualifiedName&, const AtomicString&) OVERR
IDE; | 75 virtual void parseAttribute(const QualifiedName&, const AtomicString&) OVERR
IDE; |
76 virtual void willRecalcStyle(StyleChange) OVERRIDE; | 76 virtual void willRecalcStyle(StyleChange) OVERRIDE; |
77 | 77 |
78 private: | 78 private: |
79 | 79 |
80 ContentDistribution m_distribution; | 80 ContentDistribution m_distribution; |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
130 return 0; | 130 return 0; |
131 } | 131 } |
132 | 132 |
133 InsertionPoint* resolveReprojection(const Node*); | 133 InsertionPoint* resolveReprojection(const Node*); |
134 | 134 |
135 void collectInsertionPointsWhereNodeIsDistributed(const Node*, Vector<InsertionP
oint*, 8>& results); | 135 void collectInsertionPointsWhereNodeIsDistributed(const Node*, Vector<InsertionP
oint*, 8>& results); |
136 | 136 |
137 } // namespace WebCore | 137 } // namespace WebCore |
138 | 138 |
139 #endif // InsertionPoint_h | 139 #endif // InsertionPoint_h |
OLD | NEW |