"jason.greene(a)jboss.com" wrote : . The only issue is the perf of getScopeLevel,
but we have such a small number of fixed levels that there probably is no noticeable perf
diff using a treemap.
If you keep the array or arraylist sorted, you can get the same O(log n)-type performance
by using e.g. Arrays.binarySearch()....
View the original post :
http://www.jboss.org/index.html?module=bb&op=viewtopic&p=4248262#...
Reply to the post :
http://www.jboss.org/index.html?module=bb&op=posting&mode=reply&a...