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

common/vtkLongArray.h

Go to the documentation of this file.
00001 /*=========================================================================
00002 
00003   Program:   Visualization Toolkit
00004   Module:    $RCSfile: vtkLongArray.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 =========================================================================*/
00054 #ifndef __vtkLongArray_h
00055 #define __vtkLongArray_h
00056 
00057 #include "vtkDataArray.h"
00058 
00059 class VTK_EXPORT vtkLongArray : public vtkDataArray
00060 {
00061 public:
00062   static vtkLongArray *New();
00063 
00064   vtkTypeMacro(vtkLongArray,vtkDataArray);
00065   void PrintSelf(ostream& os, vtkIndent indent);
00066 
00068   int Allocate(const int sz, const int ext=1000);
00069 
00071   void Initialize();
00072 
00074   void Squeeze() {this->Resize (this->MaxId+1);};
00075 
00077   vtkDataArray *MakeObject();
00078 
00080   int GetDataType() {return VTK_LONG;};
00081   
00083   void SetNumberOfTuples(const int number);
00084   
00087   float *GetTuple(const int i);
00088 
00090   void GetTuple(const int i, float * tuple);
00091   void GetTuple(const int i, double * tuple);
00092 
00094   void SetTuple(const int i, const float * tuple);
00095   void SetTuple(const int i, const double * tuple);
00096 
00099   void InsertTuple(const int i, const float * tuple);
00100   void InsertTuple(const int i, const double * tuple);
00101 
00104   int InsertNextTuple(const float * tuple);
00105   int InsertNextTuple(const double * tuple);
00106 
00108   long GetValue(const int id) {return this->Array[id];};
00109 
00113   void SetNumberOfValues(const int number);
00114 
00117   void SetValue(const int id, const long value) { this->Array[id] = value;};
00118 
00120   void InsertValue(const int id, const long i);
00121 
00124   int InsertNextValue(const long);
00125 
00128   long *GetPointer(const int id) {return this->Array + id;}
00129   void *GetVoidPointer(const int id) {return (void *)this->GetPointer(id);};
00130 
00134   long *WritePointer(const int id, const int number);
00135   
00137   void DeepCopy(vtkDataArray *da);
00138 
00145   void SetArray(long* array, int size, int save);
00146   void SetVoidArray(void *array,int size, int save) 
00147     {this->SetArray((long*)array, size, save);};
00148 
00149 #ifndef VTK_REMOVE_LEGACY_CODE
00150 
00151   void DeepCopy(vtkDataArray &da) 
00152     {VTK_LEGACY_METHOD(DeepCopy,"3.2");this->DeepCopy(&da);}
00153 #endif
00154   
00155 protected:
00156   vtkLongArray(int numComp=1);
00157   ~vtkLongArray();
00158   vtkLongArray(const vtkLongArray&) {};
00159   void operator=(const vtkLongArray&) {};
00160 
00161   long *Array;   // pointer to data
00162   long *Resize(const int sz);  // function to resize data
00163 
00164   int TupleSize; //used for data conversion
00165   float *Tuple;
00166 
00167   int SaveUserArray;
00168 };
00169 
00170 inline void vtkLongArray::SetNumberOfValues(const int number) 
00171 {
00172   this->Allocate(number);
00173   this->MaxId = number - 1;
00174 }
00175 
00176 inline long *vtkLongArray::WritePointer(const int id, const int number) 
00177 {
00178   int newSize=id+number;
00179   if ( newSize > this->Size )
00180     {
00181     this->Resize(newSize);
00182     }
00183   if ( (--newSize) > this->MaxId )
00184     {
00185     this->MaxId = newSize;
00186     }
00187   return this->Array + id;
00188 }
00189 
00190 inline void vtkLongArray::InsertValue(const int id, const long i)
00191 {
00192   if ( id >= this->Size )
00193     {
00194     this->Resize(id+1);
00195     }
00196   this->Array[id] = i;
00197   if ( id > this->MaxId )
00198     {
00199     this->MaxId = id;
00200     }
00201 }
00202 
00203 inline int vtkLongArray::InsertNextValue(const long i)
00204 {
00205   this->InsertValue (++this->MaxId,i); 
00206   return this->MaxId;
00207 }
00208 
00209 
00210 #endif

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