This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
RE: g++ 2.95 typeinfo::name()
- To: dewar at gnat dot com, dvv at egcs dot dvv dot ru, jcast at ou dot edu
- Subject: RE: g++ 2.95 typeinfo::name()
- From: Mike Stump <mrs at windriver dot com>
- Date: Tue, 23 Jan 2001 03:14:38 -0800 (PST)
- Cc: gcc at gcc dot gnu dot org
> From: dewar@gnat.com
> To: dvv@egcs.dvv.ru, jcast@ou.edu
> Cc: gcc@gcc.gnu.org
> Date: Tue, 23 Jan 2001 00:57:50 -0500 (EST)
> Where do you deduce that the semantics must be deterministic?
Blink.
This is silly. It is as silly as saying that a qsort function that
was quadratic wasn't buggy. If you want to argue your point, explain
to all of us why an implementation that offered a qsort function that
was quadratic would not be buggy. It is silly because it is a waste
of time; there isn't a proposal on the table to break name().