Mercurial > jwe > octave
view libinterp/octave-value/ov-lazy-idx.cc @ 21017:93748bcaec17
maint: Replace emtpy 'std::string ()' calls with "".
* Backend.cc, comment-list.h, debug.cc, defaults.in.h, dynamic-ld.h, error.cc,
graphics.cc, graphics.in.h, help.cc, hook-fcn.h, load-path.cc, load-path.h,
ls-ascii-helper.cc, ls-mat-ascii.cc, ls-mat5.cc, ls-mat5.h, ls-oct-text.cc,
oct-iostrm.h, oct-lvalue.h, oct-stream.cc, oct-stream.h, oct-strstrm.h,
regexp.cc, schur.cc, sqrtm.cc, strfns.cc, symtab.cc, symtab.h, sysdep.cc,
toplev.cc, urlwrite.cc, variables.cc, variables.h, ov-builtin.h, ov-cell.cc,
ov-class.cc, ov-classdef.cc, ov-classdef.h, ov-dld-fcn.h, ov-fcn-handle.cc,
ov-fcn-inline.cc, ov-fcn-inline.h, ov-fcn.h, ov-lazy-idx.cc, ov-mex-fcn.h,
ov-struct.cc, ov-typeinfo.cc, ov-typeinfo.h, ov-usr-fcn.cc, ov-usr-fcn.h, ov.h,
ovl.h, octave.cc, lex.h, parse.h, pt-classdef.h, pt-exp.cc, pt-pr-code.h,
token.h, version.cc, version.in.h, oct-rand.h, dir-ops.h, file-ops.cc,
file-ops.h, file-stat.h, oct-env.cc, oct-group.cc, oct-passwd.cc,
oct-syscalls.cc, cmd-edit.cc, cmd-edit.h, cmd-hist.cc, cmd-hist.h, kpse.cc,
lo-array-gripes.h, pathsearch.cc, pathsearch.h, str-vec.h, url-transfer.h:
Replace emtpy 'std::string ()' calls with "".
author | Rik <rik@octave.org> |
---|---|
date | Wed, 30 Dec 2015 12:33:33 -0800 |
parents | f90c8372b7ba |
children | 5e00ed38a58b |
line wrap: on
line source
/* Copyright (C) 2010-2015 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 #include "ov-lazy-idx.h" #include "ops.h" #include "ov-scalar.h" #include "ls-oct-text.h" #include "ls-oct-binary.h" DEFINE_OV_TYPEID_FUNCTIONS_AND_DATA (octave_lazy_index, "lazy_index", "double"); static octave_base_value * default_numeric_conversion_function (const octave_base_value& a) { CAST_CONV_ARG (const octave_lazy_index&); return v.full_value ().clone (); } octave_base_value::type_conv_info octave_lazy_index::numeric_conversion_function (void) const { return octave_base_value::type_conv_info (default_numeric_conversion_function, octave_matrix::static_type_id ()); } octave_base_value * octave_lazy_index::try_narrowing_conversion (void) { octave_base_value *retval = 0; switch (index.length (0)) { case 1: retval = new octave_scalar (static_cast<double> (index(0) + 1)); break; case 0: retval = new octave_matrix (NDArray (index.orig_dimensions ())); break; default: break; } return retval; } octave_value octave_lazy_index::fast_elem_extract (octave_idx_type n) const { return double (index.checkelem (n) + 1); } octave_value octave_lazy_index::reshape (const dim_vector& new_dims) const { return idx_vector (index.as_array ().reshape (new_dims), index.extent (0)); } octave_value octave_lazy_index::permute (const Array<int>& vec, bool inv) const { // If the conversion has already been made, forward the operation. if (value.is_defined ()) return value.permute (vec, inv); else return idx_vector (index.as_array ().permute (vec, inv), index.extent (0)); } octave_value octave_lazy_index::squeeze (void) const { return idx_vector (index.as_array ().squeeze (), index.extent (0)); } octave_value octave_lazy_index::sort (octave_idx_type dim, sortmode mode) const { const dim_vector odims = index.orig_dimensions (); // index_vector can employ a more efficient sorting algorithm. if (mode == ASCENDING && odims.length () == 2 && (dim >= 0 && dim <= 1) && odims(1-dim) == 1) return index_vector ().sorted (); else return idx_vector (index.as_array ().sort (dim, mode), index.extent (0)); } octave_value octave_lazy_index::sort (Array<octave_idx_type> &sidx, octave_idx_type dim, sortmode mode) const { const dim_vector odims = index.orig_dimensions (); // index_vector can employ a more efficient sorting algorithm. if (mode == ASCENDING && odims.length () == 2 && (dim >= 0 && dim <= 1) && odims(1-dim) == 1) return index_vector ().sorted (sidx); else return idx_vector (index.as_array ().sort (sidx, dim, mode), index.extent (0)); } sortmode octave_lazy_index::is_sorted (sortmode mode) const { if (index.is_range ()) { // Avoid the array conversion. octave_idx_type inc = index.increment (); if (inc == 0) return (mode == UNSORTED ? ASCENDING : mode); else if (inc > 0) return (mode == DESCENDING ? UNSORTED : ASCENDING); else return (mode == ASCENDING ? UNSORTED : DESCENDING); } else return index.as_array ().is_sorted (mode); } Array<octave_idx_type> octave_lazy_index::sort_rows_idx (sortmode mode) const { return index.as_array ().sort_rows_idx (mode); } sortmode octave_lazy_index::is_sorted_rows (sortmode mode) const { return index.as_array ().is_sorted_rows (mode); } static const std::string value_save_tag ("index_value"); bool octave_lazy_index::save_ascii (std::ostream& os) { return save_text_data (os, make_value (), value_save_tag, false, 0); } bool octave_lazy_index::load_ascii (std::istream& is) { bool dummy; std::string nm = read_text_data (is, "", dummy, value, 0); if (nm != value_save_tag) error ("lazy_index: corrupted data on load"); else index = value.index_vector (); return true; } bool octave_lazy_index::save_binary (std::ostream& os, bool& save_as_floats) { return save_binary_data (os, make_value (), value_save_tag, "", false, save_as_floats); } bool octave_lazy_index::load_binary (std::istream& is, bool swap, oct_mach_info::float_format fmt) { bool dummy; std::string doc; std::string nm = read_binary_data (is, swap, fmt, "", dummy, value, doc); if (nm != value_save_tag) error ("lazy_index: corrupted data on load"); else index = value.index_vector (); return true; }