"David G. Johnston" <david.g.johns...@gmail.com> writes:
> More concisely:
> Make the first input type a candidate type. Each subsequent input type is
> compared to the current candidate, with a new candidate being chosen only
> when there exists a non-mutal implicit cast to the new type. If at any
> point a preferred type is made a candidate then it will be chosen.
So this is just a verbatim statement of the algorithm, which is what
I was hoping to avoid :-(. But maybe there's no simpler way.
regards, tom lane
