Mercurial > octave
view libinterp/corefcn/oct-map.cc @ 19593:446c46af4b42 stable
strip trailing whitespace from most source files
* Makefile.am, NEWS, build-aux/common.mk, configure.ac,
doc/Makefile.am, doc/doxyhtml/Makefile.am,
doc/interpreter/Makefile.am, doc/interpreter/arith.txi,
doc/interpreter/audio.txi, doc/interpreter/basics.txi,
doc/interpreter/bugs.txi, doc/interpreter/container.txi,
doc/interpreter/cp-idx.txi, doc/interpreter/data.txi,
doc/interpreter/debug.txi, doc/interpreter/diagperm.txi,
doc/interpreter/diffeq.txi, doc/interpreter/doccheck/README,
doc/interpreter/doccheck/spellcheck, doc/interpreter/emacs.txi,
doc/interpreter/errors.txi, doc/interpreter/eval.txi,
doc/interpreter/expr.txi, doc/interpreter/external.txi,
doc/interpreter/fn-idx.txi, doc/interpreter/func.txi,
doc/interpreter/geometry.txi, doc/interpreter/geometryimages.m,
doc/interpreter/gpl.txi, doc/interpreter/grammar.txi,
doc/interpreter/gui.txi, doc/interpreter/image.txi,
doc/interpreter/install.txi, doc/interpreter/interp.txi,
doc/interpreter/interpimages.m, doc/interpreter/intro.txi,
doc/interpreter/io.txi, doc/interpreter/java.txi,
doc/interpreter/linalg.txi, doc/interpreter/macros.texi,
doc/interpreter/matrix.txi, doc/interpreter/munge-texi.pl,
doc/interpreter/nonlin.txi, doc/interpreter/numbers.txi,
doc/interpreter/obsolete.txi, doc/interpreter/octave-config.1,
doc/interpreter/octave.texi, doc/interpreter/oop.txi,
doc/interpreter/op-idx.txi, doc/interpreter/optim.txi,
doc/interpreter/package.txi, doc/interpreter/plot.txi,
doc/interpreter/poly.txi, doc/interpreter/preface.txi,
doc/interpreter/quad.txi, doc/interpreter/set.txi,
doc/interpreter/signal.txi, doc/interpreter/sparse.txi,
doc/interpreter/sparseimages.m, doc/interpreter/splineimages.m,
doc/interpreter/stats.txi, doc/interpreter/stmt.txi,
doc/interpreter/strings.txi, doc/interpreter/system.txi,
doc/interpreter/testfun.txi, doc/interpreter/tips.txi,
doc/interpreter/var.txi, doc/interpreter/vectorize.txi,
doc/liboctave/Makefile.am, doc/liboctave/array.texi,
doc/liboctave/bugs.texi, doc/liboctave/cp-idx.texi,
doc/liboctave/dae.texi, doc/liboctave/diffeq.texi,
doc/liboctave/error.texi, doc/liboctave/factor.texi,
doc/liboctave/fn-idx.texi, doc/liboctave/gpl.texi,
doc/liboctave/install.texi, doc/liboctave/intro.texi,
doc/liboctave/liboctave.texi, doc/liboctave/matvec.texi,
doc/liboctave/nleqn.texi, doc/liboctave/nlfunc.texi,
doc/liboctave/ode.texi, doc/liboctave/optim.texi,
doc/liboctave/preface.texi, doc/liboctave/quad.texi,
doc/liboctave/range.texi, doc/refcard/Makefile.am,
doc/refcard/refcard.tex, etc/HACKING, etc/NEWS.1, etc/NEWS.2,
etc/NEWS.3, etc/OLD-ChangeLogs/ChangeLog,
etc/OLD-ChangeLogs/doc-ChangeLog,
etc/OLD-ChangeLogs/scripts-ChangeLog,
etc/OLD-ChangeLogs/src-ChangeLog, etc/OLD-ChangeLogs/test-ChangeLog,
etc/PROJECTS, etc/README.Cygwin, etc/README.MacOS, etc/README.MinGW,
etc/README.gnuplot, etc/gdbinit, etc/icons/Makefile.am,
examples/@polynomial/end.m, examples/@polynomial/subsasgn.m,
examples/Makefile.am, examples/standalonebuiltin.cc,
libgui/Makefile.am, libgui/qterminal/libqterminal/README,
libgui/qterminal/libqterminal/unix/BlockArray.cpp,
libgui/qterminal/libqterminal/unix/BlockArray.h,
libgui/qterminal/libqterminal/unix/Character.h,
libgui/qterminal/libqterminal/unix/CharacterColor.h,
libgui/qterminal/libqterminal/unix/Emulation.cpp,
libgui/qterminal/libqterminal/unix/Emulation.h,
libgui/qterminal/libqterminal/unix/Filter.cpp,
libgui/qterminal/libqterminal/unix/Filter.h,
libgui/qterminal/libqterminal/unix/History.cpp,
libgui/qterminal/libqterminal/unix/History.h,
libgui/qterminal/libqterminal/unix/KeyboardTranslator.cpp,
libgui/qterminal/libqterminal/unix/KeyboardTranslator.h,
libgui/qterminal/libqterminal/unix/LineFont.h,
libgui/qterminal/libqterminal/unix/QUnixTerminalImpl.cpp,
libgui/qterminal/libqterminal/unix/QUnixTerminalImpl.h,
libgui/qterminal/libqterminal/unix/Screen.cpp,
libgui/qterminal/libqterminal/unix/Screen.h,
libgui/qterminal/libqterminal/unix/ScreenWindow.cpp,
libgui/qterminal/libqterminal/unix/ScreenWindow.h,
libgui/qterminal/libqterminal/unix/TerminalCharacterDecoder.cpp,
libgui/qterminal/libqterminal/unix/TerminalCharacterDecoder.h,
libgui/qterminal/libqterminal/unix/Vt102Emulation.h,
libgui/qterminal/libqterminal/win32/QWinTerminalImpl.cpp,
libgui/qterminal/qterminal/main.cpp,
libgui/src/m-editor/file-editor-tab.cc, libgui/src/octave-gui.cc,
libgui/src/octave-qt-link.cc, libinterp/corefcn/data.cc,
libinterp/corefcn/defun-int.h, libinterp/corefcn/det.cc,
libinterp/corefcn/gl2ps-renderer.cc, libinterp/corefcn/graphics.cc,
libinterp/corefcn/graphics.in.h, libinterp/corefcn/ls-mat5.cc,
libinterp/corefcn/lu.cc, libinterp/corefcn/oct-tex-parser.yy,
libinterp/corefcn/oct-tex-symbols.in, libinterp/corefcn/quadcc.cc,
libinterp/corefcn/zfstream.cc, libinterp/dldfcn/__eigs__.cc,
libinterp/dldfcn/__voronoi__.cc, libinterp/gendoc.pl,
libinterp/genprops.awk, libinterp/mk-errno-list, libinterp/mk-pkg-add,
libinterp/mkbuiltins, libinterp/mkdefs, libinterp/mkdocs,
libinterp/mkops, libinterp/octave-value/ov-java.cc,
libinterp/parse-tree/lex.ll, libinterp/parse-tree/oct-parse.in.yy,
libinterp/parse-tree/octave.gperf, liboctave/Makefile.am,
liboctave/array/Array.cc, liboctave/array/module.mk,
liboctave/cruft/daspk/datv.f, liboctave/cruft/daspk/dcnst0.f,
liboctave/cruft/daspk/dcnstr.f, liboctave/cruft/daspk/ddasic.f,
liboctave/cruft/daspk/ddasid.f, liboctave/cruft/daspk/ddasik.f,
liboctave/cruft/daspk/ddaspk.f, liboctave/cruft/daspk/ddstp.f,
liboctave/cruft/daspk/ddwnrm.f, liboctave/cruft/daspk/dfnrmd.f,
liboctave/cruft/daspk/dfnrmk.f, liboctave/cruft/daspk/dhels.f,
liboctave/cruft/daspk/dheqr.f, liboctave/cruft/daspk/dinvwt.f,
liboctave/cruft/daspk/dlinsd.f, liboctave/cruft/daspk/dlinsk.f,
liboctave/cruft/daspk/dmatd.f, liboctave/cruft/daspk/dnedd.f,
liboctave/cruft/daspk/dnedk.f, liboctave/cruft/daspk/dnsd.f,
liboctave/cruft/daspk/dnsid.f, liboctave/cruft/daspk/dnsik.f,
liboctave/cruft/daspk/dnsk.f, liboctave/cruft/daspk/dorth.f,
liboctave/cruft/daspk/dslvd.f, liboctave/cruft/daspk/dslvk.f,
liboctave/cruft/daspk/dspigm.f, liboctave/cruft/daspk/dyypnw.f,
liboctave/cruft/dasrt/ddasrt.f, liboctave/cruft/dasrt/drchek.f,
liboctave/cruft/dassl/ddaslv.f, liboctave/cruft/dassl/ddassl.f,
liboctave/cruft/misc/blaswrap.c, liboctave/cruft/misc/module.mk,
liboctave/cruft/odepack/cfode.f, liboctave/cruft/odepack/dlsode.f,
liboctave/cruft/odepack/ewset.f, liboctave/cruft/odepack/intdy.f,
liboctave/cruft/odepack/prepj.f, liboctave/cruft/odepack/sintdy.f,
liboctave/cruft/odepack/slsode.f, liboctave/cruft/odepack/solsy.f,
liboctave/cruft/odepack/ssolsy.f, liboctave/cruft/odepack/stode.f,
liboctave/cruft/odepack/vnorm.f, liboctave/cruft/ranlib/Basegen.doc,
liboctave/cruft/ranlib/README, liboctave/cruft/ranlib/genbet.f,
liboctave/cruft/ranlib/genexp.f, liboctave/cruft/ranlib/gennch.f,
liboctave/cruft/ranlib/gennf.f, liboctave/cruft/ranlib/gennor.f,
liboctave/cruft/ranlib/getsd.f, liboctave/cruft/ranlib/initgn.f,
liboctave/cruft/ranlib/phrtsd.f, liboctave/cruft/ranlib/randlib.fdoc,
liboctave/cruft/ranlib/setsd.f, liboctave/cruft/ranlib/tstgmn.for,
liboctave/cruft/ranlib/tstmid.for, liboctave/cruft/slatec-fn/atanh.f,
liboctave/cruft/slatec-fn/datanh.f,
liboctave/cruft/slatec-fn/xgmainc.f,
liboctave/cruft/slatec-fn/xsgmainc.f, liboctave/numeric/module.mk,
liboctave/operators/mk-ops.awk, liboctave/operators/mx-ops,
liboctave/operators/sparse-mk-ops.awk,
liboctave/operators/sparse-mx-ops, liboctave/operators/vx-ops,
liboctave/util/module.mk, run-octave.in, scripts/@ftp/ftp.m,
scripts/audio/wavread.m, scripts/deprecated/java_convert_matrix.m,
scripts/deprecated/java_debug.m, scripts/deprecated/java_invoke.m,
scripts/deprecated/java_new.m,
scripts/deprecated/java_unsigned_conversion.m,
scripts/deprecated/javafields.m, scripts/deprecated/javamethods.m,
scripts/deprecated/shell_cmd.m, scripts/general/accumarray.m,
scripts/general/display.m, scripts/general/fieldnames.m,
scripts/general/interp1.m, scripts/general/interp2.m,
scripts/general/interp3.m, scripts/general/isa.m,
scripts/general/methods.m, scripts/general/sortrows.m,
scripts/geometry/convhull.m, scripts/geometry/delaunay.m,
scripts/geometry/delaunay3.m, scripts/geometry/delaunayn.m,
scripts/geometry/griddata.m, scripts/geometry/griddatan.m,
scripts/geometry/voronoi.m, scripts/geometry/voronoin.m,
scripts/gui/guihandles.m, scripts/gui/inputdlg.m,
scripts/gui/listdlg.m, scripts/gui/msgbox.m, scripts/gui/questdlg.m,
scripts/gui/uigetfile.m, scripts/gui/waitbar.m, scripts/gui/warndlg.m,
scripts/help/doc.m, scripts/help/help.m, scripts/help/type.m,
scripts/image/bone.m, scripts/image/cmpermute.m,
scripts/image/cmunique.m, scripts/image/colorcube.m,
scripts/image/colormap.m, scripts/image/contrast.m,
scripts/image/gray2ind.m, scripts/image/image.m,
scripts/image/imshow.m, scripts/image/ind2gray.m, scripts/image/jet.m,
scripts/image/rgb2ntsc.m, scripts/image/spinmap.m,
scripts/io/importdata.m, scripts/io/strread.m, scripts/io/textread.m,
scripts/io/textscan.m, scripts/java/java_get.m,
scripts/java/java_set.m, scripts/java/javaaddpath.m,
scripts/java/javaclasspath.m, scripts/java/javamem.m,
scripts/linear-algebra/linsolve.m, scripts/linear-algebra/qzhess.m,
scripts/miscellaneous/debug.m, scripts/miscellaneous/desktop.m,
scripts/miscellaneous/dir.m, scripts/miscellaneous/dos.m,
scripts/miscellaneous/edit.m, scripts/miscellaneous/fact.m,
scripts/miscellaneous/getappdata.m, scripts/miscellaneous/inputname.m,
scripts/miscellaneous/license.m, scripts/miscellaneous/ls_command.m,
scripts/miscellaneous/run.m, scripts/miscellaneous/setfield.m,
scripts/miscellaneous/unix.m, scripts/miscellaneous/ver.m,
scripts/mk-pkg-add, scripts/mkdoc.pl,
scripts/optimization/fminsearch.m, scripts/optimization/optimset.m,
scripts/optimization/sqp.m, scripts/pkg/pkg.m,
scripts/pkg/private/create_pkgadddel.m,
scripts/pkg/private/fix_depends.m, scripts/pkg/private/install.m,
scripts/plot/appearance/axis.m, scripts/plot/appearance/box.m,
scripts/plot/appearance/clabel.m, scripts/plot/appearance/daspect.m,
scripts/plot/appearance/datetick.m, scripts/plot/appearance/grid.m,
scripts/plot/appearance/legend.m, scripts/plot/appearance/orient.m,
scripts/plot/appearance/shading.m, scripts/plot/appearance/text.m,
scripts/plot/appearance/title.m, scripts/plot/appearance/xlabel.m,
scripts/plot/appearance/ylabel.m, scripts/plot/appearance/zlabel.m,
scripts/plot/draw/area.m, scripts/plot/draw/bar.m,
scripts/plot/draw/barh.m, scripts/plot/draw/colorbar.m,
scripts/plot/draw/contour.m, scripts/plot/draw/contour3.m,
scripts/plot/draw/contourf.m, scripts/plot/draw/ellipsoid.m,
scripts/plot/draw/errorbar.m, scripts/plot/draw/ezcontour.m,
scripts/plot/draw/ezcontourf.m, scripts/plot/draw/ezmesh.m,
scripts/plot/draw/ezpolar.m, scripts/plot/draw/fill.m,
scripts/plot/draw/fplot.m, scripts/plot/draw/hist.m,
scripts/plot/draw/meshc.m, scripts/plot/draw/meshz.m,
scripts/plot/draw/pareto.m, scripts/plot/draw/patch.m,
scripts/plot/draw/peaks.m, scripts/plot/draw/pie.m,
scripts/plot/draw/pie3.m, scripts/plot/draw/plot.m,
scripts/plot/draw/plotyy.m, scripts/plot/draw/private/__bar__.m,
scripts/plot/draw/private/__contour__.m,
scripts/plot/draw/private/__errplot__.m,
scripts/plot/draw/private/__ezplot__.m,
scripts/plot/draw/private/__patch__.m,
scripts/plot/draw/private/__stem__.m, scripts/plot/draw/rectangle.m,
scripts/plot/draw/ribbon.m, scripts/plot/draw/rose.m,
scripts/plot/draw/scatter.m, scripts/plot/draw/scatter3.m,
scripts/plot/draw/semilogx.m, scripts/plot/draw/shrinkfaces.m,
scripts/plot/draw/sombrero.m, scripts/plot/draw/sphere.m,
scripts/plot/draw/stairs.m, scripts/plot/draw/stem.m,
scripts/plot/draw/stemleaf.m, scripts/plot/draw/surf.m,
scripts/plot/draw/surface.m, scripts/plot/draw/surfc.m,
scripts/plot/draw/surfl.m, scripts/plot/draw/surfnorm.m,
scripts/plot/draw/tetramesh.m, scripts/plot/draw/trimesh.m,
scripts/plot/draw/triplot.m, scripts/plot/draw/trisurf.m,
scripts/plot/util/__gnuplot_drawnow__.m,
scripts/plot/util/__plt_get_axis_arg__.m, scripts/plot/util/axes.m,
scripts/plot/util/clf.m, scripts/plot/util/copyobj.m,
scripts/plot/util/figure.m, scripts/plot/util/gcbo.m,
scripts/plot/util/graphics_toolkit.m, scripts/plot/util/hggroup.m,
scripts/plot/util/meshgrid.m, scripts/plot/util/newplot.m,
scripts/plot/util/print.m,
scripts/plot/util/private/__add_default_menu__.m,
scripts/plot/util/private/__fltk_print__.m,
scripts/plot/util/private/__gnuplot_print__.m,
scripts/plot/util/private/__print_parse_opts__.m,
scripts/plot/util/refreshdata.m, scripts/plot/util/subplot.m,
scripts/polynomial/conv.m, scripts/polynomial/poly.m,
scripts/polynomial/polyeig.m, scripts/polynomial/polyfit.m,
scripts/polynomial/polyval.m,
scripts/polynomial/private/__splinefit__.m,
scripts/polynomial/spline.m, scripts/prefs/prefdir.m,
scripts/prefs/preferences.m, scripts/prefs/private/prefsfile.m,
scripts/prefs/rmpref.m, scripts/signal/freqz.m,
scripts/signal/module.mk, scripts/sparse/eigs.m, scripts/sparse/pcg.m,
scripts/sparse/private/__sprand_impl__.m, scripts/sparse/sprand.m,
scripts/sparse/sprandn.m, scripts/sparse/spy.m, scripts/sparse/svds.m,
scripts/specfun/expint.m, scripts/specfun/factor.m,
scripts/special-matrix/gallery.m, scripts/special-matrix/hankel.m,
scripts/special-matrix/toeplitz.m, scripts/startup/inputrc,
scripts/statistics/base/kurtosis.m, scripts/statistics/base/moment.m,
scripts/statistics/base/qqplot.m, scripts/statistics/base/var.m,
scripts/statistics/distributions/betarnd.m,
scripts/statistics/distributions/binoinv.m,
scripts/statistics/distributions/binopdf.m,
scripts/statistics/distributions/binornd.m,
scripts/statistics/distributions/cauchy_rnd.m,
scripts/statistics/distributions/chi2rnd.m,
scripts/statistics/distributions/discrete_pdf.m,
scripts/statistics/distributions/discrete_rnd.m,
scripts/statistics/distributions/empirical_rnd.m,
scripts/statistics/distributions/exprnd.m,
scripts/statistics/distributions/frnd.m,
scripts/statistics/distributions/gamrnd.m,
scripts/statistics/distributions/geornd.m,
scripts/statistics/distributions/hygernd.m,
scripts/statistics/distributions/kolmogorov_smirnov_cdf.m,
scripts/statistics/distributions/laplace_cdf.m,
scripts/statistics/distributions/laplace_pdf.m,
scripts/statistics/distributions/logistic_cdf.m,
scripts/statistics/distributions/logistic_pdf.m,
scripts/statistics/distributions/lognrnd.m,
scripts/statistics/distributions/nbincdf.m,
scripts/statistics/distributions/nbininv.m,
scripts/statistics/distributions/nbinpdf.m,
scripts/statistics/distributions/nbinrnd.m,
scripts/statistics/distributions/normrnd.m,
scripts/statistics/distributions/poissinv.m,
scripts/statistics/distributions/poissrnd.m,
scripts/statistics/distributions/tinv.m,
scripts/statistics/distributions/trnd.m,
scripts/statistics/distributions/unidcdf.m,
scripts/statistics/distributions/unidpdf.m,
scripts/statistics/distributions/unidrnd.m,
scripts/statistics/distributions/unifrnd.m,
scripts/statistics/distributions/wblrnd.m,
scripts/statistics/models/module.mk,
scripts/statistics/tests/kruskal_wallis_test.m,
scripts/strings/base2dec.m, scripts/strings/deblank.m,
scripts/strings/dec2base.m, scripts/strings/dec2bin.m,
scripts/strings/dec2hex.m, scripts/strings/mat2str.m,
scripts/strings/ostrsplit.m, scripts/strings/regexptranslate.m,
scripts/strings/str2num.m, scripts/strings/strcat.m,
scripts/strings/strjoin.m, scripts/strings/strsplit.m,
scripts/strings/strtok.m, scripts/strings/strtrim.m,
scripts/strings/strtrunc.m, scripts/strings/substr.m,
scripts/testfun/__run_test_suite__.m, scripts/testfun/speed.m,
scripts/testfun/test.m, scripts/time/asctime.m,
scripts/time/datenum.m, scripts/time/datevec.m,
scripts/time/weekday.m, src/Makefile.am, test/Makefile.am,
test/build-bc-overload-tests.sh, test/build-sparse-tests.sh,
test/jit.tst, test/line-continue.tst: Strip trailing whitespace.
author | John W. Eaton <jwe@octave.org> |
---|---|
date | Tue, 20 Jan 2015 08:26:57 -0500 |
parents | 175b392e91fe |
children | 6a71e5030df5 |
line wrap: on
line source
/* Copyright (C) 1995-2013 John W. Eaton Copyright (C) 2010 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 "error.h" #include "str-vec.h" #include "oct-map.h" #include "utils.h" octave_fields::octave_fields (const string_vector& fields) : rep (new fields_rep) { octave_idx_type n = fields.numel (); for (octave_idx_type i = 0; i < n; i++) (*rep)[fields(i)] = i; } octave_fields::octave_fields (const char * const *fields) : rep (new fields_rep) { octave_idx_type n = 0; while (*fields) (*rep)[std::string (*fields++)] = n++; } bool octave_fields::isfield (const std::string& field) const { return rep->find (field) != rep->end (); } octave_idx_type octave_fields::getfield (const std::string& field) const { fields_rep::iterator p = rep->find (field); return (p != rep->end ()) ? p->second : -1; } octave_idx_type octave_fields::getfield (const std::string& field) { fields_rep::iterator p = rep->find (field); if (p != rep->end ()) return p->second; else { make_unique (); octave_idx_type n = rep->size (); return (*rep)[field] = n; } } octave_idx_type octave_fields::rmfield (const std::string& field) { fields_rep::iterator p = rep->find (field); if (p == rep->end ()) return -1; else { octave_idx_type n = p->second; make_unique (); rep->erase (field); for (fields_rep::iterator q = rep->begin (); q != rep->end (); q++) { if (q->second >= n) q->second--; } return n; } } void octave_fields::orderfields (Array<octave_idx_type>& perm) { octave_idx_type n = rep->size (); perm.clear (n, 1); make_unique (); octave_idx_type i = 0; for (fields_rep::iterator q = rep->begin (); q != rep->end (); q++) { octave_idx_type j = q->second; q->second = i; perm(i++) = j; } } bool octave_fields::equal_up_to_order (const octave_fields& other, octave_idx_type* perm) const { bool retval = true; iterator p = begin (), q = other.begin (); for (; p != end () && q != other.end (); p++, q++) { if (p->first == q->first) perm[p->second] = q->second; else { retval = false; break; } } retval = (p == end () && q == other.end ()); return retval; } bool octave_fields::equal_up_to_order (const octave_fields& other, Array<octave_idx_type>& perm) const { octave_idx_type n = nfields (); if (perm.length () != n) perm.clear (1, n); return equal_up_to_order (other, perm.fortran_vec ()); } string_vector octave_fields::fieldnames (void) const { octave_idx_type n = nfields (); string_vector retval(n); for (iterator p = begin (); p != end (); p++) retval.xelem (p->second) = p->first; return retval; } octave_value octave_scalar_map::getfield (const std::string& k) const { octave_idx_type idx = xkeys.getfield (k); return (idx >= 0) ? xvals[idx] : octave_value (); } void octave_scalar_map::setfield (const std::string& k, const octave_value& val) { octave_idx_type idx = xkeys.getfield (k); if (idx < static_cast<octave_idx_type> (xvals.size ())) xvals[idx] = val; else xvals.push_back (val); } void octave_scalar_map::rmfield (const std::string& k) { octave_idx_type idx = xkeys.rmfield (k); if (idx >= 0) xvals.erase (xvals.begin () + idx); } octave_scalar_map octave_scalar_map::orderfields (void) const { Array<octave_idx_type> perm; return orderfields (perm); } octave_scalar_map octave_scalar_map::orderfields (Array<octave_idx_type>& perm) const { octave_scalar_map retval (xkeys); retval.xkeys.orderfields (perm); octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) retval.xvals[i] = xvals[perm.xelem (i)]; return retval; } octave_scalar_map octave_scalar_map::orderfields (const octave_scalar_map& other, Array<octave_idx_type>& perm) const { if (xkeys.is_same (other.xkeys)) return *this; else { octave_scalar_map retval (other.xkeys); if (other.xkeys.equal_up_to_order (xkeys, perm)) { octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) retval.xvals[i] = xvals[perm.xelem (i)]; } else error ("orderfields: structs must have same fields up to order"); return retval; } } octave_value octave_scalar_map::contents (const std::string& k) const { return getfield (k); } octave_value& octave_scalar_map::contents (const std::string& k) { octave_idx_type idx = xkeys.getfield (k); if (idx >= static_cast<octave_idx_type> (xvals.size ())) xvals.resize (idx+1); return xvals[idx]; } octave_map::octave_map (const octave_scalar_map& m) : xkeys (m.xkeys), xvals (), dimensions (1, 1) { octave_idx_type nf = m.nfields (); xvals.reserve (nf); for (octave_idx_type i = 0; i < nf; i++) { xvals.push_back (Cell (dimensions)); xvals[i].xelem (0) = m.xvals[i]; } } octave_map::octave_map (const Octave_map& m) : xkeys (m.keys ()), xvals (m.nfields ()), dimensions (m.dims ()) { for (iterator p = begin (); p != end (); p++) contents(p) = m.contents (key (p)); optimize_dimensions (); } Cell octave_map::getfield (const std::string& k) const { octave_idx_type idx = xkeys.getfield (k); return (idx >= 0) ? xvals[idx] : Cell (); } void octave_map::setfield (const std::string& k, const Cell& val) { if (nfields () == 0) dimensions = val.dims (); if (val.dims () == dimensions) { octave_idx_type idx = xkeys.getfield (k); if (idx < static_cast<octave_idx_type> (xvals.size ())) xvals[idx] = val; else xvals.push_back (val); } else error ("octave_map::setfield: internal error"); } void octave_map::rmfield (const std::string& k) { octave_idx_type idx = xkeys.rmfield (k); if (idx >= 0) xvals.erase (xvals.begin () + idx); } octave_map octave_map::orderfields (void) const { Array<octave_idx_type> perm; return orderfields (perm); } octave_map octave_map::orderfields (Array<octave_idx_type>& perm) const { octave_map retval (xkeys); retval.xkeys.orderfields (perm); octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) retval.xvals[i] = xvals[perm.xelem (i)]; return retval; } octave_map octave_map::orderfields (const octave_map& other, Array<octave_idx_type>& perm) const { if (xkeys.is_same (other.xkeys)) return *this; else { octave_map retval (other.xkeys); if (other.xkeys.equal_up_to_order (xkeys, perm)) { octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) retval.xvals[i] = xvals[perm.xelem (i)]; } else error ("orderfields: structs must have same fields up to order"); return retval; } } Cell octave_map::contents (const std::string& k) const { return getfield (k); } Cell& octave_map::contents (const std::string& k) { octave_idx_type idx = xkeys.getfield (k); if (idx >= static_cast<octave_idx_type> (xvals.size ())) xvals.push_back (Cell (dimensions)); // auto-set correct dims. return xvals[idx]; } void octave_map::extract_scalar (octave_scalar_map& dest, octave_idx_type idx) const { octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) dest.xvals[i] = xvals[i](idx); } octave_scalar_map octave_map::checkelem (octave_idx_type n) const { octave_scalar_map retval (xkeys); // Optimize this so that there is just one check. extract_scalar (retval, compute_index (n, dimensions)); return retval; } octave_scalar_map octave_map::checkelem (octave_idx_type i, octave_idx_type j) const { octave_scalar_map retval (xkeys); // Optimize this so that there is just one check. extract_scalar (retval, compute_index (i, j, dimensions)); return retval; } octave_scalar_map octave_map::checkelem (const Array<octave_idx_type>& ra_idx) const { octave_scalar_map retval (xkeys); // Optimize this so that there is just one check. extract_scalar (retval, compute_index (ra_idx, dimensions)); return retval; } octave_scalar_map octave_map::fast_elem_extract (octave_idx_type n) const { octave_scalar_map retval (xkeys); extract_scalar (retval, n); return retval; } bool octave_map::fast_elem_insert (octave_idx_type n, const octave_scalar_map& rhs) { bool retval = false; octave_idx_type nf = nfields (); if (rhs.xkeys.is_same (xkeys)) { for (octave_idx_type i = 0; i < nf; i++) xvals[i](n) = rhs.xvals[i]; retval = true; } else { OCTAVE_LOCAL_BUFFER (octave_idx_type, perm, nf); if (xkeys.equal_up_to_order (rhs.xkeys, perm)) { for (octave_idx_type i = 0; i < nf; i++) xvals[i](n) = rhs.xvals[perm[i]]; retval = true; } } return retval; } octave_map octave_map::squeeze (void) const { octave_map retval (*this); octave_idx_type nf = nfields (); retval.dimensions = dimensions.squeeze (); for (octave_idx_type i = 0; i < nf; i++) retval.xvals[i] = xvals[i].squeeze (); retval.optimize_dimensions (); return retval; } /* ## test preservation of xkeys by squeeze %!test %! x(1,1,1,1).d = 10; x(3,5,1,7).a = "b"; x(2,4,1,7).f = 27; %! assert (fieldnames (squeeze (x)), {"d"; "a"; "f"}); */ octave_map octave_map::permute (const Array<int>& vec, bool inv) const { octave_map retval (xkeys); octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) retval.xvals[i] = xvals[i].permute (vec, inv); // FIXME: // There is no dim_vector::permute for technical reasons. // We pick the dim vector from results if possible, otherwise use a dummy // array to get it. Need (?) a better solution to this problem. if (nf > 0) retval.dimensions = retval.xvals[0].dims (); else { Array<char> dummy (dimensions); dummy = dummy.permute (vec, inv); retval.dimensions = dummy.dims (); } retval.optimize_dimensions (); return retval; } /* ## test preservation of key order by permute %!test %! x(1,1,1,1).d = 10; x(3,5,1,7).a = "b"; x(2,4,1,7).f = 27; %! assert (fieldnames (permute (x, [3, 4, 1, 2])), {"d"; "a"; "f"}); */ octave_map octave_map::transpose (void) const { assert (ndims () == 2); octave_map retval (xkeys); retval.dimensions = dim_vector (dimensions (1), dimensions (0)); octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) retval.xvals[i] = xvals[i].transpose (); retval.optimize_dimensions (); return retval; } /* ## test preservation of key order by transpose %!test %! x(1,1).d = 10; x(3,5).a = "b"; x(2,4).f = 27; %! assert (fieldnames (transpose (x)), {"d"; "a"; "f"}); %! assert (fieldnames (x'), {"d"; "a"; "f"}); %! assert (fieldnames (x.'), {"d"; "a"; "f"}); */ octave_map octave_map::reshape (const dim_vector& dv) const { octave_map retval (xkeys); retval.dimensions = dv; octave_idx_type nf = nfields (); if (nf > 0) { retval.xvals.reserve (nf); for (octave_idx_type i = 0; i < nf; i++) retval.xvals[i] = xvals[i].reshape (dv); } else { // FIXME: Do it with a dummy array, to reuse error message. // Need (?) a better solution. Array<char> dummy (dimensions); dummy.reshape (dv); } retval.optimize_dimensions (); return retval; } /* ## test preservation of key order by reshape %!test %! x(1,1).d = 10; x(4,6).a = "b"; x(2,4).f = 27; %! assert (fieldnames (reshape (x, 3, 8)), {"d"; "a"; "f"}); */ void octave_map::resize (const dim_vector& dv, bool fill) { octave_idx_type nf = nfields (); if (nf > 0) { for (octave_idx_type i = 0; i < nf; i++) { if (fill) xvals[i].resize (dv, Matrix ()); else xvals[i].resize (dv); } } else { // FIXME: Do it with a dummy array, to reuse error message. // Need (?) a better solution. Array<char> dummy (dimensions); dummy.resize (dv); } dimensions = dv; optimize_dimensions (); } void octave_map::do_cat (int dim, octave_idx_type n, const octave_scalar_map *map_list, octave_map& retval) { octave_idx_type nf = retval.nfields (); retval.xvals.reserve (nf); dim_vector& rd = retval.dimensions; rd.resize (dim+1, 1); rd(0) = rd(1) = 1; rd(dim) = n; for (octave_idx_type j = 0; j < nf; j++) { retval.xvals.push_back (Cell (rd)); assert (retval.xvals[j].numel () == n); for (octave_idx_type i = 0; i < n; i++) retval.xvals[j].xelem (i) = map_list[i].xvals[j]; } } void octave_map::do_cat (int dim, octave_idx_type n, const octave_map *map_list, octave_map& retval) { octave_idx_type nf = retval.nfields (); retval.xvals.reserve (nf); OCTAVE_LOCAL_BUFFER (Array<octave_value>, field_list, n); for (octave_idx_type j = 0; j < nf; j++) { for (octave_idx_type i = 0; i < n; i++) field_list[i] = map_list[i].xvals[j]; retval.xvals.push_back (Array<octave_value>::cat (dim, n, field_list)); if (j == 0) retval.dimensions = retval.xvals[j].dims (); } } // This is just a wrapper. void permute_to_correct_order1 (const octave_scalar_map& ref, const octave_scalar_map& src, octave_scalar_map& dest, Array<octave_idx_type>& perm) { dest = src.orderfields (ref, perm); } // In non-scalar case, we also promote empty structs without fields. void permute_to_correct_order1 (const octave_map& ref, const octave_map& src, octave_map& dest, Array<octave_idx_type>& perm) { if (src.nfields () == 0 && src.is_empty ()) dest = octave_map (src.dims (), ref.keys ()); else dest = src.orderfields (ref, perm); } template <class map> static void permute_to_correct_order (octave_idx_type n, octave_idx_type nf, octave_idx_type idx, const map *map_list, map *new_map_list) { new_map_list[idx] = map_list[idx]; Array<octave_idx_type> perm (dim_vector (1, nf)); for (octave_idx_type i = 0; i < n; i++) { if (i == idx) continue; permute_to_correct_order1 (map_list[idx], map_list[i], new_map_list[i], perm); if (error_state) { // Use liboctave exception to be consistent. (*current_liboctave_error_handler) ("cat: field names mismatch in concatenating structs"); break; } } } octave_map octave_map::cat (int dim, octave_idx_type n, const octave_scalar_map *map_list) { octave_map retval; // Allow dim = -1, -2 for compatibility, though it makes no difference here. if (dim == -1 || dim == -2) dim = -dim - 1; else if (dim < 0) (*current_liboctave_error_handler) ("cat: invalid dimension"); if (n == 1) retval = map_list[0]; else if (n > 1) { octave_idx_type idx, nf = 0; for (idx = 0; idx < n; idx++) { nf = map_list[idx].nfields (); if (nf > 0) { retval.xkeys = map_list[idx].xkeys; break; } } if (nf > 0) { // Try the fast case. bool all_same = true; for (octave_idx_type i = 0; i < n; i++) { all_same = map_list[idx].xkeys.is_same (map_list[i].xkeys); if (! all_same) break; } if (all_same) do_cat (dim, n, map_list, retval); else { // permute all structures to common order. OCTAVE_LOCAL_BUFFER (octave_scalar_map, new_map_list, n); permute_to_correct_order (n, nf, idx, map_list, new_map_list); do_cat (dim, n, new_map_list, retval); } } else { dim_vector& rd = retval.dimensions; rd.resize (dim+1, 1); rd(0) = rd(1) = 1; rd(dim) = n; } retval.optimize_dimensions (); } return retval; } octave_map octave_map::cat (int dim, octave_idx_type n, const octave_map *map_list) { octave_map retval; // Allow dim = -1, -2 for compatibility, though it makes no difference here. if (dim == -1 || dim == -2) dim = -dim - 1; else if (dim < 0) (*current_liboctave_error_handler) ("cat: invalid dimension"); if (n == 1) retval = map_list[0]; else if (n > 1) { octave_idx_type idx, nf = 0; for (idx = 0; idx < n; idx++) { nf = map_list[idx].nfields (); if (nf > 0) { retval.xkeys = map_list[idx].xkeys; break; } } // Try the fast case. bool all_same = true; if (nf > 0) { for (octave_idx_type i = 0; i < n; i++) { all_same = map_list[idx].xkeys.is_same (map_list[i].xkeys); if (! all_same) break; } } if (all_same && nf > 0) do_cat (dim, n, map_list, retval); else { if (nf > 0) { // permute all structures to correct order. OCTAVE_LOCAL_BUFFER (octave_map, new_map_list, n); permute_to_correct_order (n, nf, idx, map_list, new_map_list); do_cat (dim, n, new_map_list, retval); } else { dim_vector dv = map_list[0].dimensions; for (octave_idx_type i = 1; i < n; i++) { if (! dv.concat (map_list[i].dimensions, dim)) { error ("dimension mismatch in struct concatenation"); return retval; } } retval.dimensions = dv; } } retval.optimize_dimensions (); } return retval; } /* ## test preservation of key order by concatenation %!test %! x(1, 1).d = 10; x(4, 6).a = "b"; x(2, 4).f = 27; %! y(1, 6).f = 11; y(1, 6).a = "c"; y(1, 6).d = 33; %! assert (fieldnames ([x; y]), {"d"; "a"; "f"}); %!test %! s = struct (); %! sr = [s,s]; %! sc = [s;s]; %! sm = [s,s;s,s]; %! assert (nfields (sr), 0); %! assert (nfields (sc), 0); %! assert (nfields (sm), 0); %! assert (size (sr), [1, 2]); %! assert (size (sc), [2, 1]); %! assert (size (sm), [2, 2]); */ octave_map octave_map::index (const idx_vector& i, bool resize_ok) const { octave_map retval (xkeys); octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) retval.xvals[k] = xvals[k].index (i, resize_ok); if (nf > 0) retval.dimensions = retval.xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions); dummy = dummy.index (i, resize_ok); retval.dimensions = dummy.dims (); } retval.optimize_dimensions (); return retval; } octave_map octave_map::index (const idx_vector& i, const idx_vector& j, bool resize_ok) const { octave_map retval (xkeys); octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) retval.xvals[k] = xvals[k].index (i, j, resize_ok); if (nf > 0) retval.dimensions = retval.xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions); dummy = dummy.index (i, j, resize_ok); retval.dimensions = dummy.dims (); } retval.optimize_dimensions (); return retval; } octave_map octave_map::index (const Array<idx_vector>& ia, bool resize_ok) const { octave_map retval (xkeys); octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) retval.xvals[k] = xvals[k].index (ia, resize_ok); if (nf > 0) retval.dimensions = retval.xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions); dummy = dummy.index (ia, resize_ok); retval.dimensions = dummy.dims (); } retval.optimize_dimensions (); return retval; } octave_map octave_map::index (const octave_value_list& idx, bool resize_ok) const { octave_idx_type n_idx = idx.length (); octave_map retval; switch (n_idx) { case 1: { idx_vector i = idx(0).index_vector (); if (! error_state) retval = index (i, resize_ok); } break; case 2: { idx_vector i = idx(0).index_vector (); if (! error_state) { idx_vector j = idx(1).index_vector (); retval = index (i, j, resize_ok); } } break; default: { Array<idx_vector> ia (dim_vector (n_idx, 1)); for (octave_idx_type i = 0; i < n_idx; i++) { ia(i) = idx(i).index_vector (); if (error_state) break; } if (! error_state) retval = index (ia, resize_ok); } break; } return retval; } // Perhaps one day these will be optimized. Right now, they just call index. octave_map octave_map::column (octave_idx_type k) const { return index (idx_vector::colon, k); } octave_map octave_map::page (octave_idx_type k) const { static Array<idx_vector> ia (dim_vector (3, 1), idx_vector::colon); ia(2) = k; return index (ia); } void octave_map::assign (const idx_vector& i, const octave_map& rhs) { if (rhs.xkeys.is_same (xkeys)) { octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) xvals[k].assign (i, rhs.xvals[k], Matrix ()); if (nf > 0) dimensions = xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions), rhs_dummy (rhs.dimensions); dummy.assign (i, rhs_dummy);; dimensions = dummy.dims (); } optimize_dimensions (); } else if (nfields () == 0) { octave_map tmp (dimensions, rhs.xkeys); tmp.assign (i, rhs); *this = tmp; } else { Array<octave_idx_type> perm; octave_map rhs1 = rhs.orderfields (*this, perm); if (! error_state) { assert (rhs1.xkeys.is_same (xkeys)); assign (i, rhs1); } else error ("incompatible fields in struct assignment"); } } void octave_map::assign (const idx_vector& i, const idx_vector& j, const octave_map& rhs) { if (rhs.xkeys.is_same (xkeys)) { octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) xvals[k].assign (i, j, rhs.xvals[k], Matrix ()); if (nf > 0) dimensions = xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions), rhs_dummy (rhs.dimensions); dummy.assign (i, j, rhs_dummy);; dimensions = dummy.dims (); } optimize_dimensions (); } else if (nfields () == 0) { octave_map tmp (dimensions, rhs.xkeys); tmp.assign (i, j, rhs); *this = tmp; } else { Array<octave_idx_type> perm; octave_map rhs1 = rhs.orderfields (*this, perm); if (! error_state) { assert (rhs1.xkeys.is_same (xkeys)); assign (i, j, rhs1); } else error ("incompatible fields in struct assignment"); } } void octave_map::assign (const Array<idx_vector>& ia, const octave_map& rhs) { if (rhs.xkeys.is_same (xkeys)) { octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) xvals[k].assign (ia, rhs.xvals[k], Matrix ()); if (nf > 0) dimensions = xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions), rhs_dummy (rhs.dimensions); dummy.assign (ia, rhs_dummy);; dimensions = dummy.dims (); } optimize_dimensions (); } else if (nfields () == 0) { octave_map tmp (dimensions, rhs.xkeys); tmp.assign (ia, rhs); *this = tmp; } else { Array<octave_idx_type> perm; octave_map rhs1 = rhs.orderfields (*this, perm); if (! error_state) { assert (rhs1.xkeys.is_same (xkeys)); assign (ia, rhs1); } else error ("incompatible fields in struct assignment"); } } void octave_map::assign (const octave_value_list& idx, const octave_map& rhs) { octave_idx_type n_idx = idx.length (); switch (n_idx) { case 1: { idx_vector i = idx(0).index_vector (); if (! error_state) assign (i, rhs); } break; case 2: { idx_vector i = idx(0).index_vector (); if (! error_state) { idx_vector j = idx(1).index_vector (); assign (i, j, rhs); } } break; default: { Array<idx_vector> ia (dim_vector (n_idx, 1)); for (octave_idx_type i = 0; i < n_idx; i++) { ia(i) = idx(i).index_vector (); if (error_state) break; } if (! error_state) assign (ia, rhs); } break; } } void octave_map::assign (const octave_value_list& idx, const std::string& k, const Cell& rhs) { Cell tmp; iterator p = seek (k); Cell& ref = p != end () ? contents (p) : tmp; if (&ref == &tmp) ref = Cell (dimensions); ref.assign (idx, rhs); if (! error_state && ref.dims () != dimensions) { dimensions = ref.dims (); octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) { if (&xvals[i] != &ref) xvals[i].resize (dimensions, Matrix ()); } optimize_dimensions (); } if (! error_state && &ref == &tmp) setfield (k, tmp); } /* %!test %! rhs.b = 1; %! a(3) = rhs; %! assert ({a.b}, {[], [], 1}) */ void octave_map::delete_elements (const idx_vector& i) { octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) xvals[k].delete_elements (i); if (nf > 0) dimensions = xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions); dummy.delete_elements (i); dimensions = dummy.dims (); } optimize_dimensions (); } void octave_map::delete_elements (int dim, const idx_vector& i) { octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) xvals[k].delete_elements (dim, i); if (nf > 0) dimensions = xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions); dummy.delete_elements (dim, i); dimensions = dummy.dims (); } optimize_dimensions (); } void octave_map::delete_elements (const Array<idx_vector>& ia) { octave_idx_type nf = nfields (); for (octave_idx_type k = 0; k < nf; k++) xvals[k].delete_elements (ia); if (nf > 0) dimensions = xvals[0].dims (); else { // Use dummy array. FIXME: Need(?) a better solution. Array<char> dummy (dimensions); dummy.delete_elements (ia); dimensions = dummy.dims (); } optimize_dimensions (); } void octave_map::delete_elements (const octave_value_list& idx) { octave_idx_type n_idx = idx.length (); Array<idx_vector> ia (dim_vector (n_idx, 1)); for (octave_idx_type i = 0; i < n_idx; i++) { ia(i) = idx(i).index_vector (); if (error_state) break; } if (! error_state) delete_elements (ia); } /* ## test preservation of key order by indexing %!test %! x(1, 1).d = 10; x(4, 6).a = "b"; x(2, 4).f = 27; %! assert (fieldnames (x([1, 2], [2:5])), {"d"; "a"; "f"}); */ octave_map octave_map::concat (const octave_map& rb, const Array<octave_idx_type>& ra_idx) { if (nfields () == rb.nfields ()) { for (const_iterator pa = begin (); pa != end (); pa++) { const_iterator pb = rb.seek (key(pa)); if (pb == rb.end ()) { error ("field name mismatch in structure concatenation"); break; } contents(pa).insert (rb.contents (pb), ra_idx); } } else { dim_vector dv = dims (); if (dv.all_zero ()) *this = rb; else if (! rb.dims ().all_zero ()) error ("invalid structure concatenation"); } return *this; } void octave_map::optimize_dimensions (void) { octave_idx_type nf = nfields (); for (octave_idx_type i = 0; i < nf; i++) { if (! xvals[i].optimize_dimensions (dimensions)) { error ("internal error: dimension mismatch across fields in struct"); break; } } } Octave_map::Octave_map (const dim_vector& dv, const Cell& key_vals) : map (), key_list (), dimensions (dv) { Cell c (dv); if (key_vals.is_cellstr ()) { for (octave_idx_type i = 0; i < key_vals.numel (); i++) { std::string k = key_vals(i).string_value (); map[k] = c; key_list.push_back (k); } } else error ("Octave_map: expecting keys to be cellstr"); } Octave_map::Octave_map (const octave_map& m) : map (), key_list (), dimensions (m.dims ()) { for (octave_map::const_iterator p = m.begin (); p != m.end (); p++) map[m.key (p)] = m.contents (p); const string_vector mkeys = m.fieldnames (); for (octave_idx_type i = 0; i < mkeys.numel (); i++) key_list.push_back (mkeys(i)); } Octave_map Octave_map::squeeze (void) const { Octave_map retval (dims ().squeeze ()); for (const_iterator pa = begin (); pa != end (); pa++) { Cell tmp = contents (pa).squeeze (); if (error_state) break; retval.assign (key (pa), tmp); } // Preserve order of keys. retval.key_list = key_list; return retval; } Octave_map Octave_map::permute (const Array<int>& vec, bool inv) const { Octave_map retval (dims ()); for (const_iterator pa = begin (); pa != end (); pa++) { Cell tmp = contents (pa).permute (vec, inv); if (error_state) break; retval.assign (key (pa), tmp); } // Preserve order of keys. retval.key_list = key_list; return retval; } Cell& Octave_map::contents (const std::string& k) { maybe_add_to_key_list (k); return map[k]; } Cell Octave_map::contents (const std::string& k) const { const_iterator p = seek (k); return p != end () ? p->second : Cell (); } int Octave_map::intfield (const std::string& k, int def_val) const { int retval = def_val; Cell c = contents (k); if (! c.is_empty ()) retval = c(0).int_value (); return retval; } std::string Octave_map::stringfield (const std::string& k, const std::string& def_val) const { std::string retval = def_val; Cell c = contents (k); if (! c.is_empty ()) retval = c(0).string_value (); return retval; } string_vector Octave_map::keys (void) const { assert (static_cast<size_t>(nfields ()) == key_list.size ()); return string_vector (key_list); } Octave_map Octave_map::transpose (void) const { assert (ndims () == 2); dim_vector dv = dims (); octave_idx_type nr = dv(0); octave_idx_type nc = dv(1); dim_vector new_dims (nc, nr); Octave_map retval (new_dims); for (const_iterator p = begin (); p != end (); p++) retval.assign (key(p), Cell (contents(p).transpose ())); // Preserve order of keys. retval.key_list = key_list; return retval; } Octave_map Octave_map::reshape (const dim_vector& new_dims) const { Octave_map retval; if (new_dims != dims ()) { for (const_iterator p = begin (); p != end (); p++) retval.assign (key(p), contents(p).reshape (new_dims)); retval.dimensions = new_dims; // Preserve order of keys. retval.key_list = key_list; } else retval = *this; return retval; } void Octave_map::resize (const dim_vector& dv, bool fill) { if (dv != dims ()) { if (nfields () == 0) dimensions = dv; else { for (const_iterator p = begin (); p != end (); p++) { Cell tmp = contents(p); if (fill) tmp.resize (dv, Matrix ()); else tmp.resize (dv); dimensions = dv; assign (key(p), tmp); } } } } Octave_map Octave_map::concat (const Octave_map& rb, const Array<octave_idx_type>& ra_idx) { Octave_map retval; if (nfields () == rb.nfields ()) { for (const_iterator pa = begin (); pa != end (); pa++) { const_iterator pb = rb.seek (key(pa)); if (pb == rb.end ()) { error ("field name mismatch in structure concatenation"); break; } retval.assign (key(pa), contents(pa).insert (rb.contents(pb), ra_idx)); } // Preserve order of keys. retval.key_list = key_list; } else { dim_vector dv = dims (); if (dv.all_zero ()) retval = rb; else { dv = rb.dims (); if (dv.all_zero ()) retval = *this; else error ("invalid structure concatenation"); } } return retval; } static bool keys_ok (const Octave_map& a, const Octave_map& b, string_vector& keys) { bool retval = false; keys = string_vector (); if (a.nfields () == 0) { keys = b.keys (); retval = true; } else { string_vector a_keys = a.keys ().sort (); string_vector b_keys = b.keys ().sort (); octave_idx_type a_len = a_keys.length (); octave_idx_type b_len = b_keys.length (); if (a_len == b_len) { for (octave_idx_type i = 0; i < a_len; i++) { if (a_keys[i] != b_keys[i]) goto done; } keys = a_keys; retval = true; } } done: return retval; } Octave_map& Octave_map::maybe_delete_elements (const octave_value_list& idx) { string_vector t_keys = keys (); octave_idx_type len = t_keys.length (); if (len > 0) { for (octave_idx_type i = 0; i < len; i++) { std::string k = t_keys[i]; contents(k).delete_elements (idx); if (error_state) break; } if (!error_state) dimensions = contents(t_keys[0]).dims (); } return *this; } Octave_map& Octave_map::assign (const octave_value_list& idx, const Octave_map& rhs) { string_vector t_keys; if (keys_ok (*this, rhs, t_keys)) { octave_idx_type len = t_keys.length (); if (len == 0) { Cell tmp_lhs (dims ()); Cell tmp_rhs (rhs.dims ()); tmp_lhs.assign (idx, tmp_rhs, Matrix ()); if (! error_state) resize (tmp_lhs.dims ()); else error ("size mismatch in structure assignment"); } else { for (octave_idx_type i = 0; i < len; i++) { std::string k = t_keys[i]; Cell t_rhs = rhs.contents (k); assign (idx, k, t_rhs); if (error_state) break; } } } else error ("field name mismatch in structure assignment"); return *this; } Octave_map& Octave_map::assign (const octave_value_list& idx, const std::string& k, const Cell& rhs) { Cell tmp; if (contains (k)) tmp = map[k]; else tmp = Cell (dimensions); tmp.assign (idx, rhs); if (! error_state) { dim_vector tmp_dims = tmp.dims (); if (tmp_dims != dimensions) { for (iterator p = begin (); p != end (); p++) contents(p).resize (tmp_dims, Matrix ()); dimensions = tmp_dims; } maybe_add_to_key_list (k); map[k] = tmp; } return *this; } Octave_map& Octave_map::assign (const std::string& k, const octave_value& rhs) { if (nfields () == 0) { maybe_add_to_key_list (k); map[k] = Cell (rhs); dimensions = dim_vector (1, 1); } else { dim_vector dv = dims (); if (dv.all_ones ()) { maybe_add_to_key_list (k); map[k] = Cell (rhs); } else error ("invalid structure assignment"); } return *this; } Octave_map& Octave_map::assign (const std::string& k, const Cell& rhs) { if (nfields () == 0) { maybe_add_to_key_list (k); map[k] = rhs; dimensions = rhs.dims (); } else { if (dims () == rhs.dims ()) { maybe_add_to_key_list (k); map[k] = rhs; } else error ("invalid structure assignment"); } return *this; } Octave_map Octave_map::index (const octave_value_list& idx, bool resize_ok) const { Octave_map retval; octave_idx_type n_idx = idx.length (); if (n_idx > 0) { Array<idx_vector> ra_idx (dim_vector (n_idx, 1)); for (octave_idx_type i = 0; i < n_idx; i++) { ra_idx(i) = idx(i).index_vector (); if (error_state) break; } if (! error_state) { for (const_iterator p = begin (); p != end (); p++) { Cell tmp = contents (p); tmp = tmp.Array<octave_value>::index (ra_idx, resize_ok); if (error_state) break; retval.assign (key(p), tmp); } // Preserve order of keys. retval.key_list = key_list; } } else retval = *this; return retval; }