X-Git-Url: https://oss.titaniummirror.com/gitweb?a=blobdiff_plain;f=gcc%2Ftestsuite%2Fg%2B%2B.old-deja%2Fg%2B%2B.robertl%2Feb109.C;fp=gcc%2Ftestsuite%2Fg%2B%2B.old-deja%2Fg%2B%2B.robertl%2Feb109.C;h=0000000000000000000000000000000000000000;hb=6fed43773c9b0ce596dca5686f37ac3fc0fa11c0;hp=7a7c56cd34f9a81ec803b9fc1622a5ffb072cc21;hpb=27b11d56b743098deb193d510b337ba22dc52e5c;p=msp430-gcc.git

diff --git a/gcc/testsuite/g++.old-deja/g++.robertl/eb109.C b/gcc/testsuite/g++.old-deja/g++.robertl/eb109.C
deleted file mode 100644
index 7a7c56cd..00000000
--- a/gcc/testsuite/g++.old-deja/g++.robertl/eb109.C
+++ /dev/null
@@ -1,73 +0,0 @@
-#include<map>
-#include<iostream>
-#include<vector>
-#include<string>
-
-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 VertexType, class EdgeType>
-class Graph
-{  // ERROR - candidates
-  public:
-    // public type interface
-    typedef std::map<int, EdgeType > Successor;
-    typedef std::pair<VertexType, Successor> vertex;
-    typedef std::vector<vertex> 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<class VertexType, class EdgeType>
-ostream& operator<<(ostream& os, Graph<VertexType,EdgeType>& G)
-{
-    // display of vertices with successors
-  for(int i = 0; i < G.size(); ++i)  // ERROR - no size function
-    {
-      os << G[i].first << " <";      // ERROR - no index operator
-
-        // The compiler does not like this line!!!!!!
-        typename Graph<VertexType, EdgeType>::Successor::iterator
-	  startN = G[i].second.begin(), // ERROR - no index operator
-	  endN   = G[i].second.end();  // ERROR - no index operator
-
-        while(startN != endN)
-        {
-            os << G[(*startN).first].first << ' ' // ERROR - no index operator
-               << (*startN).second << ' ';
-            ++startN;
-        }
-        os << ">\n";
-    }
-    return os;
-}
-
-int main()
-{
-    // no edge weighting, therefore type Empty:
-    Graph<std::string, Empty> V(true);        // ERROR - no bool constructor
-    // ReadGraph(V, "gra1.dat");
-
-    // display of vertices with successors
-    cout << V;
-
-}