From: "Alpár Jüttner" <alpar@cs.elte.hu>
To: "André Pönitz" <apoenitz@trolltech.com>
Cc: gdb@sourceware.org
Subject: Re: Move GDB to C++ ?
Date: Thu, 31 Jul 2008 10:07:00 -0000 [thread overview]
Message-ID: <1217497386.4594.14.camel@piko.site> (raw)
In-Reply-To: <200807311042.41954.apoenitz@trolltech.com>
[-- Attachment #1: Type: text/plain, Size: 641 bytes --]
Hi,
> Well, at the time I started coding (and probably yours, too ;-)),
> compiler were considered "user friendly" when they did not just
> abort on faulty input but were so nice and gave the number of
> the problematic line, too. (a) one gets used to it, and (b) it's
> far more convienient nowadays. Especially gcc is pretty good
> at pointing out possible reasons _why_ compilation failed.
Understanding the error message of g++ is sometimes a kind of horror,
indeed. See the attached error message for a "nice" example. Luckily,
this is again something that is only a problem when templates are
extensively used.
Best regards,
Alpar
[-- Attachment #2: g++-log.txt --]
[-- Type: text/plain, Size: 17019 bytes --]
-*- mode: compilation; default-directory: "~/projects/ETIK/hugo_loc/work/deba/" -*-
Compilation started at Mon Nov 28 07:14:16
g++ -I/home/alpar/projects/ETIK/hugo preflow-matching.cpp
preflow-matching.h: In function 'int lemon::_maxMatchingB_init(const Graph&, MT&, typename Graph::LowerNodeMap<int>&, typename Graph::LowerNodeMap<int>&, int&) [with Graph = lemon::SmartUndirBipartiteGraph, MT = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::UpperNodeMap<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>]':
preflow-matching.h:165: instantiated from 'int lemon::maxMatchingB(const Graph&, MT&) [with Graph = lemon::SmartUndirBipartiteGraph, MT = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::UpperNodeMap<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>]'
preflow-matching.h:143: instantiated from 'int lemon::maxMatchingB(const Graph&) [with Graph = Graph]'
preflow-matching.cpp:241: instantiated from here
preflow-matching.h:99: error: no match for 'operator=' in '(+ matching)->lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::UpperNodeMap<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>::<anonymous>.lemon::IterableMapExtender<lemon::DefaultMap<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge> >::<anonymous>.lemon::DefaultMap<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>::<anonymous>.lemon::ArrayMap<_Graph, _Item, _Value>::operator[] [with _Graph = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, _Item = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, _Value = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge](((const lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode&)(& lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode(((const lemon::SmartUndirBipartiteGraphBase::Node&)((const lemon::SmartUndirBipartiteGraphBase::Node*)(& n.lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > >::UpperNodeIt::<anonymous>))))))) = lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > >::IncEdgeIt(((const lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > >&)(&(+ g)->lemon::SmartUndirBipartiteGraph::<anonymous>.lemon::ClearableUndirBipartiteGraphExtender<lemon::ExtendableUndirBipartiteGraphExtender<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > > > >::<anonymous>.lemon::ExtendableUndirBipartiteGraphExtender<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > > >::<anonymous>.lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::<anonymous>)), ((const lemon::SmartUndirBipartiteGraphBase::Node&)((const lemon::SmartUndirBipartiteGraphBase::Node*)(& n.lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > >::UpperNodeIt::<anonymous>))))'
/home/alpar/projects/ETIK/hugo/lemon/bits/graph_extender.h:428: note: candidates are: lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge& lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge::operator=(const lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge&)
preflow-matching.h: In function 'int lemon::_maxMatchingB(const Graph&, MT&, typename Graph::LowerNodeMap<int>&, typename Graph::LowerNodeMap<int>&, int) [with Graph = lemon::SmartUndirBipartiteGraph, MT = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::UpperNodeMap<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>]':
preflow-matching.h:167: instantiated from 'int lemon::maxMatchingB(const Graph&, MT&) [with Graph = lemon::SmartUndirBipartiteGraph, MT = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::UpperNodeMap<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>]'
preflow-matching.h:143: instantiated from 'int lemon::maxMatchingB(const Graph&) [with Graph = Graph]'
preflow-matching.cpp:241: instantiated from here
preflow-matching.h:54: error: dependent-name 'lemon::IterableBoolNodeMap<Graph>::TrueIt' is parsed as a non-type, but instantiation yields a type
preflow-matching.h:54: note: say 'typename lemon::IterableBoolNodeMap<Graph>::TrueIt' if a type is meant
preflow-matching.h:74: error: no match for 'operator=' in '(+ matching)->lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::UpperNodeMap<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>::<anonymous>.lemon::IterableMapExtender<lemon::DefaultMap<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge> >::<anonymous>.lemon::DefaultMap<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>::<anonymous>.lemon::ArrayMap<_Graph, _Item, _Value>::operator[] [with _Graph = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, _Item = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, _Value = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge](((const lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode&)(& lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode(((const lemon::SmartUndirBipartiteGraphBase::Node&)((const lemon::SmartUndirBipartiteGraphBase::Node*)(&(+ g)->lemon::SmartUndirBipartiteGraph::<anonymous>.lemon::ClearableUndirBipartiteGraphExtender<lemon::ExtendableUndirBipartiteGraphExtender<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > > > >::<anonymous>.lemon::ExtendableUndirBipartiteGraphExtender<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > > >::<anonymous>.lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::<anonymous>.lemon::IterableUndirBipartiteGraphExtender<_Base>::runningNode [with _Base = lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> >](((const lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > >::IncEdgeIt&)((const lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > >::IncEdgeIt*)(& bedge))))))))))) = bedge'
/home/alpar/projects/ETIK/hugo/lemon/bits/graph_extender.h:428: note: candidates are: lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge& lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge::operator=(const lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge&)
preflow-matching.h:82: error: no match for 'operator[]' in 'cov[(+ matching)->lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::UpperNodeMap<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>::<anonymous>.lemon::IterableMapExtender<lemon::DefaultMap<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge> >::<anonymous>.lemon::DefaultMap<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>::<anonymous>.lemon::ArrayMap<_Graph, _Item, _Value>::operator[] [with _Graph = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, _Item = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, _Value = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge](((const lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode&)(& lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode(((const lemon::SmartUndirBipartiteGraphBase::Node&)((const lemon::SmartUndirBipartiteGraphBase::Node*)(& n.lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > >::UpperNodeIt::<anonymous>)))))))]'
/home/alpar/projects/ETIK/hugo/lemon/bits/vector_map.h:154: note: candidates are: typename std::vector<_Value, std::allocator<_Tp> >::reference lemon::VectorMap<_Graph, _Item, _Value>::operator[](const _Item&) [with _Graph = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, _Item = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::LowerNode, _Value = int]
/home/alpar/projects/ETIK/hugo/lemon/bits/vector_map.h:162: note: typename std::vector<_Value, std::allocator<_Tp> >::const_reference lemon::VectorMap<_Graph, _Item, _Value>::operator[](const _Item&) const [with _Graph = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, _Item = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::LowerNode, _Value = int]
preflow-matching.h:83: error: no match for 'operator[]' in 'cov[(+ matching)->lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >::UpperNodeMap<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>::<anonymous>.lemon::IterableMapExtender<lemon::DefaultMap<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge> >::<anonymous>.lemon::DefaultMap<lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge>::<anonymous>.lemon::ArrayMap<_Graph, _Item, _Value>::operator[] [with _Graph = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, _Item = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode, _Value = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::Edge](((const lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode&)(& lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::UpperNode(((const lemon::SmartUndirBipartiteGraphBase::Node&)((const lemon::SmartUndirBipartiteGraphBase::Node*)(& n.lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > >::UpperNodeIt::<anonymous>)))))))]'
/home/alpar/projects/ETIK/hugo/lemon/bits/vector_map.h:154: note: candidates are: typename std::vector<_Value, std::allocator<_Tp> >::reference lemon::VectorMap<_Graph, _Item, _Value>::operator[](const _Item&) [with _Graph = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, _Item = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::LowerNode, _Value = int]
/home/alpar/projects/ETIK/hugo/lemon/bits/vector_map.h:162: note: typename std::vector<_Value, std::allocator<_Tp> >::const_reference lemon::VectorMap<_Graph, _Item, _Value>::operator[](const _Item&) const [with _Graph = lemon::MappableUndirBipartiteGraphExtender<lemon::IterableUndirBipartiteGraphExtender<lemon::AlterableUndirBipartiteGraphExtender<lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase> > > >, _Item = lemon::UndirBipartiteGraphExtender<lemon::SmartUndirBipartiteGraphBase>::LowerNode, _Value = int]
Compilation exited abnormally with code 1 at Mon Nov 28 07:14:18
next prev parent reply other threads:[~2008-07-31 9:43 UTC|newest]
Thread overview: 128+ messages / expand[flat|nested] mbox.gz Atom feed top
2008-07-10 18:46 Stan Shebs
2008-07-10 19:01 ` Mark Kettenis
2008-07-10 20:01 ` Stan Shebs
2008-07-10 20:04 ` Paul Koning
2008-07-10 20:40 ` Andrew Cagney
2008-07-10 21:31 ` Stan Shebs
2008-07-10 22:30 ` Nick Roberts
2008-07-10 23:49 ` Stan Shebs
2008-07-11 6:14 ` Vladimir Prus
2008-07-11 12:40 ` Andrew Cagney
2008-07-11 12:23 ` Robert Dewar
2008-07-11 16:03 ` Dave Korn
2008-07-10 21:54 ` Mark Kettenis
2008-07-11 6:26 ` Joel Brobecker
2008-07-11 8:55 ` Vladimir Prus
2008-07-11 9:23 ` Andreas Schwab
2008-07-11 9:32 ` Vladimir Prus
2008-07-11 14:27 ` Andrew Cagney
2008-07-11 14:34 ` Daniel Jacobowitz
2008-07-11 14:54 ` Paul Koning
2008-07-11 15:30 ` Pedro Alves
2008-07-11 16:09 ` Dave Korn
2008-07-11 16:26 ` Daniel Jacobowitz
2008-07-12 5:41 ` Robert Dewar
2008-07-29 17:29 ` Andrew Cagney
2008-07-29 18:08 ` Vladimir Prus
2008-07-29 18:09 ` Thiago Jung Bauermann
2008-07-29 19:05 ` Andrew Cagney
2008-07-29 19:06 ` Thiago Jung Bauermann
2008-07-29 19:35 ` Thiago Jung Bauermann
2008-07-30 7:18 ` Vladimir Prus
2008-07-30 12:11 ` André Pönitz
2008-07-30 12:35 ` Mark Kettenis
2008-07-30 15:39 ` André Pönitz
2008-07-30 17:52 ` Eli Zaretskii
2008-07-30 17:47 ` Eli Zaretskii
2008-07-29 19:32 ` Eli Zaretskii
2008-07-29 19:45 ` Stan Shebs
2008-07-30 18:18 ` Eli Zaretskii
2008-07-30 19:05 ` Stan Shebs
2008-07-30 19:15 ` Eli Zaretskii
2008-07-30 19:42 ` Stan Shebs
2008-07-31 15:37 ` Andrew Cagney
2008-07-30 19:30 ` Andrew Cagney
2008-07-30 19:56 ` Mark Kettenis
2008-07-31 9:03 ` André Pönitz
2008-07-31 9:33 ` Alpár Jüttner
2008-07-31 10:07 ` Alpár Jüttner [this message]
2008-07-30 5:24 ` Tom Tromey
2008-07-30 18:30 ` Eli Zaretskii
2008-07-30 20:29 ` David Carlton
2008-07-30 20:30 ` Eli Zaretskii
2008-07-30 20:38 ` Eli Zaretskii
2008-07-31 4:52 ` Michael Veksler
2008-07-31 20:03 ` Ian Lance Taylor
2008-07-30 9:25 ` Vladimir Prus
2008-07-30 11:55 ` Salvatore Lionetti
2008-07-30 18:45 ` Eli Zaretskii
2008-07-30 19:19 ` Stan Shebs
2008-07-29 23:59 ` Mark Kettenis
2008-07-10 19:35 ` Jan Kratochvil
2008-07-10 22:41 ` Tom Tromey
2008-07-11 9:57 ` Andrew STUBBS
2008-07-11 11:44 ` Daniel Jacobowitz
2008-07-11 12:43 ` Pierre Muller
2008-07-11 13:14 ` Andrew Cagney
2008-07-13 23:18 ` Tom Tromey
2008-07-14 0:15 ` Nick Roberts
2008-07-14 8:49 ` Vladimir Prus
2008-07-14 13:21 ` Robert Dewar
2008-07-14 15:54 ` Vladimir Prus
2008-07-14 15:58 ` Robert Dewar
2008-07-14 16:03 ` Robert Dewar
2008-07-14 16:23 ` Vladimir Prus
2008-07-14 16:39 ` Robert Dewar
2008-07-14 17:53 ` Vladimir Prus
2008-07-16 19:06 ` Thiago Jung Bauermann
2008-07-14 17:54 ` Mark Kettenis
2008-07-14 16:12 ` Daniel Jacobowitz
2008-07-14 16:15 ` Robert Dewar
2008-07-14 16:18 ` Robert Dewar
2008-07-14 16:21 ` Bob Rossi
2008-07-14 16:31 ` Vladimir Prus
2008-07-14 19:00 ` Tom Tromey
2008-07-12 3:30 ` Michael Snyder
2008-07-14 14:54 ` Andrew Cagney
2008-07-20 14:36 ` Michael Eager
2008-07-31 8:40 ` Vladimir Prus
2008-07-31 14:37 ` Alpár Jüttner
2008-07-31 22:30 ` GDB to C++ issue: deletion Paul Hilfinger
2008-07-31 22:40 ` Daniel Jacobowitz
2008-07-31 22:58 ` Paul Hilfinger
2008-07-31 23:25 ` Daniel Jacobowitz
2008-08-01 5:38 ` Ian Lance Taylor
2008-08-01 8:52 ` André Pönitz
2008-08-01 9:53 ` Eli Zaretskii
2008-08-01 12:57 ` Daniel Jacobowitz
2008-08-01 14:57 ` Paul Koning
2008-08-01 15:31 ` Eli Zaretskii
2008-08-01 13:51 ` André Pönitz
[not found] ` <20080801125124.GA13594@caradoc.them.org>
[not found] ` <uzlnwn9jq.fsf@gnu.org>
2008-08-01 13:59 ` Daniel Jacobowitz
2008-08-01 15:17 ` Eli Zaretskii
2008-08-01 15:29 ` Daniel Jacobowitz
2008-08-01 15:38 ` Eli Zaretskii
2008-08-12 14:40 ` Problem with can_use_hw_breakpoint Jeremy Bennett
2008-08-12 14:51 ` Eli Zaretskii
2008-08-12 14:56 ` Jeremy Bennett
2008-07-31 20:00 ` Move GDB to C++ ? Eli Zaretskii
2008-08-01 13:13 ` Daniel Jacobowitz
2008-08-01 13:47 ` Eli Zaretskii
2008-08-01 14:04 ` André Pönitz
2008-08-01 15:20 ` Eli Zaretskii
2008-08-04 9:34 ` André Pönitz
2008-08-01 14:21 ` Daniel Jacobowitz
2008-08-01 15:23 ` Eli Zaretskii
2008-08-01 16:14 ` Vladimir Prus
2008-08-01 19:20 ` Eli Zaretskii
2008-08-02 5:55 ` Vladimir Prus
2008-08-02 8:07 ` Eli Zaretskii
2008-08-02 9:22 ` Vladimir Prus
2008-08-02 9:47 ` Eli Zaretskii
2008-08-02 10:00 ` Vladimir Prus
2008-08-02 10:16 ` Eli Zaretskii
2008-08-01 13:55 ` Mark Kettenis
2008-08-01 14:11 ` André Pönitz
2008-08-01 15:02 ` Stan Shebs
2008-08-01 15:05 ` Vladimir Prus
2008-08-01 15:17 ` Daniel Jacobowitz
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=1217497386.4594.14.camel@piko.site \
--to=alpar@cs.elte.hu \
--cc=apoenitz@trolltech.com \
--cc=gdb@sourceware.org \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox