ids.hpp

/*
 * ids.hpp
 *
 *  Created on: Mar 1, 2016
 *      Author: i-bird
 */

#ifndef SRC_GRAPH_IDS_HPP_
#define SRC_GRAPH_IDS_HPP_

struct rid
{
    idx_t id;

    rid(size_t id)
    :id(id)
    {}

    rid()
    :id(0)
    {}

    inline bool operator<=(const rid & r) const
    {
        return id <= r.id;
    }

    inline bool operator<(const rid & r) const
    {
        return id < r.id;
    }

    inline rid operator-(int i) const
    {
        struct rid tmp;
        tmp.id = id - i;
        return tmp;
    }

    inline rid operator-(struct rid i) const
    {
        struct rid tmp;
        tmp.id = id - i.id;
        return tmp;
    }

    inline rid operator+(int i) const
    {
        struct rid tmp;
        tmp.id = id + i;
        return tmp;
    }

    inline rid & operator+=(const rid & i)
    {
        id += i.id;
        return *this;
    }

    inline rid & operator++()
    {
        id++;

        return *this;
    }

    inline bool operator==(const rid & r) const
    {
        return id == r.id;
    }
};

struct gid
{
    size_t id;

    gid(){};

    gid(size_t id)
    :id(id)
    {}
};

struct lid
{
    size_t id;
};

// define hash map for gid rid and lid

namespace std
{
    template <>
    struct hash<rid>
    {
        inline std::size_t operator()(const rid& k) const
        {
            return k.id;
        }
    };

    template <>
    struct hash<gid>
    {
        inline std::size_t operator()(const gid& k) const
        {
            return k.id;
        }
    };

    template <>
    struct hash<lid>
    {
        inline std::size_t operator()(const lid& k) const
        {
            return k.id;
        }
    };

}


#endif /* SRC_GRAPH_IDS_HPP_ */