/*

Copyright (C) 1999 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 2, 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, write to the Free
Software Foundation, 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.

*/

#if !defined (Cell_h)
#define Cell_h 1

#if defined (__GNUG__) && defined (USE_PRAGMA_INTERFACE_IMPLEMENTATION)
#pragma interface
#endif

#include <string>

#include "ArrayN.h"
#include "oct-alloc.h"
#include "str-vec.h"

#include "oct-obj.h"

class
Cell : public ArrayN<octave_value>
{
public:

  Cell (void)
    : ArrayN<octave_value> () { }

  Cell (const octave_value& val)
    : ArrayN<octave_value> (dim_vector (1, 1), val) { }

  Cell (const octave_value_list& ovl)
    : ArrayN<octave_value> (dim_vector (ovl.length (), 1))
    {
      for (int i = 0; i < ovl.length (); i++)
	elem (i) = ovl (i);
    }

  Cell (int n, int m, const octave_value& val = resize_fill_value ())
    : ArrayN<octave_value> (dim_vector (n, m), val) { }

  Cell (const ArrayN<octave_value>& c)
    : ArrayN<octave_value> (c) { }

  Cell (const Array<octave_value>& c, int nr, int nc)
    : ArrayN<octave_value> (c, dim_vector (nr, nc)) { }

  Cell (const string_vector& sv);

  Cell (const Cell& c)
    : ArrayN<octave_value> (c) { }

  Cell index (const octave_value_list& idx, bool resize_ok = false) const;

  Cell index (idx_vector& i, int resize_ok = 0,
	      const octave_value& rfv = resize_fill_value ()) const
    { return ArrayN<octave_value>::index (i, resize_ok, rfv); }

  Cell index (idx_vector& i, idx_vector& j, int resize_ok = 0,
	      const octave_value& rfv = resize_fill_value ()) const
    { return ArrayN<octave_value>::index (i, j, resize_ok, rfv); }

  Cell index (Array<idx_vector>& ra_idx, int resize_ok = 0,
	      const octave_value& rfv = resize_fill_value ()) const
    { return ArrayN<octave_value>::index (ra_idx, resize_ok, rfv); }

  Cell& assign (const octave_value_list& idx, const Cell& rhs,
		const octave_value& fill_val = octave_value ());

  octave_value& operator () (int i) { return elem_internal (i); }

  octave_value operator () (int i) const { return elem_internal (i); }

  octave_value& operator () (int i, int j)
    { return ArrayN<octave_value>::operator () (i, j); }

  octave_value operator () (int i, int j) const
    { return ArrayN<octave_value>::operator () (i, j); }

  // XXX FIXME XXX
  boolMatrix all (int dim = 0) const { return boolMatrix (); }

  // XXX FIXME XXX
  boolMatrix any (int dim = 0) const { return boolMatrix (); }

  // XXX FIXME XXX
  bool is_true (void) const { return false; }

  static octave_value resize_fill_value (void) { return Matrix (); }

private:

  // XXX FIXME XXX -- we need to do something intelligent if there is
  // more than one dimension, but for now this is all we need...

  void maybe_resize (int n)
    {
      if (n >= rows ())
	resize (dim_vector (n + 1, 1), octave_value ());
    }

  octave_value& elem_internal (int n)
    {
      maybe_resize (n);
      return elem (n);
    }

  octave_value elem_internal (int n) const
    {
      return elem (n);
    }
};

#endif

/*
;;; Local Variables: ***
;;; mode: C++ ***
;;; End: ***
*/