[REVIEW REQUEST] Improvements to TableView sorting

Scott Palmer swpalmer at gmail.com
Wed Feb 20 23:01:54 PST 2013

On 2013-02-19, at 11:03 PM, John Hendrikx <hjohn at xs4all.nl> wrote:

> On 19/02/2013 23:41, Knut Arne Vedaa wrote:
>>> - Depending on the backing list, many random deletes in a huge List will
>>> be costly (ArrayList won't cut it, any Events being triggered on
>>> modification of the list will likely also introduce a huge bottleneck).
>>> Note that the use case specifically causes these deletes to be random!
>>> It's not possible to do it in a single remove event.
>> Can't you do it in a single operation if you use List#removeAll?
> No, if you select the top half of the items in a list sorted by Last Name, then resort the list by First Name, the selection will no longer be a single range.  If you decide to delete them at that point, you'll have to do many small deletes.

Not with removeAll. It doesn't use a range. You give it a list containing only the nodes you wish to remove.


More information about the openjfx-dev mailing list