212 lines
6.2 KiB
C++
212 lines
6.2 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/*************************************************************************
|
|
*
|
|
* 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
|
|
* <http://www.openoffice.org/license.html>
|
|
* for a copy of the LGPLv3 License.
|
|
*
|
|
************************************************************************/
|
|
#ifndef _INDEX_HXX
|
|
#define _INDEX_HXX
|
|
|
|
#include <limits.h>
|
|
|
|
#include "rtl/instance.hxx"
|
|
#include <tools/solar.h>
|
|
#include <tools/rtti.hxx> // for RTTI of SwIndexReg
|
|
#include <tools/string.hxx> // for xub_StrLen
|
|
#include <swdllapi.h>
|
|
|
|
#define INVALID_INDEX STRING_NOTFOUND
|
|
|
|
// Maximal count of indices in IndexArray (for testing on overflows).
|
|
class SwIndex;
|
|
class SwIndexReg;
|
|
struct SwPosition;
|
|
|
|
#if OSL_DEBUG_LEVEL > 1
|
|
#define INLINE
|
|
#else
|
|
#define INLINE inline
|
|
#endif
|
|
|
|
class SW_DLLPUBLIC SwIndex
|
|
{
|
|
friend class SwIndexReg;
|
|
|
|
#if OSL_DEBUG_LEVEL > 1
|
|
static int nSerial;
|
|
int MySerial;
|
|
#endif
|
|
|
|
xub_StrLen nIndex;
|
|
SwIndexReg* pArray;
|
|
SwIndex *pNext, *pPrev;
|
|
|
|
SwIndex& ChgValue( const SwIndex& rIdx, xub_StrLen nNewValue );
|
|
void Remove();
|
|
|
|
public:
|
|
explicit SwIndex(SwIndexReg *const pReg, xub_StrLen const nIdx = 0);
|
|
SwIndex( const SwIndex & );
|
|
SwIndex( const SwIndex &, short nDiff );
|
|
~SwIndex() { Remove(); }
|
|
|
|
INLINE xub_StrLen operator++();
|
|
INLINE xub_StrLen operator--();
|
|
INLINE xub_StrLen operator++(int);
|
|
INLINE xub_StrLen operator--(int);
|
|
|
|
INLINE xub_StrLen operator+=( xub_StrLen );
|
|
INLINE xub_StrLen operator-=( xub_StrLen );
|
|
INLINE xub_StrLen operator+=( const SwIndex& );
|
|
INLINE xub_StrLen operator-=( const SwIndex& );
|
|
|
|
INLINE sal_Bool operator<( const SwIndex& ) const;
|
|
INLINE sal_Bool operator<=( const SwIndex& ) const;
|
|
INLINE sal_Bool operator>( const SwIndex& ) const;
|
|
INLINE sal_Bool operator>=( const SwIndex& ) const;
|
|
sal_Bool operator==( const SwIndex& rSwIndex ) const
|
|
{ return (nIndex == rSwIndex.nIndex) && (pArray == rSwIndex.pArray); }
|
|
|
|
sal_Bool operator!=( const SwIndex& rSwIndex ) const
|
|
{ return (nIndex != rSwIndex.nIndex) || (pArray != rSwIndex.pArray); }
|
|
|
|
sal_Bool operator<( xub_StrLen nWert ) const { return nIndex < nWert; }
|
|
sal_Bool operator<=( xub_StrLen nWert ) const { return nIndex <= nWert; }
|
|
sal_Bool operator>( xub_StrLen nWert ) const { return nIndex > nWert; }
|
|
sal_Bool operator>=( xub_StrLen nWert ) const { return nIndex >= nWert; }
|
|
sal_Bool operator==( xub_StrLen nWert ) const { return nIndex == nWert; }
|
|
sal_Bool operator!=( xub_StrLen nWert ) const { return nIndex != nWert; }
|
|
|
|
INLINE SwIndex& operator=( xub_StrLen );
|
|
SwIndex& operator=( const SwIndex & );
|
|
|
|
xub_StrLen GetIndex() const { return nIndex; }
|
|
|
|
// Assignments without creating a temporary object.
|
|
SwIndex &Assign(SwIndexReg *,xub_StrLen);
|
|
|
|
// Returns pointer to IndexArray (for RTTI at SwIndexReg).
|
|
const SwIndexReg* GetIdxReg() const { return pArray; }
|
|
};
|
|
|
|
#undef INLINE
|
|
|
|
class SwIndexReg
|
|
{
|
|
friend class SwIndex;
|
|
friend bool lcl_PosOk(const SwPosition & aPos);
|
|
|
|
const SwIndex *pFirst, *pLast, *pMiddle;
|
|
|
|
protected:
|
|
virtual void Update( SwIndex const & rPos, const xub_StrLen nChangeLen,
|
|
const bool bNegative = false, const bool bDelete = false );
|
|
|
|
void ChkArr();
|
|
|
|
sal_Bool HasAnyIndex() const { return 0 != pFirst; }
|
|
|
|
public:
|
|
SwIndexReg();
|
|
virtual ~SwIndexReg();
|
|
|
|
// rtti, abgeleitete moegens gleichtun oder nicht. Wenn sie es gleichtun
|
|
// kann ueber das SwIndexReg typsicher gecastet werden.
|
|
TYPEINFO();
|
|
|
|
void MoveTo( SwIndexReg& rArr );
|
|
};
|
|
|
|
// A global array for holding indices that need to be "swapped" temporarily or
|
|
// do not know a valid array (SwPaM/SwPosition!):
|
|
struct EmptyIndexArray: rtl::Static< SwIndexReg, EmptyIndexArray > {};
|
|
|
|
#if !defined(OSL_DEBUG_LEVEL) || OSL_DEBUG_LEVEL < 2
|
|
|
|
inline xub_StrLen SwIndex::operator++()
|
|
{
|
|
return ChgValue( *this, nIndex+1 ).nIndex;
|
|
}
|
|
inline xub_StrLen SwIndex::operator--()
|
|
{
|
|
return ChgValue( *this, nIndex-1 ).nIndex;
|
|
}
|
|
inline xub_StrLen SwIndex::operator++(int)
|
|
{
|
|
xub_StrLen nOldIndex = nIndex;
|
|
ChgValue( *this, nIndex+1 );
|
|
return nOldIndex;
|
|
}
|
|
inline xub_StrLen SwIndex::operator--(int)
|
|
{
|
|
xub_StrLen nOldIndex = nIndex;
|
|
ChgValue( *this, nIndex-1 );
|
|
return nOldIndex;
|
|
}
|
|
|
|
inline xub_StrLen SwIndex::operator+=( xub_StrLen nWert )
|
|
{
|
|
return ChgValue( *this, nIndex + nWert ).nIndex;
|
|
}
|
|
inline xub_StrLen SwIndex::operator-=( xub_StrLen nWert )
|
|
{
|
|
return ChgValue( *this, nIndex - nWert ).nIndex;
|
|
}
|
|
inline xub_StrLen SwIndex::operator+=( const SwIndex& rIndex )
|
|
{
|
|
return ChgValue( *this, nIndex + rIndex.nIndex ).nIndex;
|
|
}
|
|
inline xub_StrLen SwIndex::operator-=( const SwIndex& rIndex )
|
|
{
|
|
return ChgValue( *this, nIndex - rIndex.nIndex ).nIndex;
|
|
}
|
|
|
|
inline sal_Bool SwIndex::operator<( const SwIndex& rIndex ) const
|
|
{
|
|
return nIndex < rIndex.nIndex;
|
|
}
|
|
inline sal_Bool SwIndex::operator<=( const SwIndex& rIndex ) const
|
|
{
|
|
return nIndex <= rIndex.nIndex;
|
|
}
|
|
inline sal_Bool SwIndex::operator>( const SwIndex& rIndex ) const
|
|
{
|
|
return nIndex > rIndex.nIndex;
|
|
}
|
|
inline sal_Bool SwIndex::operator>=( const SwIndex& rIndex ) const
|
|
{
|
|
return nIndex >= rIndex.nIndex;
|
|
}
|
|
inline SwIndex& SwIndex::operator=( xub_StrLen nWert )
|
|
{
|
|
if( nIndex != nWert )
|
|
ChgValue( *this, nWert );
|
|
return *this;
|
|
}
|
|
|
|
#endif // PRODUCT
|
|
|
|
#endif
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|