binfilter/inc/bf_sfx2/bitset.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: bitset.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 _SFXBITSET_HXX
  31 #define _SFXBITSET_HXX
  32
  33 #ifndef _SOLAR_H
  34 #include <tools/solar.h>
  35 #endif
  36 class Range;
  37 namespace binfilter {
  38
  39
  40 class BitSet
  41 {
  42 private:
  43     void CopyFrom( const BitSet& rSet );
  44     USHORT nBlocks;
  45     USHORT nCount;
  46     ULONG* pBitmap;
  47 public:
  48     BitSet operator<<( USHORT nOffset ) const;
  49     static USHORT CountBits( ULONG nBits );
  50     BOOL operator!() const;
  51     BitSet();
  52     BitSet( const BitSet& rOrig );
  53     ~BitSet();
  54     USHORT Count() const;
  55     BitSet operator|( const BitSet& rSet ) const;
  56     BitSet operator|( USHORT nBit ) const;
  57     BitSet& operator|=( const BitSet& rSet );
  58     BitSet& operator|=( USHORT nBit );
  59     BitSet operator-( const BitSet& rSet ) const;
  60     BitSet operator-( USHORT nId ) const;
  61     BitSet& operator-=( const BitSet& rSet );
  62     BitSet& operator-=( USHORT nBit );
  63     BitSet operator&( const BitSet& rSet ) const;
  64     BitSet& operator&=( const BitSet& rSet );
  65     BitSet operator^( const BitSet& rSet ) const;
  66     BitSet operator^( USHORT nBit ) const;
  67     BitSet& operator^=( const BitSet& rSet );
  68     BitSet& operator^=( USHORT nBit );
  69     BOOL IsRealSubSet( const BitSet& rSet ) const;
  70     BOOL IsSubSet( const BitSet& rSet ) const;
  71     BOOL IsRealSuperSet( const BitSet& rSet ) const;
  72     BOOL IsSuperSet( const BitSet& rSet ) const;
  73     BOOL operator==( USHORT nBit ) const;
  74     BOOL operator!=( USHORT nBit ) const;
  75
  76 };
  77 //--------------------------------------------------------------------
  78
  79 // returns TRUE if the set is empty
  80
  81
  82
  83 inline BOOL BitSet::operator!() const
  84 {
  85     return nCount == 0;
  86 }
  87 //--------------------------------------------------------------------
  88
  89 // returns the number of bits in the bitset
  90
  91 inline USHORT BitSet::Count() const
  92 {
  93     return nCount;
  94 }
  95 //--------------------------------------------------------------------
  96
  97 // creates the union of two bitset
  98
  99 inline BitSet BitSet::operator|( const BitSet& rSet ) const
 100 {
 101     return BitSet(*this) |= rSet;
 102 }
 103 //--------------------------------------------------------------------
 104
 105 // creates the union of a bitset with a single bit
 106
 107 inline BitSet BitSet::operator|( USHORT nBit ) const
 108 {
 109     return BitSet(*this) |= nBit;
 110 }
 111 //--------------------------------------------------------------------
 112
 113 // creates the asymetric difference
 114
 115 inline BitSet BitSet::operator-( const BitSet& rSet ) const
 116 {
 117     return BitSet();
 118 }
 119 //--------------------------------------------------------------------
 120
 121 // creates the asymetric difference with a single bit
 122
 123
 124 inline BitSet BitSet::operator-( USHORT nId ) const
 125 {
 126     return BitSet();
 127 }
 128 //--------------------------------------------------------------------
 129
 130 // removes the bits contained in rSet
 131
 132 inline BitSet& BitSet::operator-=( const BitSet& rSet )
 133 {
 134     return *this;
 135 }
 136 //--------------------------------------------------------------------
 137
 138
 139 // creates the intersection with another bitset
 140
 141 inline BitSet BitSet::operator&( const BitSet& rSet ) const
 142 {
 143     return BitSet();
 144 }
 145 //--------------------------------------------------------------------
 146
 147 // intersects with another bitset
 148
 149 inline BitSet& BitSet::operator&=( const BitSet& rSet )
 150 {
 151     return *this;
 152 }
 153 //--------------------------------------------------------------------
 154
 155 // creates the symetric difference with another bitset
 156
 157 inline BitSet BitSet::operator^( const BitSet& rSet ) const
 158 {
 159     return BitSet();
 160 }
 161 //--------------------------------------------------------------------
 162
 163 // creates the symetric difference with a single bit
 164
 165 inline BitSet BitSet::operator^( USHORT nBit ) const
 166 {
 167     return BitSet();
 168 }
 169 //--------------------------------------------------------------------
 170
 171 // builds the symetric difference with another bitset
 172
 173 inline BitSet& BitSet::operator^=( const BitSet& rSet )
 174 {
 175     return *this;
 176 }
 177 //--------------------------------------------------------------------
 178 #ifdef BITSET_READY
 179 // builds the symetric difference with a single bit
 180
 181 inline BitSet& BitSet::operator^=( USHORT nBit )
 182 {
 183     // crash!!!
 184     return BitSet();
 185 }
 186 #endif
 187 //--------------------------------------------------------------------
 188
 189 // determines if the other bitset is a real superset
 190
 191 inline BOOL BitSet::IsRealSubSet( const BitSet& rSet ) const
 192 {
 193     return FALSE;
 194 }
 195 //--------------------------------------------------------------------
 196
 197 // detsermines if the other bitset is a superset or equal
 198
 199 inline BOOL BitSet::IsSubSet( const BitSet& rSet ) const
 200 {
 201     return FALSE;
 202 }
 203 //--------------------------------------------------------------------
 204
 205 // determines if the other bitset is a real subset
 206
 207 inline BOOL BitSet::IsRealSuperSet( const BitSet& rSet ) const
 208 {
 209     return FALSE;
 210 }
 211
 212 //--------------------------------------------------------------------
 213
 214 // determines if the other bitset is a subset or equal
 215
 216 inline BOOL BitSet::IsSuperSet( const BitSet& rSet ) const
 217 {
 218     return FALSE;
 219 }
 220 //--------------------------------------------------------------------
 221
 222 // determines if the bit is the only one in the bitset
 223
 224 inline BOOL BitSet::operator==( USHORT nBit ) const
 225 {
 226     return FALSE;
 227 }
 228 //--------------------------------------------------------------------
 229
 230 // determines if the bitsets aren't equal
 231
 232 //--------------------------------------------------------------------
 233
 234 // determines if the bitset doesn't contain only this bit
 235
 236 inline BOOL BitSet::operator!=( USHORT nBit ) const
 237 {
 238     return !( *this == nBit );
 239 }
 240 //--------------------------------------------------------------------
 241
 242 class IndexBitSet : BitSet
 243 {
 244 public:
 245   void ReleaseIndex(USHORT i){*this-=i;}
 246 };
 247
 248
 249 }//end of namespace binfilter
 250 #endif
 251