rsc/inc/rscclobj.hxx

   1 /*************************************************************************
   2  *
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * Copyright 2008 by Sun Microsystems, Inc.
   6  *
   7  * OpenOffice.org - a multi-platform office productivity suite
   8  *
   9  * $RCSfile: rscclobj.hxx,v $
  10  * $Revision: 1.6 $
  11  *
  12  * This file is part of OpenOffice.org.
  13  *
  14  * OpenOffice.org is free software: you can redistribute it and/or modify
  15  * it under the terms of the GNU Lesser General Public License version 3
  16  * only, as published by the Free Software Foundation.
  17  *
  18  * OpenOffice.org is distributed in the hope that it will be useful,
  19  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  20  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  21  * GNU Lesser General Public License version 3 for more details
  22  * (a copy is included in the LICENSE file that accompanied this code).
  23  *
  24  * You should have received a copy of the GNU Lesser General Public License
  25  * version 3 along with OpenOffice.org.  If not, see
  26  * <http://www.openoffice.org/license.html>
  27  * for a copy of the LGPLv3 License.
  28  *
  29  ************************************************************************/
  30 #ifndef _RSCCLOBJ_HXX
  31 #define _RSCCLOBJ_HXX
  32
  33 #include <rsctree.hxx>
  34 #include <rscdef.hxx>
  35 #include <rscall.h>
  36
  37 /****************** C L A S S E S ****************************************/
  38 class RscTypCont;
  39
  40 /*********** R s c I n c o n s i s t e n t *******************************/
  41 class RscInconsistent {
  42 public:
  43     RscId aFirstId;   //Paar von inkonsistenten Id's
  44     RscId aSecondId;
  45     RscInconsistent( const RscId & rFirst, const RscId & rSecond ){
  46             aFirstId = rFirst;
  47             aSecondId = rSecond;
  48         };
  49 };
  50
  51 DECLARE_LIST( RscInconsList, RscInconsistent * )
  52
  53 /******************* O b j N o d e ***************************************/
  54 class ObjNode : public IdNode{
  55     RscId       aRscId; // Id der Resource
  56     CLASS_DATA  pRscObj;// pointer to a resourceobject
  57     ULONG       lFileKey;// Dateischluessel
  58 protected:
  59     using NameNode::Search;
  60
  61 public:
  62     using NameNode::Insert;
  63
  64                 ObjNode( const RscId & rId, CLASS_DATA pData, ULONG lKey );
  65     ObjNode *   DelObjNode( RscTop * pClass, ULONG lFileKey );
  66     sal_uInt32      GetId() const;
  67     RscId       GetRscId(){ return( aRscId ); }
  68     ULONG       GetFileKey(){ return lFileKey; };
  69     ObjNode*    Search( const RscId &rName ) const{
  70                     // search the index in the b-tree
  71                     return( (ObjNode *)IdNode::Search( rName ) );
  72                 }
  73     BOOL        Insert( ObjNode* pTN ){
  74                     // insert a new node in the b-tree
  75                     return( IdNode::Insert( (IdNode *)pTN ) );
  76                 }
  77     CLASS_DATA  GetRscObj(){
  78                     // get the Object from this Node
  79                     return( pRscObj );
  80                 }
  81     BOOL        IsConsistent( RscInconsList * pList = NULL );
  82 };
  83
  84 /******************* R e f N o d e ***************************************/
  85 class RefNode : public IdNode{
  86     Atom        nTypNameId; // index of a Name in a hashtabel
  87 protected:
  88     using NameNode::Search;
  89
  90 public:
  91     using NameNode::Insert;
  92
  93     ObjNode*    pObjBiTree; // Zeiger auf Objektbaum
  94                 RefNode( Atom nTyp );
  95     sal_uInt32      GetId() const;
  96     RefNode*    Search( Atom typ ) const{
  97                     // search the index in the b-tree
  98                     return( (RefNode *)IdNode::Search( typ ) );
  99                 };
 100     BOOL        Insert( RefNode* pTN ){
 101                     // insert a new node in the b-tree
 102                     return( IdNode::Insert( (IdNode *)pTN ) );
 103                 };
 104     BOOL        PutObjNode( ObjNode * pPutObject );
 105
 106                 // insert new node in b-tree pObjBiTree
 107     ObjNode *   GetObjNode( const RscId &rRscId );
 108
 109     ObjNode *   GetObjNode(){
 110                     // hole  pObjBiTree
 111                     return( pObjBiTree );
 112                 };
 113 };
 114
 115 #endif // _RSCCLOBJ_HXX