190 lines
5.5 KiB
C++
190 lines
5.5 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/*
|
|
* This file is part of the LibreOffice project.
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
*
|
|
* This file incorporates work covered by the following license notice:
|
|
*
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
* contributor license agreements. See the NOTICE file distributed
|
|
* with this work for additional information regarding copyright
|
|
* ownership. The ASF licenses this file to you under the Apache
|
|
* License, Version 2.0 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
|
|
*/
|
|
|
|
|
|
#include <hintids.hxx>
|
|
#include <vcl/msgbox.hxx>
|
|
#include <svl/stritem.hxx>
|
|
#include <svl/intitem.hxx>
|
|
#include <editeng/keepitem.hxx>
|
|
#include <editeng/brkitem.hxx>
|
|
#include <editeng/ulspitem.hxx>
|
|
#include <editeng/frmdiritem.hxx>
|
|
#include <svl/ctloptions.hxx>
|
|
#include <swmodule.hxx>
|
|
#include <fmtornt.hxx>
|
|
#include <fmtpdsc.hxx>
|
|
#include <fmtlsplt.hxx>
|
|
|
|
#include <svtools/htmlcfg.hxx>
|
|
#include <fmtrowsplt.hxx>
|
|
#include <svx/htmlmode.hxx>
|
|
|
|
#include <docsh.hxx>
|
|
#include <wrtsh.hxx>
|
|
#include <view.hxx>
|
|
#include <viewopt.hxx>
|
|
#include <uitool.hxx>
|
|
#include <frmatr.hxx>
|
|
|
|
#include <tablepg.hxx>
|
|
#include <tablemgr.hxx>
|
|
#include <pagedesc.hxx>
|
|
#include <poolfmt.hxx>
|
|
#include <SwStyleNameMapper.hxx>
|
|
|
|
#include <cmdid.h>
|
|
#include <tabledlg.hrc>
|
|
#include <table.hrc>
|
|
#include "swtablerep.hxx"
|
|
|
|
|
|
SwTableRep::SwTableRep( const SwTabCols& rTabCol )
|
|
:
|
|
nTblWidth(0),
|
|
nSpace(0),
|
|
nLeftSpace(0),
|
|
nRightSpace(0),
|
|
nAlign(0),
|
|
nWidthPercent(0),
|
|
bLineSelected(sal_False),
|
|
bWidthChanged(sal_False),
|
|
bColsChanged(sal_False)
|
|
{
|
|
nAllCols = nColCount = rTabCol.Count();
|
|
pTColumns = new TColumn[ nColCount + 1 ];
|
|
SwTwips nStart = 0,
|
|
nEnd;
|
|
for( sal_uInt16 i = 0; i < nAllCols; ++i )
|
|
{
|
|
nEnd = rTabCol[ i ] - rTabCol.GetLeft();
|
|
pTColumns[ i ].nWidth = nEnd - nStart;
|
|
pTColumns[ i ].bVisible = !rTabCol.IsHidden(i);
|
|
if(!pTColumns[ i ].bVisible)
|
|
nColCount --;
|
|
nStart = nEnd;
|
|
}
|
|
pTColumns[ nAllCols ].nWidth = rTabCol.GetRight() - rTabCol.GetLeft() - nStart;
|
|
pTColumns[ nAllCols ].bVisible = sal_True;
|
|
nColCount++;
|
|
nAllCols++;
|
|
}
|
|
|
|
SwTableRep::~SwTableRep()
|
|
{
|
|
delete[] pTColumns;
|
|
}
|
|
|
|
sal_Bool SwTableRep::FillTabCols( SwTabCols& rTabCols ) const
|
|
{
|
|
long nOldLeft = rTabCols.GetLeft(),
|
|
nOldRight = rTabCols.GetRight();
|
|
|
|
sal_Bool bSingleLine = sal_False;
|
|
sal_uInt16 i;
|
|
|
|
for ( i = 0; i < rTabCols.Count(); ++i )
|
|
if(!pTColumns[i].bVisible)
|
|
{
|
|
bSingleLine = sal_True;
|
|
break;
|
|
}
|
|
|
|
SwTwips nPos = 0;
|
|
SwTwips nLeft = GetLeftSpace();
|
|
rTabCols.SetLeft(nLeft);
|
|
if(bSingleLine)
|
|
{
|
|
// die unsichtbaren Trenner werden aus den alten TabCols genommen
|
|
// die sichtbaren kommen aus pTColumns
|
|
TColumn* pOldTColumns = new TColumn[nAllCols + 1];
|
|
SwTwips nStart = 0,
|
|
nEnd;
|
|
for(i = 0; i < nAllCols - 1; i++)
|
|
{
|
|
nEnd = rTabCols[i] - rTabCols.GetLeft();
|
|
pOldTColumns[i].nWidth = nEnd - nStart;
|
|
pOldTColumns[i].bVisible = !rTabCols.IsHidden(i);
|
|
nStart = nEnd;
|
|
}
|
|
pOldTColumns[nAllCols - 1].nWidth = rTabCols.GetRight() - rTabCols.GetLeft() - nStart;
|
|
pOldTColumns[nAllCols - 1].bVisible = sal_True;
|
|
|
|
sal_uInt16 nOldPos = 0;
|
|
sal_uInt16 nNewPos = 0;
|
|
SwTwips nOld = 0;
|
|
SwTwips nNew = 0;
|
|
sal_Bool bOld = sal_False;
|
|
sal_Bool bFirst = sal_True;
|
|
i = 0;
|
|
|
|
while ( i < nAllCols -1 )
|
|
{
|
|
while((bFirst || bOld ) && nOldPos < nAllCols )
|
|
{
|
|
nOld += pOldTColumns[nOldPos].nWidth;
|
|
nOldPos++;
|
|
if(!pOldTColumns[nOldPos - 1].bVisible)
|
|
break;
|
|
}
|
|
while((bFirst || !bOld ) && nNewPos < nAllCols )
|
|
{
|
|
nNew += pTColumns[nNewPos].nWidth;
|
|
nNewPos++;
|
|
if(pOldTColumns[nNewPos - 1].bVisible)
|
|
break;
|
|
}
|
|
bFirst = sal_False;
|
|
// sie muessen sortiert eingefuegt werden
|
|
bOld = nOld < nNew;
|
|
nPos = sal_uInt16(bOld ? nOld : nNew);
|
|
rTabCols[i] = nPos + nLeft;
|
|
rTabCols.SetHidden( i, bOld );
|
|
i++;
|
|
}
|
|
rTabCols.SetRight(nLeft + nTblWidth);
|
|
|
|
delete[] pOldTColumns;
|
|
}
|
|
else
|
|
{
|
|
for ( i = 0; i < nAllCols - 1; ++i )
|
|
{
|
|
nPos += pTColumns[i].nWidth;
|
|
rTabCols[i] = nPos + rTabCols.GetLeft();
|
|
rTabCols.SetHidden( i, !pTColumns[i].bVisible );
|
|
rTabCols.SetRight(nLeft + pTColumns[nAllCols - 1].nWidth + nPos);
|
|
}
|
|
}
|
|
|
|
// Rundungsfehler abfangen
|
|
if(Abs((long)nOldLeft - (long)rTabCols.GetLeft()) < 3)
|
|
rTabCols.SetLeft(nOldLeft);
|
|
|
|
if(Abs((long)nOldRight - (long)rTabCols.GetRight()) < 3)
|
|
rTabCols.SetRight(nOldRight);
|
|
|
|
if(GetRightSpace() >= 0 &&
|
|
rTabCols.GetRight() > rTabCols.GetRightMax())
|
|
rTabCols.SetRight(rTabCols.GetRightMax());
|
|
return bSingleLine;
|
|
}
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|