/usr/include/octave-3.8.2/octave/intNDArray.h is in liboctave-dev 3.8.2-4.
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 | /*
Copyright (C) 2004-2013 John W. Eaton
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_intNDArray_h)
#define octave_intNDArray_h 1
#include "MArray.h"
#include "boolNDArray.h"
class NDArray;
template <class T>
class
intNDArray : public MArray<T>
{
public:
using typename MArray<T>::element_type;
intNDArray (void) : MArray<T> () { }
intNDArray (T val) : MArray<T> (dim_vector (1, 1), val) { }
intNDArray (const dim_vector& dv) : MArray<T> (dv) { }
intNDArray (const dim_vector& dv, T val)
: MArray<T> (dv, val) { }
template <class U>
intNDArray (const Array<U>& a) : MArray<T> (a) { }
template <class U>
intNDArray (const MArray<U>& a) : MArray<T> (a) { }
template <class U>
intNDArray (const intNDArray<U>& a) : MArray<T> (a) { }
intNDArray& operator = (const intNDArray<T>& a)
{
MArray<T>::operator = (a);
return *this;
}
boolNDArray operator ! (void) const;
bool any_element_is_nan (void) const { return false; }
bool any_element_not_one_or_zero (void) const;
intNDArray diag (octave_idx_type k = 0) const;
intNDArray diag (octave_idx_type m, octave_idx_type n) const;
intNDArray& changesign (void)
{
MArray<T>::changesign ();
return *this;
}
// FIXME: this is not quite the right thing.
boolNDArray all (int dim = -1) const;
boolNDArray any (int dim = -1) const;
intNDArray max (int dim = -1) const;
intNDArray max (Array<octave_idx_type>& index, int dim = -1) const;
intNDArray min (int dim = -1) const;
intNDArray min (Array<octave_idx_type>& index, int dim = -1) const;
intNDArray cummax (int dim = -1) const;
intNDArray cummax (Array<octave_idx_type>& index, int dim = -1) const;
intNDArray cummin (int dim = -1) const;
intNDArray cummin (Array<octave_idx_type>& index, int dim = -1) const;
intNDArray sum (int dim) const;
NDArray dsum (int dim) const;
intNDArray cumsum (int dim) const;
intNDArray diff (octave_idx_type order = 1, int dim = -1) const;
intNDArray abs (void) const;
intNDArray signum (void) const;
intNDArray squeeze (void) const
{ return intNDArray<T> (MArray<T>::squeeze ()); }
intNDArray transpose (void) const
{ return intNDArray<T> (MArray<T>::transpose ()); }
intNDArray concat (const intNDArray<T>& rb,
const Array<octave_idx_type>& ra_idx);
intNDArray& insert (const intNDArray<T>& a,
octave_idx_type r, octave_idx_type c);
intNDArray& insert (const intNDArray<T>& a,
const Array<octave_idx_type>& ra_idx);
static void increment_index (Array<octave_idx_type>& ra_idx,
const dim_vector& dimensions,
int start_dimension = 0);
static octave_idx_type compute_index (Array<octave_idx_type>& ra_idx,
const dim_vector& dimensions);
};
// i/o
template <class T>
std::ostream& operator << (std::ostream& os, const intNDArray<T>& a);
template <class T>
std::istream& operator >> (std::istream& is, intNDArray<T>& a);
#endif
|