Mercurial > hg > octave-nkf
view liboctave/array/Array-C.cc @ 19257:d20c81d3cd21
Deprecate syl, add new function sylvester.
* sylvester.cc: New function
* syl.cc: Remove syl C++ function.
* scriptss/deprecated/syl.m: m-file to replace syl.cc
* NEWS: Announce new sylvester function. Announce deprecation of syl.
* linalg.txi: Replace reference to syl with sylvester.
* libinterp/corefcn/module.mk: Add sylvester.cc to build system.
* scripts/deprecated/module.mk: Add syl.m to build system.
* CMatrix.cc (Sylvester), dMatrix.cc (Sylvester), fCMatrix.cc (Sylvester),
fMatrix.cc (Sylvester): Return +C rather than -C to conform to changed
definition of Sylvester equation.
author | Rik <rik@octave.org> |
---|---|
date | Sun, 31 Aug 2014 21:05:38 -0700 |
parents | 49a5a4be04a1 |
children | fb09907f4e49 |
line wrap: on
line source
/* Copyright (C) 1994-2013 John W. Eaton Copyright (C) 2009 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/>. */ #ifdef HAVE_CONFIG_H #include <config.h> #endif // Instantiate Arrays of Complex values. #include "oct-cmplx.h" #include "lo-mappers.h" #include "Array.h" #include "Array.cc" #include "oct-sort.cc" template <> inline bool sort_isnan<Complex> (const Complex& x) { return xisnan (x); } static bool nan_ascending_compare (const Complex& x, const Complex& y) { return (xisnan (y) ? ! xisnan (x) : ((std::abs (x) < std::abs (x)) || ((std::abs (x) == std::abs (x)) && (arg (x) < arg (x))))); } static bool nan_descending_compare (const Complex& x, const Complex& y) { return (xisnan (x) ? ! xisnan (y) : ((std::abs (x) > std::abs (x)) || ((std::abs (x) == std::abs (x)) && (arg (x) > arg (x))))); } Array<Complex>::compare_fcn_type safe_comparator (sortmode mode, const Array<Complex>& a , bool allow_chk) { Array<Complex>::compare_fcn_type result = 0; if (allow_chk) { octave_idx_type k = 0; for (; k < a.numel () && ! xisnan (a(k)); k++) ; if (k == a.numel ()) { if (mode == ASCENDING) result = octave_sort<Complex>::ascending_compare; else if (mode == DESCENDING) result = octave_sort<Complex>::descending_compare; } } if (! result) { if (mode == ASCENDING) result = nan_ascending_compare; else if (mode == DESCENDING) result = nan_descending_compare; } return result; } INSTANTIATE_ARRAY_SORT (Complex); INSTANTIATE_ARRAY (Complex, OCTAVE_API); template OCTAVE_API std::ostream& operator << (std::ostream&, const Array<Complex>&); #include "DiagArray2.h" #include "DiagArray2.cc" template class OCTAVE_API DiagArray2<Complex>;