Logo Search packages:      
Sourcecode: afnix version File versions

Graph.cpp

// ---------------------------------------------------------------------------
// - Graph.cpp                                                               -
// - afnix:gfx module - graph base 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 "Graph.hpp"
#include "Vector.hpp"
#include "Integer.hpp"
#include "Boolean.hpp"
#include "Runnable.hpp"
#include "QuarkZone.hpp"
#include "Exception.hpp"

namespace afnix {

  // -------------------------------------------------------------------------
  // - class section                                                         -
  // -------------------------------------------------------------------------

  // create an empty graph

00033   Graph::Graph (void) {
    p_clo = nilp;
  }

  // create a graph with a client object

00039   Graph::Graph (Object* clo) {
    Object::iref (p_clo = clo);
  }

  // delete this graph

00045   Graph::~Graph (void) {
    Object::dref (p_clo);
  }

  // return the graph class name

00051   String Graph::repr (void) const {
    return "Graph";
  }

  // make this graph a shared object

00057   void Graph::mksho (void) {
    if (p_shared != nilp) return;
    Object::mksho ();
    d_edges.mksho ();
    d_vrtxs.mksho ();
    if (p_clo != nilp) p_clo->mksho ();
  }

  // reset the graph

00067   void Graph::reset (void) {
    wrlock ();
    try {
      ereset ();
      vreset ();
      unlock ();
    } catch (...) {
      unlock ();
      throw;
    }
  }

  // reset all edges in this graph

00081   void Graph::ereset (void) {
    wrlock ();
    try {
      long ne = getne ();
      for (long i = 0; i < ne; i++) {
      Edge* edge = dynamic_cast <Edge*> (d_edges.get (i));
      edge->reset ();
      }
      unlock ();
    } catch (...) {
      unlock ();
      throw;
    }
  }

  // reset all vertices in this graph

00098   void Graph::vreset (void) {
    wrlock ();
    try {
      long nv = getnv ();
      for (long i = 0; i < nv; i++) {
      Vertex* vertex = dynamic_cast <Vertex*> (d_vrtxs.get (i));
      vertex->reset ();
      }
      unlock ();
    } catch (...) {
      unlock ();
      throw;
    }
  }

  // return true if the vertex exists in this graph
  
00115   bool Graph::exists (Vertex* vertex) const {
    rdlock ();
    bool result = d_vrtxs.exists (vertex);
    unlock ();
    return result;
  }

  // return true if the edge exists in this graph
  
00124   bool Graph::exists (Edge* edge) const {
    rdlock ();
    bool result = d_edges.exists (edge);
    unlock ();
    return result;
  }
 
  // add an edge to this graph

00133   void Graph::add (Edge* edge) {
    if (edge == nilp) return;
    wrlock ();
    try {
      if (d_edges.exists (edge) == false) {
      // add the edge
      d_edges.add (edge);
      // collect all vertices and add them
      long nv = edge->cardinality ();
      for (long i = 0; i < nv; i++) add (edge->get (i));
      }
      unlock ();
    } catch (...) {
      unlock ();
      throw;
    }
  }

  // add a vertex to this graph

00153   void Graph::add (Vertex* vertex) {
    if (vertex == nilp) return
    wrlock ();
    try {
      if (d_vrtxs.exists (vertex) == false) {
      // add the vertx
      d_vrtxs.add (vertex);
      // collect all edges and add them
      long ne = vertex->degree ();
      for (long i = 0; i < ne; i++) add (vertex->get (i));
      }
      unlock ();
    } catch (...) {
      unlock ();
      throw;
    }
  }

  // return the number of edges

00173   long Graph::getne (void) const {
    rdlock ();
    long result = d_edges.length ();
    unlock ();
    return result;
  }

  // return the number of vertices

00182   long Graph::getnv (void) const {
    rdlock ();
    long result = d_vrtxs.length ();
    unlock ();
    return result;
  }


  // get an edge by index

00192   Edge* Graph::getedge (const long index) const {
    rdlock ();
    try {
      Edge* edge = dynamic_cast <Edge*> (d_edges.get (index));
      unlock ();
      return edge;
    } catch (...) {
      unlock ();
      throw;
    }
  }

  // get a vertex by index

00206   Vertex* Graph::getvrtx (const long index) const {
    rdlock ();
    try {
      Vertex* vertex = dynamic_cast <Vertex*> (d_vrtxs.get (index));
      unlock ();
      return vertex;
    } catch (...) {
      unlock ();
      throw;
    }
  }

  // set the graph client object

00220   void Graph::setclo (Object* clo) {
    wrlock ();
    if (p_clo != clo) {
      Object::dref (p_clo);
      Object::iref (p_clo = clo);
      if (p_shared != nilp) p_clo->mksho ();
    }
    unlock ();
  }

  // get the graph client object

00232   Object* Graph::getclo (void) const {
    rdlock ();
    Object* clo = p_clo;
    unlock ();
    return clo;
  }

  // -------------------------------------------------------------------------
  // - object section                                                        -
  // -------------------------------------------------------------------------

  // the quark zone
  static const long QUARK_ZONE_LENGTH = 11;
  static QuarkZone  zone (QUARK_ZONE_LENGTH);

  // the graph supported quarks
  static const long QUARK_ADD     = zone.intern ("add");
  static const long QUARK_RESET   = zone.intern ("reset");
  static const long QUARK_ERESET  = zone.intern ("reset-edges");
  static const long QUARK_VRESET  = zone.intern ("reset-vertices");
  static const long QUARK_EXISTS  = zone.intern ("exists");
  static const long QUARK_NEDGES  = zone.intern ("number-of-edges");
  static const long QUARK_NVRTXS  = zone.intern ("number-of-vertices");
  static const long QUARK_GETCLO  = zone.intern ("get-client");
  static const long QUARK_SETCLO  = zone.intern ("set-client");
  static const long QUARK_GETEDGE = zone.intern ("get-edge");
  static const long QUARK_GETVRTX = zone.intern ("get-vertex");

  // create a new object in a generic way

00262   Object* Graph::mknew (Vector* argv) {
    long argc = (argv == nilp) ? 0 : argv->length ();
    if (argc == 0) return new Graph;
    if (argc == 1) return new Graph (argv->get (0));
    throw Exception ("argument-error", "too many arguments to create graph");
  }

  // return true if the given quark is defined

00271   bool Graph::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 this object with a set of arguments and a quark
  
00284   Object* Graph::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_NEDGES) return new Integer (getne ());
      if (quark == QUARK_NVRTXS) return new Integer (getnv ());
      if (quark == QUARK_RESET) {
      reset ();
      return nilp;
      }
      if (quark == QUARK_ERESET) {
      ereset ();
      return nilp;
      }
      if (quark == QUARK_VRESET) {
      vreset ();
      return nilp;
      }
      if (quark == QUARK_GETCLO) {
      rdlock ();
      Object* result = getclo ();
      robj->post (result);
      unlock ();
      return result;
      }
    }

    // dispatch 1 argument
    if (argc == 1) {
      if (quark == QUARK_ADD) {
      Edge* edge = dynamic_cast <Edge*> (argv->get (0));
      if (edge != nilp) {
        add (edge);
        robj->post (edge);
        return edge;
      }
      Vertex* vertex = dynamic_cast <Vertex*> (argv->get (0));
      if (vertex != nilp) {
        add (vertex);
        robj->post (vertex);
        return vertex;
      }
      throw Exception ("type-error", "invalid object to add to graph");
      }
      if (quark == QUARK_EXISTS) {
      Object* obj = argv->get (0);
      // check for edge
      Edge* edge = dynamic_cast <Edge*> (obj);
      if (edge != nilp) return new Boolean (exists (edge));
      // check for vertex
      Vertex* vertex = dynamic_cast <Vertex*> (obj);
      if (vertex != nilp) return new Boolean (exists (vertex));
      // type error
      throw Exception ("type-error", "invalid object to check in graph",
                   Object::repr (obj));
      }
      if (quark == QUARK_GETEDGE) {
      long index = argv->getint (0);
      rdlock ();
      try {
        Edge* edge = getedge (index);
        robj->post (edge);
        unlock ();
        return edge;
      } catch (...) {
        unlock ();
        throw;
      }
      }
      if (quark == QUARK_GETVRTX) {
      long index = argv->getint (0);
      rdlock ();
      try {
        Vertex* vertex = getvrtx (index);
        robj->post (vertex);
        unlock ();
        return vertex;
      } catch (...) {
        unlock ();
        throw;
      }
      }
      if (quark == QUARK_SETCLO) {
      Object* result = argv->get (0);
      setclo (result);
      robj->post (result);
      return result;
      }
    }
    // call the object method
    return Object::apply (robj, nset, quark, argv);
  }
}

Generated by  Doxygen 1.6.0   Back to index