For my part the "for the ages" implementation of this function is required. I am thinking about Brewer's Theorem and other related "omitted" or non-functional values or quality control criteria (QCC) in related to this functionality. You have chosen your target well, I believe.
Sent from my iPhone Michael McGrady Principal investigator AF081_028 SBIR Chief Architect Topia Technology, Inc Work 1.253.572.9712 Cel 1.253.720.3365 On Dec 14, 2010, at 12:18 AM, Patricia Shanahan <p...@acm.org> wrote: > On 12/13/2010 11:36 PM, MICHAEL MCGRADY wrote: >> I would say that in addition to just be a fast data structure the >> data structure must be fast and accommodate synchronous and >> asynchronous backups, partitions, and transactions. > > How much of that should be in the bottom layer? As far as I can tell, > the general design of outrigger is to implement features such as > transactions on top of FastList, treating it as a fast, simple > primitive. Remember I'm not trying to create the list data structure for > the ages, just something that I can make work and that does the same job > as FastList. > > Patricia
