Mercurial > hg > octave-lyh
view liboctave/intNDArray.cc @ 8920:eb63fbe60fab
update copyright notices
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Sat, 07 Mar 2009 10:41:27 -0500 |
parents | ea76466605ba |
children | dc07bc4157b8 |
line wrap: on
line source
// N-D Array manipulations. /* Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 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/>. */ #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 MArrayN<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<boolNDArray> (*this, dim, mx_inline_all); } template <class T> boolNDArray intNDArray<T>::any (int dim) const { return do_mx_red_op<boolNDArray> (*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 < 1 ) is.clear (std::ios::badbit); else { 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); 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); 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<intNDArray<T> > (*this, dim, mx_inline_sum); } template <class T> intNDArray<T> intNDArray<T>::cumsum (int dim) const { return do_mx_cum_op<intNDArray<T> > (*this, dim, mx_inline_cumsum); } template <class T> intNDArray<T> intNDArray<T>::max (int dim) const { return do_mx_minmax_op<intNDArray<T> > (*this, dim, mx_inline_max); } template <class T> intNDArray<T> intNDArray<T>::max (ArrayN<octave_idx_type>& idx_arg, int dim) const { return do_mx_minmax_op<intNDArray<T> > (*this, idx_arg, dim, mx_inline_max); } template <class T> intNDArray<T> intNDArray<T>::min (int dim) const { return do_mx_minmax_op<intNDArray<T> > (*this, dim, mx_inline_min); } template <class T> intNDArray<T> intNDArray<T>::min (ArrayN<octave_idx_type>& idx_arg, int dim) const { return do_mx_minmax_op<intNDArray<T> > (*this, idx_arg, dim, mx_inline_min); } template <class T> intNDArray<T> intNDArray<T>::cummax (int dim) const { return do_mx_cumminmax_op<intNDArray<T> > (*this, dim, mx_inline_cummax); } template <class T> intNDArray<T> intNDArray<T>::cummax (ArrayN<octave_idx_type>& idx_arg, int dim) const { return do_mx_cumminmax_op<intNDArray<T> > (*this, idx_arg, dim, mx_inline_cummax); } template <class T> intNDArray<T> intNDArray<T>::cummin (int dim) const { return do_mx_cumminmax_op<intNDArray<T> > (*this, dim, mx_inline_cummin); } template <class T> intNDArray<T> intNDArray<T>::cummin (ArrayN<octave_idx_type>& idx_arg, int dim) const { return do_mx_cumminmax_op<intNDArray<T> > (*this, idx_arg, dim, mx_inline_cummin); } /* ;;; Local Variables: *** ;;; mode: C++ *** ;;; End: *** */