This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
RE: Template parameter type inference algorithm
- From: "Dave Korn" <dk at artimi dot com>
- To: "'Piotr Wyderski'" <piotr dot wyderski at wp dot pl>,<gcc at gcc dot gnu dot org>
- Date: Mon, 19 Jul 2004 11:23:25 +0100
- Subject: RE: Template parameter type inference algorithm
> -----Original Message-----
> From: gcc-owner On Behalf Of Piotr Wyderski
> Sent: 19 July 2004 11:12
> Hello,
>
> where can I found a description of the type inference
> algorithm used by GCC to solve dependencies between
> template parameters and to bind a template instance
> to a template name with its actual parameters?
>
> And the next question: which approach is used by GCC
> to effectively find the best matching function (method,
> operator etc.) to a given function application?
>
> Could you please suggest me a paper available on the
> Internet or a book which explains the above problems?
>
> Best regards
> Piotr Wyderski
>
I Am Not A Language Lawyer, but IIUIC all the procedures for resolving
names and overloading are clearly specified in the C++ language spec, and
the compiler implements the standards-mandated algorithms. So I suggest you
go straight to the source, and get a copy of the language spec.
cheers,
DaveK
--
Can't think of a witty .sigline today....