Main Page   Class Hierarchy   Alphabetical List   Compound List   File List   Compound Members   File Members   Related Pages  

common/vtkBitArray.h

Go to the documentation of this file.
00001 /*=========================================================================
00002 
00003   Program:   Visualization Toolkit
00004   Module:    $RCSfile: vtkBitArray.h,v $
00005   Language:  C++
00006 
00007 
00008 Copyright (c) 1993-2001 Ken Martin, Will Schroeder, Bill Lorensen 
00009 All rights reserved.
00010 
00011 Redistribution and use in source and binary forms, with or without
00012 modification, are permitted provided that the following conditions are met:
00013 
00014  * Redistributions of source code must retain the above copyright notice,
00015    this list of conditions and the following disclaimer.
00016 
00017  * Redistributions in binary form must reproduce the above copyright notice,
00018    this list of conditions and the following disclaimer in the documentation
00019    and/or other materials provided with the distribution.
00020 
00021  * Neither name of Ken Martin, Will Schroeder, or Bill Lorensen nor the names
00022    of any contributors may be used to endorse or promote products derived
00023    from this software without specific prior written permission.
00024 
00025  * Modified source versions must be plainly marked as such, and must not be
00026    misrepresented as being the original software.
00027 
00028 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS IS''
00029 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00030 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00031 ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR
00032 ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
00033 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
00034 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
00035 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
00036 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
00037 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
00038 
00039 =========================================================================*/
00052 #ifndef __vtkBitArray_h
00053 #define __vtkBitArray_h
00054 
00055 #include "vtkDataArray.h"
00056 
00057 class VTK_EXPORT vtkBitArray : public vtkDataArray
00058 {
00059 public:
00060   static vtkBitArray *New();
00061   vtkTypeMacro(vtkBitArray,vtkDataArray);
00062   void PrintSelf(ostream& os, vtkIndent indent);
00063 
00065   int Allocate(const int sz, const int ext=1000);
00066 
00068   void Initialize();
00069 
00070   // satisfy vtkDataArray API
00071   vtkDataArray *MakeObject();
00072   int GetDataType() {return VTK_BIT;};
00073   
00075   void SetNumberOfTuples(const int number);
00076 
00079   float *GetTuple(const int i);
00080 
00082   void GetTuple(const int i, float * tuple);
00083   void GetTuple(const int i, double * tuple);
00084   
00086   void SetTuple(const int i, const float * tuple);
00087   void SetTuple(const int i, const double * tuple);
00088   
00091   void InsertTuple(const int i, const float * tuple);
00092   void InsertTuple(const int i, const double * tuple);
00093 
00096   int InsertNextTuple(const float * tuple);
00097   int InsertNextTuple(const double * tuple);
00098 
00100   void Squeeze();
00101 
00103   int GetValue(const int id);
00104 
00110   void SetNumberOfValues(const int number);
00111 
00114   void SetValue(const int id, const int value);
00115 
00117   void InsertValue(const int id, const int i);
00118   int InsertNextValue(const int i);
00119 
00121   unsigned char *GetPointer(const int id) {return this->Array + id/8;}
00122 
00126   unsigned char *WritePointer(const int id, const int number);
00127   void *GetVoidPointer(const int id) {return (void *)this->GetPointer(id);};
00128 
00130   void DeepCopy(vtkDataArray *da);
00131 
00138   void SetArray(unsigned char* array, int size, int save);
00139   void SetVoidArray(void *array,int size, int save) 
00140     {this->SetArray((unsigned char *)array, size, save);};
00141 
00142 #ifndef VTK_REMOVE_LEGACY_CODE
00143 
00144   void DeepCopy(vtkBitArray &da) 
00145     {VTK_LEGACY_METHOD(DeepCopy,"3.2"); this->DeepCopy(&da);}
00146 #endif
00147   
00148 protected:
00149   vtkBitArray(int numComp=1);
00150   ~vtkBitArray();
00151   vtkBitArray(const vtkBitArray&) {};
00152   void operator=(const vtkBitArray&) {};
00153 
00154   unsigned char *Array;   // pointer to data
00155   unsigned char *Resize(const int sz);  // function to resize data
00156 
00157   int TupleSize; //used for data conversion
00158   float *Tuple;
00159 
00160   int SaveUserArray;
00161 
00162 private:
00163   // hide superclass' DeepCopy() from the user and the compiler
00164   void DeepCopy(vtkDataArray &da) {this->vtkDataArray::DeepCopy(&da);}
00165   
00166 };
00167 
00168 inline unsigned char *vtkBitArray::WritePointer(const int id, const int number)
00169 {
00170   int newSize=id+number;
00171   if ( newSize > this->Size )
00172     {
00173     this->Resize(newSize);
00174     }
00175   if ( (--newSize) > this->MaxId )
00176     {
00177     this->MaxId = newSize;
00178     }
00179   return this->Array + id/8;
00180 }
00181 
00182 inline void vtkBitArray::SetNumberOfValues(const int number) 
00183 {
00184   this->Allocate(number);
00185   this->MaxId = number - 1;
00186 }
00187 
00188 inline void vtkBitArray::SetValue(const int id, const int value) 
00189 {
00190   if (value)
00191     {
00192     this->Array[id/8] |= (0x80 >> id%8);
00193     }
00194   else
00195     {
00196     this->Array[id/8] &= (~(0x80 >> id%8));
00197     }
00198 }
00199 
00200 inline void vtkBitArray::InsertValue(const int id, const int i)
00201 {
00202   if ( id >= this->Size )
00203     {
00204     this->Resize(id+1);
00205     }
00206   if (i)
00207     {
00208     this->Array[id/8] |= (0x80 >> id%8);
00209     }
00210   else
00211     {
00212     this->Array[id/8] &= (~(0x80 >> id%8));
00213     }
00214   if ( id > this->MaxId )
00215     {
00216     this->MaxId = id;
00217     }
00218 }
00219 
00220 inline int vtkBitArray::InsertNextValue(const int i)
00221 {
00222   this->InsertValue (++this->MaxId,i); return this->MaxId;
00223 }
00224 
00225 inline void vtkBitArray::Squeeze() {this->Resize (this->MaxId+1);}
00226 
00227 #endif
00228 

Generated on Wed Nov 21 12:26:51 2001 for VTK by doxygen1.2.11.1 written by Dimitri van Heesch, © 1997-2001