/usr/include/octave-3.8.1/octave/MArray.h is in liboctave-dev 3.8.1-1ubuntu1.
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 | // Template array classes with like-type math ops
/*
Copyright (C) 1993-2013 John W. Eaton
Copyright (C) 2010 VZLU Prague
This file is part of Octave.
Octave is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 3 of the License, or (at your
option) any later version.
Octave 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 General Public License
for more details.
You should have received a copy of the GNU General Public License
along with Octave; see the file COPYING. If not, see
<http://www.gnu.org/licenses/>.
*/
#if !defined (octave_MArray_h)
#define octave_MArray_h 1
#include "Array.h"
// N-dimensional array with math ops.
// But first, some preprocessor abuse...
#include "MArray-decl.h"
MARRAY_OPS_FORWARD_DECLS (MArray, )
template <class T>
class
MArray : public Array<T>
{
protected:
// For jit support
MArray (T *sdata, octave_idx_type slen, octave_idx_type *adims, void *arep)
: Array<T> (sdata, slen, adims, arep) { }
public:
MArray (void) : Array<T> () { }
explicit MArray (octave_idx_type n) GCC_ATTR_DEPRECATED
: Array<T> (dim_vector (n, 1)) { }
MArray (octave_idx_type n, const T& val) GCC_ATTR_DEPRECATED
: Array<T> (dim_vector (n, 1), val) { }
explicit MArray (const dim_vector& dv)
: Array<T> (dv) { }
explicit MArray (const dim_vector& dv, const T& val)
: Array<T> (dv, val) { }
MArray (const MArray<T>& a) : Array<T> (a) { }
template <class U>
MArray (const Array<U>& a) : Array<T> (a) { }
~MArray (void) { }
MArray<T>& operator = (const MArray<T>& a)
{
Array<T>::operator = (a);
return *this;
}
MArray<T> reshape (const dim_vector& new_dims) const
{ return Array<T>::reshape (new_dims); }
MArray<T> permute (const Array<octave_idx_type>& vec,
bool inv = false) const
{ return Array<T>::permute (vec, inv); }
MArray<T> ipermute (const Array<octave_idx_type>& vec) const
{ return Array<T>::ipermute (vec); }
MArray squeeze (void) const { return Array<T>::squeeze (); }
MArray<T> transpose (void) const
{ return Array<T>::transpose (); }
MArray<T> hermitian (T (*fcn) (const T&) = 0) const
{ return Array<T>::hermitian (fcn); }
// Performs indexed accumulative addition.
void idx_add (const idx_vector& idx, T val);
void idx_add (const idx_vector& idx, const MArray<T>& vals);
void idx_min (const idx_vector& idx, const MArray<T>& vals);
void idx_max (const idx_vector& idx, const MArray<T>& vals);
void idx_add_nd (const idx_vector& idx, const MArray<T>& vals, int dim = -1);
void changesign (void);
};
#endif
|