OLD | NEW |
1 // Copyright 2014 PDFium Authors. All rights reserved. | 1 // Copyright 2014 PDFium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com | 5 // Original code copyright 2014 Foxit Software Inc. http://www.foxitsoftware.com |
6 | 6 |
7 #include "xfa/fxfa/parser/xfa_layout_itemlayout.h" | 7 #include "xfa/fxfa/parser/xfa_layout_itemlayout.h" |
8 | 8 |
9 #include <algorithm> | 9 #include <algorithm> |
10 #include <memory> | 10 #include <memory> |
11 | 11 |
12 #include "xfa/fxfa/app/xfa_ffnotify.h" | 12 #include "xfa/fxfa/app/xfa_ffnotify.h" |
| 13 #include "xfa/fxfa/parser/cxfa_measurement.h" |
13 #include "xfa/fxfa/parser/cxfa_occur.h" | 14 #include "xfa/fxfa/parser/cxfa_occur.h" |
14 #include "xfa/fxfa/parser/xfa_doclayout.h" | 15 #include "xfa/fxfa/parser/xfa_doclayout.h" |
15 #include "xfa/fxfa/parser/xfa_document.h" | 16 #include "xfa/fxfa/parser/xfa_document.h" |
16 #include "xfa/fxfa/parser/xfa_document_layout_imp.h" | 17 #include "xfa/fxfa/parser/xfa_document_layout_imp.h" |
17 #include "xfa/fxfa/parser/xfa_layout_appadapter.h" | 18 #include "xfa/fxfa/parser/xfa_layout_appadapter.h" |
18 #include "xfa/fxfa/parser/xfa_layout_pagemgr_new.h" | 19 #include "xfa/fxfa/parser/xfa_layout_pagemgr_new.h" |
19 #include "xfa/fxfa/parser/xfa_localemgr.h" | 20 #include "xfa/fxfa/parser/xfa_localemgr.h" |
20 #include "xfa/fxfa/parser/xfa_object.h" | 21 #include "xfa/fxfa/parser/xfa_object.h" |
21 #include "xfa/fxfa/parser/xfa_utils.h" | 22 #include "xfa/fxfa/parser/xfa_utils.h" |
22 | 23 |
(...skipping 2962 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2985 if (iMax < 0) | 2986 if (iMax < 0) |
2986 return TRUE; | 2987 return TRUE; |
2987 | 2988 |
2988 int32_t iCount = m_PendingNodesCount[pTemplate]; | 2989 int32_t iCount = m_PendingNodesCount[pTemplate]; |
2989 if (iCount >= iMax) | 2990 if (iCount >= iMax) |
2990 return FALSE; | 2991 return FALSE; |
2991 | 2992 |
2992 m_PendingNodesCount[pTemplate] = iCount + 1; | 2993 m_PendingNodesCount[pTemplate] = iCount + 1; |
2993 return TRUE; | 2994 return TRUE; |
2994 } | 2995 } |
OLD | NEW |