237 lines
7.0 KiB
C++
237 lines
7.0 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 SW_NDINDEX_HXX
|
|
#define SW_NDINDEX_HXX
|
|
|
|
#include <limits.h>
|
|
|
|
#include <tools/solar.h>
|
|
|
|
#include <node.hxx>
|
|
|
|
|
|
class SwNode;
|
|
class SwNodes;
|
|
|
|
/// Marks a node in the document model.
|
|
class SW_DLLPUBLIC SwNodeIndex
|
|
{
|
|
friend void SwNodes::RegisterIndex( SwNodeIndex& );
|
|
friend void SwNodes::DeRegisterIndex( SwNodeIndex& );
|
|
friend void SwNodes::RemoveNode( sal_uLong, sal_uLong, sal_Bool );
|
|
|
|
SwNode* pNd;
|
|
SwNodeIndex *pNext, *pPrev;
|
|
|
|
void Remove();
|
|
|
|
// These are not allowed!
|
|
SwNodeIndex( SwNodes& rNds, sal_uInt16 nIdx );
|
|
SwNodeIndex( SwNodes& rNds, int nIdx );
|
|
|
|
public:
|
|
SwNodeIndex( SwNodes& rNds, sal_uLong nIdx = 0 );
|
|
SwNodeIndex( const SwNodeIndex &, long nDiff = 0 );
|
|
SwNodeIndex( const SwNode&, long nDiff = 0 );
|
|
~SwNodeIndex() { Remove(); }
|
|
|
|
inline sal_uLong operator++();
|
|
inline sal_uLong operator--();
|
|
inline sal_uLong operator++(int);
|
|
inline sal_uLong operator--(int);
|
|
|
|
inline sal_uLong operator+=( sal_uLong );
|
|
inline sal_uLong operator-=( sal_uLong );
|
|
inline sal_uLong operator+=( const SwNodeIndex& );
|
|
inline sal_uLong operator-=( const SwNodeIndex& );
|
|
|
|
inline sal_Bool operator< ( const SwNodeIndex& ) const;
|
|
inline sal_Bool operator<=( const SwNodeIndex& ) const;
|
|
inline sal_Bool operator> ( const SwNodeIndex& ) const;
|
|
inline sal_Bool operator>=( const SwNodeIndex& ) const;
|
|
inline sal_Bool operator==( const SwNodeIndex& ) const;
|
|
inline sal_Bool operator!=( const SwNodeIndex& ) const;
|
|
|
|
inline sal_Bool operator< ( sal_uLong nWert ) const;
|
|
inline sal_Bool operator<=( sal_uLong nWert ) const;
|
|
inline sal_Bool operator> ( sal_uLong nWert ) const;
|
|
inline sal_Bool operator>=( sal_uLong nWert ) const;
|
|
inline sal_Bool operator==( sal_uLong nWert ) const;
|
|
inline sal_Bool operator!=( sal_uLong nWert ) const;
|
|
|
|
inline SwNodeIndex& operator=( sal_uLong );
|
|
SwNodeIndex& operator=( const SwNodeIndex& );
|
|
SwNodeIndex& operator=( const SwNode& );
|
|
|
|
// Return value of index as sal_uLong.
|
|
inline sal_uLong GetIndex() const;
|
|
|
|
// Enables assignments without creation of a temporary object.
|
|
SwNodeIndex& Assign( SwNodes& rNds, sal_uLong );
|
|
SwNodeIndex& Assign( const SwNode& rNd, long nOffset = 0 );
|
|
|
|
// Gets pointer on NodesArray.
|
|
inline const SwNodes& GetNodes() const;
|
|
inline SwNodes& GetNodes();
|
|
|
|
SwNode& GetNode() const { return *pNd; }
|
|
};
|
|
|
|
// SwRange
|
|
|
|
class SW_DLLPUBLIC SwNodeRange
|
|
{
|
|
public:
|
|
SwNodeIndex aStart;
|
|
SwNodeIndex aEnd;
|
|
|
|
SwNodeRange( const SwNodeIndex &rS, const SwNodeIndex &rE );
|
|
SwNodeRange( const SwNodeRange &rRange );
|
|
|
|
SwNodeRange( SwNodes& rArr, sal_uLong nSttIdx = 0, sal_uLong nEndIdx = 0 );
|
|
SwNodeRange( const SwNodeIndex& rS, long nSttDiff,
|
|
const SwNodeIndex& rE, long nEndDiff = 0 );
|
|
SwNodeRange( const SwNode& rS, long nSttDiff,
|
|
const SwNode& rE, long nEndDiff = 0 );
|
|
};
|
|
|
|
|
|
|
|
|
|
// For inlines node.hxx is needed which in turn needs this one.
|
|
// Therefore all inlines accessing pNd are implemented here.
|
|
|
|
inline sal_uLong SwNodeIndex::GetIndex() const
|
|
{
|
|
return pNd->GetIndex();
|
|
}
|
|
inline const SwNodes& SwNodeIndex::GetNodes() const
|
|
{
|
|
return pNd->GetNodes();
|
|
}
|
|
inline SwNodes& SwNodeIndex::GetNodes()
|
|
{
|
|
return pNd->GetNodes();
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator< ( sal_uLong nWert ) const
|
|
{
|
|
return pNd->GetIndex() < nWert;
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator<=( sal_uLong nWert ) const
|
|
{
|
|
return pNd->GetIndex() <= nWert;
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator> ( sal_uLong nWert ) const
|
|
{
|
|
return pNd->GetIndex() > nWert;
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator>=( sal_uLong nWert ) const
|
|
{
|
|
return pNd->GetIndex() >= nWert;
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator==( sal_uLong nWert ) const
|
|
{
|
|
return pNd->GetIndex() == nWert;
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator!=( sal_uLong nWert ) const
|
|
{
|
|
return pNd->GetIndex() != nWert;
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator<( const SwNodeIndex& rIndex ) const
|
|
{
|
|
return pNd->GetIndex() < rIndex.GetIndex();
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator<=( const SwNodeIndex& rIndex ) const
|
|
{
|
|
return pNd->GetIndex() <= rIndex.GetIndex();
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator>( const SwNodeIndex& rIndex ) const
|
|
{
|
|
return pNd->GetIndex() > rIndex.GetIndex();
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator>=( const SwNodeIndex& rIndex ) const
|
|
{
|
|
return pNd->GetIndex() >= rIndex.GetIndex();
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator==( const SwNodeIndex& rIdx ) const
|
|
{
|
|
return pNd == rIdx.pNd;
|
|
}
|
|
inline sal_Bool SwNodeIndex::operator!=( const SwNodeIndex& rIdx ) const
|
|
{
|
|
return pNd != rIdx.pNd;
|
|
}
|
|
|
|
inline sal_uLong SwNodeIndex::operator++()
|
|
{
|
|
return ( pNd = GetNodes()[ pNd->GetIndex()+1 ] )->GetIndex();
|
|
}
|
|
inline sal_uLong SwNodeIndex::operator--()
|
|
{
|
|
return ( pNd = GetNodes()[ pNd->GetIndex()-1 ] )->GetIndex();
|
|
}
|
|
inline sal_uLong SwNodeIndex::operator++(int)
|
|
{
|
|
sal_uLong nOldIndex = pNd->GetIndex();
|
|
pNd = GetNodes()[ nOldIndex + 1 ];
|
|
return nOldIndex;
|
|
}
|
|
inline sal_uLong SwNodeIndex::operator--(int)
|
|
{
|
|
sal_uLong nOldIndex = pNd->GetIndex();
|
|
pNd = GetNodes()[ nOldIndex - 1 ];
|
|
return nOldIndex;
|
|
}
|
|
|
|
inline sal_uLong SwNodeIndex::operator+=( sal_uLong nWert )
|
|
{
|
|
return ( pNd = GetNodes()[ pNd->GetIndex() + nWert ] )->GetIndex();
|
|
}
|
|
inline sal_uLong SwNodeIndex::operator-=( sal_uLong nWert )
|
|
{
|
|
return ( pNd = GetNodes()[ pNd->GetIndex() - nWert ] )->GetIndex();
|
|
}
|
|
inline sal_uLong SwNodeIndex::operator+=( const SwNodeIndex& rIndex )
|
|
{
|
|
return ( pNd = GetNodes()[ pNd->GetIndex() + rIndex.GetIndex() ] )->GetIndex();
|
|
}
|
|
inline sal_uLong SwNodeIndex::operator-=( const SwNodeIndex& rIndex )
|
|
{
|
|
return ( pNd = GetNodes()[ pNd->GetIndex() - rIndex.GetIndex() ] )->GetIndex();
|
|
}
|
|
|
|
inline SwNodeIndex& SwNodeIndex::operator=( sal_uLong nWert )
|
|
{
|
|
pNd = GetNodes()[ nWert ];
|
|
return *this;
|
|
}
|
|
|
|
#endif
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|