Robert == Robert Schuster [EMAIL PROTECTED] writes:
Robert Now when evaluating the XML data I have to search the method put
Robert which accepts the two arguments. Having
Robert only String and JFrame as argument types means that the call to
Robert HashMap.class.getMethod(put, new Class[] {
Tom Tromey writes
Robert == Robert Schuster [EMAIL PROTECTED] writes:
Robert Now when evaluating the XML data I have to search the method put
Robert which accepts the two arguments. Having
Robert only String and JFrame as argument types means that the call to
Robert
David == David Holmes [EMAIL PROTECTED] writes:
David Hmmm. There is a further problem that you have to work out how
David to do this such that overload resolution is applied
David correctly. Basically I can't see any way to do this other than
David to reapply the same method resolution logic
Tom Tromey writes:
Yeah, I agree, based on what I read it does seem that way.
This algorithm is going through an overhaul as a result of all the
new language features, I wonder if that will propagate to
XMLDecoder.
At least the algorithm has been overhauled such that the new features do not
David Holmes wrote:
Regardless this is not something I would want to hand code using the
reflection API as Robert must do.
I have come across this same challenge several times now, i.e.,
having to write code that implements the Java best match semantics
for method invocation using reflection.
Hi Classpath hackers,
I am currently implementing java.beans.XMLDecoder which now starts to
work. But I have a small (efficiency) problem.
As you might know the decoder accepts XML data like this:
object class=java.awt.Point
int12/int
int43/int
/object
and executes this using reflection as
6 matches
Mail list logo
