Home Research Papers Posters Manuals Talks Download People Help Internal

util/spanningTreeVertex.h

Go to the documentation of this file.

#ifndef SPANNING_TREE_VERTEX
#define SPANNING_TREE_VERTEX

namespace topo {

typedef int vtxType;

class SpanningTreeVertex
{
    public:
        vtxType id;
        // vtxType parent;
        std::vector<int> X;
        std::vector<int> childIndex;
        SpanningTreeVertex(const vtxType _id=-1): id(_id) {}

    inline friend bool operator== (const SpanningTreeVertex &obj, const vtxType vtxID)
    { return (obj.id == vtxID); }

    inline friend bool operator== (const vtxType vtxID, const SpanningTreeVertex &obj)
    { return (obj.id == vtxID); }

    inline friend bool operator< (const SpanningTreeVertex &obj, const vtxType vtxID)
    { return (obj.id < vtxID); }

    inline friend bool operator< (const vtxType vtxID, const SpanningTreeVertex &obj)
    { return (vtxID < obj.id); }

    friend std::ostream& operator<< (std::ostream &out, const SpanningTreeVertex &obj)
    {
        out<<" "<<obj.id;
        if (obj.X.size()>0)
        {
            out<<"("<<obj.X[0];
            for (int i=1,cSize=obj.X.size(); i<cSize; i++)
                out<<","<<obj.X[i];
            out<<") ";
        }
        return out;
    }
};

inline int getProcID(const vtxType vtx) { return vtx; }
inline int getProcID(const SpanningTreeVertex &vtx) { return vtx.id; }

inline int numHops(const SpanningTreeVertex &vtx1, const SpanningTreeVertex &vtx2)
{
    //CkAssert(vtx1.X.size() == vtx2.X.size());

    int nHops = 0;
    for (int i=0, nDims=vtx1.X.size(); i<nDims; i++)
        nHops += abs( vtx1.X[i] - vtx2.X[i] );
    return nHops;
}



template <typename Iterator>
inline Iterator pickClosest(const SpanningTreeVertex &parent, const Iterator start, const Iterator end)
{
    Iterator itr     = start;
    Iterator closest = itr++;
    int      minHops = numHops(parent,*closest); // aTopoMgr.getHopsBetweenRanks( parentPE, (*closest).id );
    for (; itr != end; itr++)
    {
        int hops = numHops(parent,*itr); //aTopoMgr.getHopsBetweenRanks( parentPE, (*itr).id );
        if (hops < minHops)
        {
            closest = itr;
            minHops = hops;
        }
    }
    return closest;
}

} // end namespace topo

#endif // SPANNING_TREE_VERTEX

---