On Sun, Mar 15, 2009 at 7:32 PM, Chris Anderson wrote:
each item in it's own document, and store the list position as a
float. To insert an item between two others, average their
position-floats and use that. In the case of replication with other
items on the list from remote nodes, approximate order should be
preserved.
On Sun, Mar 15, 2009 at 4:21 PM, Dean Landolt wrote:
The bookmarks case you mention is interesting -- and definitely common. The
ordered list model is tough to accommodate, but you could always keep a doc
that maintains this order state. Ordering operations should always occur
distinctly from document change operations, so local consistency shouldn't
be a problem. But I concede that this'll be damn tough to replicate.
Damien once mentioned on IRC a clever way to do ordered lists. KeepThe bookmarks case you mention is interesting -- and definitely common. The
ordered list model is tough to accommodate, but you could always keep a doc
that maintains this order state. Ordering operations should always occur
distinctly from document change operations, so local consistency shouldn't
be a problem. But I concede that this'll be damn tough to replicate.
each item in it's own document, and store the list position as a
float. To insert an item between two others, average their
position-floats and use that. In the case of replication with other
items on the list from remote nodes, approximate order should be
preserved.
Touché.
