/* -*- 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 . */ #ifndef INCLUDED_SC_INC_COMPRESSEDARRAY_HXX #define INCLUDED_SC_INC_COMPRESSEDARRAY_HXX #include #include #include "scdllapi.h" const size_t nScCompressedArrayDelta = 4; /** Compressed array of row (or column) entries, e.g. heights, flags, ... The array stores ranges of values such that consecutive values occupy only one entry. Initially it consists of one DataEntry with an implied start row/column of 0 and an end row/column of access type maximum value. typename A := access type, e.g. SCROW or SCCOL, must be a POD. typename D := data type, e.g. sal_uInt16 or sal_uInt8 or whatever, may also be a struct or class. D::operator==() and D::operator=() must be implemented. Force template instantiation for a specific type in source/core/data/compressedarray.cxx TODO: Currently the allocated memory never shrinks, must manually invoke Resize() if needed. */ template< typename A, typename D > class ScCompressedArray { public: struct DataEntry { A nEnd; // start is end of previous entry + 1 D aValue; DataEntry() {} //! uninitialized }; /** Construct with nMaxAccess=MAXROW, for example. */ ScCompressedArray( A nMaxAccess, const D& rValue, size_t nDelta = nScCompressedArrayDelta ); /** Construct from a plain array of D */ ScCompressedArray( A nMaxAccess, const D* pDataArray, size_t nDataCount ); virtual ~ScCompressedArray(); void Resize( size_t nNewSize ); void Reset( const D& rValue ); void SetValue( A nPos, const D& rValue ); void SetValue( A nStart, A nEnd, const D& rValue ); const D& GetValue( A nPos ) const; /** Get value for a row, and it's region end row */ const D& GetValue( A nPos, size_t& nIndex, A& nEnd ) const; /** Get next value and it's region end row. If nIndex=nCount, the value of the last entry is returned again. */ const D& GetNextValue( size_t& nIndex, A& nEnd ) const; /** Insert rows before nStart and copy value for inserted rows from nStart-1, return that value. */ const D& Insert( A nStart, size_t nCount ); void Remove( A nStart, size_t nCount ); /** Copy rArray.nStart+nSourceDy to this.nStart */ void CopyFrom( const ScCompressedArray& rArray, A nStart, A nEnd ); // methods public for the coupled array sum methods /** Obtain index into entries for nPos */ SC_DLLPUBLIC size_t Search( A nPos ) const; protected: size_t nCount; size_t nLimit; size_t nDelta; DataEntry* pData; A nMaxAccess; }; template< typename A, typename D > void ScCompressedArray::Reset( const D& rValue ) { // Create a temporary copy in case we got a reference passed that points to // a part of the array to be reallocated. D aTmpVal( rValue); delete[] pData; nCount = nLimit = 1; pData = new DataEntry[1]; pData[0].aValue = aTmpVal; pData[0].nEnd = nMaxAccess; } template< typename A, typename D > void ScCompressedArray::SetValue( A nPos, const D& rValue ) { SetValue( nPos, nPos, rValue); } template< typename A, typename D > const D& ScCompressedArray::GetValue( A nPos ) const { size_t nIndex = Search( nPos); return pData[nIndex].aValue; } template< typename A, typename D > const D& ScCompressedArray::GetValue( A nPos, size_t& nIndex, A& nEnd ) const { nIndex = Search( nPos); nEnd = pData[nIndex].nEnd; return pData[nIndex].aValue; } template< typename A, typename D > const D& ScCompressedArray::GetNextValue( size_t& nIndex, A& nEnd ) const { if (nIndex < nCount) ++nIndex; size_t nEntry = (nIndex < nCount ? nIndex : nCount-1); nEnd = pData[nEntry].nEnd; return pData[nEntry].aValue; } // ScBitMaskCompressedArray /** The data type represents bits, manageable by bitwise operations. */ template< typename A, typename D > class ScBitMaskCompressedArray : public ScCompressedArray { public: ScBitMaskCompressedArray( A nMaxAccessP, const D& rValue, size_t nDeltaP = nScCompressedArrayDelta ) : ScCompressedArray( nMaxAccessP, rValue, nDeltaP) {} ScBitMaskCompressedArray( A nMaxAccessP, const D* pDataArray, size_t nDataCount ) : ScCompressedArray( nMaxAccessP, pDataArray, nDataCount) {} void AndValue( A nPos, const D& rValueToAnd ); void OrValue( A nPos, const D& rValueToOr ); void AndValue( A nStart, A nEnd, const D& rValueToAnd ); void OrValue( A nStart, A nEnd, const D& rValueToOr ); /** Copy values from rArray and bitwise AND them with rValueToAnd. */ void CopyFromAnded( const ScBitMaskCompressedArray& rArray, A nStart, A nEnd, const D& rValueToAnd ); /** Return the last row where an entry meets the condition: ((aValue & rBitMask) != 0), start searching at 0. If no entry meets this condition, ::std::numeric_limits::max() is returned. */ A GetLastAnyBitAccess( const D& rBitMask ) const; }; template< typename A, typename D > void ScBitMaskCompressedArray::AndValue( A nPos, const D& rValueToAnd ) { const D& rValue = this->GetValue( nPos); if ((rValue & rValueToAnd) != rValue) this->SetValue( nPos, rValue & rValueToAnd); } template< typename A, typename D > void ScBitMaskCompressedArray::OrValue( A nPos, const D& rValueToOr ) { const D& rValue = this->GetValue( nPos); if ((rValue | rValueToOr) != rValue) this->SetValue( nPos, rValue | rValueToOr); } #endif // INCLUDED_SC_INC_COMPRESSEDARRAY_HXX /* vim:set shiftwidth=4 softtabstop=4 expandtab: */ o/mimo/mimo-7-3 LibreOffice 核心代码仓库文档基金会
summaryrefslogtreecommitdiff
path: root/include/sfx2/sfxdlg.hxx
AgeCommit message (Expand)Author
2018-03-28lokdialog: Set parent for AutoCorrect Options... so that it can be tunneled.Jan Holesovsky
2017-05-09loplugin:constantparamNoel Grandin
2016-11-22loplugin:countusersofdefaultparams in include/sfx2Noel Grandin
2016-11-18includes should be at the top of the fileNoel Grandin
2016-10-28ScopedVclPtr vs std::unique_ptr for VclAbstractDialog derivativesCaolán McNamara
2016-10-27make the AbstractDialog stuff extend from VclReferenceBaseNoel Grandin
2016-10-10drop some unused forward declarations and includesCaolán McNamara
2016-09-13loplugin:override: No more need for the "MSVC dtor override" workaroundStephan Bergmann
2016-09-09loplugin:constantparam in sfx2Noel Grandin