[elephant-ticket] Re: #34: Implement a persistent aggregates library/abstraction

[elephant]

#34: Implement a persistent aggregates library/abstraction
--------------------------+-------------------------------------------------
  Reporter:  ieslick      |       Owner:  ieslick    
      Type:  enhancement  |      Status:  new        
  Priority:  major        |   Milestone:  Release 1.0
 Component:  system-wide  |     Version:             
Resolution:               |    Keywords:             
--------------------------+-------------------------------------------------
Changes (by ieslick):

  * milestone:  => Release 1.0
  * summary:  Support a persistent aggregates library => Implement a
              persistent aggregates library/abstraction

Old description:

> pcons, parray, phash - similar to lisp API, but prefixed with 'p'.  How
> to implement?

New description:

 Implement some subset of pcons, parray, phash, ptable, pset, etc.

 Provide a similar to lisp API, but prefixed with 'p'.  How to implement?
 What data structures make sense to layer over btrees and indexes, if any?

 This could be trivial to implement, but useful for newcomers looking for
 familiar ground and can avoid contamination by cursors and instead do
 iterators or mapping functions?

Comment:

 This could be useful PR and a benefit to new users to hide some of the
 complexity engendered by BTrees.

-- 
Ticket URL: <http://trac.common-lisp.net/elephant/ticket/34>
elephant <http://common-lisp.net/project/elephant>
elephant