Home

Template-Spaß!

Montag, 26. Mai 2008 | Autor:

Feh­ler­mel­dun­gen in Pro­gram­men mit Tem­pla­tes: Exakt, aber unlesbar:

test.cpp:81: Feh­ler: no match für »ope­ra­tor=« in »path.std::map<_Key, _Tp, _Compare, _Alloc>::operator[] [with _Key = std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, _Tp = std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Compare = std::less<std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Alloc = std::allocator<std::pair<const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > > > >](((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >&)((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >*)(& prev_path)))) = ((std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >*)path.std::map<_Key, _Tp, _Compare, _Alloc>::operator[] [with _Key = std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, _Tp = std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Compare = std::less<std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Alloc = std::allocator<std::pair<const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > > > >](((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >&)((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >*)(& new_first)))))->std::vector<_Tp, _Alloc>::insert [with _InputIterator = __gnu_cxx::__normal_iterator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>*, std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > > >, _Tp = graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, _Alloc = std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >](((std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >*)path.std::map<_Key, _Tp, _Compare, _Alloc>::operator[] [with _Key = std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, _Tp = std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Compare = std::less<std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Alloc = std::allocator<std::pair<const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > > > >](((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >&)((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >*)(& prev_path)))))->std::vector<_Tp, _Alloc>::end [with _Tp = graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, _Alloc = std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >](), ((std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >*)path.std::map<_Key, _Tp, _Compare, _Alloc>::operator[] [with _Key = std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, _Tp = std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Compare = std::less<std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Alloc = std::allocator<std::pair<const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > > > >](((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >&)((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >*)(& new_second)))))->std::vector<_Tp, _Alloc>::begin [with _Tp = graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, _Alloc = std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >](), ((std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >*)path.std::map<_Key, _Tp, _Compare, _Alloc>::operator[] [with _Key = std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, _Tp = std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Compare = std::less<std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > >, _Alloc = std::allocator<std::pair<const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >, std::vector<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> > > > >](((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >&)((const std::pair<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >*)(& new_second)))))->std::vector<_Tp, _Alloc>::end [with _Tp = graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX>, _Alloc = std::allocator<graph::priv::Iterator<graph::priv::NodeFunc, graph::Graph<void, void, false>, VERTEX> >]())«

Falls es jeman­den inter­es­siert: Das Ding ist 9783 Zei­chen lang.

Tags »

Trackback: Trackback-URL |  Feed zum Beitrag: RSS 2.0
Thema: Programmieren

Diesen Beitrag kommentieren.

Kommentar abgeben