bump product version to 4.1.6.2
[LibreOffice.git] / sw / inc / tabcol.hxx
blob2ce41e028c6510ee6352ecbd20ec52992e2f535f
1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 /*
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 _TABCOL_HXX
20 #define _TABCOL_HXX
22 #include <tools/solar.h>
24 #include <vector>
25 #include "swdllapi.h"
27 struct SwTabColsEntry
29 long nPos;
30 long nMin;
31 long nMax;
32 sal_Bool bHidden; // For each entry a flag, hidden or not.
33 // If the flag bHidden is sal_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
51 // change its size.
53 SwTabColsEntries aData;
55 //For the CopyCTor.
56 const SwTabColsEntries& GetData() const { return aData; }
58 public:
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[]( sal_uInt16 nPos ) { return aData[nPos].nPos; }
64 long operator[]( sal_uInt16 nPos ) const { return aData[nPos].nPos; }
65 sal_uInt16 Count() const { return sal::static_int_cast< sal_uInt16 >(aData.size()); }
67 sal_Bool IsHidden( sal_uInt16 nPos ) const { return aData[nPos].bHidden; }
68 void SetHidden( sal_uInt16 nPos, sal_Bool bValue ) { aData[nPos].bHidden = bValue; }
70 void Insert( long nValue, sal_Bool bValue, sal_uInt16 nPos );
71 void Insert( long nValue, long nMin, long nMax, sal_Bool bValue, sal_uInt16 nPos );
72 void Remove( sal_uInt16 nPos, sal_uInt16 nAnz = 1 );
74 const SwTabColsEntry& GetEntry( sal_uInt16 nPos ) const { return aData[nPos]; }
75 SwTabColsEntry& GetEntry( sal_uInt16 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 //_TABCOL_HXX
93 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */