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

Common/vtkShortArray.h

Go to the documentation of this file.
00001 /*=========================================================================
00002 
00003   Program:   Visualization Toolkit
00004   Module:    $RCSfile: vtkShortArray.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 __vtkShortArray_h
00055 #define __vtkShortArray_h
00056 
00057 #include "vtkDataArray.h"
00058 
00059 class VTK_COMMON_EXPORT vtkShortArray : public vtkDataArray
00060 {
00061 public:
00062   static vtkShortArray *New();
00063 
00064   vtkTypeMacro(vtkShortArray,vtkDataArray);
00065   void PrintSelf(ostream& os, vtkIndent indent);
00066 
00069   int Allocate(const vtkIdType sz, const vtkIdType ext=1000);
00070 
00072   void Initialize();
00073 
00075   vtkDataArray *MakeObject();
00076 
00078   int GetDataType() {return VTK_SHORT;};
00079 
00081   void SetNumberOfTuples(const vtkIdType number);
00082 
00085   float *GetTuple(const vtkIdType i);
00086 
00088 
00089   void GetTuple(const vtkIdType i, float * tuple);
00090   void GetTuple(const vtkIdType i, double * tuple);
00092 
00094 
00095   void SetTuple(const vtkIdType i, const float * tuple);
00096   void SetTuple(const vtkIdType i, const double * tuple);
00098   
00100 
00102   void InsertTuple(const vtkIdType i, const float * tuple);
00103   void InsertTuple(const vtkIdType i, const double * tuple);
00105 
00107 
00109   vtkIdType InsertNextTuple(const float * tuple);
00110   vtkIdType InsertNextTuple(const double * tuple);
00112 
00114   void Squeeze() {this->ResizeAndExtend (this->MaxId+1);};
00115 
00117   virtual void Resize(vtkIdType numTuples);
00118 
00122   float GetComponent(const vtkIdType i, const int j);
00123   
00128   void SetComponent(const vtkIdType i, const int j, const float c);
00129   
00133   void InsertComponent(const vtkIdType i, const int j, const float c);
00134 
00136   short GetValue(const vtkIdType id) {return this->Array[id];};
00137 
00139 
00141   void SetValue(const vtkIdType id, const short value)
00142     {this->Array[id] = value;};
00144 
00148   void SetNumberOfValues(const vtkIdType number);
00149 
00151   void InsertValue(const vtkIdType id, const short i);
00152 
00155   vtkIdType InsertNextValue(const short);
00156 
00160   short *WritePointer(const vtkIdType id, const vtkIdType number);
00161 
00163 
00165   void *GetVoidPointer(const vtkIdType id)
00166     {return (void *)this->GetPointer(id);};
00167   short *GetPointer(const vtkIdType id) {return this->Array + id;}
00169 
00171   void DeepCopy(vtkDataArray *da);
00172   
00174 
00180   void SetArray(short* array, vtkIdType size, int save);
00181   void SetVoidArray(void *array, vtkIdType size, int save) 
00182     {this->SetArray((short*)array, size, save);};
00184   
00185 protected:
00186   vtkShortArray(vtkIdType numComp=1);
00187   ~vtkShortArray();
00188 
00189   short *Array;   // pointer to data
00190   short *ResizeAndExtend(const vtkIdType sz);  // function to resize data
00191 
00192   int TupleSize; //used for data conversion
00193   float *Tuple;
00194 
00195   int SaveUserArray;
00196 private:
00197   vtkShortArray(const vtkShortArray&);  // Not implemented.
00198   void operator=(const vtkShortArray&);  // Not implemented.
00199 };
00200 
00201 inline void vtkShortArray::SetNumberOfValues(const vtkIdType number) 
00202 {
00203   this->Allocate(number);
00204   this->MaxId = number - 1;
00205 }
00206 
00207 
00208 inline short *vtkShortArray::WritePointer(const vtkIdType id,
00209                                           const vtkIdType number) 
00210 {
00211   vtkIdType newSize=id+number;
00212   if ( newSize > this->Size )
00213     {
00214     this->ResizeAndExtend(newSize);
00215     }
00216   if ( (--newSize) > this->MaxId )
00217     {
00218     this->MaxId = newSize;
00219     }
00220   return this->Array + id;
00221 }
00222 
00223 inline void vtkShortArray::InsertValue(const vtkIdType id, const short i)
00224 {
00225   if ( id >= this->Size )
00226     {
00227     this->ResizeAndExtend(id+1);
00228     }
00229   this->Array[id] = i;
00230   if ( id > this->MaxId )
00231     {
00232     this->MaxId = id;
00233     }
00234 }
00235 
00236 inline vtkIdType vtkShortArray::InsertNextValue(const short i)
00237 {
00238   this->InsertValue (++this->MaxId,i); 
00239   return this->MaxId;
00240 }
00241 
00242 
00243 #endif

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