---

ExprHashtable.h

Go to the documentation of this file.

#ifndef EXPRHASHTABLE_H
#define EXPRHASHTABLE_H

#include "SundanceDefs.h"

#include "ExprArray.h"
#include <string>
#include "TSFHashtable.h"
#include "TSFQueue.h"


namespace Sundance
{

  using namespace TSF;
  using std::string;

  using std::ostream;

  class ExprHashtable
    {
    public:
      /**
       * Create an empty ExprHashtable
       */
      ExprHashtable(int capacity=101);

      bool containsKey(const string& key) const ;

      /**
       * Get the value indexed by key
       */
      const Expr& get(const string& key) const ;
      /**
       * Put a new (key, value) pair in the table.
       */
      void put(const string& key, const Expr& value);

      /**
       * Remove from the table the element given by key.
       */
      void remove(const string& key);

      /**
       * Get the number of elements in the table
       */
      int size() const ;

      void print(ostream& os) const ;

      /**
       * Write contents to a string
       */
      string toString() const ;

      /**
       * Test for equality with another hashtable
       */
      bool operator==(const ExprHashtable& other) const ;

      /**
       * Test relative ordering with another hashtable
       */
      bool operator<(const ExprHashtable& other) const ;



      /**
       * Get a sorted list of all unknown and variational functions
       */
      void getUnksAndVars(Expr& unk, Expr& var);

      /** return a list of key strings */
      TSFArray<string> getKeys() const ;

    private:
      TSFHashtable<string, int> indices_;
      TSFQueue<int> recycledIndices_;
      ExprArray exprs_;
    };

  inline ostream& operator<<(ostream& os, ExprHashtable& h)
    {
      h.print(os);
      return os;
    }


}
#endif

---

Contact:

Kevin Long (krlong@ca.sandia.gov)


Documentation generated by