/usr/include/liggghts/vector_container.h is in libliggghts-dev 3.7.0+repack1-1.
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 | /* ----------------------------------------------------------------------
This is the
██╗ ██╗ ██████╗ ██████╗ ██████╗ ██╗ ██╗████████╗███████╗
██║ ██║██╔════╝ ██╔════╝ ██╔════╝ ██║ ██║╚══██╔══╝██╔════╝
██║ ██║██║ ███╗██║ ███╗██║ ███╗███████║ ██║ ███████╗
██║ ██║██║ ██║██║ ██║██║ ██║██╔══██║ ██║ ╚════██║
███████╗██║╚██████╔╝╚██████╔╝╚██████╔╝██║ ██║ ██║ ███████║
╚══════╝╚═╝ ╚═════╝ ╚═════╝ ╚═════╝ ╚═╝ ╚═╝ ╚═╝ ╚══════╝®
DEM simulation engine, released by
DCS Computing Gmbh, Linz, Austria
http://www.dcs-computing.com, office@dcs-computing.com
LIGGGHTS® is part of CFDEM®project:
http://www.liggghts.com | http://www.cfdem.com
Core developer and main author:
Christoph Kloss, christoph.kloss@dcs-computing.com
LIGGGHTS® is open-source, distributed under the terms of the GNU Public
License, version 2 or later. It 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. You should have
received a copy of the GNU General Public License along with LIGGGHTS®.
If not, see http://www.gnu.org/licenses . See also top-level README
and LICENSE files.
LIGGGHTS® and CFDEM® are registered trade marks of DCS Computing GmbH,
the producer of the LIGGGHTS® software and the CFDEM®coupling software
See http://www.cfdem.com/terms-trademark-policy for details.
-------------------------------------------------------------------------
Contributing author and copyright for this file:
(if not contributing author is listed, this file has been contributed
by the core developer)
Christoph Kloss (DCS Computing GmbH, Linz)
Christoph Kloss (JKU Linz)
Philippe Seil (JKU Linz)
Copyright 2012- DCS Computing GmbH, Linz
Copyright 2009-2012 JKU Linz
------------------------------------------------------------------------- */
#ifndef LMP_VECTOR_CONTAINER
#define LMP_VECTOR_CONTAINER
#include "general_container.h"
#include "memory.h"
namespace LAMMPS_NS
{
template<typename T, int LEN_VEC>
class VectorContainer : public GeneralContainer <T, 1, LEN_VEC>
{
public:
VectorContainer();
VectorContainer(const char *_id);
VectorContainer(const char *_id, const char *_comm, const char *_ref, const char *_restart, int _scalePower = 1);
VectorContainer(VectorContainer<T,LEN_VEC> const &orig);
virtual ~VectorContainer();
void add(T* elem);
void get(int n, T* elem);
void set(int n, T* elem);
T max_elem(int n);
T min_elem(int n);
//void setAll(T def);
T*& operator() (int n);
T* const& operator() (int n) const;
T** begin();
void* begin_slow_dirty();
int pushToBuffer_plain(double *buf);
int pullFromBuffer_plain(double *buf);
};
/* ----------------------------------------------------------------------
constructors
------------------------------------------------------------------------- */
template<typename T, int LEN_VEC>
VectorContainer<T,LEN_VEC>::VectorContainer()
: GeneralContainer<T,1,LEN_VEC>(0)
{
}
template<typename T, int LEN_VEC>
VectorContainer<T,LEN_VEC>::VectorContainer(const char *_id)
: GeneralContainer<T,1,LEN_VEC>(_id)
{
}
template<typename T, int LEN_VEC>
VectorContainer<T,LEN_VEC>::VectorContainer(const char *_id, const char *_comm, const char *_ref, const char *_restart, int _scalePower)
: GeneralContainer<T,1,LEN_VEC>(_id, _comm, _ref, _restart, _scalePower)
{
}
template<typename T, int LEN_VEC>
VectorContainer<T,LEN_VEC>::VectorContainer(VectorContainer<T,LEN_VEC> const &orig)
: GeneralContainer<T,1,LEN_VEC>(orig)
{
}
/* ----------------------------------------------------------------------
destructor
------------------------------------------------------------------------- */
template<typename T, int LEN_VEC>
VectorContainer<T,LEN_VEC>::~VectorContainer()
{
}
/* ----------------------------------------------------------------------
add element
------------------------------------------------------------------------- */
template<typename T, int LEN_VEC>
void VectorContainer<T,LEN_VEC>::add(T* elem)
{
if(GeneralContainer<T,1,LEN_VEC>::numElem_ == GeneralContainer<T,1,LEN_VEC>::maxElem_)
{
grow(GeneralContainer<T,1,LEN_VEC>::arr_,GeneralContainer<T,1,LEN_VEC>::maxElem_+GROW_CONTAINER(),1,LEN_VEC);
GeneralContainer<T,1,LEN_VEC>::maxElem_ += GROW_CONTAINER();
}
for(int i=0;i<LEN_VEC;i++)
GeneralContainer<T,1,LEN_VEC>::arr_[GeneralContainer<T,1,LEN_VEC>::numElem_][0][i] = elem[i];
GeneralContainer<T,1,LEN_VEC>::numElem_++;
}
/* ----------------------------------------------------------------------
access
------------------------------------------------------------------------- */
template<typename T, int LEN_VEC>
T*& VectorContainer<T,LEN_VEC>::operator() (int n)
{
return GeneralContainer<T,1,LEN_VEC>::arr_[n][0];
}
template<typename T, int LEN_VEC>
T* const& VectorContainer<T,LEN_VEC>::operator() (int n) const
{
return GeneralContainer<T,1,LEN_VEC>::arr_[n][0];
}
template<typename T, int LEN_VEC>
void VectorContainer<T,LEN_VEC>::get(int n, T* elem)
{
for(int i = 0; i < LEN_VEC; i++)
elem[i] = GeneralContainer<T,1,LEN_VEC>::arr_[n][0][i];
}
template<typename T, int LEN_VEC>
void VectorContainer<T,LEN_VEC>::set(int n, T* elem)
{
for(int i = 0; i < LEN_VEC; i++)
GeneralContainer<T,1,LEN_VEC>::arr_[n][0][i] = elem[i];
}
template<typename T, int LEN_VEC>
T VectorContainer<T,LEN_VEC>::max_elem(int n)
{
T max = GeneralContainer<T,1,LEN_VEC>::arr_[n][0][0];
for(int i = 1; i < LEN_VEC; i++)
if(GeneralContainer<T,1,LEN_VEC>::arr_[n][0][i] > max)
max = GeneralContainer<T,1,LEN_VEC>::arr_[n][0][i];
return max;
}
template<typename T, int LEN_VEC>
T VectorContainer<T,LEN_VEC>::min_elem(int n)
{
T min = GeneralContainer<T,1,LEN_VEC>::arr_[n][0][0];
for(int i = 1; i < LEN_VEC; i++)
if(GeneralContainer<T,1,LEN_VEC>::arr_[n][0][i] < min)
min = GeneralContainer<T,1,LEN_VEC>::arr_[n][0][i];
return min;
}
/*
template<typename T, int LEN_VEC>
void VectorContainer<T,LEN_VEC>::setAll(T def)
{
int len = this->size();
for(int n = 0; n < len; n++)
for(int i = 0; i < LEN_VEC; i++)
GeneralContainer<T,1,LEN_VEC>::arr_[n][0][i] = def;
}
*/
template<typename T, int LEN_VEC>
T** VectorContainer<T,LEN_VEC>::begin()
{
return &(GeneralContainer<T,1,LEN_VEC>::arr_[0][0]);
}
template<typename T, int LEN_VEC>
void* VectorContainer<T,LEN_VEC>::begin_slow_dirty()
{
return (void*) &(GeneralContainer<T,1,LEN_VEC>::arr_[0][0]);
}
template<typename T, int LEN_VEC>
int VectorContainer<T,LEN_VEC>::pushToBuffer_plain(double *buf)
{
int len = this->size();
int m = 0;
for(int i = 0; i < len; i++)
for(int j = 0; j < LEN_VEC; j++)
buf[m++] = static_cast<double>(this->arr_[i][0][j]);
return len*LEN_VEC;
}
template<typename T, int LEN_VEC>
int VectorContainer<T,LEN_VEC>::pullFromBuffer_plain(double *buf)
{
int len = this->size();
int m = 0;
for(int i = 0; i < len; i++)
for(int j = 0; j < LEN_VEC; j++)
this->arr_[i][0][j] = static_cast<T>(buf[m++]);
return len*LEN_VEC;
}
} /* LAMMPS_NS */
#endif /* VECTORCONTAINER_H_ */
|