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

common/vtkVoidArray.h

Go to the documentation of this file.
00001 /*=========================================================================
00002 
00003   Program:   Visualization Toolkit
00004   Module:    $RCSfile: vtkVoidArray.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 =========================================================================*/
00051 #ifndef __vtkVoidArray_h
00052 #define __vtkVoidArray_h
00053 
00054 #include "vtkDataArray.h"
00055 
00056 class VTK_EXPORT vtkVoidArray : public vtkDataArray
00057 {
00058 public:
00059   static vtkVoidArray *New();
00060 
00061   vtkTypeMacro(vtkVoidArray,vtkDataArray);
00062   void PrintSelf(ostream& os, vtkIndent indent);
00063 
00065   int Allocate(const int sz, const int ext=1000);
00066 
00068   void Initialize();
00069 
00071   vtkDataArray *MakeObject() {return vtkVoidArray::New();};
00072 
00074   int GetDataType() {return VTK_VOID;};
00075   
00077   void SetNumberOfTuples(const int number);
00078 
00080   float *GetTuple(const int i);
00081 
00083   void GetTuple(const int i, float * tuple);
00084   void GetTuple(const int i, double * tuple);
00085 
00087   void SetTuple(const int i, const float * tuple);
00088   void SetTuple(const int i, const double * tuple);
00089 
00092   void InsertTuple(const int i, const float * tuple);
00093   void InsertTuple(const int i, const double * tuple);
00094 
00097   int InsertNextTuple(const float * tuple);
00098   int InsertNextTuple(const double * tuple);
00099 
00101   void Squeeze() {this->Resize (this->MaxId+1);};
00102 
00104   void* GetValue(const int id) {return this->Array[id];};
00105 
00109   void SetNumberOfValues(const int number);
00110 
00113   void SetValue(const int id, void *value);
00114 
00116   void InsertValue(const int id, void* p);
00117 
00120   int InsertNextValue(void* v);
00121 
00124   void** GetPointer(const int id) {return this->Array + id;}
00125   void *GetVoidPointer(const int id) {return this->GetPointer(id);};
00126 
00130   void** WritePointer(const int id, const int number);
00131   
00133   void DeepCopy(vtkDataArray *da);
00134   
00135 #ifndef VTK_REMOVE_LEGACY_CODE
00136 
00137   void DeepCopy(vtkDataArray &da) 
00138     {VTK_LEGACY_METHOD(DeepCopy,"3.2"); this->DeepCopy(&da);}
00139 #endif
00140   
00141 
00142 protected:
00143   vtkVoidArray();
00144   ~vtkVoidArray();
00145   vtkVoidArray(const vtkVoidArray&) {};
00146   void operator=(const vtkVoidArray&) {};
00147 
00148   void** Array;  // pointer to data
00149   void** Resize(const int sz);  // function to resize data
00150 
00151   int TupleSize; //used for data conversion
00152   float *Tuple;
00153 };
00154 
00155 
00156 inline void vtkVoidArray::SetNumberOfValues(const int number) 
00157 {
00158   this->Allocate(number);
00159   this->MaxId = number - 1;
00160 }
00161 
00162 inline void vtkVoidArray::SetValue(const int id, void *value) 
00163 {
00164   this->Array[id] = value;
00165 }
00166 
00167 inline void** vtkVoidArray::WritePointer(const int id, const int number) 
00168 {
00169   int newSize=id+number;
00170   if ( newSize > this->Size )
00171     {
00172     this->Resize(newSize);
00173     }
00174   if ( (--newSize) > this->MaxId )
00175     {
00176     this->MaxId = newSize;
00177     }
00178   return this->Array + id;
00179 }
00180 
00181 inline void vtkVoidArray::InsertValue(const int id, void* p)
00182 {
00183   if ( id >= this->Size )
00184     {
00185     this->Resize(id+1);
00186     }
00187   this->Array[id] = p;
00188   if ( id > this->MaxId )
00189     {
00190     this->MaxId = id;
00191     }
00192 }
00193 
00194 inline int vtkVoidArray::InsertNextValue(void* p)
00195 {
00196   this->InsertValue (++this->MaxId,p);
00197   return this->MaxId;
00198 }
00199 
00200 
00201 #endif

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