OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2011 Google Inc. All rights reserved. | 2 * Copyright (C) 2011 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 12 matching lines...) Expand all Loading... |
23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 23 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 24 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 25 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 26 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 27 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 28 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
29 */ | 29 */ |
30 | 30 |
31 #include "core/layout/FlexibleBoxAlgorithm.h" | 31 #include "core/layout/FlexibleBoxAlgorithm.h" |
32 | 32 |
| 33 #include "core/layout/LayoutBox.h" |
| 34 |
33 namespace blink { | 35 namespace blink { |
34 | 36 |
35 FlexItem::FlexItem(LayoutBox* box, | 37 FlexItem::FlexItem(LayoutBox* box, |
36 LayoutUnit flexBaseContentSize, | 38 LayoutUnit flexBaseContentSize, |
37 LayoutUnit hypotheticalMainContentSize, | 39 LayoutUnit hypotheticalMainContentSize, |
38 LayoutUnit mainAxisBorderAndPadding, | 40 LayoutUnit mainAxisBorderAndPadding, |
39 LayoutUnit mainAxisMargin) | 41 LayoutUnit mainAxisMargin) |
40 : box(box), | 42 : box(box), |
41 flexBaseContentSize(flexBaseContentSize), | 43 flexBaseContentSize(flexBaseContentSize), |
42 hypotheticalMainContentSize(hypotheticalMainContentSize), | 44 hypotheticalMainContentSize(hypotheticalMainContentSize), |
(...skipping 40 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
83 totalFlexShrink += flexItem.box->style()->flexShrink(); | 85 totalFlexShrink += flexItem.box->style()->flexShrink(); |
84 totalWeightedFlexShrink += | 86 totalWeightedFlexShrink += |
85 flexItem.box->style()->flexShrink() * flexItem.flexBaseContentSize; | 87 flexItem.box->style()->flexShrink() * flexItem.flexBaseContentSize; |
86 sumHypotheticalMainSize += flexItem.hypotheticalMainAxisMarginBoxSize(); | 88 sumHypotheticalMainSize += flexItem.hypotheticalMainAxisMarginBoxSize(); |
87 } | 89 } |
88 DCHECK(lineItems.size() > 0 || nextIndex == m_allItems.size()); | 90 DCHECK(lineItems.size() > 0 || nextIndex == m_allItems.size()); |
89 return lineItems.size() > 0; | 91 return lineItems.size() > 0; |
90 } | 92 } |
91 | 93 |
92 } // namespace blink | 94 } // namespace blink |
OLD | NEW |