Mercurial > hg > octave-max
view liboctave/intNDArray.cc @ 14327:4d917a6a858b stable
doc: Use Octave coding conventions in @example blocks of docstrings.
* accumarray.m, accumdim.m, bar.m, base2dec.m, bincoeff.m, bitcmp.m, bitset.m,
celldisp.m, chop.m, clabel.m, cloglog.m, colon.m, compass.m, computer.m,
contour3.m, contourc.m, corr.m, cstrcat.m, ctime.m, cylinder.m, date.m,
dec2base.m, demo.m, dir.m, dlmwrite.m, expm.m, ezcontourf.m, ezcontour.m,
ezmeshc.m, ezmesh.m, ezplot.m, ezsurfc.m, ezsurf.m, feather.m, findobj.m,
flipdim.m, fplot.m, genvarname.m, getfield.m, hankel.m, hilb.m, hist.m,
idivide.m, index.m, int2str.m, interp1.m, is_leap_year.m, ismember.m,
isocolors.m, isonormals.m, isosurface.m, kurtosis.m, legendre.m, linkprop.m,
logit.m, logm.m, __makeinfo__.m, __marching_cube__.m, median.m, mkoctfile.m,
moment.m, mpoles.m, orderfields.m, pcg.m, pcr.m, plot3.m, plotmatrix.m,
polyaffine.m, polygcd.m, poly.m, polyout.m, print.m, qp.m, quadgk.m, qzhess.m,
randi.m, rat.m, refreshdata.m, residue.m, rose.m, rot90.m, saveas.m, saveobj.m,
shiftdim.m, skewness.m, spaugment.m, spdiags.m, sqp.m, stem.m, str2num.m,
strcat.m, strjust.m, strread.m, strsplit.m, structfun.m, subplot.m,
subsindex.m, substruct.m, surfl.m, surfnorm.m, svds.m, uimenu.m, union.m,
voronoi.m, warning_ids.m, wblpdf.m: Use Octave coding conventions in
@example blocks of docstrings.
author | Rik <octave@nomad.inbox5.com> |
---|---|
date | Sat, 04 Feb 2012 22:12:50 -0800 |
parents | 72c96de7a403 |
children | e8e86ae3abbc |
line wrap: on
line source
// N-D Array manipulations. /* Copyright (C) 2004-2012 John W. Eaton Copyright (C) 2009 VZLU Prague, a.s. 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/>. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif #include "Array-util.h" #include "mx-base.h" #include "lo-ieee.h" #include "mx-inlines.cc" // unary operations template <class T> boolNDArray intNDArray<T>::operator ! (void) const { boolNDArray b (this->dims ()); for (octave_idx_type i = 0; i < this->length (); i++) b.elem (i) = ! this->elem (i); return b; } template <class T> bool intNDArray<T>::any_element_not_one_or_zero (void) const { octave_idx_type nel = this->nelem (); for (octave_idx_type i = 0; i < nel; i++) { T val = this->elem (i); if (val != 0.0 && val != 1.0) return true; } return false; } template <class T> intNDArray<T> intNDArray<T>::diag (octave_idx_type k) const { return MArray<T>::diag (k); } // FIXME -- this is not quite the right thing. template <class T> boolNDArray intNDArray<T>::all (int dim) const { return do_mx_red_op<bool, T > (*this, dim, mx_inline_all); } template <class T> boolNDArray intNDArray<T>::any (int dim) const { return do_mx_red_op<bool, T > (*this, dim, mx_inline_any); } template <class T> void intNDArray<T>::increment_index (Array<octave_idx_type>& ra_idx, const dim_vector& dimensions, int start_dimension) { ::increment_index (ra_idx, dimensions, start_dimension); } template <class T> octave_idx_type intNDArray<T>::compute_index (Array<octave_idx_type>& ra_idx, const dim_vector& dimensions) { return ::compute_index (ra_idx, dimensions); } template <class T> intNDArray<T> intNDArray<T>::concat (const intNDArray<T>& rb, const Array<octave_idx_type>& ra_idx) { if (rb.numel () > 0) insert (rb, ra_idx); return *this; } template <class T> intNDArray<T>& intNDArray<T>::insert (const intNDArray<T>& a, octave_idx_type r, octave_idx_type c) { Array<T>::insert (a, r, c); return *this; } template <class T> intNDArray<T>& intNDArray<T>::insert (const intNDArray<T>& a, const Array<octave_idx_type>& ra_idx) { Array<T>::insert (a, ra_idx); return *this; } // This contains no information on the array structure !!! template <class T> std::ostream& operator << (std::ostream& os, const intNDArray<T>& a) { octave_idx_type nel = a.nelem (); for (octave_idx_type i = 0; i < nel; i++) os << " " << a.elem (i) << "\n"; return os; } template <class T> std::istream& operator >> (std::istream& is, intNDArray<T>& a) { octave_idx_type nel = a.nelem (); if (nel > 0) { T tmp; for (octave_idx_type i = 0; i < nel; i++) { is >> tmp; if (is) a.elem (i) = tmp; else goto done; } } done: return is; } // FIXME -- should abs and signum just be mapper functions? template <class T> intNDArray<T> intNDArray<T>::abs (void) const { octave_idx_type nel = this->nelem (); intNDArray<T> ret (this->dims ()); for (octave_idx_type i = 0; i < nel; i++) { T val = this->elem (i); ret.xelem (i) = val.abs (); } return ret; } template <class T> intNDArray<T> intNDArray<T>::signum (void) const { octave_idx_type nel = this->nelem (); intNDArray<T> ret (this->dims ()); for (octave_idx_type i = 0; i < nel; i++) { T val = this->elem (i); ret.xelem (i) = val.signum (); } return ret; } template <class T> intNDArray<T> intNDArray<T>::sum (int dim) const { return do_mx_red_op<T, T> (*this, dim, mx_inline_sum); } template <class T> NDArray intNDArray<T>::dsum (int dim) const { return do_mx_red_op<double, T> (*this, dim, mx_inline_dsum); } template <class T> intNDArray<T> intNDArray<T>::cumsum (int dim) const { return do_mx_cum_op<T, T> (*this, dim, mx_inline_cumsum); } template <class T> intNDArray<T> intNDArray<T>::max (int dim) const { return do_mx_minmax_op<T> (*this, dim, mx_inline_max); } template <class T> intNDArray<T> intNDArray<T>::max (Array<octave_idx_type>& idx_arg, int dim) const { return do_mx_minmax_op<T> (*this, idx_arg, dim, mx_inline_max); } template <class T> intNDArray<T> intNDArray<T>::min (int dim) const { return do_mx_minmax_op<T> (*this, dim, mx_inline_min); } template <class T> intNDArray<T> intNDArray<T>::min (Array<octave_idx_type>& idx_arg, int dim) const { return do_mx_minmax_op<T> (*this, idx_arg, dim, mx_inline_min); } template <class T> intNDArray<T> intNDArray<T>::cummax (int dim) const { return do_mx_cumminmax_op<T> (*this, dim, mx_inline_cummax); } template <class T> intNDArray<T> intNDArray<T>::cummax (Array<octave_idx_type>& idx_arg, int dim) const { return do_mx_cumminmax_op<T> (*this, idx_arg, dim, mx_inline_cummax); } template <class T> intNDArray<T> intNDArray<T>::cummin (int dim) const { return do_mx_cumminmax_op<T> (*this, dim, mx_inline_cummin); } template <class T> intNDArray<T> intNDArray<T>::cummin (Array<octave_idx_type>& idx_arg, int dim) const { return do_mx_cumminmax_op<T> (*this, idx_arg, dim, mx_inline_cummin); } template <class T> intNDArray<T> intNDArray<T>::diff (octave_idx_type order, int dim) const { return do_mx_diff_op<T> (*this, dim, order, mx_inline_diff); }