2010-10-14 08:30:41 +02:00
|
|
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
2000-09-18 16:15:01 +00:00
|
|
|
/*************************************************************************
|
|
|
|
*
|
2008-04-10 09:58:41 +00:00
|
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2010-02-12 15:01:35 +01:00
|
|
|
* Copyright 2000, 2010 Oracle and/or its affiliates.
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2008-04-10 09:58:41 +00:00
|
|
|
* OpenOffice.org - a multi-platform office productivity suite
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2008-04-10 09:58:41 +00:00
|
|
|
* This file is part of OpenOffice.org.
|
2000-09-18 16:15:01 +00:00
|
|
|
*
|
2008-04-10 09:58:41 +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
|
|
|
*
|
2008-04-10 09:58:41 +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
|
|
|
*
|
2008-04-10 09:58:41 +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 _DOCARY_HXX
|
|
|
|
#define _DOCARY_HXX
|
|
|
|
|
2001-01-23 09:42:57 +00:00
|
|
|
#include <com/sun/star/i18n/ForbiddenCharacters.hpp>
|
2012-05-16 11:48:48 +02:00
|
|
|
#include <vector>
|
2012-07-13 15:35:23 +02:00
|
|
|
#include <set>
|
2012-05-16 15:23:09 +02:00
|
|
|
#include <algorithm>
|
2012-07-20 17:16:03 +02:00
|
|
|
#include <o3tl/sorted_vector.hxx>
|
2001-01-23 09:42:57 +00:00
|
|
|
|
2000-09-18 16:15:01 +00:00
|
|
|
class SwFieldType;
|
2012-06-20 16:36:51 +02:00
|
|
|
class SwFmt;
|
2000-09-18 16:15:01 +00:00
|
|
|
class SwFrmFmt;
|
|
|
|
class SwCharFmt;
|
|
|
|
class SwTOXType;
|
|
|
|
class SwUndo;
|
|
|
|
class SwSectionFmt;
|
|
|
|
class SwNumRule;
|
|
|
|
class SwRedline;
|
|
|
|
class SwUnoCrsr;
|
|
|
|
class SwOLENode;
|
2012-06-20 16:36:51 +02:00
|
|
|
class SwTxtFmtColl;
|
|
|
|
class SwGrfFmtColl;
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2001-01-19 15:45:37 +00:00
|
|
|
namespace com { namespace sun { namespace star { namespace i18n {
|
2012-09-02 09:05:03 +03:00
|
|
|
struct ForbiddenCharacters; ///< comes from the I18N UNO interface
|
2007-09-27 06:59:22 +00:00
|
|
|
}}}}
|
2001-01-19 15:45:37 +00:00
|
|
|
|
2000-09-18 16:15:01 +00:00
|
|
|
#include <swtypes.hxx>
|
|
|
|
|
2012-09-02 09:05:03 +03:00
|
|
|
/** provides some methods for generic operations on lists that contain
|
|
|
|
SwFmt* subclasses. */
|
2012-06-20 16:36:51 +02:00
|
|
|
class SwFmtsBase
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
virtual size_t GetFmtCount() const = 0;
|
|
|
|
virtual SwFmt* GetFmt(size_t idx) const = 0;
|
|
|
|
virtual ~SwFmtsBase() = 0;
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-06-20 16:36:51 +02:00
|
|
|
class SwGrfFmtColls : public std::vector<SwGrfFmtColl*>, public SwFmtsBase
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
virtual size_t GetFmtCount() const { return size(); }
|
|
|
|
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
|
|
|
|
sal_uInt16 GetPos(const SwGrfFmtColl* pFmt) const;
|
2012-09-02 09:05:03 +03:00
|
|
|
/// free's any remaining child objects
|
2012-06-20 16:36:51 +02:00
|
|
|
virtual ~SwGrfFmtColls() {}
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-09-02 09:05:03 +03:00
|
|
|
/// Specific frame formats (frames, DrawObjects).
|
2012-06-20 16:36:51 +02:00
|
|
|
class SW_DLLPUBLIC SwFrmFmts : public std::vector<SwFrmFmt*>, public SwFmtsBase
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
virtual size_t GetFmtCount() const { return size(); }
|
|
|
|
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
|
|
|
|
sal_uInt16 GetPos(const SwFrmFmt* pFmt) const;
|
|
|
|
bool Contains(const SwFrmFmt* pFmt) const;
|
2012-09-02 09:05:03 +03:00
|
|
|
/// free's any remaining child objects
|
2012-06-20 16:36:51 +02:00
|
|
|
virtual ~SwFrmFmts();
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-06-20 16:36:51 +02:00
|
|
|
class SwCharFmts : public std::vector<SwCharFmt*>, public SwFmtsBase
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
virtual size_t GetFmtCount() const { return size(); }
|
|
|
|
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
|
|
|
|
sal_uInt16 GetPos(const SwCharFmt* pFmt) const;
|
|
|
|
bool Contains(const SwCharFmt* pFmt) const;
|
2012-09-02 09:05:03 +03:00
|
|
|
/// free's any remaining child objects
|
2012-06-20 16:36:51 +02:00
|
|
|
virtual ~SwCharFmts();
|
|
|
|
};
|
|
|
|
|
|
|
|
class SwTxtFmtColls : public std::vector<SwTxtFmtColl*>, public SwFmtsBase
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
virtual size_t GetFmtCount() const { return size(); }
|
|
|
|
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
|
|
|
|
sal_uInt16 GetPos(const SwTxtFmtColl* pFmt) const;
|
|
|
|
virtual ~SwTxtFmtColls() {}
|
|
|
|
};
|
|
|
|
|
2012-09-02 09:05:03 +03:00
|
|
|
/// Array of Undo-history.
|
2012-06-20 16:36:51 +02:00
|
|
|
class SW_DLLPUBLIC SwSectionFmts : public std::vector<SwSectionFmt*>, public SwFmtsBase
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
virtual size_t GetFmtCount() const { return size(); }
|
|
|
|
virtual SwFmt* GetFmt(size_t idx) const { return (SwFmt*)operator[](idx); }
|
|
|
|
sal_uInt16 GetPos(const SwSectionFmt* pFmt) const;
|
|
|
|
bool Contains(const SwSectionFmt* pFmt) const;
|
2012-09-02 09:05:03 +03:00
|
|
|
/// free's any remaining child objects
|
2012-06-20 16:36:51 +02:00
|
|
|
virtual ~SwSectionFmts();
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-05-21 17:01:56 +02:00
|
|
|
class SwFldTypes : public std::vector<SwFieldType*> {
|
|
|
|
public:
|
2012-09-02 09:05:03 +03:00
|
|
|
/// the destructor will free all objects still in the vector
|
2012-05-21 17:01:56 +02:00
|
|
|
~SwFldTypes();
|
|
|
|
sal_uInt16 GetPos(const SwFieldType* pFieldType) const;
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-05-21 15:49:21 +02:00
|
|
|
class SwTOXTypes : public std::vector<SwTOXType*> {
|
|
|
|
public:
|
2012-09-02 09:05:03 +03:00
|
|
|
/// the destructor will free all objects still in the vector
|
2012-05-21 15:49:21 +02:00
|
|
|
~SwTOXTypes();
|
|
|
|
sal_uInt16 GetPos(const SwTOXType* pTOXType) const;
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-05-16 15:23:09 +02:00
|
|
|
class SW_DLLPUBLIC SwNumRuleTbl : public std::vector<SwNumRule*> {
|
|
|
|
public:
|
2012-09-02 09:05:03 +03:00
|
|
|
/// the destructor will free all objects still in the vector
|
2012-05-16 15:23:09 +02:00
|
|
|
~SwNumRuleTbl();
|
|
|
|
sal_uInt16 GetPos(const SwNumRule* pRule) const;
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-07-20 17:16:03 +02:00
|
|
|
struct CompareSwRedlineTbl
|
|
|
|
{
|
|
|
|
bool operator()(SwRedline* const &lhs, SwRedline* const &rhs) const;
|
|
|
|
};
|
2012-07-31 18:53:04 +02:00
|
|
|
class _SwRedlineTbl
|
|
|
|
: public o3tl::sorted_vector<SwRedline*, CompareSwRedlineTbl,
|
2012-08-02 21:30:45 +02:00
|
|
|
o3tl::find_partialorder_ptrequals>
|
2012-07-31 18:53:04 +02:00
|
|
|
{
|
2012-07-20 17:16:03 +02:00
|
|
|
public:
|
|
|
|
~_SwRedlineTbl();
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
|
|
|
class SwRedlineTbl : private _SwRedlineTbl
|
|
|
|
{
|
|
|
|
public:
|
2012-07-20 17:16:03 +02:00
|
|
|
bool Contains(const SwRedline* p) const { return find(const_cast<SwRedline* const>(p)) != end(); }
|
|
|
|
sal_uInt16 GetPos(const SwRedline* p) const;
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-07-20 17:16:03 +02:00
|
|
|
bool Insert( SwRedline* p, bool bIns = true );
|
|
|
|
bool Insert( SwRedline* p, sal_uInt16& rInsPos, bool bIns = true );
|
|
|
|
bool InsertWithValidRanges( SwRedline* p, sal_uInt16* pInsPos = 0 );
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-07-20 17:16:03 +02:00
|
|
|
void Remove( sal_uInt16 nPos );
|
|
|
|
bool Remove( const SwRedline* p );
|
|
|
|
void DeleteAndDestroy( sal_uInt16 nPos, sal_uInt16 nLen = 1 );
|
|
|
|
void DeleteAndDestroyAll();
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-09-02 09:05:03 +03:00
|
|
|
/** Search next or previous Redline with the same Seq. No.
|
|
|
|
Search can be restricted via Lookahaed.
|
|
|
|
Using 0 or USHRT_MAX makes search the whole array. */
|
2011-01-17 15:06:54 +01:00
|
|
|
sal_uInt16 FindNextOfSeqNo( sal_uInt16 nSttPos, sal_uInt16 nLookahead = 20 ) const;
|
|
|
|
sal_uInt16 FindPrevOfSeqNo( sal_uInt16 nSttPos, sal_uInt16 nLookahead = 20 ) const;
|
|
|
|
sal_uInt16 FindNextSeqNo( sal_uInt16 nSeqNo, sal_uInt16 nSttPos,
|
|
|
|
sal_uInt16 nLookahead = 20 ) const;
|
|
|
|
sal_uInt16 FindPrevSeqNo( sal_uInt16 nSeqNo, sal_uInt16 nSttPos,
|
|
|
|
sal_uInt16 nLookahead = 20 ) const;
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-07-20 17:16:03 +02:00
|
|
|
using _SwRedlineTbl::size;
|
2007-09-27 06:59:22 +00:00
|
|
|
using _SwRedlineTbl::operator[];
|
2012-07-20 17:16:03 +02:00
|
|
|
using _SwRedlineTbl::empty;
|
2000-09-18 16:15:01 +00:00
|
|
|
};
|
|
|
|
|
2012-07-13 15:35:23 +02:00
|
|
|
class SwUnoCrsrTbl : public std::set<SwUnoCrsr*> {
|
|
|
|
public:
|
2012-09-02 09:05:03 +03:00
|
|
|
/// the destructor will free all objects still in the set
|
2012-07-13 15:35:23 +02:00
|
|
|
~SwUnoCrsrTbl();
|
|
|
|
};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
2012-05-16 11:48:48 +02:00
|
|
|
class SwOLENodes : public std::vector<SwOLENode*> {};
|
2000-09-18 16:15:01 +00:00
|
|
|
|
|
|
|
|
|
|
|
#endif //_DOCARY_HXX
|
2001-01-23 09:42:57 +00:00
|
|
|
|
2010-10-14 08:30:41 +02:00
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|