/* -*- 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/. */ #ifndef INCLUDED_SC_INC_MTVFUNCTIONS_HXX #define INCLUDED_SC_INC_MTVFUNCTIONS_HXX #include #include namespace sc { template struct FuncElseNoOp { Ret operator() (mdds::mtv::element_t, SizeT, SizeT) const { return Ret(); } }; /** * Generic algorithm to parse blocks of multi_type_vector either partially * or fully. */ template typename StoreT::const_iterator ParseBlock( const typename StoreT::const_iterator& itPos, const StoreT& rStore, Func& rFunc, typename StoreT::size_type nStart, typename StoreT::size_type nEnd) { typedef std::pair PositionType; PositionType aPos = rStore.position(itPos, nStart); typename StoreT::const_iterator it = aPos.first; typename StoreT::size_type nOffset = aPos.second; typename StoreT::size_type nDataSize = 0; typename StoreT::size_type nTopRow = nStart; for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize) { bool bLastBlock = false; nDataSize = it->size - nOffset; if (nTopRow + nDataSize - 1 > nEnd) { // Truncate the block. nDataSize = nEnd - nTopRow + 1; bLastBlock = true; } rFunc(*it, nOffset, nDataSize); if (bLastBlock) break; } return it; } /** * Non-const variant of the above function. TODO: Find a way to merge these * two in an elegant way. */ template typename StoreT::iterator ProcessBlock(const typename StoreT::iterator& itPos, StoreT& rStore, Func& rFunc, typename StoreT::size_type nStart, typename StoreT::size_type nEnd) { typedef std::pair PositionType; PositionType aPos = rStore.position(itPos, nStart); typename StoreT::iterator it = aPos.first; typename StoreT::size_type nOffset = aPos.second; typename StoreT::size_type nDataSize = 0; typename StoreT::size_type nCurRow = nStart; for (; it != rStore.end() && nCurRow <= nEnd; ++it, nOffset = 0, nCurRow += nDataSize) { bool bLastBlock = false; nDataSize = it->size - nOffset; if (nCurRow + nDataSize - 1 > nEnd) { // Truncate the block. nDataSize = nEnd - nCurRow + 1; bLastBlock = true; } rFunc(*it, nOffset, nDataSize); if (bLastBlock) break; } return it; } template void EachElem(NodeT& rNode, size_t nOffset, size_t nDataSize, FuncElem& rFuncElem) { ItrT it = BlkT::begin(*rNode.data); std::advance(it, nOffset); ItrT itEnd = it; std::advance(itEnd, nDataSize); size_t nRow = rNode.position + nOffset; for (; it != itEnd; ++it, ++nRow) rFuncElem(nRow, *it); } template void EachElem(NodeT& rNode, FuncElem& rFuncElem) { ItrT it = BlkT::begin(*rNode.data); ItrT itEnd = BlkT::end(*rNode.data); size_t nRow = rNode.position; for (; it != itEnd; ++it, ++nRow) rFuncElem(nRow, *it); } template std::pair CheckElem( const StoreT& rStore, const typename StoreT::const_iterator& it, size_t nOffset, size_t nDataSize, FuncElem& rFuncElem) { typedef std::pair PositionType; typename BlkT::const_iterator itData = BlkT::begin(*it->data); std::advance(itData, nOffset); typename BlkT::const_iterator itDataEnd = itData; std::advance(itDataEnd, nDataSize); size_t nTopRow = it->position + nOffset; size_t nRow = nTopRow; for (; itData != itDataEnd; ++itData, ++nRow) { if (rFuncElem(nRow, *itData)) return PositionType(it, nRow - it->position); } return PositionType(rStore.end(), 0); } template void ParseElements1(const StoreT& rStore, FuncElem& rFuncElem, FuncElse& rFuncElse) { typename StoreT::size_type nTopRow = 0, nDataSize = 0; typename StoreT::const_iterator it = rStore.begin(), itEnd = rStore.end(); for (; it != itEnd; ++it, nTopRow += nDataSize) { nDataSize = it->size; if (it->type != BlkT::block_type) { rFuncElse(it->type, nTopRow, nDataSize); continue; } EachElem(*it, rFuncElem); } } template typename StoreT::const_iterator ParseElements1( const typename StoreT::const_iterator& itPos, const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd, FuncElem& rFuncElem, FuncElse& rFuncElse) { typedef std::pair PositionType; PositionType aPos = rStore.position(itPos, nStart); typename StoreT::const_iterator it = aPos.first; typename StoreT::size_type nOffset = aPos.second; typename StoreT::size_type nDataSize = 0; typename StoreT::size_type nTopRow = nStart; for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize) { bool bLastBlock = false; nDataSize = it->size - nOffset; if (nTopRow + nDataSize - 1 > nEnd) { // Truncate the block. nDataSize = nEnd - nTopRow + 1; bLastBlock = true; } if (it->type == BlkT::block_type) EachElem(*it, nOffset, nDataSize, rFuncElem); else rFuncElse(it->type, nTopRow, nDataSize); if (bLastBlock) break; } return it; }; template typename StoreT::const_iterator ParseElements2( const typename StoreT::const_iterator& itPos, const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd, FuncElem& rFuncElem, FuncElse& rFuncElse) { typedef std::pair PositionType; PositionType aPos = rStore.position(itPos, nStart); typename StoreT::const_iterator it = aPos.first; typename StoreT::size_type nOffset = aPos.second; typename StoreT::size_type nDataSize = 0; typename StoreT::size_type nTopRow = nStart; for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize) { bool bLastBlock = false; nDataSize = it->size - nOffset; if (nTopRow + nDataSize - 1 > nEnd) { // Truncate the block. nDataSize = nEnd - nTopRow + 1; bLastBlock = true; } switch (it->type) { case Blk1::block_type: EachElem(*it, nOffset, nDataSize, rFuncElem); break; case Blk2::block_type: EachElem(*it, nOffset, nDataSize, rFuncElem); break; default: rFuncElse(it->type, nTopRow, nDataSize); } if (bLastBlock) break; } return it; } template typename StoreT::const_iterator ParseElements4( const typename StoreT::const_iterator& itPos, const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd, FuncElem& rFuncElem, FuncElse& rFuncElse) { typedef std::pair PositionType; PositionType aPos = rStore.position(itPos, nStart); typename StoreT::const_iterator it = aPos.first; typename StoreT::size_type nOffset = aPos.second; typename StoreT::size_type nDataSize = 0; typename StoreT::size_type nTopRow = nStart; for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize) { bool bLastBlock = false; nDataSize = it->size - nOffset; if (nTopRow + nDataSize - 1 > nEnd) { // Truncate the block. nDataSize = nEnd - nTopRow + 1; bLastBlock = true; } switch (it->type) { case Blk1::block_type: EachElem(*it, nOffset, nDataSize, rFuncElem); break; case Blk2::block_type: EachElem(*it, nOffset, nDataSize, rFuncElem); break; case Blk3::block_type: EachElem(*it, nOffset, nDataSize, rFuncElem); break; case Blk4::block_type: EachElem(*it, nOffset, nDataSize, rFuncElem); break; default: rFuncElse(it->type, nTopRow, nDataSize); } if (bLastBlock) break; } return it; } template void ProcessElements1(StoreT& rStore, FuncElem& rFuncElem, FuncElse& rFuncElse) { typename StoreT::size_type nTopRow = 0, nDataSize = 0; typename StoreT::iterator it = rStore.begin(), itEnd = rStore.end(); for (; it != itEnd; ++it, nTopRow += nDataSize) { nDataSize = it->size; if (it->type != BlkT::block_type) { rFuncElse(it->type, nTopRow, nDataSize); continue; } EachElem(*it, rFuncElem); } } /** * This variant specifies start and end positions. */ template typename StoreT::iterator ProcessElements1( const typename StoreT::iterator& itPos, StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd, FuncElem& rFuncElem, FuncElse& rFuncElse) { typedef std::pair PositionType; PositionType aPos = rStore.position(itPos, nStart); typename StoreT::iterator it = aPos.first; typename StoreT::size_type nOffset = aPos.second; typename StoreT::size_type nDataSize = 0; typename StoreT::size_type nTopRow = nStart; for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize) { bool bLastBlock = false; nDataSize = it->size - nOffset; if (nTopRow + nDataSize - 1 > nEnd) { // Truncate the block. nDataSize = nEnd - nTopRow + 1; bLastBlock = true; } if (it->type == BlkT::block_type) EachElem(*it, nOffset, nDataSize, rFuncElem); else rFuncElse(it->type, nTopRow, nDataSize); if (bLastBlock) break; } return it; }; template void ProcessElements2(StoreT& rStore, FuncElem& rFuncElem, FuncElse& rFuncElse) { typename StoreT::size_type nTopRow = 0, nDataSize = 0; typename StoreT::iterator it = rStore.begin(), itEnd = rStore.end(); for (; it != itEnd; ++it, nTopRow += nDataSize) { nDataSize = it->size; switch (it->type) { case Blk1::block_type: EachElem(*it, rFuncElem); break; case Blk2::block_type: EachElem(*it, rFuncElem); break; default: rFuncElse(it->type, nTopRow, nDataSize); } } } template std::pair FindElement1( const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd, FuncElem& rFuncElem, FuncElse& rFuncElse) { typedef std::pair PositionType; typedef std::pair ElseRetType; PositionType aPos = rStore.position(nStart); typename StoreT::const_iterator it = aPos.first; typename StoreT::size_type nOffset = aPos.second; typename StoreT::size_type nDataSize = 0; typename StoreT::size_type nTopRow = nStart; for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize) { bool bLastBlock = false; nDataSize = it->size - nOffset; if (nTopRow + nDataSize - 1 > nEnd) { // Truncate the block. nDataSize = nEnd - nTopRow + 1; bLastBlock = true; } switch (it->type) { case Blk1::block_type: { PositionType aRet = CheckElem(rStore, it, nOffset, nDataSize, rFuncElem); if (aRet.first != rStore.end()) return aRet; } break; default: { ElseRetType aRet = rFuncElse(it->type, nTopRow, nDataSize); if (aRet.second) return PositionType(it, aRet.first); } } if (bLastBlock) break; } return PositionType(rStore.end(), 0); } template std::pair FindElement2( const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd, FuncElem& rFuncElem, FuncElse& rFuncElse) { typedef std::pair PositionType; typedef std::pair ElseRetType; PositionType aPos = rStore.position(nStart); typename StoreT::const_iterator it = aPos.first; typename StoreT::size_type nOffset = aPos.second; typename StoreT::size_type nDataSize = 0; typename StoreT::size_type nTopRow = nStart; for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize) { bool bLastBlock = false; nDataSize = it->size - nOffset; if (nTopRow + nDataSize - 1 > nEnd) { // Truncate the block. nDataSize = nEnd - nTopRow + 1; bLastBlock = true; } switch (it->type) { case Blk1::block_type: { PositionType aRet = CheckElem(rStore, it, nOffset, nDataSize, rFuncElem); if (aRet.first != rStore.end()) return aRet; } break; case Blk2::block_type: { PositionType aRet = CheckElem(rStore, it, nOffset, nDataSize, rFuncElem); if (aRet.first != rStore.end()) return aRet; } break; default: { ElseRetType aRet = rFuncElse(*it, nOffset, nDataSize); if (aRet.second) return PositionType(it, aRet.first); } } if (bLastBlock) break; } return PositionType(rStore.end(), 0); } } #endif /* vim:set shiftwidth=4 softtabstop=4 expandtab: */