Hi
Ran into a performance problem when reordering a table with more than 300 rows. It actually gets slowly worse the more rows added.
After a bit of digging we found what was causing it to be slow:

The inserting causes the drag to not be as smooth as you would hope. If you are dragging a item up past 100+ items it can get very annoying.
The solution we came up with was to move that logic into a debounced method, meaning if the user stops dragging for x milliseconds it then calls the function. This has greatly improved the performance for dragging rows and is a lot more scalable.
However, I thought I would post on here to see if we were missing something?
Hi
Ran into a performance problem when reordering a table with more than 300 rows. It actually gets slowly worse the more rows added.

After a bit of digging we found what was causing it to be slow:
The inserting causes the drag to not be as smooth as you would hope. If you are dragging a item up past 100+ items it can get very annoying.
The solution we came up with was to move that logic into a debounced method, meaning if the user stops dragging for x milliseconds it then calls the function. This has greatly improved the performance for dragging rows and is a lot more scalable.
However, I thought I would post on here to see if we were missing something?