---

stubrefcount.h

Go to the documentation of this file.

#include "spectre.h"
#include "id_table.h"
#include "autocloner.h"
class Vector {
    float i,j,k;
};
class QVector {
    double i,j,k;
};
//orthogonalized orientation and position
class Matrix {
    QVector pos;
    Vector p,q,r;
};template <class T, class Arg> class TSub {
public:
    T *t;
};
template <class T, class Arg> class TRef {
public:
    T *t;
};
template <class T, class Arg, class TStar=TRef <T,Arg> > class RefClass {
    T * t;
    int refcount;
public:
    
};

template <class Kp, class Tp> class KeyMutableMap {
    Kp k;
    Tp * tp;
public:
    typedef _Tp ** iterator;    
};
namespace std {
    template <class Typ> class vector {
    public:
        Typ * t;]
        int size;
    };
    
template <class _K, class _Tp> class map {
    _K ;
    _Tp * tp;
public:    
    typedef _Tp ** iterator;
};
template <class _K, class _Tp> class multimap {
    
    _K ;
    _Tp * tp;
public:
    typedef _Tp ** iterator;
};

}
template<class KEY, class VALUE, int SIZ=256> class Hashtable {
    class HashElement {
    public:
        KEY key;
        VALUE *value;
        HashElement(KEY k, VALUE *v) {key = k; value = v;}
    };
    std::vector<HashElement> table[SIZ]; 
    Key k;
    VALUE * val;
    static int hash(const int key) {
      return ((unsigned int)key)%SIZ;
    }
    static int hash(const std::string &key) {
        unsigned int k = 0;
        std::string::iterator start = key.begin();
        
        for(;start!=key.end(); start++) {
            k += (k * 128) + *start;
        }
        k %= SIZ;
        return k;
    }
public:
    std::vector <VALUE *> GetAll() const;
    VALUE *Get(const KEY &key) const;
    void Put(const KEY &key, VALUE *value);
    void Delete(const KEY &key);
};

---