/************************************************************************* * * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * Copyright 2000, 2010 Oracle and/or its affiliates. * * OpenOffice.org - a multi-platform office productivity suite * * This file is part of OpenOffice.org. * * OpenOffice.org is free software: you can redistribute it and/or modify * it under the terms of the GNU Lesser General Public License version 3 * only, as published by the Free Software Foundation. * * OpenOffice.org is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU Lesser General Public License version 3 for more details * (a copy is included in the LICENSE file that accompanied this code). * * You should have received a copy of the GNU Lesser General Public License * version 3 along with OpenOffice.org. If not, see * * for a copy of the LGPLv3 License. * ************************************************************************/ // ============================================================================ #ifndef _SC_CSVSPLITS_HXX #define _SC_CSVSPLITS_HXX #include #include // ============================================================================ /** Constant for an invalid vector index. */ const sal_uInt32 CSV_VEC_NOTFOUND = SAL_MAX_UINT32; /** Constant for an invalid ruler position. */ const sal_Int32 CSV_POS_INVALID = -1; // ---------------------------------------------------------------------------- /** A vector of column splits that supports inserting, removing and moving splits. */ class ScCsvSplits { private: typedef ::std::vector< sal_Int32 > ScSplitVector; typedef ScSplitVector::iterator iterator; typedef ScSplitVector::const_iterator const_iterator; ScSplitVector maVec; /// The split containter. public: // *** access by position *** --------------------------------------------- /** Inserts a new split at position nPos into the vector. @return true = split inserted (nPos was valid and empty). */ bool Insert( sal_Int32 nPos ); /** Removes a split by position. @return true = split found and removed. */ bool Remove( sal_Int32 nPos ); /** Removes a range of splits in the given position range. */ void RemoveRange( sal_Int32 nPosStart, sal_Int32 nPosEnd ); /** Removes all elements from the vector. */ void Clear(); /** Returns true if at position nPos is a split. */ bool HasSplit( sal_Int32 nPos ) const; // *** access by index *** ------------------------------------------------ /** Searches for a split at position nPos. @return the vector index of the split. */ sal_uInt32 GetIndex( sal_Int32 nPos ) const; /** Returns index of the first split greater than or equal to nPos. */ sal_uInt32 LowerBound( sal_Int32 nPos ) const; /** Returns index of the last split less than or equal to nPos. */ sal_uInt32 UpperBound( sal_Int32 nPos ) const; /** Returns the number of splits. */ inline sal_uInt32 Count() const { return maVec.size(); } /** Returns the position of the specified split. */ sal_Int32 GetPos( sal_uInt32 nIndex ) const; /** Returns the position of the specified split. */ inline sal_Int32 operator[]( sal_uInt32 nIndex ) const { return GetPos( nIndex ); } private: /** Returns the vector index of an iterator. */ sal_uInt32 GetIterIndex( const_iterator aIter ) const; }; // ============================================================================ #endif