Improving Comparable compareTo performance

I profiled my code and found out that my class, which implements `Comparable`, spends 8x more cpu time in compareTo(Object) than in compareTo(T) I assume that the slowdown is because of virtual table lookup for this method.
**Is there a way to force static invocation of the function?** (like in non virtual C++ methods) I still want to use the `Comparable` interface since I use `TreeSet` with this object and I'd like not to rewrite this code.

EDIT: No, I didn't implement the compareTo(Object) - this was automatically generated and reported by the profiler
And the two compareTo's are exactly the same other than casting?

以上就是Improving Comparable compareTo performance的详细内容,更多请关注web前端其它相关文章!

赞(0) 打赏
未经允许不得转载:web前端首页 » JavaScript 答疑

评论 抢沙发

  • 昵称 (必填)
  • 邮箱 (必填)
  • 网址

前端开发相关广告投放 更专业 更精准