This is the mail archive of the
gcc-bugs@gcc.gnu.org
mailing list for the GCC project.
LEDA compilation problem
- To: egcs-bugs at cygnus dot com
- Subject: LEDA compilation problem
- From: Zdenek Kabelac <kabi at informatics dot muni dot cz>
- Date: Wed, 30 Sep 1998 13:58:57 +0200 (CEST)
Hi
This appeared on my screen - so here is my bug-report:
make[1]: Entering directory `/var/tmp/LEDA/LEDA-3.7.1-linux-egcs-1.1/demo/graph'
g++ -O -I../../incl -c git_demo.c
../../incl/LEDA/graph_iterator.h: In function `void GIT_dfs_list<leda_stack<OutAdjIt>, node_array_da<bool>, leda_list<node_struct *>, OutAdjIt>(const class leda_stack<OutAdjIt> &, struct node_array_da<bool> &, class leda_list<node_struct *> &, class OutAdjIt)':
../../incl/LEDA/graph_iterator.h:6367: instantiated from here
In file included from git_demo.c:13:
../../incl/LEDA/graph_iterator.h:5040: Internal compiler error.
../../incl/LEDA/graph_iterator.h:5040: Please submit a full bug report to `egcs-bugs@cygnus.com'.
make[1]: [git_demo] Error 1 (ignored)
LEDA was downloaded from:
http://www.mpi-sb.mpg.de/LEDA/leda.html
egcs on my Debian slink system is
egcc 2.91.57-3 (1.1b)
this is the place around the line 5050
/*{\Mimplementation
Each operation requires constant time.
Therefore, a normal depth-first search needs
${\cal O}(m+n)$ time.
}*/
template<class Stacktype, class Mark, class List, class OutAdjIt>
inline void GIT_dfs_list(const Stacktype& st, Mark& ma, List& vlist, OutAdjIt ai)
{
GIT_DFS<OutAdjIt,Stacktype,Mark> _dfs(st,ma);
_dfs.stack().clear(); **** This is the line 5040
if (get(ma,ai)!=true) _dfs.init(ai);
while (!_dfs.stack().empty()) {
vlist.push(_dfs.current());
_dfs.next_unseen();
}
};
--
Odstranite-li ve Windows95 vsechny chyby
budete mit prazdny disk
Zdenek Kabelac http://www.fi.muni.cz/~kabi/ kabi@fi.muni.cz