97 lines
3.1 KiB
C++
97 lines
3.1 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/.
|
|
*/
|
|
|
|
#include <sal/config.h>
|
|
|
|
#include <dputil.hxx>
|
|
#include <subtotalparam.hxx>
|
|
|
|
#include <osl/diagnose.h>
|
|
|
|
#include <com/sun/star/sheet/SubTotalColumn.hpp>
|
|
#include <com/sun/star/uno/Sequence.hxx>
|
|
|
|
ScSubTotalParam::SubtotalGroup::SubtotalGroup(const SubtotalGroup& r)
|
|
: bActive(r.bActive)
|
|
, nField(r.nField)
|
|
{
|
|
if (r.nSubTotals > 0)
|
|
{
|
|
assert(r.pSubTotals);
|
|
AllocSubTotals(r.nSubTotals);
|
|
std::copy_n(r.pSubTotals.get(), r.nSubTotals, pSubTotals.get());
|
|
}
|
|
}
|
|
|
|
ScSubTotalParam::SubtotalGroup& ScSubTotalParam::SubtotalGroup::operator=(const SubtotalGroup& r)
|
|
{
|
|
bActive = r.bActive;
|
|
nField = r.nField;
|
|
|
|
AllocSubTotals(r.nSubTotals);
|
|
if (r.nSubTotals > 0)
|
|
{
|
|
assert(r.pSubTotals);
|
|
std::copy_n(r.pSubTotals.get(), r.nSubTotals, pSubTotals.get());
|
|
}
|
|
|
|
return *this;
|
|
}
|
|
|
|
bool ScSubTotalParam::SubtotalGroup::operator==(const SubtotalGroup& r) const
|
|
{
|
|
return bActive == r.bActive && nField == r.nField && nSubTotals == r.nSubTotals
|
|
&& (!nSubTotals
|
|
|| std::equal(pSubTotals.get(), pSubTotals.get() + nSubTotals, r.pSubTotals.get()));
|
|
}
|
|
|
|
void ScSubTotalParam::SubtotalGroup::AllocSubTotals(SCCOL n)
|
|
{
|
|
if (nSubTotals != n)
|
|
{
|
|
nSubTotals = std::max(n, SCCOL(0));
|
|
pSubTotals.reset(nSubTotals ? new std::pair<SCCOL, ScSubTotalFunc>[nSubTotals] : nullptr);
|
|
}
|
|
}
|
|
|
|
void ScSubTotalParam::SubtotalGroup::SetSubtotals(const css::uno::Sequence<css::sheet::SubTotalColumn>& seq)
|
|
{
|
|
AllocSubTotals(seq.getLength());
|
|
for (SCCOL i = 0; i < nSubTotals; ++i)
|
|
pSubTotals[i] = { seq[i].Column,
|
|
ScDPUtil::toSubTotalFunc(static_cast<ScGeneralFunction>(seq[i].Function)) };
|
|
}
|
|
|
|
void ScSubTotalParam::SetSubTotals( sal_uInt16 nGroup,
|
|
const SCCOL* ptrSubTotals,
|
|
const ScSubTotalFunc* ptrFunctions,
|
|
sal_uInt16 nCount )
|
|
{
|
|
OSL_ENSURE( (nGroup <= MAXSUBTOTAL),
|
|
"ScSubTotalParam::SetSubTotals(): nGroup > MAXSUBTOTAL!" );
|
|
OSL_ENSURE( ptrSubTotals,
|
|
"ScSubTotalParam::SetSubTotals(): ptrSubTotals == NULL!" );
|
|
OSL_ENSURE( ptrFunctions,
|
|
"ScSubTotalParam::SetSubTotals(): ptrFunctions == NULL!" );
|
|
OSL_ENSURE( (nCount > 0),
|
|
"ScSubTotalParam::SetSubTotals(): nCount == 0!" );
|
|
|
|
if ( !(ptrSubTotals && ptrFunctions && (nCount > 0) && (nGroup <= MAXSUBTOTAL)) )
|
|
return;
|
|
|
|
// 0 is interpreted as 1, otherwise decrementing the array index
|
|
if (nGroup != 0)
|
|
nGroup--;
|
|
|
|
aGroups[nGroup].AllocSubTotals(nCount);
|
|
for ( sal_uInt16 i=0; i<nCount; i++ )
|
|
aGroups[nGroup].pSubTotals[i] = { ptrSubTotals[i], ptrFunctions[i] };
|
|
}
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|