src/lib/util/state/stateout.h

//
// stateout.h
//
// Copyright (C) 1998 Limit Point Systems, Inc.
//
// Author: Curtis Janssen <cljanss@limitpt.com>
// Maintainer: LPS
//
// This file is part of the SC Toolkit.
//
// The SC Toolkit is free software; you can redistribute it and/or modify
// it under the terms of the GNU Library General Public License as published by
// the Free Software Foundation; either version 2, or (at your option)
// any later version.
//
// The SC Toolkit 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 Library General Public License for more details.
//
// You should have received a copy of the GNU Library General Public License
// along with the SC Toolkit; see the file COPYING.LIB.  If not, write to
// the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
//
// The U.S. Government is granted a limited license as per AL 91-7.
//

#ifndef _util_state_stateout_h
#define _util_state_stateout_h

#ifdef __GNUC__
#pragma interface
#endif

#include <string>
#include <vector>
#include <map>

#include <util/class/class.h>
#include <util/state/state.h>

namespace sc {

  namespace detail {
    template <typename T> struct ToStateOut;
  }

class StateOutData {
  public:
    int num;
    int size;
    int type;
    int offset;

    StateOutData(): num(0), size(0), type(0), offset(0) {}
};

class StateOut: public DescribedClass {
    friend class SavableState;
    friend class TranslateDataOut;
  private:
    // do not allow copy constructor or assignment
    StateOut(const StateOut&);
    void operator=(const StateOut&);
    int have_cd_;
  protected:
    int dir_loc_loc_;
    TranslateDataOut *translate_;
    int copy_references_;
    int next_object_number_;
    std::map<Ref<SavableState>,StateOutData> ps_;
    std::map<ClassDescP,int> classidmap_;
    int nextclassid_;
    int node_to_node_;
    virtual int put_array_void(const void*,int);
    virtual int putparents(const ClassDesc*);

    void put_directory();

    // The following members are called by friend SavableState

    void have_classdesc() { have_cd_ = 1; }
    int need_classdesc() { int tmp = have_cd_; have_cd_ = 0; return !tmp; }

    virtual int putobject(const Ref<SavableState> &);

    virtual int put(const ClassDesc*);
  public:
    StateOut();
    virtual ~StateOut();

    virtual void put_header();

    virtual int putstring(const char*);

    virtual int put(const std::string &);

    virtual int put(char r);
    virtual int put(unsigned int r);
    virtual int put(int r);
    virtual int put(bool r);
    virtual int put(unsigned long r);
    virtual int put(long r);
    virtual int put(float r);
    virtual int put(double r);
    virtual int put(const char*,int);
    virtual int put(const unsigned int*,int);
    virtual int put(const int*,int);
    virtual int put(const unsigned long*,int);
    virtual int put(const long*,int);
    virtual int put(const float*,int);
    virtual int put(const double*,int);
    virtual int put_array_char(const char*p,int size);
    virtual int put_array_uint(const unsigned int*p,int size);
    virtual int put_array_int(const int*p,int size);
    virtual int put_array_ulong(const unsigned long*p,int size);
    virtual int put_array_long(const long*p,int size);
    virtual int put_array_float(const float*p,int size);
    virtual int put_array_double(const double*p,int size);

    template <class T>
    int put(typename std::vector<T> &v) {
      const size_t l = v.size();
      int r = put(l);
      if (l) { for (size_t i=0; i<l; ++i) detail::ToStateOut<T>::put(v[i],*this,r); }
      return r;
    }

    template <typename Key, typename Value>
    int put(const std::map<Key,Value>& map) {
      typedef std::map<Key,Value> Map;
      const size_t size = map.size();
      int r = put(size);
      if (size) {
        typedef typename Map::const_iterator citer;
        const citer end = map.end();
        for(citer i=map.begin(); i!=end; ++i) {
          r += put(*i);
        }
      }
      return r;
    }

    template <typename L, typename R>
    int put(const std::pair<L,R>& v) {
      int s = 0;
      detail::ToStateOut<L>::put(v.first,*this,s);
      detail::ToStateOut<R>::put(v.second,*this,s);
      return s;
    }

    void forget_references();
    void copy_references();

    virtual int use_directory();

    virtual void flush();

    int node_to_node() const { return node_to_node_; }

    virtual int tell();
    virtual void seek(int loc);
    virtual int seekable();
  };

  class RefSCMatrix;
  class RefSymmSCMatrix;
  class RefDiagSCMatrix;

  namespace detail {
    template <typename T> struct ToStateOut {
      static void put(const T& t, StateOut& so, int& count) {
        count += so.put(t);
      }
    };
    template <typename T> struct ToStateOut< sc::Ref<T> > {
      static void put(const Ref<T>& t, StateOut& so, int& count) {
        SavableState::save_state(t.pointer(),so);
      }
    };
    template <> struct ToStateOut<sc::RefSCMatrix> {
      static void put(const sc::RefSCMatrix& t, StateOut& so, int& count);
    };
    template <> struct ToStateOut<sc::RefSymmSCMatrix> {
      static void put(const sc::RefSymmSCMatrix& t, StateOut& so, int& count);
    };
    template <> struct ToStateOut<sc::RefDiagSCMatrix> {
      static void put(const sc::RefDiagSCMatrix& t, StateOut& so, int& count);
    };
  }

}

#endif

// Local Variables:
// mode: c++
// c-file-style: "CLJ"
// End:

---