1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
3 * This file is part of the LibreOffice project.
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 * This file incorporates work covered by the following license notice:
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
19 #ifndef INCLUDED_SW_INC_TABCOL_HXX
20 #define INCLUDED_SW_INC_TABCOL_HXX
22 #include <tools/solar.h>
32 bool bHidden
; // For each entry a flag, hidden or not.
33 // If the flag bHidden is true column separator
34 // is not in current line. It must maintained
35 // but it may not be displayed.
38 typedef std::vector
< SwTabColsEntry
> SwTabColsEntries
;
40 class SW_DLLPUBLIC SwTabCols
42 long nLeftMin
, // Leftmost border (reference point) for
43 // document coordinates.
44 // All other values are relative to this point!
45 nLeft
, // Left border of table.
46 nRight
, // Right border of table.
47 nRightMax
; // Maximum right border of table.
49 bool bLastRowAllowedToChange
; // If the last row of the table frame
50 // is split across pages, it may not
53 SwTabColsEntries aData
;
56 const SwTabColsEntries
& GetData() const { return aData
; }
59 SwTabCols( sal_uInt16 nSize
= 0 );
60 SwTabCols( const SwTabCols
& );
61 SwTabCols
&operator=( const SwTabCols
& );
62 bool operator==( const SwTabCols
& rCmp
) const;
63 long& operator[]( size_t nPos
) { return aData
[nPos
].nPos
; }
64 long operator[]( size_t nPos
) const { return aData
[nPos
].nPos
; }
65 size_t Count() const { return aData
.size(); }
67 bool IsHidden( size_t nPos
) const { return aData
[nPos
].bHidden
; }
68 void SetHidden( size_t nPos
, bool bValue
) { aData
[nPos
].bHidden
= bValue
; }
70 void Insert( long nValue
, bool bValue
, size_t nPos
);
71 void Insert( long nValue
, long nMin
, long nMax
, bool bValue
, size_t nPos
);
72 void Remove( size_t nPos
, size_t nCount
= 1 );
74 const SwTabColsEntry
& GetEntry( size_t nPos
) const { return aData
[nPos
]; }
75 SwTabColsEntry
& GetEntry( size_t nPos
) { return aData
[nPos
]; }
77 long GetLeftMin() const { return nLeftMin
; }
78 long GetLeft() const { return nLeft
; }
79 long GetRight() const { return nRight
; }
80 long GetRightMax()const { return nRightMax
;}
82 void SetLeftMin ( long nNew
) { nLeftMin
= nNew
; }
83 void SetLeft ( long nNew
) { nLeft
= nNew
; }
84 void SetRight ( long nNew
) { nRight
= nNew
; }
85 void SetRightMax( long nNew
) { nRightMax
= nNew
;}
87 bool IsLastRowAllowedToChange() const { return bLastRowAllowedToChange
; }
88 void SetLastRowAllowedToChange( bool bNew
) { bLastRowAllowedToChange
= bNew
; }
91 #endif // INCLUDED_SW_INC_TABCOL_HXX
93 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */