Subversion Repositories openrisc

// { dg-do assemble  }

#include

#include

#include

#include

using namespace std;

// empty parameter class with a minimal set of operations

// if there are no weights for edges necessary

struct Empty

{

  public:

    Empty(int=0) {}

    bool operator<(const Empty&) const { return true;}

};

inline ostream& operator<<(ostream& os, const Empty&) { return os;}

inline istream& operator>>(istream& is, Empty& ) { return is;}

template

class Graph                     // { dg-message "note" } candidates

{

  public:

    // public type interface

    typedef std::map Successor;

    typedef std::pair vertex;

    typedef std::vector GraphType;

    typedef typename GraphType::iterator iterator;

    typedef typename GraphType::const_iterator const_iterator;

  // a lot of stuff deleted ....

  private:

    bool directed;

    GraphType C;          // container

    ostream* pOut;

};

// all graph-methods delet

template

ostream& operator<<(ostream& os, Graph& G)

{

    // display of vertices with successors

  for(int i = 0; i < G.size(); ++i)  // { dg-error "no member" } no size function

    {

      os << G[i].first << " <";      // { dg-error "no match" } no index operator

        // The compiler does not like this line!!!!!!

        typename Graph::Successor::iterator

          startN = G[i].second.begin(), // { dg-error "no match" } no index operator

          endN   = G[i].second.end();  // { dg-error "no match" } no index operator

        while(startN != endN)

        {

            os << G[(*startN).first].first << ' ' // { dg-error "no match" } no index operator

               << (*startN).second << ' ';

            ++startN;

        }

        os << ">\n";

    }

    return os;

}

int main()

{

    // no edge weighting, therefore type Empty:

    Graph V(true);        // { dg-error "no match" } no bool constructor

    // { dg-message "candidate" "candidate note" { target *-*-* } 68 }

    // ReadGraph(V, "gra1.dat");

    // display of vertices with successors

    cout << V;

}