00001 /* _______ __ 00002 / ___/ / ___ __ _ / / ___ 00003 / /__/ _ \/ _ \/ V \/ _ \/ _ \ 00004 \___/_//_/\___/_/_/_/_.__/\___/ 00005 */ 00006 // CHOMBO Copyright (c) 2000-2004, The Regents of the University of 00007 // California, through Lawrence Berkeley National Laboratory (subject to 00008 // receipt of any required approvals from U.S. Dept. of Energy). All 00009 // 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 // (1) Redistributions of source code must retain the above copyright 00015 // notice, this list of conditions and the following disclaimer. 00016 // (2) Redistributions in binary form must reproduce the above copyright 00017 // notice, this list of conditions and the following disclaimer in the 00018 // documentation and/or other materials provided with the distribution. 00019 // (3) Neither the name of Lawrence Berkeley National Laboratory, U.S. 00020 // Dept. of Energy nor the names of its contributors may be used to endorse 00021 // or promote products derived from this software without specific prior 00022 // written permission. 00023 // 00024 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 00025 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 00026 // TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A 00027 // PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER 00028 // OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 00029 // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 00030 // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 00031 // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 00032 // LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 00033 // NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 00034 // SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 00035 // 00036 // You are under no obligation whatsoever to provide any bug fixes, 00037 // patches, or upgrades to the features, functionality or performance of 00038 // the source code ("Enhancements") to anyone; however, if you choose to 00039 // make your Enhancements available either publicly, or directly to 00040 // Lawrence Berkeley National Laboratory, without imposing a separate 00041 // written license agreement for such Enhancements, then you hereby grant 00042 // the following license: a non-exclusive, royalty-free perpetual license 00043 // to install, use, modify, prepare derivative works, incorporate into 00044 // other computer software, distribute, and sublicense such Enhancements or 00045 // derivative works thereof, in binary and source code form. 00046 // 00047 // TRADEMARKS. Product and company names mentioned herein may be the 00048 // trademarks of their respective owners. Any rights not expressly granted 00049 // herein are reserved. 00050 // 00051 00052 #ifndef _TUPLE_H_ 00053 #define _TUPLE_H_ 00054 00055 #include <cstdlib> 00056 #include <cassert> 00057 using namespace std; 00058 00059 // 00061 00069 template <class T, size_t N> 00070 class Tuple 00071 { 00072 public: 00073 00079 Tuple (); 00080 00087 //explicit Tuple (const T* v); 00088 // 00089 // The copy constructor. 00090 // 00091 Tuple (const Tuple& rhs); 00092 // 00093 // The copy assignment operator. 00094 // 00095 Tuple& operator= (const Tuple& rhs); 00096 00101 T& operator[] (int i); 00102 00107 const T& operator[] (int i) const; 00108 00113 operator const T* () const; 00114 00115 protected: 00116 // 00117 // The underlying vector of T representing the Tuple. 00118 // 00119 T vect[N]; 00120 }; 00121 00122 // 00123 // Inlines. 00124 // 00125 00126 template <class T, size_t N> 00127 inline 00128 Tuple<T,N>::Tuple() 00129 {} 00130 00131 template <class T, size_t N> 00132 inline 00133 T& 00134 Tuple<T,N>::operator[] (int i) 00135 { 00136 assert(0 <= i && i < (int)N); 00137 return vect[i]; 00138 } 00139 00140 template <class T, size_t N> 00141 inline 00142 const T& 00143 Tuple<T,N>::operator[] (int i) const 00144 { 00145 assert(0 <= i && i < (int)N); 00146 return vect[i]; 00147 } 00148 00149 template <class T, size_t N> 00150 inline 00151 Tuple<T,N>::operator const T* () const 00152 { 00153 return &vect[0]; 00154 } 00155 00156 //template <class T, size_t N> 00157 //Tuple<T,N>::Tuple (const T* v) 00158 //{ 00159 // assert(v != 0); 00160 // for (size_t i = 0; i < N; ++i) 00161 // vect[i] = v[i]; 00162 //} 00163 00164 template <class T, size_t N> 00165 Tuple<T,N>::Tuple (const Tuple<T,N>& rhs) 00166 { 00167 for (size_t i = 0; i < N; ++i) 00168 vect[i] = rhs.vect[i]; 00169 } 00170 00171 template <class T, size_t N> 00172 Tuple<T,N>& 00173 Tuple<T,N>::operator= (const Tuple<T,N>& rhs) 00174 { 00175 for (size_t i = 0; i < N; ++i) 00176 vect[i] = rhs.vect[i]; 00177 return *this; 00178 } 00179 00180 #endif /*CH_TUPLE_H*/