Files
libreoffice/sw/inc/index.hxx

220 lines
6.2 KiB
C++
Raw Normal View History

2000-09-18 16:15:01 +00:00
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
2000-09-18 16:15:01 +00:00
*
* Copyright 2008 by Sun Microsystems, Inc.
2000-09-18 16:15:01 +00:00
*
* OpenOffice.org - a multi-platform office productivity suite
2000-09-18 16:15:01 +00:00
*
* $RCSfile: index.hxx,v $
* $Revision: 1.10 $
2000-09-18 16:15:01 +00:00
*
* This file is part of OpenOffice.org.
2000-09-18 16:15:01 +00:00
*
* 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.
2000-09-18 16:15:01 +00:00
*
* 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).
2000-09-18 16:15:01 +00:00
*
* 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.
2000-09-18 16:15:01 +00:00
*
************************************************************************/
#ifndef _INDEX_HXX
#define _INDEX_HXX
#include <limits.h>
#include <tools/solar.h>
#include <tools/rtti.hxx> // for RTTI of SwIndexReg
#include <tools/string.hxx> // for xub_StrLen
#define INVALID_INDEX STRING_NOTFOUND
// Maximale Anzahl von Indizies im IndexArray (zum Abtesten auf Ueberlaeufe)
class SwIndex;
class SwIndexReg;
struct SwPosition;
2000-09-18 16:15:01 +00:00
#ifdef PRODUCT
#define INLINE inline
#else
#define INLINE
#endif
class SwIndex
{
friend class SwIndexReg;
#ifndef PRODUCT
static int nSerial;
int MySerial;
#endif
xub_StrLen nIndex;
SwIndexReg* pArray;
SwIndex *pNext, *pPrev;
SwIndex& ChgValue( const SwIndex& rIdx, xub_StrLen nNewValue );
void Remove(); // Ausketten
public:
SwIndex( SwIndexReg * pReg, xub_StrLen nIdx = 0 );
SwIndex( const SwIndex & );
SwIndex( const SwIndex &, short nDiff );
~SwIndex() { Remove(); }
INLINE xub_StrLen operator++();
INLINE xub_StrLen operator--();
#ifndef CFRONT
INLINE xub_StrLen operator++(int);
INLINE xub_StrLen operator--(int);
#endif
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 BOOL operator<( const SwIndex& ) const;
INLINE BOOL operator<=( const SwIndex& ) const;
INLINE BOOL operator>( const SwIndex& ) const;
INLINE BOOL operator>=( const SwIndex& ) const;
BOOL operator==( const SwIndex& rSwIndex ) const
{ return (nIndex == rSwIndex.nIndex) && (pArray == rSwIndex.pArray); }
BOOL operator!=( const SwIndex& rSwIndex ) const
{ return (nIndex != rSwIndex.nIndex) || (pArray != rSwIndex.pArray); }
BOOL operator<( xub_StrLen nWert ) const { return nIndex < nWert; }
BOOL operator<=( xub_StrLen nWert ) const { return nIndex <= nWert; }
BOOL operator>( xub_StrLen nWert ) const { return nIndex > nWert; }
BOOL operator>=( xub_StrLen nWert ) const { return nIndex >= nWert; }
BOOL operator==( xub_StrLen nWert ) const { return nIndex == nWert; }
BOOL operator!=( xub_StrLen nWert ) const { return nIndex != nWert; }
INLINE SwIndex& operator=( xub_StrLen );
SwIndex& operator=( const SwIndex & );
// gebe den Wert vom Index als xub_StrLen zurueck
xub_StrLen GetIndex() const { return nIndex; }
// ermoeglicht Zuweisungen ohne Erzeugen eines temporaeren
// Objektes
SwIndex &Assign(SwIndexReg *,xub_StrLen);
// Herausgabe des Pointers auf das IndexArray,
// (fuers RTTI am SwIndexReg)
const SwIndexReg* GetIdxReg() const { return pArray; }
};
#undef INLINE
class SwIndexReg
{
friend class SwIndex;
friend bool lcl_PosOk(const SwPosition & aPos);
2000-09-18 16:15:01 +00:00
const SwIndex *pFirst, *pLast, *pMiddle;
// ein globales Array, in das Indizies verschoben werden, die mal
// temporaer "ausgelagert" werden muessen; oder die zum Zeitpunkt des
// anlegens kein gueltiges Array kennen (SwPaM/SwPosition!)
friend void _InitCore();
friend void _FinitCore();
static SwIndexReg* pEmptyIndexArray;
protected:
virtual void Update( const SwIndex & aPos, xub_StrLen nLen,
BOOL bNegativ = FALSE, BOOL bDelete = FALSE );
2000-09-18 16:15:01 +00:00
void ChkArr();
BOOL HasAnyIndex() const { return 0 != pFirst; }
public:
SwIndexReg();
virtual ~SwIndexReg();
2000-09-18 16:15:01 +00:00
// rtti, abgeleitete moegens gleichtun oder nicht. Wenn sie es gleichtun
// kann ueber das SwIndexReg typsicher gecastet werden.
TYPEINFO();
void MoveTo( SwIndexReg& rArr );
};
#ifdef PRODUCT
inline xub_StrLen SwIndex::operator++()
{
return ChgValue( *this, nIndex+1 ).nIndex;
}
inline xub_StrLen SwIndex::operator--()
{
return ChgValue( *this, nIndex-1 ).nIndex;
}
#ifndef CFRONT
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;
}
#endif
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 BOOL SwIndex::operator<( const SwIndex& rIndex ) const
{
return nIndex < rIndex.nIndex;
}
inline BOOL SwIndex::operator<=( const SwIndex& rIndex ) const
{
return nIndex <= rIndex.nIndex;
}
inline BOOL SwIndex::operator>( const SwIndex& rIndex ) const
{
return nIndex > rIndex.nIndex;
}
inline 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
2000-09-18 16:15:01 +00:00
#endif