Re: [racket-users] Best data structure for ordered data set with insertion and reordering?

Thanks George. Much appreciated. On Thu, Jul 16, 2020 at 11:21 PM George Neuner wrote: > > Hi David, > > On 7/16/2020 11:44 AM, David Storrs wrote: > > On Thu, Jul 16, 2020 at 10:09 AM George Neuner > wrote: > >> >> The problem seems under-specified. Can you say more about the real >>

Re: [racket-users] Best data structure for ordered data set with insertion and reordering?

Hi David, On 7/16/2020 11:44 AM, David Storrs wrote: On Thu, Jul 16, 2020 at 10:09 AM George Neuner > wrote: The problem seems under-specified.  Can you say more about the real purpose? Basic version:  It's a peer-to-peer encrypted swarmed file sharing

Re: [racket-users] Best data structure for ordered data set with insertion and reordering?

On Thu, Jul 16, 2020 at 10:09 AM George Neuner wrote: > > On 7/16/2020 4:29 AM, David Storrs wrote: > > The problem seems under-specified. Can you say more about the real > purpose? > Basic version: It's a peer-to-peer encrypted swarmed file sharing system that presents like Dropbox on the

Re: [racket-users] Best data structure for ordered data set with insertion and reordering?

On 7/16/2020 4:29 AM, David Storrs wrote: tl;dr Can anyone recommend a data structure that is ordered and supports efficient reordering, insertion at arbitrary location, and deletion? Long form: I'm working on an operation-log reconciliation problem, where each operation is one of:  

[racket-users] Best data structure for ordered data set with insertion and reordering?

tl;dr Can anyone recommend a data structure that is ordered and supports efficient reordering, insertion at arbitrary location, and deletion? Long form: I'm working on an operation-log reconciliation problem, where each operation is one of: File-CreateP H File-Update P H File-Delete