Logo Search packages:      
Sourcecode: afnix version File versions

Index.cpp

// ---------------------------------------------------------------------------
// - Index.cpp                                                               -
// - afnix:sps module - cell index class implementation                      -
// ---------------------------------------------------------------------------
// - This program is free software;  you can redistribute it  and/or  modify -
// - it provided that this copyright notice is kept intact.                  -
// -                                                                         -
// - This program  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.  In no event shall -
// - the copyright holder be liable for any  direct, indirect, incidental or -
// - special damages arising in any way out of the use of this software.     -
// ---------------------------------------------------------------------------
// - copyright (c) 1999-2007 amaury darsch                                   -
// ---------------------------------------------------------------------------

#include "Index.hpp"
#include "Vector.hpp"
#include "Integer.hpp"
#include "Boolean.hpp"
#include "Runnable.hpp"
#include "QuarkZone.hpp"
#include "Exception.hpp"

namespace afnix {

  // -------------------------------------------------------------------------
  // - private section                                                       -
  // -------------------------------------------------------------------------
  
  // the index structure
  struct s_indx {
    // the cell index
    long d_cidx;
    // the record index
    long d_ridx;
    // the sheet index
    long d_sidx;
    // create a default entry
    s_indx (void) {
      reset ();
    }
    // create an entry by coordinate
    s_indx (const long cidx) {
      set (cidx);
    }
    // create an entry by coordinate
    s_indx (const long cidx, const long ridx) {
      set (cidx, ridx);
    }
    // create an entry by coordinate
    s_indx (const long cidx, const long ridx, const long sidx) {
      set (cidx, ridx, sidx);
    }
    // copy construct this entry
    s_indx (const s_indx& that) {
      d_cidx = that.d_cidx;
      d_ridx = that.d_ridx;
      d_sidx = that.d_sidx;
    }
    // assign an entry to this one
    s_indx& operator = (const s_indx& that) {
      if (this == &that) return *this;
      d_cidx = that.d_cidx;
      d_ridx = that.d_ridx;
      d_sidx = that.d_sidx;
      return *this;
    }
    // reset this entry
    void reset (void) {
      d_cidx = -1;
      d_ridx = -1;
      d_sidx = -1;
    }
    // check if an entry is equal to the coordinate and name
    bool chk (const long cidx) {
      if (d_cidx != cidx) return false;
      if (d_ridx != -1)   return false;
      if (d_sidx != -1)   return false;
      return true;
    }
    // check if an entry is equal to the coordinate and name
    bool chk (const long cidx, const long ridx) {
      if (d_cidx != cidx) return false;
      if (d_ridx != ridx) return false;
      if (d_sidx != -1)   return false;
      return true;
    }
    // check if an entry is equal to the coordinate and name
    bool chk (const long cidx, const long ridx, const long sidx) {
      if (d_cidx != cidx) return false;
      if (d_ridx != ridx) return false;
      if (d_sidx != sidx) return false;
      return true;
    }
    // check if an entry is equal to the coordinate and name
    bool chk (const long cidx, const long ridx, const long sidx, 
            const String& name) {
      if (d_cidx != cidx) return false;
      if (d_ridx != ridx) return false;
      if (d_sidx != sidx) return false;
      return true;
    }
    // set an entry by coordinate
    void set (const long cidx) {
      d_cidx = cidx;
      d_ridx = -1;
      d_sidx = -1;
    }
    // set an entry by coordinate
    void set (const long cidx, const long ridx) {
      d_cidx = cidx;
      d_ridx = ridx;
      d_sidx = -1;
    }
    // set an entry by coordinate
    void set (const long cidx, const long ridx, const long sidx) {
      d_cidx = cidx;
      d_ridx = ridx;
      d_sidx = sidx;
    }
  };

  // -------------------------------------------------------------------------
  // - class section                                                         -
  // -------------------------------------------------------------------------
   
  // create an empty index
  
00130   Index::Index (void) {
    d_size = 0;
    p_indx = nilp;
  }

  // create an index by coordinates
  
00137   Index::Index (const long cidx) {
    d_size = 1;
    p_indx = new s_indx (cidx);
  }

  // create an index by coordinates
  
00144   Index::Index (const long cidx, const long ridx) {
    d_size = 1;
    p_indx = new s_indx (cidx, ridx);
  }

  // create an index by coordinates
  
00151   Index::Index (const long cidx, const long ridx, const long sidx) {
    d_size = 1;
    p_indx = new s_indx (cidx, ridx, sidx);
  }

  // copy construct this index

00158   Index::Index (const Index& that) {
    that.rdlock ();
    d_size = that.d_size;
    p_indx = (d_size == 0) ? nilp : new s_indx[d_size];
    for (long i = 0; i < d_size; i++) p_indx[i] = that.p_indx[i];
    that.unlock ();
  }

  // destroy this index

00168   Index::~Index (void) {
    delete [] p_indx;
  }

  // return the class name

00174   String Index::repr (void) const {
    return "Index";
  }

  // assign an index to this one

00180   Index& Index::operator = (const Index& that) {
    if (this == &that) return *this;
    wrlock ();
    that.rdlock ();
    delete [] p_indx;
    d_size = that.d_size;
    p_indx = (d_size == 0) ? nilp : new s_indx[d_size];
    for (long i = 0; i < d_size; i++) p_indx[i] = that.p_indx[i];
    that.unlock ();
    unlock ();
    return *this;
  }

  // reset this index

00195   void Index::reset (void) {
    wrlock ();
    delete [] p_indx;
    d_size = 0;
    p_indx = nilp;
    unlock ();
  }

  // return the index length

00205   long Index::length (void) const {
    rdlock ();
    long result = d_size;
    unlock ();
    return result;
  }

  // return true if an entry exist

00214   bool Index::exists (const long cidx) const {
    rdlock ();
    for (long i = 0; i < d_size; i++) {
      if (p_indx[i].chk (cidx) == true) {
      unlock ();
      return true;
      }
    }
    unlock ();
    return false;
  }

  // return true if an entry exist

00228   bool Index::exists (const long cidx, const long ridx) const {
    rdlock ();
    for (long i = 0; i < d_size; i++) {
      if (p_indx[i].chk (cidx, ridx) == true) {
      unlock ();
      return true;
      }
    }
    unlock ();
    return false;
  }

  // return true if an entry exist

00242   bool Index::exists (const long cidx, const long ridx, 
                  const long sidx) const {
    rdlock ();
    for (long i = 0; i < d_size; i++) {
      if (p_indx[i].chk (cidx, ridx, sidx) == true) {
      unlock ();
      return true;
      }
    }
    unlock ();
    return false;
  }

  // add an entry by coordinate

00257   void Index::add (const long cidx) {
    wrlock ();
    // check if the entry exists
    if (exists (cidx) == true) {
      unlock ();
      return;
    }
    // the entry does not exist - create and copy the array
    s_indx* indx = new s_indx[d_size+1];
    for (long i = 0; i < d_size; i++) indx[i] = p_indx[i];
    delete [] p_indx;
    p_indx = indx;
    // set the new entry
    p_indx[d_size++].set (cidx);
    unlock ();
  }

  // add an entry by coordinate

00276   void Index::add (const long cidx, const long ridx) {
    wrlock ();
    // check if the entry exists
    if (exists (cidx, ridx) == true) {
      unlock ();
      return;
    }
    // the entry does not exist - create and copy the array
    s_indx* indx = new s_indx[d_size+1];
    for (long i = 0; i < d_size; i++) indx[i] = p_indx[i];
    delete [] p_indx;
    p_indx = indx;
    // set the new entry
    p_indx[d_size++].set (cidx, ridx);
    unlock ();
  }

  // add an entry by coordinate

00295   void Index::add (const long cidx, const long ridx, const long sidx) {
    wrlock ();
    // check if the entry exists
    if (exists (cidx, ridx, sidx) == true) {
      unlock ();
      return;
    }
    // the entry does not exist - create and copy the array
    s_indx* indx = new s_indx[d_size+1];
    for (long i = 0; i < d_size; i++) indx[i] = p_indx[i];
    delete [] p_indx;
    p_indx = indx;
    // set the new entry
    p_indx[d_size++].set (cidx, ridx, sidx);
    unlock ();
  }

  // set the cell index by position

00314   void Index::setcidx (const long ipos, const long cidx) {
    wrlock ();
    // check for position
    if ((ipos < 0) || (ipos >= d_size)) {
      unlock ();
      throw Exception ("index-error", "out of range index position");
    }
    // set indexat position
    p_indx[ipos].d_cidx = cidx;
    unlock ();
  }

  // update all cell indexes with a new value

00328   void Index::updcidx (const long cidx) {
    wrlock ();
    for (long i = 0; i < d_size; i++) {
      p_indx[i].d_cidx = cidx;
    }
    unlock ();
  }

  // return the cell index by position

00338   long Index::getcidx (const long ipos) const {
    rdlock ();
     // check for position
    if ((ipos < 0) || (ipos >= d_size)) {
      unlock ();
      throw Exception ("index-error", "out of range index position");
    }
    // get index at position
    long result = p_indx[ipos].d_cidx;
    unlock ();
    return result;
  }

  // set the record index by position

00353   void Index::setridx (const long ipos, const long ridx) {
    wrlock ();
    // check for position
    if ((ipos < 0) || (ipos >= d_size)) {
      unlock ();
      throw Exception ("index-error", "out of range index position");
    }
    // set indexat position
    p_indx[ipos].d_ridx = ridx;
    unlock ();
  }

  // update all record indexes with a new value

00367   void Index::updridx (const long ridx) {
    wrlock ();
    for (long i = 0; i < d_size; i++) {
      p_indx[i].d_ridx = ridx;
    }
    unlock ();
  }

  // return the record index by position

00377   long Index::getridx (const long ipos) const {
    rdlock ();
     // check for position
    if ((ipos < 0) || (ipos >= d_size)) {
      unlock ();
      throw Exception ("index-error", "out of range index position");
    }
    // get index at position
    long result = p_indx[ipos].d_ridx;
    unlock ();
    return result;
  }

  // set the sheet index by position

00392   void Index::setsidx (const long ipos, const long sidx) {
    wrlock ();
    // check for position
    if ((ipos < 0) || (ipos >= d_size)) {
      unlock ();
      throw Exception ("index-error", "out of range index position");
    }
    // set indexat position
    p_indx[ipos].d_sidx = sidx;
    unlock ();
  }

  // update all sheet indexes with a new value

00406   void Index::updsidx (const long sidx) {
    wrlock ();
    for (long i = 0; i < d_size; i++) {
      p_indx[i].d_sidx = sidx;
    }
    unlock ();
  }

  // return the sheet index by position

00416   long Index::getsidx (const long ipos) const {
    rdlock ();
     // check for position
    if ((ipos < 0) || (ipos >= d_size)) {
      unlock ();
      throw Exception ("index-error", "out of range index position");
    }
    // get index at position
    long result = p_indx[ipos].d_sidx;
    unlock ();
    return result;
  }

  // -------------------------------------------------------------------------
  // - object section                                                        -
  // -------------------------------------------------------------------------
  
  // the quark zone
  static const long QUARK_ZONE_LENGTH = 13;
  static QuarkZone  zone (QUARK_ZONE_LENGTH);

  // the object supported quarks
  static const long QUARK_ADD     = zone.intern ("add");
  static const long QUARK_RESET   = zone.intern ("reset");
  static const long QUARK_LENGTH  = zone.intern ("length");
  static const long QUARK_EXISTSP = zone.intern ("exists-p");
  static const long QUARK_SETCIDX = zone.intern ("set-index-cell");
  static const long QUARK_UPDCIDX = zone.intern ("update-index-cell");
  static const long QUARK_GETCIDX = zone.intern ("get-index-cell");
  static const long QUARK_SETRIDX = zone.intern ("set-index-record");
  static const long QUARK_UPDRIDX = zone.intern ("update-index-record");
  static const long QUARK_GETRIDX = zone.intern ("get-index-record");
  static const long QUARK_SETSIDX = zone.intern ("set-index-sheet");
  static const long QUARK_UPDSIDX = zone.intern ("update-index-sheet");
  static const long QUARK_GETSIDX = zone.intern ("get-index-sheet");

  // create a new object in a generic way

00454   Object* Index::mknew (Vector* argv) {
    // get number of arguments
    long argc = (argv == nilp) ? 0 : argv->length ();
    // check for 0 argument
    if (argc == 0) return new Index;
    // check for 1 argument
    if (argc == 1) {
      long cidx = argv->getint (0);
      return new Index (cidx);
    }
    // check for 2 arguments
    if (argc == 2) {
      long cidx = argv->getint (0);
      long ridx = argv->getint (1);
      return new Index (cidx, ridx);
    }
    // check for 3 arguments
    if (argc == 3) {
      long cidx = argv->getint (0);
      long ridx = argv->getint (1);
      long sidx = argv->getint (2);
      return new Index (cidx, ridx, sidx);
    }
    throw Exception ("argument-error", "too many arguments with index");
  }

  // return true if the given quark is defined

00482   bool Index::isquark (const long quark, const bool hflg) const {
    rdlock ();
    if (zone.exists (quark) == true) {
      unlock ();
      return true;
    }
    bool result = hflg ? Object::isquark (quark, hflg) : false;
    unlock ();
    return result;
  }

  // apply an object method with a set of arguments and a quark

00495   Object* Index::apply (Runnable* robj, Nameset* nset, const long quark,
                  Vector* argv) {
    // get the number of arguments
    long argc = (argv == nilp) ? 0 : argv->length ();

    // dispatch 0 argument
    if (argc == 0) {
      if (quark == QUARK_LENGTH)  return new Integer (length ());
      if (quark == QUARK_RESET) {
      reset ();
      return nilp;
      }
    }
    // dispatch 1 argument
    if (argc == 1) {
      if (quark == QUARK_ADD) {
      long cidx = argv->getint (0);
      add (cidx);
      return nilp;
      }
      if (quark == QUARK_EXISTSP) {
      long cidx = argv->getint (0);
      return new Boolean (exists (cidx));
      }
      if (quark == QUARK_GETCIDX) {
      long ipos = argv->getint (0);
      return new Integer (getcidx (ipos));
      }
      if (quark == QUARK_GETRIDX) {
      long ipos = argv->getint (0);
      return new Integer (getridx (ipos));
      }
      if (quark == QUARK_GETSIDX) {
      long ipos = argv->getint (0);
      return new Integer (getsidx (ipos));
      }
      if (quark == QUARK_UPDCIDX) {
      long cidx = argv->getint (0);
      updcidx (cidx);
      return nilp;
      }
      if (quark == QUARK_UPDRIDX) {
      long ridx = argv->getint (0);
      updridx (ridx);
      return nilp;
      }
      if (quark == QUARK_UPDSIDX) {
      long sidx = argv->getint (0);
      updsidx (sidx);
      return nilp;
      }
    }
    // dispatch 2 arguments
    if (argc == 2) {
      if (quark == QUARK_ADD) {
      long cidx = argv->getint (0);
      long ridx = argv->getint (1);
      add (cidx, ridx);
      return nilp;
      }
      if (quark == QUARK_EXISTSP) {
      long cidx = argv->getint (0);
      long ridx = argv->getint (1);
      return new Boolean (exists (cidx, ridx));
      }
      if (quark == QUARK_SETCIDX) {
      long ipos = argv->getint (0);
      long cidx = argv->getint (1);
      setcidx (ipos, cidx);
      return nilp;
      }
      if (quark == QUARK_SETRIDX) {
      long ipos = argv->getint (0);
      long ridx = argv->getint (1);
      setridx (ipos, ridx);
      return nilp;
      }
      if (quark == QUARK_SETSIDX) {
      long ipos = argv->getint (0);
      long sidx = argv->getint (1);
      setsidx (ipos, sidx);
      return nilp;
      }
    }
    // dispatch 3 arguments
    if (argc == 3) {
      if (quark == QUARK_ADD) {
      long cidx = argv->getint (0);
      long ridx = argv->getint (1);
      long sidx = argv->getint (2);
      add (cidx, ridx, sidx);
      return nilp;
      }
      if (quark == QUARK_EXISTSP) {
      long cidx = argv->getint (0);
      long ridx = argv->getint (1);
      long sidx = argv->getint (2);
      return new Boolean (exists (cidx, ridx, sidx));
      }
    }
    // call the object method
    return Object::apply (robj, nset, quark, argv);
  }
}

Generated by  Doxygen 1.6.0   Back to index