/usr/include/trilinos/Shards_ArrayVector.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 | /*------------------------------------------------------------------------*/
/* shards : Shared Discretization Tools */
/* Copyright (2008) Sandia Corporation */
/* */
/* Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive */
/* license for use of this work by or on behalf of the U.S. Government. */
/* */
/* This library is free software; you can redistribute it and/or modify */
/* it under the terms of the GNU Lesser General Public License as */
/* published by the Free Software Foundation; either version 2.1 of the */
/* License, or (at your option) any later version. */
/* */
/* This library is distributed in the hope that it will be useful, */
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU */
/* Lesser General Public License for more details. */
/* */
/* You should have received a copy of the GNU Lesser General Public */
/* License along with this library; if not, write to the Free Software */
/* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 */
/* USA */
/* */
/* Questions? Contact H. Carter Edwards (hcedwar@sandia.gov) */
/*------------------------------------------------------------------------*/
#ifndef Shards_ArrayVector_hpp
#define Shards_ArrayVector_hpp
//----------------------------------------------------------------------
#include <Shards_Array.hpp>
//----------------------------------------------------------------------
namespace shards {
/** \addtogroup shards_package_array
* \{
*/
template< typename Scalar , ArrayOrder Order ,
class Tag1 = void , class Tag2 = void ,
class Tag3 = void , class Tag4 = void ,
class Tag5 = void , class Tag6 = void ,
class Tag7 = void , class Tag8 = void >
class ArrayVector ;
//----------------------------------------------------------------------
template< typename Scalar , ArrayOrder Order >
class ArrayVector<Scalar,Order,void,void,void,void, void,void,void,void>
: public Array<Scalar,Order,void,void,void,void, void,void,void,void>
{
private:
std::vector<Scalar> m_storage ;
typedef
Array<Scalar,Order,void,void,void,void, void,void,void,void>
BaseType ;
ArrayVector( const ArrayVector & );
ArrayVector & operator = ( const ArrayVector & );
Scalar * get_ptr() { return m_storage.empty() ? NULL : & m_storage[0] ; }
public:
typedef array_traits::int_t size_type ;
ArrayVector()
: BaseType() , m_storage() {}
~ArrayVector() {}
template< class Tag1 , class Tag2 , class Tag3 , class Tag4 ,
class Tag5 , class Tag6 , class Tag7 , class Tag8 >
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 ,
const size_type n7 , const size_type n8 )
{
m_storage.resize( n1 * n2 * n3 * n4 * n5 * n6 * n7 * n8 );
BaseType::template assign<Tag1,Tag2,Tag3,Tag4,Tag5,Tag6,Tag7,Tag8>
( get_ptr() ,n1,n2,n3,n4,n5,n6,n7,n8);
}
template< class Tag1 , class Tag2 , class Tag3 , class Tag4 ,
class Tag5 , class Tag6 , class Tag7 >
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 ,
const size_type n7 )
{
m_storage.resize( n1 * n2 * n3 * n4 * n5 * n6 * n7 );
BaseType::template assign<Tag1,Tag2,Tag3,Tag4,Tag5,Tag6,Tag7>
( get_ptr() ,n1,n2,n3,n4,n5,n6,n7);
}
template< class Tag1 , class Tag2 , class Tag3 , class Tag4 ,
class Tag5 , class Tag6 >
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 )
{
m_storage.resize( n1 * n2 * n3 * n4 * n5 * n6 );
BaseType::template assign<Tag1,Tag2,Tag3,Tag4,Tag5,Tag6>
( get_ptr() ,n1,n2,n3,n4,n5,n6);
}
template< class Tag1 , class Tag2 , class Tag3 , class Tag4 ,
class Tag5 >
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 )
{
m_storage.resize( n1 * n2 * n3 * n4 * n5 );
BaseType::template assign<Tag1,Tag2,Tag3,Tag4,Tag5>
( get_ptr(),n1,n2,n3,n4,n5);
}
template< class Tag1 , class Tag2 , class Tag3 , class Tag4 >
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 )
{
m_storage.resize( n1 * n2 * n3 * n4 );
BaseType::template assign<Tag1,Tag2,Tag3,Tag4>
( get_ptr(),n1,n2,n3,n4);
}
template< class Tag1 , class Tag2 , class Tag3 >
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 )
{
m_storage.resize( n1 * n2 * n3 );
BaseType::template assign<Tag1,Tag2,Tag3>
( get_ptr(),n1,n2,n3);
}
template< class Tag1 , class Tag2 >
void resize( const size_type n1 , const size_type n2 )
{
m_storage.resize( n1 * n2 );
BaseType::template assign<Tag1,Tag2>( get_ptr(),n1,n2);
}
template< class Tag1 >
void resize( const size_type n1 )
{
m_storage.resize( n1 );
BaseType::template assign<Tag1>( get_ptr(),n1);
}
};
//----------------------------------------------------------------------
template< typename Scalar , ArrayOrder Order ,
class Tag1 , class Tag2 , class Tag3 , class Tag4 ,
class Tag5 , class Tag6 , class Tag7 , class Tag8 >
class ArrayVector
: public Array<Scalar,Order,Tag1,Tag2,Tag3,Tag4,Tag5,Tag6,Tag7,Tag8>
{
private:
std::vector<Scalar> m_storage ;
typedef
array_traits::Helper<Scalar,Order,Tag1,Tag2,Tag3,Tag4,Tag5,Tag6,Tag7,Tag8>
help_type ;
typedef
Array<Scalar,Order,Tag1,Tag2,Tag3,Tag4,Tag5,Tag6,Tag7,Tag8>
BaseType ;
ArrayVector( const ArrayVector & );
ArrayVector & operator = ( const ArrayVector & );
Scalar * get_ptr() { return m_storage.empty() ? NULL : & m_storage[0] ; }
public:
typedef array_traits::int_t size_type ;
ArrayVector()
: BaseType() , m_storage() {}
~ArrayVector() {}
void resize( const size_type * const dims )
{
help_type::assign( BaseType::m_stride , dims );
const typename BaseType::size_type n = BaseType::size();
m_storage.resize( n );
BaseType::m_ptr = get_ptr();
}
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 ,
const size_type n7 , const size_type n8 )
{
array_traits::CheckRank<8,BaseType::Rank>::ok();
m_storage.resize( n1 * n2 * n3 * n4 * n5 * n6 * n7 * n8 );
BaseType::assign( get_ptr() ,n1,n2,n3,n4,n5,n6,n7,n8);
}
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 ,
const size_type n7 )
{
array_traits::CheckRank<7,BaseType::Rank>::ok();
m_storage.resize( n1 * n2 * n3 * n4 * n5 * n6 * n7 );
BaseType::assign( get_ptr(),n1,n2,n3,n4,n5,n6,n7);
}
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 )
{
array_traits::CheckRank<6,BaseType::Rank>::ok();
m_storage.resize( n1 * n2 * n3 * n4 * n5 * n6 );
BaseType::assign( get_ptr(),n1,n2,n3,n4,n5,n6);
}
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 )
{
array_traits::CheckRank<5,BaseType::Rank>::ok();
m_storage.resize( n1 * n2 * n3 * n4 * n5 );
BaseType::assign( get_ptr(),n1,n2,n3,n4,n5);
}
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 )
{
array_traits::CheckRank<4,BaseType::Rank>::ok();
m_storage.resize( n1 * n2 * n3 * n4 );
BaseType::assign( get_ptr(),n1,n2,n3,n4);
}
void resize( const size_type n1 , const size_type n2 ,
const size_type n3 )
{
array_traits::CheckRank<3,BaseType::Rank>::ok();
m_storage.resize( n1 * n2 * n3 );
BaseType::assign( get_ptr(),n1,n2,n3);
}
void resize( const size_type n1 , const size_type n2 )
{
array_traits::CheckRank<2,BaseType::Rank>::ok();
m_storage.resize( n1 * n2 );
BaseType::assign( get_ptr(),n1,n2);
}
void resize( const size_type n1 )
{
array_traits::CheckRank<1,BaseType::Rank>::ok();
m_storage.resize( n1 );
BaseType::assign( get_ptr(),n1);
}
ArrayVector( const size_type * const dims )
: BaseType(), m_storage() { resize( dims ); }
ArrayVector( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 ,
const size_type n7 , const size_type n8 )
: BaseType(), m_storage() { resize(n1,n2,n3,n4,n5,n6,n7,n8); }
ArrayVector( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 ,
const size_type n7 )
: BaseType(), m_storage() { resize(n1,n2,n3,n4,n5,n6,n7); }
ArrayVector( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 , const size_type n6 )
: BaseType(), m_storage() { resize(n1,n2,n3,n4,n5,n6); }
ArrayVector( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 ,
const size_type n5 )
: BaseType(), m_storage() { resize(n1,n2,n3,n4,n5); }
ArrayVector( const size_type n1 , const size_type n2 ,
const size_type n3 , const size_type n4 )
: BaseType(), m_storage() { resize(n1,n2,n3,n4); }
ArrayVector( const size_type n1 , const size_type n2 ,
const size_type n3 )
: BaseType(), m_storage() { resize(n1,n2,n3); }
ArrayVector( const size_type n1 , const size_type n2 )
: BaseType(), m_storage() { resize(n1,n2); }
ArrayVector( const size_type n1 )
: BaseType(), m_storage() { resize(n1); }
};
/** \} */
}
#endif /* Shards_ArrayVector_hpp */
|