OLD | NEW |
---|---|
1 /* | 1 /* |
2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) | 2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org) |
3 * (C) 1999 Antti Koivisto (koivisto@kde.org) | 3 * (C) 1999 Antti Koivisto (koivisto@kde.org) |
4 * Copyright (C) 2010 Apple Inc. All rights reserved. | 4 * Copyright (C) 2010 Apple Inc. All rights reserved. |
5 * | 5 * |
6 * This library is free software; you can redistribute it and/or | 6 * This library is free software; you can redistribute it and/or |
7 * modify it under the terms of the GNU Library General Public | 7 * modify it under the terms of the GNU Library General Public |
8 * License as published by the Free Software Foundation; either | 8 * License as published by the Free Software Foundation; either |
9 * version 2 of the License, or (at your option) any later version. | 9 * version 2 of the License, or (at your option) any later version. |
10 * | 10 * |
(...skipping 90 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
101 updateDistribution(); | 101 updateDistribution(); |
102 LayoutListItem::updateItemValuesForOrderedList(this); | 102 LayoutListItem::updateItemValuesForOrderedList(this); |
103 } | 103 } |
104 | 104 |
105 void HTMLOListElement::recalculateItemCount() | 105 void HTMLOListElement::recalculateItemCount() |
106 { | 106 { |
107 m_itemCount = LayoutListItem::itemCountForOrderedList(this); | 107 m_itemCount = LayoutListItem::itemCountForOrderedList(this); |
108 m_shouldRecalculateItemCount = false; | 108 m_shouldRecalculateItemCount = false; |
109 } | 109 } |
110 | 110 |
111 void HTMLOListElement::attach(const AttachContext& context) | |
112 { | |
113 HTMLElement::attach(context); | |
114 | |
115 if (!RuntimeEnabledFeatures::listMarkerPseudoElementEnabled()) | |
116 return; | |
117 | |
118 if (!m_isReversed) | |
119 return; | |
120 | |
121 // If we're looking at a reversed ordered list we have to recalculate | |
122 // all of the marker values after everything is inserted. This is because | |
123 // we built the tree top to bottom, but that means the list item with the | |
124 // highest value will end up with 1 and we count down from there. | |
125 updateItemValues(); | |
esprehn
2015/04/22 07:45:45
Why is this needed? All updateItemValues does is:
dsinclair
2015/04/22 20:00:39
This works fine for lists that aren't reversed. Th
| |
111 } | 126 } |
127 | |
128 } | |
OLD | NEW |