...f vectors and maps some believe this is a innovation which makes generally more readable Greater emphasis on immutability and lazy functional programming, somewhat inspired by Haskell Strong concurrency capabilities supported by software transactional memory at the language level (worth watching: ht...

... Totally agree. One more key to type if you use autocompletion. Lots of files starting with an I. – Kalecser Feb 12 '09 at 17:24 ...

...  |  show 9 more comments 185 ...

...r to maintain? All things being equal, probably JavaFX - the API is much more consistent across components. However, this depends much more on how the code is written rather than what library is used to write it. And what will be faster to build from scratch? Highly dependent on what you're ...

...t just use the handler approach that I describe in my question? Seems much more straightforward because the UI thread doesn't freeze up while waiting to run the Handler's Runnable... – Jake Wilson Oct 25 '11 at 19:15 ...

... For more recent readers of this answer: be aware that this answer was modified and that some of the above comments no longer apply. – daveslab Jan 12 '17 at 11:26 ...

... Skip lists are more amenable to concurrent access/modification. Herb Sutter wrote an article about data structure in concurrent environments. It has more indepth information. The most frequently used implementation of a binary search tre...

... but if the list has many instances of the element that is being searched (more than ~15% of the list, on a test with a list of 1000 integers), the list comprehension is faster. share | improve this...

...tricky, too cryptic. So, as a matter of discipline, I don’t use them any more. – Nope Mar 28 '13 at 9:56 5 ...

... This solution would not work with large number or small number that has more than 20 digits. eg. 1.2e+22 toString().length outputs 7 – CherylG Oct 18 '16 at 0:52 ...