Sean Payne wrote:
Suppose gui-users wanted to drag and drop rows in a table so that they
could shuffle it anyway that they wanted so that the rows maintained
that order the next time they accessed the table. Can this be done
without updating alot of other rows? How is this normally handled?
On Sat, Jan 06, 2007 at 09:53:39PM -0800, Sean Payne wrote:
> Suppose gui-users wanted to drag and drop rows in a table so that
> they could shuffle it anyway that they wanted so that the rows
> maintained that order the next time they accessed the table. Can
> this be done without
Traditionally that is achieved by a doubly linked list. Each row
contains a pointer to the next and previous row and a null for the end
case. The linked list structure cannot fail regardless of the amount of
shuffling or the size.
Sean Payne wrote:
Suppose gui-users wanted to drag and drop
I do it by maintaining a column named 'SortOrder'
You can update the field to have whatever content will get you the
order you want
at the moment and it's preserved the next time they start the application.
On 1/6/07, Sean Payne <[EMAIL PROTECTED]> wrote:
Suppose gui-users wanted to drag and
Suppose gui-users wanted to drag and drop rows in a table so that
they could shuffle it anyway that they wanted so that the rows
maintained that order the next time they accessed the table. Can
this be done without updating alot of other rows? How is this
normally handled?
The ideas I
5 matches
Mail list logo
