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_COMMON_EXPORT vtkVoidArray : public vtkDataArray
00057 {
00058 public:
00059   static vtkVoidArray *New();
00060 
00061   vtkTypeMacro(vtkVoidArray,vtkDataArray);
00062   void PrintSelf(ostream& os, vtkIndent indent);
00063 
00066   int Allocate(const vtkIdType sz, const vtkIdType ext=1000);
00067 
00069   void Initialize();
00070 
00072   vtkDataArray *MakeObject() {return vtkVoidArray::New();};
00073 
00075   int GetDataType() {return VTK_VOID;};
00076   
00078   void SetNumberOfTuples(const vtkIdType number);
00079 
00081   float *GetTuple(const vtkIdType i);
00082 
00084 
00085   void GetTuple(const vtkIdType i, float * tuple);
00086   void GetTuple(const vtkIdType i, double * tuple);
00088 
00090 
00091   void SetTuple(const vtkIdType i, const float * tuple);
00092   void SetTuple(const vtkIdType i, const double * tuple);
00094 
00096 
00098   void InsertTuple(const vtkIdType i, const float * tuple);
00099   void InsertTuple(const vtkIdType i, const double * tuple);
00101 
00103 
00105   vtkIdType InsertNextTuple(const float * tuple);
00106   vtkIdType InsertNextTuple(const double * tuple);
00108 
00110   void Squeeze() {this->ResizeAndExtend (this->MaxId+1);};
00111 
00113   virtual void Resize(vtkIdType numTuples);
00114 
00116   void* GetValue(const vtkIdType id) {return this->Array[id];};
00117 
00121   void SetNumberOfValues(const vtkIdType number);
00122 
00125   void SetValue(const vtkIdType id, void *value);
00126 
00128   void InsertValue(const vtkIdType id, void* p);
00129 
00132   vtkIdType InsertNextValue(void* v);
00133 
00135 
00137   void** GetPointer(const vtkIdType id) {return this->Array + id;}
00138   void *GetVoidPointer(const vtkIdType id) {return this->GetPointer(id);};
00140 
00144   void** WritePointer(const vtkIdType id, const vtkIdType number);
00145   
00147   void DeepCopy(vtkDataArray *da);
00148   
00149 
00150 protected:
00151   vtkVoidArray();
00152   ~vtkVoidArray();
00153 
00154   void** Array;  // pointer to data
00155   void** ResizeAndExtend(const vtkIdType sz);  // function to resize data
00156 
00157   int TupleSize; //used for data conversion
00158   float *Tuple;
00159 private:
00160   vtkVoidArray(const vtkVoidArray&);  // Not implemented.
00161   void operator=(const vtkVoidArray&);  // Not implemented.
00162 };
00163 
00164 
00165 inline void vtkVoidArray::SetNumberOfValues(const vtkIdType number) 
00166 {
00167   this->Allocate(number);
00168   this->MaxId = number - 1;
00169 }
00170 
00171 inline void vtkVoidArray::SetValue(const vtkIdType id, void *value) 
00172 {
00173   this->Array[id] = value;
00174 }
00175 
00176 inline void** vtkVoidArray::WritePointer(const vtkIdType id,
00177                                          const vtkIdType number) 
00178 {
00179   vtkIdType newSize=id+number;
00180   if ( newSize > this->Size )
00181     {
00182     this->ResizeAndExtend(newSize);
00183     }
00184   if ( (--newSize) > this->MaxId )
00185     {
00186     this->MaxId = newSize;
00187     }
00188   return this->Array + id;
00189 }
00190 
00191 inline void vtkVoidArray::InsertValue(const vtkIdType id, void* p)
00192 {
00193   if ( id >= this->Size )
00194     {
00195     this->ResizeAndExtend(id+1);
00196     }
00197   this->Array[id] = p;
00198   if ( id > this->MaxId )
00199     {
00200     this->MaxId = id;
00201     }
00202 }
00203 
00204 inline vtkIdType vtkVoidArray::InsertNextValue(void* p)
00205 {
00206   this->InsertValue (++this->MaxId,p);
00207   return this->MaxId;
00208 }
00209 
00210 
00211 #endif

Generated on Thu Mar 28 14:19:18 2002 for VTK by doxygen1.2.11.1 written by Dimitri van Heesch, © 1997-2001