/Users/jst/src/grafalgo/cpp/include/HashMap.h

Go to the documentation of this file.

#ifndef HASHMAP_H
#define HASHMAP_H

#include "stdinc.h"
#include "Adt.h"
#include "HashTbl.h"
#include "SetPair.h"

namespace grafalgo {

class HashMap : public Adt {
public:
                HashMap(int);
                ~HashMap();

        // common methods
        void    clear();        
        void    resize(int);    
        void    expand(int);    
        void    copyFrom(const HashMap&);

        // methods for accessing pairs by index
        index   firstPair() const;
        index   nextPair(index) const;
        uint64_t key(index) const;
        int     val(index) const;

        // modifiers
        int     get(uint64_t) const;            
        bool    put(uint64_t, int); 
        void    remove(uint64_t);       

        string& toString(string&) const;
private:
        int     *values;                
        HashTbl *ht;                    
        SetPair *kvx;                   

        void makeSpace(int);
        void freeSpace();
};

inline index HashMap::firstPair() const { return kvx->firstIn(); }

inline index HashMap::nextPair(index x) const { return kvx->nextIn(x); }

inline uint64_t HashMap::key(index x) const { return ht->getKey(x); }

inline int HashMap::val(index x) const { return values[x]; }

inline int HashMap::get(uint64_t key) const {
        index x = ht->lookup(key); return (x == 0 ? 0 : values[x]);
}

inline bool HashMap::put(uint64_t key, int value) {
        index x = ht->lookup(key);
        if (x != 0) { values[x] = value; return true; }
        x = kvx->firstOut(); if (x == 0) return false;
        if (!ht->insert(key,x)) return false;
        kvx->swap(x); values[x] = value;
        return true;
}

inline void HashMap::remove(uint64_t key) {
        index x = ht->remove(key); if (x != 0) kvx->swap(x);
}

} // ends namespace

#endif