The trick is partly a JVM optimization (make boxing/unboxing very efficient. Basically, find locations where a box op is followed by an unbox op, and eliminate the both of them. Make sure this works across method boundaries (i.e. to call a method, my method boxes up a primitive, then the other method unboxes it).
That, and generics integration, i.e. allowing you to write List<int>. In order to make this fast, you can't use new ArrayList<int>();, you'd have to use a static method that can return an implementation backed by an int array. However, if the above optimization is pushed through, you shouldn't suffer any performance penalties using the List<int>'s generified API calls. On Monday, March 19, 2012 5:22:06 PM UTC+1, fabrizio.giudici wrote: > > http://java.dzone.com/articles/oracle-discusses-features-java > > > (hey, just read, didn't check whether it's accurate, a joke, or what) > > -- > Fabrizio Giudici - Java Architect, Project Manager > Tidalwave s.a.s. - "We make Java work. Everywhere." > [email protected] > http://tidalwave.it - http://fabriziogiudici.it > > -- You received this message because you are subscribed to the Google Groups "The Java Posse" group. To view this discussion on the web visit https://groups.google.com/d/msg/javaposse/-/Jnk9v8rBQKQJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/javaposse?hl=en.
