// N-D Array manipulations.
/*
Copyright (C) 1996, 1997 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 2, 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, write to the Free
Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
#if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION)
#pragma implementation
#endif
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <cfloat>
#include <vector>
#include "Array-util.h"
#include "CNDArray.h"
#include "mx-base.h"
#include "f77-fcn.h"
#include "lo-ieee.h"
#include "lo-mappers.h"
#if defined (HAVE_FFTW3)
#include "oct-fftw.h"
#else
extern "C"
{
// Note that the original complex fft routines were not written for
// double complex arguments. They have been modified by adding an
// implicit double precision (a-h,o-z) statement at the beginning of
// each subroutine.
F77_RET_T
F77_FUNC (cffti, CFFTI) (const int&, Complex*);
F77_RET_T
F77_FUNC (cfftf, CFFTF) (const int&, Complex*, Complex*);
F77_RET_T
F77_FUNC (cfftb, CFFTB) (const int&, Complex*, Complex*);
}
#endif
#if defined (HAVE_FFTW3)
ComplexNDArray
ComplexNDArray::fourier (int dim) const
{
dim_vector dv = dims ();
if (dim > dv.length () || dim < 0)
return ComplexNDArray ();
int stride = 1;
int n = dv(dim);
for (int i = 0; i < dim; i++)
stride *= dv(i);
int howmany = numel () / dv (dim);
howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany));
int nloop = (stride == 1 ? 1 : numel () / dv (dim) / stride);
int dist = (stride == 1 ? n : 1);
const Complex *in (fortran_vec ());
ComplexNDArray retval (dv);
Complex *out (retval.fortran_vec ());
// Need to be careful here about the distance between fft's
for (int k = 0; k < nloop; k++)
octave_fftw::fft (in + k * stride * n, out + k * stride * n,
n, howmany, stride, dist);
return retval;
}
ComplexNDArray
ComplexNDArray::ifourier (int dim) const
{
dim_vector dv = dims ();
if (dim > dv.length () || dim < 0)
return ComplexNDArray ();
int stride = 1;
int n = dv(dim);
for (int i = 0; i < dim; i++)
stride *= dv(i);
int howmany = numel () / dv (dim);
howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany));
int nloop = (stride == 1 ? 1 : numel () / dv (dim) / stride);
int dist = (stride == 1 ? n : 1);
const Complex *in (fortran_vec ());
ComplexNDArray retval (dv);
Complex *out (retval.fortran_vec ());
// Need to be careful here about the distance between fft's
for (int k = 0; k < nloop; k++)
octave_fftw::ifft (in + k * stride * n, out + k * stride * n,
n, howmany, stride, dist);
return retval;
}
ComplexNDArray
ComplexNDArray::fourier2d (void) const
{
dim_vector dv = dims();
if (dv.length () < 2)
return ComplexNDArray ();
dim_vector dv2(dv(0), dv(1));
const Complex *in = fortran_vec ();
ComplexNDArray retval (dv);
Complex *out = retval.fortran_vec ();
int howmany = numel() / dv(0) / dv(1);
int dist = dv(0) * dv(1);
for (int i=0; i < howmany; i++)
octave_fftw::fftNd (in + i*dist, out + i*dist, 2, dv2);
return retval;
}
ComplexNDArray
ComplexNDArray::ifourier2d (void) const
{
dim_vector dv = dims();
if (dv.length () < 2)
return ComplexNDArray ();
dim_vector dv2(dv(0), dv(1));
const Complex *in = fortran_vec ();
ComplexNDArray retval (dv);
Complex *out = retval.fortran_vec ();
int howmany = numel() / dv(0) / dv(1);
int dist = dv(0) * dv(1);
for (int i=0; i < howmany; i++)
octave_fftw::ifftNd (in + i*dist, out + i*dist, 2, dv2);
return retval;
}
ComplexNDArray
ComplexNDArray::fourierNd (void) const
{
dim_vector dv = dims ();
int rank = dv.length ();
const Complex *in (fortran_vec ());
ComplexNDArray retval (dv);
Complex *out (retval.fortran_vec ());
octave_fftw::fftNd (in, out, rank, dv);
return retval;
}
ComplexNDArray
ComplexNDArray::ifourierNd (void) const
{
dim_vector dv = dims ();
int rank = dv.length ();
const Complex *in (fortran_vec ());
ComplexNDArray retval (dv);
Complex *out (retval.fortran_vec ());
octave_fftw::ifftNd (in, out, rank, dv);
return retval;
}
#else
ComplexNDArray
ComplexNDArray::fourier (int dim) const
{
dim_vector dv = dims ();
if (dim > dv.length () || dim < 0)
return ComplexNDArray ();
ComplexNDArray retval (dv);
int npts = dv(dim);
int nn = 4*npts+15;
Array<Complex> wsave (nn);
Complex *pwsave = wsave.fortran_vec ();
OCTAVE_LOCAL_BUFFER (Complex, tmp, npts);
int stride = 1;
for (int i = 0; i < dim; i++)
stride *= dv(i);
int howmany = numel () / npts;
howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany));
int nloop = (stride == 1 ? 1 : numel () / npts / stride);
int dist = (stride == 1 ? npts : 1);
F77_FUNC (cffti, CFFTI) (npts, pwsave);
for (int k = 0; k < nloop; k++)
{
for (int j = 0; j < howmany; j++)
{
OCTAVE_QUIT;
for (int i = 0; i < npts; i++)
tmp[i] = elem((i + k*npts)*stride + j*dist);
F77_FUNC (cfftf, CFFTF) (npts, tmp, pwsave);
for (int i = 0; i < npts; i++)
retval ((i + k*npts)*stride + j*dist) = tmp[i];
}
}
return retval;
}
ComplexNDArray
ComplexNDArray::ifourier (int dim) const
{
dim_vector dv = dims ();
if (dim > dv.length () || dim < 0)
return ComplexNDArray ();
ComplexNDArray retval (dv);
int npts = dv(dim);
int nn = 4*npts+15;
Array<Complex> wsave (nn);
Complex *pwsave = wsave.fortran_vec ();
OCTAVE_LOCAL_BUFFER (Complex, tmp, npts);
int stride = 1;
for (int i = 0; i < dim; i++)
stride *= dv(i);
int howmany = numel () / npts;
howmany = (stride == 1 ? howmany : (howmany > stride ? stride : howmany));
int nloop = (stride == 1 ? 1 : numel () / npts / stride);
int dist = (stride == 1 ? npts : 1);
F77_FUNC (cffti, CFFTI) (npts, pwsave);
for (int k = 0; k < nloop; k++)
{
for (int j = 0; j < howmany; j++)
{
OCTAVE_QUIT;
for (int i = 0; i < npts; i++)
tmp[i] = elem((i + k*npts)*stride + j*dist);
F77_FUNC (cfftb, CFFTB) (npts, tmp, pwsave);
for (int i = 0; i < npts; i++)
retval ((i + k*npts)*stride + j*dist) = tmp[i] /
static_cast<double> (npts);
}
}
return retval;
}
ComplexNDArray
ComplexNDArray::fourier2d (void) const
{
dim_vector dv = dims ();
dim_vector dv2 (dv(0), dv(1));
int rank = 2;
ComplexNDArray retval (*this);
int stride = 1;
for (int i = 0; i < rank; i++)
{
int npts = dv2(i);
int nn = 4*npts+15;
Array<Complex> wsave (nn);
Complex *pwsave = wsave.fortran_vec ();
Array<Complex> row (npts);
Complex *prow = row.fortran_vec ();
int howmany = numel () / npts;
howmany = (stride == 1 ? howmany :
(howmany > stride ? stride : howmany));
int nloop = (stride == 1 ? 1 : numel () / npts / stride);
int dist = (stride == 1 ? npts : 1);
F77_FUNC (cffti, CFFTI) (npts, pwsave);
for (int k = 0; k < nloop; k++)
{
for (int j = 0; j < howmany; j++)
{
OCTAVE_QUIT;
for (int l = 0; l < npts; l++)
prow[l] = retval ((l + k*npts)*stride + j*dist);
F77_FUNC (cfftf, CFFTF) (npts, prow, pwsave);
for (int l = 0; l < npts; l++)
retval ((l + k*npts)*stride + j*dist) = prow[l];
}
}
stride *= dv2(i);
}
return retval;
}
ComplexNDArray
ComplexNDArray::ifourier2d (void) const
{
dim_vector dv = dims();
dim_vector dv2 (dv(0), dv(1));
int rank = 2;
ComplexNDArray retval (*this);
int stride = 1;
for (int i = 0; i < rank; i++)
{
int npts = dv2(i);
int nn = 4*npts+15;
Array<Complex> wsave (nn);
Complex *pwsave = wsave.fortran_vec ();
Array<Complex> row (npts);
Complex *prow = row.fortran_vec ();
int howmany = numel () / npts;
howmany = (stride == 1 ? howmany :
(howmany > stride ? stride : howmany));
int nloop = (stride == 1 ? 1 : numel () / npts / stride);
int dist = (stride == 1 ? npts : 1);
F77_FUNC (cffti, CFFTI) (npts, pwsave);
for (int k = 0; k < nloop; k++)
{
for (int j = 0; j < howmany; j++)
{
OCTAVE_QUIT;
for (int l = 0; l < npts; l++)
prow[l] = retval ((l + k*npts)*stride + j*dist);
F77_FUNC (cfftb, CFFTB) (npts, prow, pwsave);
for (int l = 0; l < npts; l++)
retval ((l + k*npts)*stride + j*dist) = prow[l] /
static_cast<double> (npts);
}
}
stride *= dv2(i);
}
return retval;
}
ComplexNDArray
ComplexNDArray::fourierNd (void) const
{
dim_vector dv = dims ();
int rank = dv.length ();
ComplexNDArray retval (*this);
int stride = 1;
for (int i = 0; i < rank; i++)
{
int npts = dv(i);
int nn = 4*npts+15;
Array<Complex> wsave (nn);
Complex *pwsave = wsave.fortran_vec ();
Array<Complex> row (npts);
Complex *prow = row.fortran_vec ();
int howmany = numel () / npts;
howmany = (stride == 1 ? howmany :
(howmany > stride ? stride : howmany));
int nloop = (stride == 1 ? 1 : numel () / npts / stride);
int dist = (stride == 1 ? npts : 1);
F77_FUNC (cffti, CFFTI) (npts, pwsave);
for (int k = 0; k < nloop; k++)
{
for (int j = 0; j < howmany; j++)
{
OCTAVE_QUIT;
for (int l = 0; l < npts; l++)
prow[l] = retval ((l + k*npts)*stride + j*dist);
F77_FUNC (cfftf, CFFTF) (npts, prow, pwsave);
for (int l = 0; l < npts; l++)
retval ((l + k*npts)*stride + j*dist) = prow[l];
}
}
stride *= dv(i);
}
return retval;
}
ComplexNDArray
ComplexNDArray::ifourierNd (void) const
{
dim_vector dv = dims ();
int rank = dv.length ();
ComplexNDArray retval (*this);
int stride = 1;
for (int i = 0; i < rank; i++)
{
int npts = dv(i);
int nn = 4*npts+15;
Array<Complex> wsave (nn);
Complex *pwsave = wsave.fortran_vec ();
Array<Complex> row (npts);
Complex *prow = row.fortran_vec ();
int howmany = numel () / npts;
howmany = (stride == 1 ? howmany :
(howmany > stride ? stride : howmany));
int nloop = (stride == 1 ? 1 : numel () / npts / stride);
int dist = (stride == 1 ? npts : 1);
F77_FUNC (cffti, CFFTI) (npts, pwsave);
for (int k = 0; k < nloop; k++)
{
for (int j = 0; j < howmany; j++)
{
OCTAVE_QUIT;
for (int l = 0; l < npts; l++)
prow[l] = retval ((l + k*npts)*stride + j*dist);
F77_FUNC (cfftb, CFFTB) (npts, prow, pwsave);
for (int l = 0; l < npts; l++)
retval ((l + k*npts)*stride + j*dist) = prow[l] /
static_cast<double> (npts);
}
}
stride *= dv(i);
}
return retval;
}
#endif
// unary operations
boolNDArray
ComplexNDArray::operator ! (void) const
{
boolNDArray b (dims ());
for (int i = 0; i < length (); i++)
b.elem (i) = elem (i) == 0.0;
return b;
}
// XXX FIXME XXX -- this is not quite the right thing.
bool
ComplexNDArray::any_element_is_inf_or_nan (void) const
{
int nel = nelem ();
for (int i = 0; i < nel; i++)
{
Complex val = elem (i);
if (xisinf (val) || xisnan (val))
return true;
}
return false;
}
// Return true if no elements have imaginary components.
bool
ComplexNDArray::all_elements_are_real (void) const
{
int nel = nelem ();
for (int i = 0; i < nel; i++)
{
double ip = std::imag (elem (i));
if (ip != 0.0 || lo_ieee_signbit (ip))
return false;
}
return true;
}
// Return nonzero if any element of CM has a non-integer real or
// imaginary part. Also extract the largest and smallest (real or
// imaginary) values and return them in MAX_VAL and MIN_VAL.
bool
ComplexNDArray::all_integers (double& max_val, double& min_val) const
{
int nel = nelem ();
if (nel > 0)
{
Complex val = elem (0);
double r_val = std::real (val);
double i_val = std::imag (val);
max_val = r_val;
min_val = r_val;
if (i_val > max_val)
max_val = i_val;
if (i_val < max_val)
min_val = i_val;
}
else
return false;
for (int i = 0; i < nel; i++)
{
Complex val = elem (i);
double r_val = std::real (val);
double i_val = std::imag (val);
if (r_val > max_val)
max_val = r_val;
if (i_val > max_val)
max_val = i_val;
if (r_val < min_val)
min_val = r_val;
if (i_val < min_val)
min_val = i_val;
if (D_NINT (r_val) != r_val || D_NINT (i_val) != i_val)
return false;
}
return true;
}
bool
ComplexNDArray::too_large_for_float (void) const
{
int nel = nelem ();
for (int i = 0; i < nel; i++)
{
Complex val = elem (i);
double r_val = std::real (val);
double i_val = std::imag (val);
if ((! (octave_is_NaN_or_NA (r_val) || xisinf (r_val))
&& fabs (r_val) > FLT_MAX)
|| (! (octave_is_NaN_or_NA (i_val) || xisinf (i_val))
&& fabs (i_val) > FLT_MAX))
return true;
}
return false;
}
boolNDArray
ComplexNDArray::all (int dim) const
{
MX_ND_ANY_ALL_REDUCTION
(MX_ND_ALL_EVAL (elem (iter_idx) == Complex (0, 0)), true);
}
boolNDArray
ComplexNDArray::any (int dim) const
{
MX_ND_ANY_ALL_REDUCTION
(MX_ND_ANY_EVAL (elem (iter_idx) != Complex (0, 0)
&& ! (lo_ieee_isnan (std::real (elem (iter_idx)))
|| lo_ieee_isnan (std::imag (elem (iter_idx))))),
false);
}
ComplexNDArray
ComplexNDArray::cumprod (int dim) const
{
MX_ND_CUMULATIVE_OP (ComplexNDArray, Complex, Complex (1, 0), *);
}
ComplexNDArray
ComplexNDArray::cumsum (int dim) const
{
MX_ND_CUMULATIVE_OP (ComplexNDArray, Complex, Complex (0, 0), +);
}
ComplexNDArray
ComplexNDArray::prod (int dim) const
{
MX_ND_COMPLEX_OP_REDUCTION (*= elem (iter_idx), Complex (1, 0));
}
ComplexNDArray
ComplexNDArray::sumsq (int dim) const
{
MX_ND_COMPLEX_OP_REDUCTION
(+= std::imag (elem (iter_idx))
? elem (iter_idx) * conj (elem (iter_idx))
: std::pow (elem (iter_idx), 2), Complex (0, 0));
}
ComplexNDArray
ComplexNDArray::sum (int dim) const
{
MX_ND_COMPLEX_OP_REDUCTION (+= elem (iter_idx), Complex (0, 0));
}
ComplexNDArray
ComplexNDArray::concat (const ComplexNDArray& rb, const Array<int>& ra_idx)
{
if (rb.numel () > 0)
insert (rb, ra_idx);
return *this;
}
ComplexNDArray
ComplexNDArray::concat (const NDArray& rb, const Array<int>& ra_idx)
{
ComplexNDArray tmp (rb);
if (rb.numel () > 0)
insert (tmp, ra_idx);
return *this;
}
ComplexNDArray
concat (NDArray& ra, ComplexNDArray& rb, const Array<int>& ra_idx)
{
ComplexNDArray retval (ra);
if (rb.numel () > 0)
retval.insert (rb, ra_idx);
return retval;
}
static const Complex Complex_NaN_result (octave_NaN, octave_NaN);
ComplexNDArray
ComplexNDArray::max (int dim) const
{
ArrayN<int> dummy_idx;
return max (dummy_idx, dim);
}
ComplexNDArray
ComplexNDArray::max (ArrayN<int>& idx_arg, int dim) const
{
dim_vector dv = dims ();
dim_vector dr = dims ();
if (dv.numel () == 0 || dim > dv.length () || dim < 0)
return ComplexNDArray ();
dr(dim) = 1;
ComplexNDArray result (dr);
idx_arg.resize (dr);
int x_stride = 1;
int x_len = dv(dim);
for (int i = 0; i < dim; i++)
x_stride *= dv(i);
for (int i = 0; i < dr.numel (); i++)
{
int x_offset;
if (x_stride == 1)
x_offset = i * x_len;
else
{
int x_offset2 = 0;
x_offset = i;
while (x_offset >= x_stride)
{
x_offset -= x_stride;
x_offset2++;
}
x_offset += x_offset2 * x_stride * x_len;
}
int idx_j;
Complex tmp_max;
double abs_max = octave_NaN;
for (idx_j = 0; idx_j < x_len; idx_j++)
{
tmp_max = elem (idx_j * x_stride + x_offset);
if (! octave_is_NaN_or_NA (tmp_max))
{
abs_max = std::abs(tmp_max);
break;
}
}
for (int j = idx_j+1; j < x_len; j++)
{
Complex tmp = elem (j * x_stride + x_offset);
if (octave_is_NaN_or_NA (tmp))
continue;
double abs_tmp = std::abs (tmp);
if (abs_tmp > abs_max)
{
idx_j = j;
tmp_max = tmp;
abs_max = abs_tmp;
}
}
if (octave_is_NaN_or_NA (tmp_max))
{
result.elem (i) = Complex_NaN_result;
idx_arg.elem (i) = 0;
}
else
{
result.elem (i) = tmp_max;
idx_arg.elem (i) = idx_j;
}
}
return result;
}
ComplexNDArray
ComplexNDArray::min (int dim) const
{
ArrayN<int> dummy_idx;
return min (dummy_idx, dim);
}
ComplexNDArray
ComplexNDArray::min (ArrayN<int>& idx_arg, int dim) const
{
dim_vector dv = dims ();
dim_vector dr = dims ();
if (dv.numel () == 0 || dim > dv.length () || dim < 0)
return ComplexNDArray ();
dr(dim) = 1;
ComplexNDArray result (dr);
idx_arg.resize (dr);
int x_stride = 1;
int x_len = dv(dim);
for (int i = 0; i < dim; i++)
x_stride *= dv(i);
for (int i = 0; i < dr.numel (); i++)
{
int x_offset;
if (x_stride == 1)
x_offset = i * x_len;
else
{
int x_offset2 = 0;
x_offset = i;
while (x_offset >= x_stride)
{
x_offset -= x_stride;
x_offset2++;
}
x_offset += x_offset2 * x_stride * x_len;
}
int idx_j;
Complex tmp_min;
double abs_min = octave_NaN;
for (idx_j = 0; idx_j < x_len; idx_j++)
{
tmp_min = elem (idx_j * x_stride + x_offset);
if (! octave_is_NaN_or_NA (tmp_min))
{
abs_min = std::abs(tmp_min);
break;
}
}
for (int j = idx_j+1; j < x_len; j++)
{
Complex tmp = elem (j * x_stride + x_offset);
if (octave_is_NaN_or_NA (tmp))
continue;
double abs_tmp = std::abs (tmp);
if (abs_tmp < abs_min)
{
idx_j = j;
tmp_min = tmp;
abs_min = abs_tmp;
}
}
if (octave_is_NaN_or_NA (tmp_min))
{
result.elem (i) = Complex_NaN_result;
idx_arg.elem (i) = 0;
}
else
{
result.elem (i) = tmp_min;
idx_arg.elem (i) = idx_j;
}
}
return result;
}
NDArray
ComplexNDArray::abs (void) const
{
NDArray retval (dims ());
int nel = nelem ();
for (int i = 0; i < nel; i++)
retval(i) = std::abs (elem (i));
return retval;
}
ComplexNDArray&
ComplexNDArray::insert (const NDArray& a, int r, int c)
{
dim_vector a_dv = a.dims ();
int n = a_dv.length ();
if (n == dimensions.length ())
{
Array<int> a_ra_idx (a_dv.length (), 0);
a_ra_idx.elem (0) = r;
a_ra_idx.elem (1) = c;
for (int i = 0; i < n; i++)
{
if (a_ra_idx (i) < 0 || (a_ra_idx (i) + a_dv (i)) > dimensions (i))
{
(*current_liboctave_error_handler)
("Array<T>::insert: range error for insert");
return *this;
}
}
a_ra_idx.elem (0) = 0;
a_ra_idx.elem (1) = 0;
int n_elt = a.numel ();
// IS make_unique () NECCESSARY HERE??
for (int i = 0; i < n_elt; i++)
{
Array<int> ra_idx = a_ra_idx;
ra_idx.elem (0) = a_ra_idx (0) + r;
ra_idx.elem (1) = a_ra_idx (1) + c;
elem (ra_idx) = a.elem (a_ra_idx);
increment_index (a_ra_idx, a_dv);
}
}
else
(*current_liboctave_error_handler)
("Array<T>::insert: invalid indexing operation");
return *this;
}
ComplexNDArray&
ComplexNDArray::insert (const ComplexNDArray& a, int r, int c)
{
Array<Complex>::insert (a, r, c);
return *this;
}
ComplexNDArray&
ComplexNDArray::insert (const ComplexNDArray& a, const Array<int>& ra_idx)
{
Array<Complex>::insert (a, ra_idx);
return *this;
}
ComplexMatrix
ComplexNDArray::matrix_value (void) const
{
ComplexMatrix retval;
int nd = ndims ();
switch (nd)
{
case 1:
retval = ComplexMatrix (Array2<Complex> (*this, dimensions(0), 1));
break;
case 2:
retval = ComplexMatrix (Array2<Complex> (*this, dimensions(0),
dimensions(1)));
break;
default:
(*current_liboctave_error_handler)
("invalid conversion of ComplexNDArray to ComplexMatrix");
break;
}
return retval;
}
void
ComplexNDArray::increment_index (Array<int>& ra_idx,
const dim_vector& dimensions,
int start_dimension)
{
::increment_index (ra_idx, dimensions, start_dimension);
}
int
ComplexNDArray::compute_index (Array<int>& ra_idx,
const dim_vector& dimensions)
{
return ::compute_index (ra_idx, dimensions);
}
// This contains no information on the array structure !!!
std::ostream&
operator << (std::ostream& os, const ComplexNDArray& a)
{
int nel = a.nelem ();
for (int i = 0; i < nel; i++)
{
os << " ";
octave_write_complex (os, a.elem (i));
os << "\n";
}
return os;
}
std::istream&
operator >> (std::istream& is, ComplexNDArray& a)
{
int nel = a.nelem ();
if (nel < 1 )
is.clear (std::ios::badbit);
else
{
Complex tmp;
for (int i = 0; i < nel; i++)
{
tmp = octave_read_complex (is);
if (is)
a.elem (i) = tmp;
else
goto done;
}
}
done:
return is;
}
// XXX FIXME XXX -- it would be nice to share code among the min/max
// functions below.
#define EMPTY_RETURN_CHECK(T) \
if (nel == 0) \
return T (dv);
ComplexNDArray
min (const Complex& c, const ComplexNDArray& m)
{
dim_vector dv = m.dims ();
int nel = dv.numel ();
EMPTY_RETURN_CHECK (ComplexNDArray);
ComplexNDArray result (dv);
for (int i = 0; i < nel; i++)
{
OCTAVE_QUIT;
result (i) = xmin (c, m (i));
}
return result;
}
ComplexNDArray
min (const ComplexNDArray& m, const Complex& c)
{
dim_vector dv = m.dims ();
int nel = dv.numel ();
EMPTY_RETURN_CHECK (ComplexNDArray);
ComplexNDArray result (dv);
for (int i = 0; i < nel; i++)
{
OCTAVE_QUIT;
result (i) = xmin (c, m (i));
}
return result;
}
ComplexNDArray
min (const ComplexNDArray& a, const ComplexNDArray& b)
{
dim_vector dv = a.dims ();
int nel = dv.numel ();
if (dv != b.dims ())
{
(*current_liboctave_error_handler)
("two-arg min expecting args of same size");
return ComplexNDArray ();
}
EMPTY_RETURN_CHECK (ComplexNDArray);
ComplexNDArray result (dv);
for (int i = 0; i < nel; i++)
{
OCTAVE_QUIT;
result (i) = xmin (a (i), b (i));
}
return result;
}
ComplexNDArray
max (const Complex& c, const ComplexNDArray& m)
{
dim_vector dv = m.dims ();
int nel = dv.numel ();
EMPTY_RETURN_CHECK (ComplexNDArray);
ComplexNDArray result (dv);
for (int i = 0; i < nel; i++)
{
OCTAVE_QUIT;
result (i) = xmax (c, m (i));
}
return result;
}
ComplexNDArray
max (const ComplexNDArray& m, const Complex& c)
{
dim_vector dv = m.dims ();
int nel = dv.numel ();
EMPTY_RETURN_CHECK (ComplexNDArray);
ComplexNDArray result (dv);
for (int i = 0; i < nel; i++)
{
OCTAVE_QUIT;
result (i) = xmax (c, m (i));
}
return result;
}
ComplexNDArray
max (const ComplexNDArray& a, const ComplexNDArray& b)
{
dim_vector dv = a.dims ();
int nel = dv.numel ();
if (dv != b.dims ())
{
(*current_liboctave_error_handler)
("two-arg max expecting args of same size");
return ComplexNDArray ();
}
EMPTY_RETURN_CHECK (ComplexNDArray);
ComplexNDArray result (dv);
for (int i = 0; i < nel; i++)
{
OCTAVE_QUIT;
result (i) = xmax (a (i), b (i));
}
return result;
}
NDS_CMP_OPS(ComplexNDArray, std::real, Complex, std::real)
NDS_BOOL_OPS(ComplexNDArray, Complex, 0.0)
SND_CMP_OPS(Complex, std::real, ComplexNDArray, std::real)
SND_BOOL_OPS(Complex, ComplexNDArray, 0.0)
NDND_CMP_OPS(ComplexNDArray, std::real, ComplexNDArray, std::real)
NDND_BOOL_OPS(ComplexNDArray, ComplexNDArray, 0.0)
/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/
syntax highlighted by Code2HTML, v. 0.9.1